# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
19896 | | str | 괄호 (kriii4_R) | C++14 | | 0 ms | 8896 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<cstdio>
#define MAX 1000001
unsigned long long DP[MAX];
unsigned long long N, K;
unsigned long long a;
int main(){
scanf("%llu %llu", &N, &K);
DP[1] = 1;
a = 1;
for (unsigned long long i = 2; i <= N; i++){
DP[i] = (1 + a);
a *= 2;
a %= 1000000007;;
}
printf("%llu\n", DP[N]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |