fork download
  1. #include<bits/stdc++.h>
  2. #define TIME (1.0* clock()/CLOCKS_PER_SEC)
  3. #define pb push_back
  4. #define eb emplace_back
  5.  
  6. #define pq priority_queue <li, vector <li>, greater <li>>
  7. using namespace std;
  8. const int maxn=1e6;
  9. //const int MOD=1e9+7;
  10. //const int MOD=998244353;
  11. //const int dx[4]{1, 0, -1, 0}, dy[4]{0, 1, 0, -1};
  12. long long n,k;
  13. long long fib[200005];
  14. long long MOD=1e9+7;
  15.  
  16.  
  17. void solve(){
  18. cin>>n>>k;
  19. fib[1]=1;
  20. fib[2]=1;
  21. for(int i=3;i<=200001;i++) fib[i]=(fib[i-1]+fib[i-2])%MOD;
  22.  
  23. cout<<(n*fib[2*k+1])%MOD;
  24. }
  25. signed main(){
  26. ios_base::sync_with_stdio(false);
  27. cin.tie(NULL);cout.tie(NULL);
  28. if (fopen("CHIENBINH.INP", "r")){
  29. freopen("CHIENBINH.INP", "r", stdin);
  30. freopen("CHIENBINH.OUT", "w", stdout);
  31. }
  32. int ntest;
  33. ntest=1;
  34. //cin>>ntest;
  35.  
  36. for(int i=1;i<=ntest;i++) solve();
  37. cerr<<"\n"<<"Time elapsed "<<TIME<<"s.\n";
  38. return 0;
  39. }
Success #stdin #stdout #stderr 0.01s 5296KB
stdin
5 4
stdout
170
stderr
Time elapsed 0.008809s.