Advertisement
Zinak

Untitled

Aug 9th, 2019
86
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.43 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int dp[100005];
  4. void calc()
  5. {
  6.     dp[0]=0;
  7.     dp[1]=1;
  8.     for(int i=1;i<100000/2;i++)
  9.     {
  10.         dp[2*i]=dp[i];
  11.         dp[2*i+1]=dp[i]+dp[i+1];
  12.     }
  13. }
  14. int main()
  15. {
  16.     int n,mx=0;
  17.     while(cin>>n)
  18.     {
  19.         if(n==0)
  20.             break;
  21.         calc();
  22.         for (int i=0;i<=n;i++)
  23.             mx = max(mx,dp[i]);
  24.         cout<<mx<<endl;
  25.     }
  26.     return 0;
  27. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement