LightOJ 1006 - Hex-a-bonacci
来源:互联网 发布:手机助手软件 编辑:程序博客网 时间:2024/05/22 01:03
Given a code (not optimized), and necessary inputs, you have to find the output of the code for the inputs. The code is as follows:
int a, b, c, d, e, f;
int fn( int n ) {
if( n == 0 ) return a;
if( n == 1 ) return b;
if( n == 2 ) return c;
if( n == 3 ) return d;
if( n == 4 ) return e;
if( n == 5 ) return f;
return( fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6) );
}
int main() {
int n, caseno = 0, cases;
scanf("%d", &cases);
while( cases-- ) {
scanf("%d %d %d %d %d %d %d", &a, &b, &c, &d, &e, &f, &n);
printf("Case %d: %d\n", ++caseno, fn(n) % 10000007);
}
return 0;
}
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case contains seven integers, a, b, c, d, e, f and n. All integers will be non-negative and 0 ≤ n ≤ 10000 and the each of the others will be fit into a 32-bit integer.
Output
For each case, print the output of the given code. The given code may have integer overflow problem in the compiler, so be careful.
Sample Input
Output for Sample Input
5
0 1 2 3 4 5 20
3 2 1 5 0 1 9
4 12 9 4 5 6 15
9 8 7 6 5 4 3
3 4 3 2 54 5 4
Case 1: 216339
Case 2: 79
Case 3: 16636
Case 4: 6
Case 5: 54
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int g[11000];int main(){int n,i,j,k,l,t,temp;scanf("%d",&t);k=1;while(t--){ memset(g,0,sizeof(g)); scanf("%d%d%d%d%d%d%d",&g[0],&g[1],&g[2],&g[3],&g[4],&g[5],&n); for(i=6;i<=n;i++) { temp=0; for(j=i-1;j>=i-6;j--) { temp+=g[j]%10000007; } g[i]=temp; } printf("Case %d: %d\n",k++,g[n]%10000007);}return 0; }
- LightOj 1006 - Hex-a-bonacci
- LightOJ 1006 Hex-a-bonacci
- LightOJ 1006 :Hex-a-bonacci
- LightOJ 1006 - Hex-a-bonacci
- LightOJ-1006-Hex-a-bonacci
- lightoj-1006-Hex-a-bonacci【思维】
- LightOJ 1006 C Hex a bonacci (取模、水~)
- LightOj 1006 Hex-a-bonacci(矩阵快速幂)
- 【LightOJ】1006 - Hex-a-bonacci(矩阵快速幂)
- lightoj 1006 - Hex-a-bonacci (FOR循环)
- Light OJ 1006 Hex-a-bonacci
- lightOj1006 Hex-a-bonacci
- Light OJ:1006 Hex-a-bonacci(水题)
- LIGHT OJ 1006 - Hex-a-bonacci 【化简递推式(DP)】
- 【light-oj】-1006 - Hex-a-bonacci(思维)
- LightOJ1006---Hex-a-bonacci(矩阵快速幂)
- Lightoj1006——Hex-a-bonacci(递归转递推)
- A - Hex Factorial
- 中值滤波
- linux脚本无权限但不提示的问题
- JPA注解
- HTTP/1.1
- Surround the Trees ssl 1720 计算几何
- LightOJ 1006 - Hex-a-bonacci
- 数据库表某字段设置default为Null好,还是“”好,或者是Empty String好呢
- PHP 学习之路 基础
- 用源码安装 appium
- android studio将导入的三方module整理到一个文件夹下
- 全志R58的官方开发板加载bmi160驱动的步骤2C
- iOS开发(第三方使用)——极光推送SDK接入
- 我是如何面试产品经理的
- 条理清晰的搭建SSH环境之整合Hibernate和Spring