#include<bits/stdc++.h>
using namespace std;
int n, b[3001];
int main(){
b[0] = 0,b[1] = 0,b[2] = 1;
int n;
cin>>n;
for(int i = 3;i <= n;i++){
int minn = 99;
for(int k = 1;k <= i/2;k++){
int buf = max(b[i - 2 * k],b[k]);
minn = min(minn, buf);
}
b[i] = 1 + minn;
}
cout<<b[n]<<endl;
return 0;
}
CSP初赛模拟之阅读程序写结果(未完成)
最新推荐文章于 2024-04-26 09:21:07 发布