Number Sequence

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).
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 <iostream>using namespace std;int f (int n, int num1, int num2){    switch(n)    {        case 2: return 1; break;        case 1: return 1; break;    }    return (num1*f(n-1, num1, num2)+num2*f(n-2, num1, num2))%7;}int main (){    int A, B, n, result;    cin >> A >> B >> n;    result = f(n, A, B);    cout << result << endl;    return 0;}