hdoj5914Triangle

Triangle

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 305    Accepted Submission(s): 209

Problem Description

Mr. Frog has n sticks, whose lengths are 1,2, 3 ⋯ n respectively. Wallice is a bad man, so he does not want Mr. Frog to form a triangle with three of the sticks here. He decides to steal some sticks! Output the minimal number of sticks he should steal so that Mr. Frog cannot form a triangle with
any three of the remaining sticks.

 

Input

The first line contains only one integer T ( T≤20 ), which indicates the number of test cases. 

For each test case, there is only one line describing the given integer n ( 1≤n≤20 ).

 

Output

For each test case, output one line “Case #x: y”, where x is the case number (starting from 1), y is the minimal number of sticks Wallice should steal.

 

Sample Input

  
  

   
   3
4
5
6
  
  

 

Sample Output

  
  

   
   Case #1: 1
Case #2: 1
Case #3: 2
  
  

 

Source

2016中国大学生程序设计竞赛（长春）-重现赛

 

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<set>
#include<list>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int,int>pii;
int F[15];
int main()
{
    F[1]=1;F[2]=2;
    for(int i=3;i<=10;++i){
        F[i]=F[i-1]+F[i-2];
    }
    int t,Test=1,n;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        printf("Case #%d: ",Test++);
        for(int i=1;i<=10;++i){
            if(F[i]>n){
                printf("%d\n",n-i+1);
                break;
            }
        }
    }
    return 0;
}