HDU5914-Triangle

Triangle

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

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中国大学生程序设计竞赛（长春）-重现赛

题意：有长度分别为1到n的n根棒子，求最少偷走多少根棒子使得任意三根棒子不能组成三角形。

解题思路：使得剩下的边都不能组成三角形，只要剩下的都是Fibonacci序列中的数就行

#include <iostream>
#include <cmath>
#include <cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

#define inf 0x3f3f3f3f

int main()
{
    int t,n,cas=0;
    int a[25]= {0,0,0,0,1,1,2,3,3,4,5,6,7,7,8,9,10,11,12,13,14,14,15,16};
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        printf("Case #%d: %d\n",++cas,a[n]);
    }
    return 0;
}