# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1044907 | PagodePaiva | Binaria (CCO23_day1problem1) | C++17 | 157 ms | 28848 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>
#define int long long
using namespace std;
const int N = 1e6+10;
int pai[N];
int res[N];
const int mod = 1e6 + 3;
int binpow(int a, int b, int m){
if(b == 0) return 1;
int t = binpow(a, b/2, m);
if(b % 2 == 0) return (t*t) % m;
return (((t*t) % m )*a) % m;
}
int fat(int x){
if(x < 0) return 0;
if(x == 0) return 1;
return (fat(x-1)*x) % mod;
}
int choose(int a, int b){
swap(a, b);
return ((fat(a) % mod)*binpow((fat(b)*fat(a-b)) % mod, mod-2, mod)) % mod;
}
int32_t main(){
int n, k;
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... |