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

2021-08-28 16:30:40

Triangle

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

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

题目链接：

　　http://acm.hdu.edu.cn/showproblem.php?pid=5914

题目大意：

　　给你1~N(N<=20)长度的木棒，求至少拿掉几根使得剩余的木棒构成不了三角形。

题目思路：

　　【模拟】

　　画画前几个就可以得出，剩下的木棒是斐波那契数列1,2,3,5,8,13。N只有20，打表。

 //

 //by coolxxx

 //#include<bits/stdc++.h>

 #include<iostream>

 #include<algorithm>

 #include<string>

 #include<iomanip>

 #include<map>

 #include<stack>

 #include<queue>

 #include<set>

 #include<bitset>

 #include<memory.h>

 #include<time.h>

 #include<stdio.h>

 #include<stdlib.h>

 #include<string.h>

 //#include<stdbool.h>

 #include<math.h>

 #define min(a,b) ((a)<(b)?(a):(b))

 #define max(a,b) ((a)>(b)?(a):(b))

 #define abs(a) ((a)>0?(a):(-(a)))

 #define lowbit(a) (a&(-a))

 #define sqr(a) ((a)*(a))

 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))

 #define mem(a,b) memset(a,b,sizeof(a))

 #define eps (1e-10)

 #define J 10000

 #define mod 1000000007

 #define MAX 0x7f7f7f7f

 #define PI 3.14159265358979323

 #pragma comment(linker,"/STACK:1024000000,1024000000")

 #define N 104

 using namespace std;

 typedef long long LL;

 double anss;

 LL aans,sum;

 int cas,cass;

 int n,m,lll,ans;

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

 int main()

 {

     #ifndef ONLINE_JUDGEW

 //    freopen("1.txt","r",stdin);

 //    freopen("2.txt","w",stdout);

     #endif

     int i,j,k;

 //    init();

 //    for(scanf("%d",&cass);cass;cass--)

     for(scanf("%d",&cas),cass=;cass<=cas;cass++)

 //    while(~scanf("%s",s))

 //    while(~scanf("%d",&n))

     {

         scanf("%d",&n);

         printf("Case #%d: ",cass);

         printf("%d\n",a[n]);

     }

     return ;

 }

 /*

 //

 //

 */

码农公寓

Triangle

相关文章