zoukankan      html  css  js  c++  java
  • hdu 5914(斐波拉契数列)

    Triangle

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


    Problem Description
    Mr. Frog has n sticks, whose lengths are 1,2, 3n 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 (T20), which indicates the number of test cases.

    For each test case, there is only one line describing the given integer n (1n20).
     
    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
     
    Source
     
     
    题意:给出 1 - n 根木棍,问最少去掉多少根使其余的不能组成三角形..
    强行 DFS...后面看别人说的只要剩下的全部是斐波拉契数列的项就可以了..
    #include <bits/stdc++.h>
    using namespace std;
    map<int ,int> value;
    int ans[] = {0,0,0,1,1,2,3,3,4,5,6,7,7,8,9,10,11,12,13,14};
    int main()
    {
        int tcase,t=1;
        scanf("%d",&tcase);
        while(tcase--){
            int n;
            scanf("%d",&n);
            printf("Case #%d: %d
    ",t++,ans[n-1]);
        }
        return 0;
    }
     
     
  • 相关阅读:
    时间
    matplotlib中文乱码
    文件路径
    mysql按照秒、分钟、小时、天、月、年统计数量
    python运行jmx文件
    查看Kafka group中的历史消息
    Django 工作流程
    python PyQt5 制作简单计算器
    python 根据链家爬取的信息生成云词
    python 爬取链家二手房信息
  • 原文地址:https://www.cnblogs.com/liyinggang/p/5931388.html
Copyright © 2011-2022 走看看