Submission #9242

#TimeUsernameProblemLanguageResultExecution timeMemory
9242siorPhibonacci (kriii2_P)C++98
0 / 4
0 ms1852 KiB
#include <iostream> #include <algorithm> #include <utility> #include <cmath> using namespace std; typedef long long ll; ll fn(ll n); 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; } cout << fn(n) << " "<<fn(n - 1) << endl; return 0; } ll fn(ll n) { double ret = 0; double a = pow((1 + sqrt(5)) / 2,n); double b = pow((1 - sqrt(5)) / 2, n); ret = (a - b) / sqrt(5); return (ll)ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...