HDU 2914 Triangle (Fibnacci 数)
2024-09-30 12:40:35
题意:给你一个长度为 n 的木棒,求至少拿掉几根使得剩余的木棒构成不了三角形。
析:为了保证不形成三角形,所以保证两边之和等于最大边是最优,这不就是Fibnacci 数么,由于 n 很小,if-else 就好。
代码如下:
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
//#include <tr1/unordered_map>
#define freopenr freopen("in.txt", "r", stdin)
#define freopenw freopen("out.txt", "w", stdout)
using namespace std;
//using namespace std :: tr1; typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f;
const LL LNF = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 1e3 + 5;
const LL mod = 10000000000007;
const int N = 1e6 + 5;
const int dr[] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1};
const char *Hex[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};
inline LL gcd(LL a, LL b){ return b == 0 ? a : gcd(b, a%b); }
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline int Min(int a, int b){ return a < b ? a : b; }
inline int Max(int a, int b){ return a > b ? a : b; }
inline LL Min(LL a, LL b){ return a < b ? a : b; }
inline LL Max(LL a, LL b){ return a > b ? a : b; }
inline bool is_in(int r, int c){
return r >= 0 && r < n && c >= 0 && c < m;
} int main(){
int T; cin >> T;
for(int kase = 1; kase <= T; ++kase){
cin >> n;
printf("Case #%d: ", kase);
if(n < 4) printf("0");
else if(n < 6) printf("1");
else if(n < 8) printf("%d", n-4);
else if(n < 13) printf("%d", n-5);
else printf("%d", n-6);
printf("\n");
}
return 0;
}
最新文章
- [LeetCode] Flatten Nested List Iterator 压平嵌套链表迭代器
- entityframework
- C#开发微信门户及应用(44)--微信H5页面开发的经验总结
- linux c学习笔记08--文件操作
- Java设计模式2:简单工厂模式
- win7 ubuntu10.04双系统,重装win7后,修复双启动项
- Phantomjs 一些简单实用
- CORTEX -M3 : Registers in depth
- iOS多线程开发--NSThread NSOperation GCD
- JavaScript原型,原型链 !
- 2、FileOutputStream--->;文件输出流(向文件写入数据)
- Bat小试牛刀
- [POI2008]BLO-Blockade - Tarjan,割点
- HTML相关内容
- 简介 - SAFe(Scaled Agile Framework,规模化敏捷框架)
- [USACO08JAN]牛大赛Cow Contest
- [Android Pro] 关于Android 7.0无法进行https抓包的问题
- jdk src 学习 Threadlocal
- MyEclipse 相关设置
- You Arent Gonna Need It 理解