HDU-5914 规律题

题目传送门： http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1004&cid=728

题意：给一个数n，问需要从1到n中拿走多少个整数才能让剩余的整数组合不成三角形

思路：算是一个找规律题吧，类斐波那契，找到规律后直接打表

代码如下：

#include <iostream>
#include <algorithm>
#include <cstring>
#include <stdio.h>
#include <string>
#include <cmath>
#include <queue>
#include <set>

using namespace std;
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   ll            long long
#define   ull           unsigned long long
#define   mem(n,v)      memset(n,v,sizeof(n))
#define   MAX           105
#define   MAXN          2000005
#define   PI            3.1415926
#define   E             2.718281828459
#define   opnin         freopen("text.in.txt","r",stdin)
#define   opnout        freopen("text.out.txt","w",stdout)
#define   clsin         fclose(stdin)
#define   clsout        fclose(stdout)
#define   haha1          cout << "haha1"<< endl
#define   haha2          cout << "haha2"<< endl
#define   haha3          cout << "haha3"<< endl

const int    INF    =   0x3f3f3f3f;
const ll     INFF   =   0x3f3f3f3f3f3f3f3f;
const double pi     =   3.141592653589793;
const double inf    =   1e18;
const double eps    =   1e-8;
const ll     mod    =   1e9+7;
const ull    mx     =   133333331;
int main()
{
    int a[21] = {0,0,0,0,1,1,2,3,3,4,5,6,7,7,8,9,10,11,12,13,14};
    int kace;
    cin >> kace;
    for(int j=1;j<=kace;j++){
        cout << "Case #" << j << ": ";
        int x;
        cin >> x;
        cout << a[x] <<endl;
    }

    return 0;
}