竞赛
考级
法兰西玫瑰
嫌疑を避ける ~~
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; int a[31] = {0,1,2,4,7,12}; for (int i=5;i<=n;i++) a[i] = a[i-1]+a[i-2]+a[i-4]; cout<<a[n]; return 0; }
Alex
#include<bits/stdc++.h> using namespace std; int p[100005]; int main(){ int n; cin >> n; p[1] = 1; p[2] = 2; p[3] = 4; p[4] = 7; p[5] = 12; for(int i = 6;i <= n;i++) p[i] = p[i-1] + p[i-2] + p[i-4]; cout << p[n]; return 0; }
DARK SPECTRE
远在天边的浪子
编程的ikun