# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796359 | anton | Zapina (COCI20_zapina) | C++17 | 134 ms | 3144 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 int long long
const int mod = 1e9 +7;
const int MAX_N = 350;
int n, nb_c[MAX_N][MAX_N+1], dp[MAX_N][MAX_N+1];
int C[MAX_N+1][MAX_N];
int expo(int a, int b){
if(b==0){
return 1;
}
if(b%2==1){
return (a*expo(a, b-1))%mod;
}
else{
return (expo(a, b/2)*expo(a, b/2))%mod;
}
}
signed main(){
cin>>n;
C[0][0] =1;
C[1][0] = 1;
C[1][1] = 1;
for(int i = 2; i<=n; i++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |