HDU 5914 - Triangle
来源:互联网 发布:初中数学助手软件 编辑:程序博客网 时间:2024/06/14 14:31
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
题意:给出一个 n,分别有 1 - n 长度的木条各一条,问给出一个 n,求出去掉最少的木条数量,使剩下的木条中的任意 3 条均不能组成一个三角形。
让剩下的木条长度都是斐波那契中的数项即可,因为 n 只有20的大小,本渣渣纯手推的。。。
#include <cstdio>int main(){ int ans[30] = {0, 0, 0, 0, 1, 1, 2, 3, 3, 4, 5, 6, 7, 7, 8, 9, 10, 11, 12, 13, 14}; int T; scanf("%d", &T); for (int icase = 1; icase <= T; ++icase) { int n; scanf("%d", &n); printf("Case #%d: %d\n", icase, ans[n]); } return 0;}
- HDU 5914 Triangle
- HDU 5914 - Triangle
- HDU 5914 - Triangle
- hdu 5914 Triangle
- HDU 5914 Triangle (水题)
- HDU 5914 Triangle(水题)
- HDU-5914 Triangle(思路)
- Triangle HDU
- Triangle HDU
- hdu 5914 Triangle 斐波那契
- HDU 5914 Triangle (2016-ccpc-长春)
- HDU - 4324 Triangle LOVE
- hdu-4466-Triangle 数学题
- hdu 3817 Triangle
- hdu 4466 Triangle
- hdu 4324 - Triangle LOVE
- hdu 4142 Triangle 水题
- hdu 4466 Triangle (数学)
- Android SharedPreferences与Editor简介(上)
- 修改ubuntu16.04+ win10启动的引导时间
- 如何快速发布NPM模块
- A Summary of Unity Attributes
- bootstrap安装及引用
- HDU 5914 - Triangle
- python学习笔记:类
- 限制CEdit(Edit Contrl)只能输入数字和小数点
- Spark Job 调度 (官方文档翻译)
- NOIP2016 普及组第四题 魔法阵magic 题解
- 解决启动Eclipse返回Exit Code=13
- 带特效的“ViewPager”
- Button 标签实现页面跳转的方法
- TLD算法流程图