Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- long long n, fi=1, fib[46];
- cin>>n;
- fib[1]=1;
- fib[2]=1;
- for(int i=3; i<=45; i++)
- {
- fib[i]=fib[i-1]+fib[i-2];
- if(n>=fib[i]) { fi=i; }
- else { break; }
- }
- if(n>fib[fi]) { fi++; }
- while(n!=fib[fi])
- {
- if(fib[fi]<n) { n=n-fib[fi]; fi--; }
- else { fi=fi-1; }
- }
- if(fi%2==0 || n==1) { cout<<"a"; }
- else { cout<<"b"; }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement