Submission #19877

#TimeUsernameProblemLanguageResultExecution timeMemory
19877king7282괄호 (kriii4_R)C++14
0 / 100
0 ms8896 KiB
#include <stdio.h> #define ll long long #define M 1000000007 ll dp[1000010]; int main(void) { ll i, n, k; scanf("%lld %lld", &n ,&k); dp[1] = 1, dp[2] = 2; for(i = 3; i <= n; i++) { dp[i] = (dp[i - 1] + dp[i - 2]) % M; if(i % 2 == 0) dp[i] = (dp[i] + 1) % M; } printf("%lld\n", dp[n]); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...