# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
932849 | Son | Binaria (CCO23_day1problem1) | C++14 | 304 ms | 21052 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;
#define LL long long
#define pb push_back
#define fi first
#define se second
#define mp make_pair
int n,k;
int A[1000005];
int fact[1000005], inv[1000005];
int mo = 1e6 + 3;
int B[1000005];
int expo( int a, int b ){
if ( b == 0 ) return 1;
int half = expo(a,b/2);
half = ( 1LL * half * half ) % mo;
if ( b & 1 ){
half = ( 1LL * half * a ) % mo;
}
return half;
}
int C( int N, int K ){
if ( K > N || K < 0 ) return 0;
int ans = (fact[N] * 1LL * inv[K]) % mo;
ans = ( ans * 1LL * inv[N-K] ) % mo;
return ans;
}
Compilation message (stderr)
# | 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... |