hdu 5914 Triangle

Triangle

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

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

3456

 

Sample Output

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

 

Source

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

//2016中国大学生程序设计竞赛（长春）-重现赛//#include"stdafx.h"#include<iostream>using namespace std;#define size 30int n;int function() {    if (n <= 3) {        return 0;    }    if (n <= 5) {        return 1;    }    if (n < 8) {        return n - 5 + 1;    }    if (n < 13) {        return n - 8 + 3;    }    if (n < 20) {        return n - 13 + 7;    }    if (n == 20) {        return 14;    }}int main() {    int cases;    cin >> cases;    for (int t = 1; t <= cases; t++) {        cin >> n;        cout << "Case #" << t << ": " << function() << endl;    }}