# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
9397 |
2014-09-28T06:08:09 Z |
dolpang2 |
Phibonacci (kriii2_P) |
C++14 |
|
0 ms |
1088 KB |
#include <cstdio>
#include <vector>
const int kModulo = 1000000007;
int main() {
int n = 0;
int k = 0;
scanf("%d%d", &n, &k);
int x = 0;
int y = 1;
for (int i = 2; i <= n; ++i) {
if (x > kModulo) x %= kModulo;
if (y > kModulo) y %= kModulo;
int temp = x + y;
x = y;
y = temp;
}
printf("%d %d", y, x);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |