Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <conio.h>
- #include <string>
- #include <set>
- #include <map>
- #include <algorithm>
- #include <string>
- #include <math.h>
- #include <vector>
- using namespace std;
- int Max(int n)
- {
- int data[100000], i;
- data[0] = 0;
- data[1] = 1;
- for (i = 2; i <= n; i++)
- if (i % 2 == 0)
- data[i] = data[i / 2];
- else
- data[i] = data[i / 2] + data[i / 2 + 1];
- sort(data, data + n+1);
- return data[n];
- }
- int main()
- {
- int n;
- while (cin >> n)
- {
- if (n == 0)
- break;
- cout << Max(n) << endl;
- }
- _getch();
- return 0;
- }
Add Comment
Please, Sign In to add comment