# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
9222 |
2014-09-28T04:50:23 Z |
sior |
Phibonacci (kriii2_P) |
C++ |
|
1000 ms |
1668 KB |
#include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
int main()
{
long long int n, k;
cin >> n >> k;
long long a = 1, b = 1;
long long ret = 2;
if (n == 0)
{
cout << 0 << " " << 1;
return 0;
}
else if (n == 1)
{
cout << 1 << " "<<0;
return 0;
}
else if (n == 2)
{
cout << 1 << " " << 1 << endl;
return 0;
}
for (long long i = 3; i <= n; i++)
{
ret = a + b;
a = b;
b = ret;
}
cout << ret << " " << a << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1000 ms |
1668 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |