Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- long long arr[31][3] = {0};
- long long fib(int n, int k)
- {
- if(n == 0) return 1;
- if(arr[n][k] != 0) return arr[n][k];
- if(k == 2) arr[n][k] = fib(n-1,0)%12345;
- else
- arr[n][k] = (fib(n-1,0)%12345+fib(n-1,k+1)%12345)%12345;
- return arr[n][k];
- }
- int main() {
- int n;
- cin>>n;
- cout<<fib(n,0)<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement