Submission #19891

#TimeUsernameProblemLanguageResultExecution timeMemory
19891inspire12괄호 (kriii4_R)C++98
0 / 100
2000 ms8692 KiB
/* * pro1.cpp * * Created on: 2016. 2. 25. * Author: SeoYoungHak */ #include <iostream> #include <stdio.h> #include <algorithm> #include <cstdio> #include <vector> using namespace std; vector<pair<int, int> > v; int dynamic(int n,int k){ if(n==0){ return 1; } if(n<0){ return 0; } return k*dynamic(n-2,k)+k*dynamic(n-1,k); } int main() { int mode = 1000000007; int n,k; scanf("%d %d",&n,&k); int ans = dynamic(n,k); printf("%d",ans%mode); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...