UVaLive 6608 Cabin Baggage (水题)
2016-08-25 22:35
267 查看
题意:给定四个数代表长宽高和重,问你是不是满足下面条件,长不高于56,宽不宽于45,高不高于25,或者总和不大于125,并且重量不高于7.
析:判断输出就好,注意这个题是或,不要想错了。
代码如下:
析:判断输出就好,注意这个题是或,不要想错了。
代码如下:
#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 <sstream> #define frer freopen("in.txt", "r", stdin) #define frew freopen("out.txt", "w", stdout) using namespace std; typedef long long LL; typedef pair<int, int> P; const int INF = 0x3f3f3f3f; const double inf = 0x3f3f3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-8; const int maxn = 1e3 + 5; const int mod = 1e9 + 7; const char *mark = "+-*"; const int dr[] = {1, 0, -1, 0}; const int dc[] = {0, 1, 0, -1}; const char *de[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"}; 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; int ans = 0; while(T--){ double a, b, c, d; cin >> a >> b >> c >> d; double e = a + b + c; if(d <= 7.0 && (e <= 125.0 || a <= 56 && b <= 45 && c <= 25)) { printf("1\n"); ++ans; } else printf("0\n"); } printf("%d\n", ans); return 0; }
相关文章推荐
- UVALive 4192 Close Enough Computations 水题
- UVA_10716 - Evil Straw Warts Live-------水题(模拟)
- POJ3438 ZOJ2886 UVALive3822 Look and Say【数列+水题】
- UVALive2363 POJ1005 HDU1065 ZOJ1049 I Think I Need a Houseboat【数学计算+水题】
- UVALive 7270 Osu! Master 水题
- UVALive 7147-World Cup-数学推导-水题
- UVALive2953 POJ1775 ZOJ2358 Sum of Factorials【打表+暴力+水题】
- UVaLive 6591 && Gym 100299L Bus (水题)
- POJ2017 ZOJ2176 UVALive3059 Speed Limit【水题】
- UVA1583 UVALive3355 Digit Generator【水题+打表】
- UVALive4167 HDU2700 Parity【水题】
- UVALive2536 POJ1248 HDU1015 ZOJ1403 Safecracker【密码+暴力+水题】
- Web Colors UVALive - 7013(水题带公式)
- UVALive2362 POJ1004 HDU1064 ZOJ1048 Financial Management【数学计算+水题】
- UVaLive 6847 Zeroes (找规律,水题)
- POJ1488 UVA272 UVALive5381 TEX Quotes【输入输出+水题】
- UVALive5910 UVA1641 POJ4022 ASCII Area【水题+输入输出】
- UVAlive3708 UVA1388 POJ3154 Graveyard【水题】
- POJ1003 UVALive2294 HDU1056 ZOJ1045 Hangover【数学计算+水题】
- 哈理工练习赛 UVALive 5089 B - Assignments(水题)