【HDU 5914 Sequence I】+ 2016中国大学生程序设计竞赛(长春)-重现赛
2016-11-12 16:36
531 查看
Triangle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 767 Accepted Submission(s): 492
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
最大的两边~小于a且加入a后最大的两边仍然小于等于 N时a便可以留下~~
本菜鸡手推~~
AC代码 :
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 767 Accepted Submission(s): 492
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
最大的两边~小于a且加入a后最大的两边仍然小于等于 N时a便可以留下~~
本菜鸡手推~~
AC代码 :
hljs perl">int pa[21] = {0,0,0,0,1,1,2,3,3,4,5,6,7,7,8,9,10,11,12,13,14}; int main() { int T,n,nl = 0; scanf("%d",&T); while(T--){ scanf("%d",&n); printf("Case #%d: %d\n",++nl,pa ); } return 0; }
相关文章推荐
- HDU Sequence I 2016中国大学生程序设计竞赛(长春)-重现赛
- hdu 5916 Harmonic Value Description-思维题-2016中国大学生程序设计竞赛(长春)-重现赛
- HDU 5914 Triangle【找规律】【2016中国大学生程序设计竞赛(长春)】
- hdu 5914 Triangle 2016中国大学生程序设计竞赛(长春)(脑洞题)
- HDU 5914 Triangle【斐波那契思维】(2016中国大学生程序设计竞赛(长春)D题)
- HDU Harmonic Value Description 2016中国大学生程序设计竞赛(长春)-重现赛
- HDU 5918 Sequence I【暴力+剪枝】(2016中国大学生程序设计竞赛(长春)H题)
- HDU 5914 Triangle 【构造】 (2016中国大学生程序设计竞赛(长春))
- HDU 5914 Triangle 【构造】 (2016中国大学生程序设计竞赛(长春))
- HDU 5918 Sequence I【KMP?】【2016中国大学生程序设计竞赛(长春)】
- HDU Ugly Problem 2016中国大学生程序设计竞赛(长春)-重现赛
- HDU 5920 Ugly Problem 【模拟】 (2016中国大学生程序设计竞赛(长春))
- HDU 5912 Fraction 【模拟】 (2016中国大学生程序设计竞赛(长春))
- HDU 5912 Fraction 模拟题 【2016中国大学生程序设计竞赛(长春)】
- hdu 5912 Fraction 2016中国大学生程序设计竞赛(长春) 水题
- hdu 5912 Fraction -2016中国大学生程序设计竞赛(长春)
- HDU Triangle 2016中国大学生程序设计竞赛(长春)-重现赛
- HDU 5912 Fraction【模拟】(2016中国大学生程序设计竞赛(长春)B题)
- HDU 5912 Fraction 【模拟】 (2016中国大学生程序设计竞赛(长春))
- HDU 5916 Harmonic Value Description 【构造】(2016中国大学生程序设计竞赛(长春))