杭电acm 1005
2015-05-01 13:11
337 查看
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.
Sample Input
1 1 3
1 2 10
0 0 0
Sample Output
2
5
递归做的话会 Runtime Error (STACK_OVERFLOW)
#include <stdio.h>
#include <string.h>
int fac(int a,int b,int n)
{
if(n==1||n==2)
return 1;
else return (a*fac(a,b,n-1)+b*fac(a,b,n-2))%7;
}
int main(int argc, char *argv[])
{
int a,b,n;
int m;
while(scanf("%d%d%d",&a,&b,&n)!=EOF)
{
if(a==0&&b==0&&n==0)
break;
m=fac(a,b,n);
printf("%d\n",m);
}
return 0;
}
附上AC答案
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.
Sample Input
1 1 3
1 2 10
0 0 0
Sample Output
2
5
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.
Sample Input
1 1 3
1 2 10
0 0 0
Sample Output
2
5
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.
Sample Input
1 1 3
1 2 10
0 0 0
Sample Output
2
5
递归做的话会 Runtime Error (STACK_OVERFLOW)
#include <stdio.h>
#include <string.h>
int fac(int a,int b,int n)
{
if(n==1||n==2)
return 1;
else return (a*fac(a,b,n-1)+b*fac(a,b,n-2))%7;
}
int main(int argc, char *argv[])
{
int a,b,n;
int m;
while(scanf("%d%d%d",&a,&b,&n)!=EOF)
{
if(a==0&&b==0&&n==0)
break;
m=fac(a,b,n);
printf("%d\n",m);
}
return 0;
}
附上AC答案
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.
Sample Input
1 1 3
1 2 10
0 0 0
Sample Output
2
5
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.
Sample Input
1 1 3
1 2 10
0 0 0
Sample Output
2
5
相关文章推荐
- 杭电acm-1005
- ACM杭电1005 Number Sequence
- 杭电ACM 1005(Number Sequence)c++
- 杭电acm--1005
- 杭电ACM1005
- 杭电ACM刷题(2):1005,Number Sequence 标签: 杭电acmC语言 2017-05-11 22:43 116人阅读
- 杭电ACM刷题(2):1005,Number Sequence
- 杭电ACM 1005:Number Sequence
- 杭电ACM 1005 Number Sequence
- 杭电ACM(1005)Number Sequence
- 杭电acm-1005
- 杭电ACM 1005 Number Sequence
- 杭电ACM 1005 Number Sequence
- 杭电ACM 1005
- 杭电acm1005
- 杭电OJ acm_step1.1.2
- [杭电ACM]1229还是A+B
- ACM杭电2019
- (java)杭电acm 题号:1002 A + B Problem II
- 杭电acm 1076题