1.走楼梯(stairs)
#include <bits/stdc++.h>
using namespace std;
int climbStairs(int n)
{
if(n < 1)
return 0;
if(n == 1)
return 1;
if(n == 2)
return 2;
return climbStairs(n-1) + climbStairs(n-2);
}
int main()
{
int n;
cin>> n;
cout<< climbStairs(n)<< endl;
return 0;
}
- 参考文章:https://blog.csdn.net/li1376417539/article/details/90673110
- https://blog.csdn.net/ajiangfan/article/details/52822411
2. 兔子繁殖(rabbit)
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int a[105],b[105];
int n,i,m;
scanf("%d",&n);
a[1] = 0;
b[1] = 1;
a[2] = 1;
b[2] = 0;
for(i = 3;i <= n;i++)
{
b[i] = a[i - 1];
a[i] = a[i - 1] + b[i - 1];
}
m = b[n] + a[n];
printf("%d",m);
return 0;
}
3. 平面分割(surface)
#include<iostream>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int total=2*m;
for (int i=m+1;i<=n;i++)
total+=i;
cout<<total;
}
- 参考文章:https://blog.csdn.net/uiqrm/article/details/54666655
4. 骨牌铺法(domino)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
long long b[10001];
using namespace std;
int main()
{
int m;
cin>>m;
b[1]=1;
b[2]=1;
b[3]=4;
for(int i=4;i<=m;i++)
{
b[i]=b[i-1]+b[i-2]+b[i-3];
}
cout<<b[m];
return 0;
}
- 参考文章:https://www.cnblogs.com/sssy/p/6601808.html
5. 蜜蜂路线(bee)
#include<iostream>
using namespace std;
int main()
{
long long f1,f2,temp;
int n,m,k;
cin>>n;
while(n--)
{
cin>>m>>k;
f1=1;f2=1;
for(int i=1;i<k-m;i++)
{
temp=f1+f2;
f1=f2;
f2=temp;
}
cout<<f2<<endl;
}
return 0;
}
- 参考文章:https://blog.csdn.net/MIKASA3/article/details/42874499
6. 极值问题(acme)
# include<stdio.h>
long long f[10005];
int main(){
int n;
scanf("%d",&n);
f[1]=1;
f[0]=1;
f[2]=2;
int i;
if(n<=1) {
printf("2\n");
}
else
for(i=3;;i++)
{
f[i]=f[i-1]+f[i-2];
if(f[i]>n)
{
printf("%lld\n",f[i-1]*f[i-1]+f[i-2]*f[i-2]);
break;
}
else if(f[i]==n)
{
printf("%lld\n",f[i]*f[i]+f[i-1]*f[i-1]);
break;
}
}
return 0;
}
- 参考文章:https://blog.csdn.net/wx2306/article/details/79821423
- https://blog.csdn.net/PR_sc/article/details/77199017
7. 火车站(NOIP1998)
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<cctype>
#include<cstring>
#include<utility>
#include<cstdlib>
#include<iomanip>
#include<iostream>
#include<algorithm>
#define Clear(x) memset(x,0,sizeof(x))
#define fup(i,a,b) for(int i=a;i<b;i++)
#define rfup(i,a,b) for(int i=a;i<=b;i++)
#define fdn(i,a,b) for(int i=a;i>b;i--)
#define rfdn(i,a,b) for(int i=a;i>=b;i--)
typedef long long ll;
using namespace std;
const int maxn = 1e2+7;
const int inf = 0x3f3f3f3f;
const double pi=acos(-1.0);
const double eps = 1e-8;
int f1[maxn];
int f2[maxn];
int read()
{
char ch=getchar();int ret=0,f=1;
while(ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){ret=ret*10+ch-'0';ch=getchar();}
return f*ret;
}
int main()
{
int a=read(),n=read(),m=read(),x=read();
Clear(f1),Clear(f2);
f1[1]=0,f1[2]=1;
f2[1]=1,f2[2]=1;
if(x==1||x==2)
{
printf("%d\n",a);
}else if(x==3){
printf("%d\n",2*a);
}else{
rfup(i,3,n-3)
{
f1[i]=f1[i-1]+f1[i-2];
f2[i]=f2[i-1]+f2[i-2];
}
int sum1=2,sum2=0;
rfup(i,1,n-4)
{
sum1+=f1[i];
sum2+=f2[i];
}
int man=(m-a*sum1)/sum2;
sum1=2,sum2=0;
rfup(i,1,x-3)
{
sum1+=f1[i];
sum2+=f2[i];
}
printf("%d\n",sum1*a+man*sum2);
}
return 0;
}
- 参考文章:https://blog.csdn.net/cggwz/article/details/77200498
- https://blog.csdn.net/qq_41311604/article/details/81544002
- https://blog.csdn.net/earnMoney/article/details/78079536