2017 Multi-University Training Contest
来源:互联网 发布:手机怎么查看淘宝积分 编辑:程序博客网 时间:2024/06/07 15:48
http://acm.hdu.edu.cn/showproblem.php?pid=6106
题意:
给出选
思路:
根据容斥定理,在正确的情况下,
1.
2.
3.
只要满足这所有的条件,那么这个班级的数据就肯定是正确的,最后
代码:
#include<bits/stdc++.h>using namespace std; int main(){ int n,T; int a,b,c,ab,bc,ac,abc; while(~scanf("%d",&T)){ while(T--){ scanf("%d",&n); int ans = 0; while(n--){ scanf("%d %d %d %d %d %d %d",&a,&b,&c,&ab,&bc,&ac,&abc); if(a >= ab && a >= ac && b >= ab && b >= bc && c >= bc && c >= ac && ab >= abc && bc >= abc && ac >= abc && a >= (ab + ac - abc) && b >= (ab + bc - abc) && c >= (bc + ac - abc)){ int temp = a + b + c + abc - ab - bc - ac; ans = max(ans,temp); } } printf("%d\n",ans); } }}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 极光推送
- IELTS12 TEST8 allow children to make their own choices on everyday matters
- Scrapy执行crawl命令报错:ModuleNotFoundError: No module named 'win32api'
- POJ 2536 Gopher II(二分图最大匹配)
- hdu 6115 Factory(LCA+暴力)
- 2017 Multi-University Training Contest
- JAVA I-O阶段性小结
- linux进程状态浅析
- 图形处理之Shader语言(二)CG语法篇
- windows下查看短文件名的方法
- 多态的实例
- NOI-砝码称重v2 多重背包 生成函数
- 课堂在线Java程序设计 类的继承 编程题1
- NDK之我淌过的坑