HDU 5914 - Triangle

题目

HDU 5914 Triangle

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

题意

输入n
有n根

代码

#include <stdio.h>int main(){    int t,n,a,b,i,c,ans;    scanf("%d",&t);    i = 1;    while(t--)    {        scanf("%d",&n);        if(n > 3)        {           ans = 2;           a = 1;b = 2;           while(b <= n)           {               c = a+b;               a = b;               b = c;               ans++;           }           ans = n - ans+1;        }        else            ans = 0;        printf("Case #%d: %d\n",i++,ans);    }    return 0;}