mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
28 lines
573 B
C++
28 lines
573 B
C++
|
#include<stdio.h>
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int f[200],a,b,n,i;
|
||
|
|
while(scanf("%d%d%d",&a,&b,&n),a||b||n)
|
||
|
|
{
|
||
|
|
if(n>2)
|
||
|
|
{
|
||
|
|
f[1]=f[2]=1;
|
||
|
|
for(i=3;i<200;i++)
|
||
|
|
{
|
||
|
|
f[i]=(a*f[i-1]+b*f[i-2])%7;
|
||
|
|
if(f[i-1]==1&&f[i]==1)
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
i-=2;
|
||
|
|
n=n%i;
|
||
|
|
if(n==0)
|
||
|
|
printf("%d\n",f[i]);
|
||
|
|
else
|
||
|
|
printf("%d\n",f[n]);
|
||
|
|
}
|
||
|
|
else
|
||
|
|
printf("1\n");
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
}
|