HDU5914

Posted Penn000

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了HDU5914相关的知识,希望对你有一定的参考价值。

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 (T20), which indicates the number of test cases. 

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

 

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

 
数据较小,打表即可
 1 //2016.10.08
 2 #include <iostream>
 3 #include <cstdio>
 4 #include <cstring>
 5 
 6 using namespace std;
 7 int ans[30] = {0, 0, 0, 0, 1, 1, 2, 3, 3, 4, 5, 6, 7, 7, 8, 9, 10, 11, 12, 13, 14};
 8 int main()
 9 {
10     int T, n, kase = 0;
11     scanf("%d", &T);
12     while(T--)
13     {
14         scanf("%d", &n);
15         printf("Case #%d: %d\n", ++kase, ans[n]);
16     }
17 
18     return 0;
19 }

 

以上是关于HDU5914的主要内容,如果未能解决你的问题,请参考以下文章

Triangle HDU - 5914

hdu 5914 Triangle

CCPC2016长春D (hdu 5914 Triangle)

HDU 5914 Triangle 构造 (2016中国大学生程序设计竞赛(长春))

QDU-Training-01

5914. 值相等的最小索引