# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
9282 |
2014-09-28T05:21:26 Z |
dolpang2 |
Phibonacci (kriii2_P) |
C++14 |
|
160 ms |
262144 KB |
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
int main() {
std::vector<long long> fibo;
fibo.push_back(0);
fibo.push_back(1);
long long n;
long long k;
scanf("%lld%lld", &n, &k);
if (k == 1) {
for (long long i = 2; i <= n; ++i) {
fibo.push_back(fibo[i - 1] + fibo[i - 2]);
}
std::cout << fibo[n] % 1000000007 << " " << fibo[n - 1] % 1000000007;
} else {
puts("no");
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Memory limit exceeded |
160 ms |
262144 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |