結果
問題 | No.864 四方演算 |
ユーザー |
![]() |
提出日時 | 2019-08-16 23:34:47 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 13 ms / 1,000 ms |
コード長 | 2,706 bytes |
コンパイル時間 | 1,345 ms |
コンパイル使用メモリ | 163,280 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-25 10:48:19 |
合計ジャッジ時間 | 2,415 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef pair<ll,ll> P;long long int INF = 3e18;double Pi = 3.1415926535897932384626;//vector<ll> G[550010];//vector<P> tree[500010];priority_queue <ll> pql;priority_queue <P> pqp;//big priority queuepriority_queue <ll,vector<ll>,greater<ll> > pqls;priority_queue <P,vector<P>,greater<P> > pqps;//small priority queue//top popint dx[8]={1,0,-1,0,1,1,-1,-1};int dy[8]={0,1,0,-1,1,-1,-1,1};char dir[] = "DRUL";//ll bit[500005];//↓,→,↑,←#define p(x) cout<<x<<endl;#define el cout<<endl;#define pe(x) cout<<(x)<<" ";#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;#define pu(x) cout<<(x);#define pb push_back#define lb lower_bound#define ub upper_bound#define CLEAR(a) a = decltype(a)();ll mod = 1000000007;ll rui(ll number1,ll number2){if(number2 == 0){return 1;}else{ll number3 = rui(number1,number2 / 2);number3 *= number3;number3 %= mod;if(number2%2==1){number3 *= number1;number3 %= mod;}return number3;}}ll gcd(ll number1,ll number2){if(number1 > number2){swap(number1,number2);}if(number1 == 0 || number1 == number2){return number2;}else{return gcd(number2 % number1,number1);}}void YES(bool condition){if(condition){p("YES");}else{p("NO");}return;}void Yes(bool condition){if(condition){p("Yes");}else{p("No");}return;}//ll fact[800005],rfact[800005];/*void c3_init(){fact[0] = rfact[0] = 1;for(ll i=1; i<=800000; i++){fact[i] = (fact[i-1]*i) % mod;}rfact[800000] = rui(fact[800000],mod - 2);for(ll i=800000; i>=1; i--){rfact[i-1] = rfact[i] * i;rfact[i-1] %= mod;}return;}ll c3(ll n,ll r){return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}*/ll n,num,sum,a,b,c,d,e,g,h,w,i,j,q;ll k,ans;ll encode(ll sum){if(sum > 2*n){return 0;}else if(sum >= n + 1){return (n - (sum - n) + 1);}else if(sum < n + 1 && sum >= 2){return sum - 1;}else{return 0;}}void solve(ll sum1,ll sum2){ll num1,num2;num1 = encode(sum1);num2 = encode(sum2);// pe(num1);p(num2);ans += num1 * num2;return;}int main(){cin >> n >> k;for(i=1;i*i<=k;i++){if(k % i == 0){if(i*i == k){solve(i,k/i);}else{solve(i,k/i);solve(k/i,i);}}}p(ans);return 0;}