HDU 5914 Triangle 【构造】 (2016中国大学生程序设计竞赛(长春))
来源:互联网 发布:javascript跳转新页面 编辑:程序博客网 时间:2024/05/17 23:00
Triangle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2 Accepted Submission(s): 1
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.
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 ).
For each test case, there is only one line describing the given integer n (
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
3456
Sample Output
Case #1: 1Case #2: 1Case #3: 2
Source
2016中国大学生程序设计竞赛(长春)-重现赛
Recommend
wange2014 | We have carefully selected several similar problems for you: 5921 5920 5919 5918 5917
题目链接:
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 104using namespace std;typedef long long LL;double anss;LL aans,sum;int cas,cass;int n,m,lll,ans;int a[]={0,0,0,0,1,1,2,3,3,4,5,6,7,7,8,9,10,11,12,13,14};int main(){#ifndef ONLINE_JUDGEW//freopen("1.txt","r",stdin);//freopen("2.txt","w",stdout);#endifint i,j,k;//init();//for(scanf("%d",&cass);cass;cass--)for(scanf("%d",&cas),cass=1;cass<=cas;cass++)//while(~scanf("%s",s))//while(~scanf("%d",&n)){scanf("%d",&n);printf("Case #%d: ",cass);printf("%d\n",a[n]);}return 0;}/*////*/
0 0
- HDU 5914 Triangle 【构造】 (2016中国大学生程序设计竞赛(长春))
- HDU Triangle 2016中国大学生程序设计竞赛(长春)-重现赛
- HDU 5914 Triangle【找规律】【2016中国大学生程序设计竞赛(长春)】
- hdu 5914 Triangle 2016中国大学生程序设计竞赛(长春)(脑洞题)
- HDU 5914 Triangle【斐波那契思维】(2016中国大学生程序设计竞赛(长春)D题)
- HDU 5916 Harmonic Value Description 【构造】(2016中国大学生程序设计竞赛(长春))
- HDU 5916 Harmonic Value Description【构造】【2016中国大学生程序设计竞赛(长春)】
- HDU 5912 Fraction 【模拟】 (2016中国大学生程序设计竞赛(长春))
- HDU 5920 Ugly Problem 【模拟】 (2016中国大学生程序设计竞赛(长春))
- HDU Fraction 2016中国大学生程序设计竞赛(长春)-重现赛
- hdu 5912 Fraction 2016中国大学生程序设计竞赛(长春) 水题
- hdu 5912 Fraction -2016中国大学生程序设计竞赛(长春)
- 【HDU 5914 Sequence I】+ 2016中国大学生程序设计竞赛(长春)-重现赛
- 2016中国大学生程序设计竞赛CCPC-长春赛区
- HDU 5916 Harmonic Value Description【思维构造题目】(2016中国大学生程序设计竞赛(长春)F题)
- HDU Harmonic Value Description 2016中国大学生程序设计竞赛(长春)-重现赛
- HDU Sequence I 2016中国大学生程序设计竞赛(长春)-重现赛
- HDU Ugly Problem 2016中国大学生程序设计竞赛(长春)-重现赛
- 唯品会的订单分库分表实践总结以及关键步骤
- Android 笔记 读取style文件的属性
- Oracle 中的JOIN
- Windows下多个Python版本共存
- Longest Substring Without Repeating Characters from LeetCode
- HDU 5914 Triangle 【构造】 (2016中国大学生程序设计竞赛(长春))
- 认识css样式(第二部分-文字排版)
- 文章标题
- codeforces723D-Lakes in Berland-DFS
- soekct实践编程1
- Codeforces Round #285 (Div. 2) C Misha and Forest
- 分库分表策略的可实现架构
- 【软件工程】——项目开发计划
- 使用feign调用restful服务