Problem Description
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).
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).
Input
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.
Output
For each test case, print the value of f(n) on a single line.
#include <stdio.h> #include <string.h> int main(int argc, const char * argv[]) { int a,b,n; int count; int index; int chart[52]; while (scanf("%d%d%d",&a,&b,&n) != EOF) { if (a == 0 && b == 0 && n == 0) { break; } if (a < 0 || a > 1000 || b < 0 || b > 1000 || n < 0 || n > 100000000) { break; } memset(chart,0,sizeof(chart)); chart[1] = chart[2] = 1; count = 3; while (count <= 51) { chart[count] = (a * chart[count - 1] + b * chart[count - 2]) % 7; if (chart[count] == 1 && chart[count - 1] == 1) { count -= 1; chart[0] = chart[count - 1]; break; } count ++; } count --; index = n % count; printf("%d\n",chart[index]); } return 0; }