目录:
题目:
分析:
作为C组的签到题,还是合格的~~笑
回到题目,我们可以根据题目,得出小麦数量的数量f
f[1]=p,f[2]=p+1,f[3]=2p+1,f[4]=3p+2……
f
[
1
]
=
p
,
f
[
2
]
=
p
+
1
,
f
[
3
]
=
2
p
+
1
,
f
[
4
]
=
3
p
+
2
…
…
再设一个数组g,用来算斐波那契数列F与f的差:
g[1]=p,g[2]=p,g[3]=2p,g[4]=3p……
g
[
1
]
=
p
,
g
[
2
]
=
p
,
g
[
3
]
=
2
p
,
g
[
4
]
=
3
p
…
…
所以我们可以得到
g[a]=f[a]−F[i−1]
g
[
a
]
=
f
[
a
]
−
F
[
i
−
1
]
然后将g与F联系起来,即可得到:
g[a]=F[a]×p
g
[
a
]
=
F
[
a
]
×
p
再根据题意,
x=f[a]
x
=
f
[
a
]
,也就是
g[a]=x−F[i−1]
g
[
a
]
=
x
−
F
[
i
−
1
]
对于F,我们可以暴力出来,而x又是已知,所以求出p就变得很简单了
接下来再暴力一遍,最后输出就好了
代码:
#pragma GCC optimize("3")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<map>
#define LL long long
using namespace std;
inline LL read() {
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
LL f[23]={0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765};
LL ans[25];
int main()
{
LL a,x,b,p,sa=0,sb=0,sc=0;
while(1)
{
a=read(),x=read();b=read();
if(a==sa&&x==sb&&b==sc) break;
x-=f[a-1];
if(x%f[a]) {printf("-1\n");continue;}
x/=f[a];
ans[1]=1;ans[2]=x;
for(int i=3;i<=b+1;i++)
ans[i]=ans[i-1]+ans[i-2];
printf("%lld\n",ans[b+1]);
sa=a;sb=x;sc=b;
}
return 0;
}