oj.uz

Submission #937086

# Submission time Handle Problem Language Result Execution time Memory
937086 2024-03-03T12:51:48 Z 1075508020060209tc Asceticism (JOI18_asceticism) C++14
0 / 100
 0 ms 348 KB 
#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
#define int long long
const int mod=1e9+7;
int qpow(int x,int t){
if(t==0){return 1;}
if(t%2==1){return qpow(x,t-1)*x%mod;}
int xx=qpow(x,t/2);
return xx*xx%mod;
}
int fac[250005];
int inv[250005];
void precalc(){
fac[0]=1;
for(int i=1;i<=250000;i++){
    fac[i]=fac[i-1]*i%mod;
}
inv[250000]=qpow(fac[250000],mod-2);
for(int i=250000-1;i>=0;i--){
    inv[i]=inv[i+1]*(i+1)%mod;
}
}
int comb(int x,int y){
if(x<y||y<0){return 0;}
return fac[x]*inv[y]%mod*inv[x-y]%mod;
}




int n;int K;

signed main(){



}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -