# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1138593 | mnbvcxz123 | Binaria (CCO23_day1problem1) | C++20 | 1098 ms | 65708 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int mod=1e6+3;
ll pw(ll a, ll w){
a%=mod;
ll ret=1;
while(w){
if(w&1)ret=ret*a%mod;
a=a*a%mod;
w>>=1;
}
return ret;
}
ll C(ll n, ll k){
if(n<0 or k<0 or k>n)return 0;
ll ret=1;
for(ll i=n-k+1;i<=n;++i)
ret=ret*i%mod;
ll p=1;
for(ll i=1;i<=k;++i)p=p*i%mod;
p=pw(p,mod-2);
ret=ret*p%mod;
return ret;
}
int 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... |