Submission #19745

#TimeUsernameProblemLanguageResultExecution timeMemory
19745jeapi괄호 (kriii4_R)C++98
0 / 100
6 ms9528 KiB
#include<iostream> using namespace std; typedef long long ll; ll D[1000001]; int main() { ll N, T; cin >> N >> T; for (int i = 2; i <= N; i++) { if (i % 2 == 0) { D[i] = (D[i - 1] * T) % 1000000007;//닫고 D[i] = (D[i] + D[i - 1]) % 1000000007;//열고 } else { D[i] = (D[i - 1] * T) % 1000000007;//닫고 D[i] = (D[i] + (D[i - 1] - T)) % 1000000007;//열고 } } cout << D[N] << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...