2013
11-26

# Number Sequence

A number sequence is defined as follows:

f(1) = 1, f(2) = 1, f(n) = (A * f(n – 1) + B * f(n – 2)) mod 7.

Given A, B, and n, you are to calculate the value of f(n).

The input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000). Three zeros signal the end of input and this test case is not to be processed.

For each test case, print the value of f(n) on a single line.

1 1 3
1 2 10
0 0 0

2
5

f[i]=f[i-1]=0;

#include <stdio.h>
#include <string.h>
int s[50];
int main()
{
int a,b,n,i;
while(scanf("%d%d%d",&a,&b,&n),a || b || n)
{
int i;
s[0]=s[1]=1;
for(i = 2; i<50;i++)
{
s[i] = (a*s[i-1]+b*s[i-2])%7;
if(s[i] ==1 && s[i-1] == 1)
{break;}

}
n = n%(i-1);
if(n == 0)
printf("%d/n",s[i-2]);
else
printf("%d/n",s[n-1]);

}
return 0;
}

1. Good task for the group. Hold it up for every yeara??s winner. This is a excellent oppotunity for a lot more enhancement. Indeed, obtaining far better and much better is constantly the crucial. Just like my pal suggests on the truth about ab muscles, he just keeps obtaining much better.