#include using namespace std; void solve(int &i, int sum, int Max) { if(sum + i >= Max) return ; i++; solve(i,sum+i,Max); } int main() { int m = 1; solve(m,0,1000); printf("%d",m); }
C/C++ code#include using namespace std; void solve(int &i, int sum, int Max) { if(sum + i >= Max) return ; i++; solve(i,sum+i,Max); } int main() { int m = 1; solve(m,0,1000); printf("%d",m); } 输出： 44
int solve(int curr, int sum, int Max) { return curr+sum>=Max ? curr-1 : solve(curr+1, curr+sum, Max); }
![扫描线三巨头 hdu1928hdu 1255 hdu 1542 [POJ 1151]](https://img.php1.cn/3c972/245b5/42f/19446f78530d3747.jpeg)
京公网安备 11010802041100号