在dext.top代码的基础下改编的（没开玩笑真能用）

#include<bits/stdc++.h>//引用这里改不了，虽然洛谷可以改 #define ikun int//将所有ikun格式的数据替换为int using namespace std; ikun kun=1,kunge=2,kunkun=3,caixukun=0;//定义替换用数 ikun main(){//实际上等同于int 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 x; int ans=1; void kun(int x) { if(x<2) return; for(int i=1;i<=x/2;i++) { ans++; kun(i); } } void work() { cin>>x; kun(x); cout<<ans; } int main() { work(); 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; }

#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; }

#include <iostream> #include <vector> using namespace std; vector<int> memo(501, -1); int countSequences(int n) { if (n == 1) return 1; if (memo[n] != -1) return memo[n]; } int main() { int n; cin >> n; cout << countSequences(n); return 0; }

代码如下🏀🏀🏀

#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; }