代码如下🏀🏀🏀

#include<bits/stdc++.h> using namespace std; #define cai int #define ji for #define libulihainijige if #define libulihainikunge else #define liangnianban return #define beidaiku cin #define basketball cout cai ikun(cai ngm){ cai taimei=0; ji(cai music=ngm/2;music>=0;music--){ libulihainijige(music>1) { taimei+=ikun(music); }libulihainikunge{ taimei+=1; } } liangnianban taimei; } cai main() { cai chicken; beidaiku>>chicken; basketball<<ikun(chicken); liangnianban 0; }

#include<bits/stdc++.h> using namespace std; int n;int arr[510]; int main(){ cin>>n; arr[0]=1;arr[1]=2; for(int i=2;i<=n;i++){ arr[i]=1; for(int j=1;j<=i/2;j++)arr[i]+=arr[j]; } cout<<arr[n]<<endl; return 0; }

#jikunde<jiba/stdc++.h> using namespace std; int main(){ jint jiba; kunin>>jiba; jint ji[jiba]; a[1]=1; a[2]=2; for(int i=3;i<=n;i++){ a[i]=1; for(int j=1;j<=i/2;j++) a[i]+=a[j]; } cout<<a[n]; return 0; }

#include<bits/stdc++.h> using namespace std; int ikun(int n) { int sum = 0; for (int i = n / 2; i >= 0; i--) { if (i > 1) { sum += ikun(i); } else { sum += 1; } } return sum; } int main() { int n; cin>>n; cout<<ikun(n); return 0; }

#include<bits/stdc++.h> #define ikun int using namespace std; ikun kun=1,kunge=2,kunkun=3,caixukun=0; ikun main(){ ikun cai; cin>>cai; ikun xu[cai]; xu[kun]=kun; xu[kunge]=kunge; for(ikun ji=kunkun;ji<=cai;ji++){ xu[ji]=kun; for(ikun zhiyin=kun;zhiyin<=ji/kunge;zhiyin++) xu[ji]+=xu[zhiyin]; } cout<<xu[cai]; return caixukun; }

#include<bits/stdc++.h> using namespace std; int ikun(int n){ int sum = 0; for (int i = n / 2; i >= 0; i--) { if (i > 1) { sum += ikun(i); } else { sum += 1; } } return sum; } int main() { int n; cin>>n; cout<<ikun(n); return 0; }

#include<bits/stdc++.h> using namespace std; int ikun(int n){ if(n==0) return 1; int ans=0; for(int i=0;i<=n/2;i++){ ans+=ikun(i); } return ans; } int main(){ int n; cin>>n; cout<<ikun(n); return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; int a[n]; a[1]=1; a[2]=2; for(int i=3;i<=n;i++){ a[i]=1; for(int j=1;j<=i/2;j++) a[i]+=a[j]; } cout<<a[n]; return 0; }

2025-07-09 恭喜你，提交通过！ 执行用时：1ms 内存消耗：3.38MB 击败了63.83%的用户 击败了35.79%的用户 #include <bits/stdc++.h> using namespace std; const int MAX=505; long long dp[MAX],pr[MAX]; int main(){ int n; cin>>n; dp[1]=1; pr[1]=1; for(int i=2;i<=n;++i){ int hlf=i/2; dp[i]=1+pr[hlf]; pr[i]=pr[i-1]+dp[i]; } cout<<dp[n]<<endl; return 0; }