Triangle

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

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

Sample Output

Case #1: 1

Case #2: 1

Case #3: 2

Source

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

数据较小，打表即可

 //2016.10.08

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 using namespace std;

 int ans[] = {, , , , , , , , , , , , , , , , , , , , };

 int main()

 {

     int T, n, kase = ;

     scanf("%d", &T);

     while(T--)

     {

         scanf("%d", &n);

         printf("Case #%d: %d\n", ++kase, ans[n]);

     }

     return ;

 }

巴特西

HDU5914