1.母牛的故事
#include<bits/stdc++.h> using namespace std; #define endl '\n' #define INF ((int)1e18) typedef long long ll; const int N=60; int n; ll a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); cin>>n; a[1]=1; a[2]=2; a[3]=3; for(int i=4;i<=n;i++){ a[i]=a[i-1]+a[i-3]; } cout<<a[n]<<endl; return 0; }2.养兔子
#include<bits/stdc++.h> using namespace std; #define endl '\n' #define INF ((int)1e18) typedef long long ll; const int N=100; int n; ll a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); cin>>n; a[1]=1; a[2]=2; for(int i=3;i<=n;i++){ a[i]=a[i-1]+a[i-2]; } cout<<a[n]; return 0; }3.骨牌铺方格
#include<bits/stdc++.h> using namespace std; #define endl '\n' #define INF ((int)1e18) typedef long long ll; const int N=55; int n; ll a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); cin>>n; a[1]=1; a[2]=2; for(int i=3;i<=n;i++){ a[i]=a[i-1]+a[i-2]; } cout<<a[n]<<endl; return 0; }4.马拦过河卒
#include<bits/stdc++.h> using namespace std; #define endl '\n' #define INF ((int)1e18) typedef long long ll; const int N=1e5+10; const int mod=998244353; int x,y; int m,n; vector<vector<ll>> a(30,vector<ll>(30,1)); int main() { ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); cin>>m>>n>>x>>y; int dx[]={2,1,-1,-2,2,1,-1,-2}; int dy[]={1,-2,-2,-1,-1,2,2,1}; a[x][y]=0; for(int i=0;i<8;i++){ int nx=x+dx[i]; int ny=y+dy[i]; a[nx][ny]=0; } if(a[0][0]==0) cout<<"0"<<endl; else{ for(int i=0;i<=m;i++){ for(int j=0;j<=n;j++){ if(i==0&&j==0) continue; if(a[i][j]==0) continue; if(i==0) a[i][j]=a[i][j-1]; else if(j==0) a[i][j]=a[i-1][j]; else{ a[i][j]=a[i-1][j]+a[i][j-1]; } } } cout<<a[m][n]<<endl; } return 0; }5.黄金时代
#include<bits/stdc++.h> using namespace std; #define endl '\n' #define INF ((int)1e18) typedef long long ll; const int N=35; int n; int a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); cin>>n; a[1]=5; for(int i=2;i<=n;i++){ a[i]=round(a[i-1]/0.6180339887); } cout<<a[n]<<endl; return 0; }6.爬楼梯
#include<bits/stdc++.h> using namespace std; #define endl '\n' #define INF ((int)1e18) typedef long long ll; const int N=55; int n; ll a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); cin>>n; a[1]=1; a[2]=2; for(int i=3;i<=n;i++){ a[i]=a[i-1]+a[i-2]; } cout<<a[n]<<endl; return 0; }7.三国佚事--巴蜀之危
#include<bits/stdc++.h> using namespace std; #define endl '\n' #define INF ((int)1e18) typedef long long ll; const int N=55; int n; ll a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); cin>>n; a[1]=0; a[2]=1; a[3]=2; for(int i=4;i<=n;i++){ a[i]=(i-1)*(a[i-1]+a[i-2]); } cout<<a[n]<<endl; return 0; }8.王小二切饼
#include<bits/stdc++.h> using namespace std; #define endl '\n' #define INF ((int)1e18) typedef long long ll; const int N=105; int n; ll a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); cin>>n; a[1]=2; for(int i=2;i<=n;i++){ a[i]=i+a[i-1]; } cout<<a[n]<<endl; return 0; }9.蟠桃记
#include<bits/stdc++.h> using namespace std; #define endl '\n' #define INF ((int)1e18) typedef long long ll; const int N=35; int n; ll a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); cin>>n; a[1]=1; for(int i=2;i<=n;i++){ a[i]=(a[i-1]+1)*2; } cout<<a[n]<<endl; return 0; }10.拍皮球
#include<iostream> #include<string> #include<algorithm> #include<cmath> #include<iomanip> using namespace std; int main() { double h; int n; cin >> h >> n; double a[n+1]; double sum; a[0] = h; for (int i = 1; i <= n; i++) { a[i] = a[i-1] / 2.0; } if (n == 1) { sum = h; } else { sum = h; for (int i = 1; i < n; i++) { sum += a[i] * 2.0; } } cout << fixed << setprecision(2) << sum << " " << a[n]; return 0; }
