# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027459 | cnn008 | Binaria (CCO23_day1problem1) | C++17 | 181 ms | 36616 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#ifdef N_N_C
#include "debug.h"
#else
#define cebug(...) "Arya"
#endif
#define int long long
const int N=1e6+5;
const int mod=1e6+3;
int n,k,a[N],f[N],inv[N],b[N];
int powmod(int a, int k, int m){
int ans=1;
while(k){
if(k&1) ans=(ans*a)%m;
a=(a*a)%m;
k/=2;
}
return ans;
}
int C(int n, int k){
if(n<k || k<0) return 0;
return f[n]*inv[k]%mod*inv[n-k]%mod;
}
void sol(){
cin>>n>>k;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |