HDU5914 Triangle

最新推荐文章于 2019-03-28 19:30:59 发布

没有灵魂的程序员

最新推荐文章于 2019-03-28 19:30:59 发布

阅读量421

点赞数

CC 4.0 BY-SA版权

分类专栏：思维找规律文章标签： HDU

本文链接：https://blog.youkuaiyun.com/xky140610205/article/details/52852001

思维同时被 2 个专栏收录

25 篇文章

订阅专栏

找规律

6 篇文章

订阅专栏

本文探讨了一道有趣的算法题目——如何通过偷取最少数量的棒子来阻止形成三角形。通过对问题的深入分析，发现其背后的数学规律与斐波那契数列紧密相关，并提供了一种高效的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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

Sample Output

  
   Case #1: 1
Case #2: 1
Case #3: 2

Source

2016中国大学生程序设计竞赛（长春）-重现赛

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

不翻译了推了半天发现是斐波拉契数列

#include<bits/stdc++.h>
using namespace std;

int gg[100]={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;
    scanf("%d",&t);
    for(int h=1;h<=t;h++)
    {   scanf("%d",&n);
        printf("Case #%d: %d\n",h,gg[n]);
    }
    return 0;
}