已知:
#include <iostream>
using namespace std;int cnt = 1;
void cal(int start)
{
for (int i = start; i < 10; i++) {
cnt ++;
cal(i+1);
}
}
int main() {
cal(0);
cout << cnt << endl;
return 0;
}
求cnt
解:记cal(i)对cnt增加的次数为a(i)
容易得到:
a(9)=1;
a(i)=a(i+1)+...+a(9)+10-i;(1)
a(i+1)=a(i+2)+...+a(9)+9-i;(2)
(1)-(2)
a(i)-2a(i+1)=1;(3)
(3)两边同时*2^i,
2^i*a(i)-2^(i+1)*a(i+1)=1
......
3*2^8-2^9=2^8;
把上面的式子累加:
2^i*a(i)=2^i+....+2^(9-i)
a(i)=2^(10-i)-1;
令i=0,
cnt=1024;