# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19981 | gs12117 | 괄호 (kriii4_R) | C++98 | 1140 ms | 8904 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<stdio.h>
int n,m;
long long int dp[1001000];
int mod=1000000007;
int mpow(int x,int y){
if(y==0)return 1;
long long int r=mpow(x,y/2);
r*=r;
r%=mod;
if(y%2==1){
r*=x;
r%=mod;
}
return r;
}
int minv(int x){
return mpow(x,mod-2);
}
int main(){
int i;
long long int cat;
scanf("%d%d",&n,&m);
dp[0]=1;
cat=1;
for(i=0;i<n;i++){
dp[i+1]=dp[i]*(m+1);
dp[i+1]%=mod;
if(i%2==0){
dp[i+1]+=mod-cat;
dp[i+1]%=mod;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |