Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdlib>
- #include <iostream>
- using namespace std;
- int q[1001][11];
- int f(int n, int k)
- {
- if (n==0 || k==0) return 0; else
- if (q[n][k]>0); else
- {
- int min = 1000000000;
- for (int i = 1; i <= n; i++)
- {
- int v1 = f(n-i,k);
- int v2 = f(i-1,k-1);
- int val = v1 > v2 ? v1 : v2;
- if (val < min) min = val;
- }
- min++;
- q[n][k] = min;
- }
- return q[n][k];
- }
- void run()
- {
- for (int i = 0; i < 1001; i++)
- {
- q[i][1] = i;
- }
- for (int i = 0; i < 11; i++)
- {
- q[1][i] = 1;
- }
- int k, n;
- for (;;)
- {
- cin >> k; if (k==0) return;
- cin >> n;
- if (k>10) k = 10;
- cout << f(n,k) << "\n";
- }
- }
- int main(int argc, char *argv[])
- {
- run();
- return EXIT_SUCCESS;
- }
Advertisement
Add Comment
Please, Sign In to add comment