lightoj 1006 Hex-a-bonacci【水】

fuck!!!!!该死的题,说好的一大串,生怕按题中代码执行会超时,md,居然就是按题中的代码来,就改一丁点就行了!!!!!!!fuck,坑啊!!!!!!!!!

Hex-a-bonacci

   PDF (English) Statistics Forum
Time Limit: 0.5 second(s) Memory Limit: 32 MB

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

AC代码:

 1 #include<stdio.h>
 2 #include<string.h>
 3 #define H 10000007
 4 int shu[10100], n;
 5 int fun()
 6 {
 7     for(int  i = 0; i < 6; i++)
 8         shu[i] %= H;
 9     if(n < 6)
10         return shu[n];
11     for(int  i = 6; i <= n; i++)
12         shu[i]=(shu[i-6]+shu[i-5]+shu[i-4]+shu[i-3]+shu[i-2]+shu[i-1])%H;
13     return shu[n];
14 }
15 int main()
16 {
17     int t;scanf("%d",&t);
18     for(int j = 1; j <= t; j++)
19     {
20         scanf("%d%d%d%d%d%d%d",&shu[0],&shu[1],&shu[2],&shu[3],&shu[4],&shu[5],&n);
21         int ans = fun();
22         printf("Case %d: %d\n", j, ans);
23     }
24     return 0;
25  } 
时间: 2024-10-26 12:23:51

lightoj 1006 Hex-a-bonacci【水】的相关文章

LightOJ 1012 简单bfs,水

1.LightOJ 1012  Guilty Prince  简单bfs 2.总结:水 题意:迷宫,求有多少位置可去 #include<iostream> #include<cstring> #include<cmath> #include<queue> #include<algorithm> #include<cstdio> #define F(i,a,b) for (int i=a;i<=b;i++) using names

Lightoj 1006 Hex-a-bonacci

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;  

LightOJ 1245 Harmonic Number (II) 水题

分析:一段区间的整数除法得到的结果肯定是相等的,然后找就行了,每次是循环一段区间,暴力 #include <cstdio> #include <iostream> #include <ctime> #include <vector> #include <cmath> #include <map> #include <queue> #include <algorithm> #include <cstring

LightOJ 1259 Goldbach`s Conjecture 水题

不想说了 #include <cstdio> #include <iostream> #include <ctime> #include <vector> #include <cmath> #include <map> #include <queue> #include <algorithm> #include <cstring> using namespace std; typedef long

LightOJ 1166 Old Sorting 置换群 或 贪心 水题

LINK 题意:给出1~n数字的排列,求变为递增有序的最小交换次数 思路:水题.数据给的很小怎么搞都可以.由于坐标和数字都是1~n,所以我使用置换群求循环节个数和长度的方法. /** @Date : 2017-07-20 14:45:30 * @FileName: LightOJ 1166 贪心 或 置换群 水题.cpp * @Platform: Windows * @Author : Lweleth ([email protected]) * @Link : https://github.co

kuangbin 带你飞 数学基础

模版整理: 晒素数 void init() { cas = 0; for (int i = 0 ; i < MAXD ; i++) is_prime[i] = true; is_prime[0] = is_prime[1] = false; for (int i = 2 ; i < MAXD ; i++) { if (is_prime[i]) { prime[cas++] = i; for (int j = i + i ; j < MAXD ; j += i) is_prime[j] =

win10 服务(系统默认服务)注册表

---恢复内容开始--- Windows Registry Editor Version 5.00 [HKEY_LOCAL_MACHINE\SYSTEM\ControlSet001\Services] [HKEY_LOCAL_MACHINE\SYSTEM\ControlSet001\Services\.NET CLR Data] [HKEY_LOCAL_MACHINE\SYSTEM\ControlSet001\Services\.NET CLR Data\Performance]"Close&q

poj 1006:Biorhythms(水题,经典题,中国剩余定理)

Biorhythms Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 110991   Accepted: 34541 Description Some people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical,

PAT 乙级 水题1006. 换个格式输出整数 (15)

1 #include<iostream> 2 using namespace std; 3 int main() 4 { 5 int n; 6 cin>>n; 7 int g=0,s=0,b=0; 8 9 10 for(int i=0;i<10;i++){ 11 for(int j=0;j<10;j++){ 12 for(int k=0;k<10;k++){ 13 if(k==n){ 14 g=k; 15 break; 16 } 17 else if(j*10+k