Number SequenceTime Limit:2000/1000 MS (Java/Others) Memory Limit:65536/32768 K (Java/Others)Total Submission(s):8030 Accepted Submission(s):1482Problem DescriptionA number sequence is defined as follows:f(1) = 1,f(2) = 1,f(n) = (A * f(n - 1) + B * f
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/04 04:38:17
![Number SequenceTime Limit:2000/1000 MS (Java/Others) Memory Limit:65536/32768 K (Java/Others)Total Submission(s):8030 Accepted Submission(s):1482Problem DescriptionA number sequence is defined as follows:f(1) = 1,f(2) = 1,f(n) = (A * f(n - 1) + B * f](/uploads/image/z/5138587-19-7.jpg?t=Number+SequenceTime+Limit%3A2000%2F1000+MS+%28Java%2FOthers%29+Memory+Limit%3A65536%2F32768+K+%28Java%2FOthers%29Total+Submission%28s%29%3A8030+Accepted+Submission%28s%29%3A1482Problem+DescriptionA+number+sequence+is+defined+as+follows%3Af%281%29+%3D+1%2Cf%282%29+%3D+1%2Cf%28n%29+%3D+%28A+%2A+f%28n+-+1%29+%2B+B+%2A+f)
Number SequenceTime Limit:2000/1000 MS (Java/Others) Memory Limit:65536/32768 K (Java/Others)Total Submission(s):8030 Accepted Submission(s):1482Problem DescriptionA number sequence is defined as follows:f(1) = 1,f(2) = 1,f(n) = (A * f(n - 1) + B * f
Number Sequence
Time Limit:2000/1000 MS (Java/Others) Memory Limit:65536/32768 K (Java/Others)
Total Submission(s):8030 Accepted Submission(s):1482
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
Number SequenceTime Limit:2000/1000 MS (Java/Others) Memory Limit:65536/32768 K (Java/Others)Total Submission(s):8030 Accepted Submission(s):1482Problem DescriptionA number sequence is defined as follows:f(1) = 1,f(2) = 1,f(n) = (A * f(n - 1) + B * f
计算有时间限制 2000/1000 毫秒
1