hdu6106 (思维水)
来源:互联网 发布:平板电脑安装ubuntu 编辑:程序博客网 时间:2024/06/05 04:50
Classes
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
The school set up three elective courses, assuming that these courses are A, B, C. N classes of students enrolled in these courses.
Now the school wants to count the number of students who enrolled in at least one course in each class and records the maximum number of students.
Each class uploaded 7 data, the number of students enrolled in course A in the class, the number of students enrolled in course B, the number of students enrolled in course C, the number of students enrolled in course AB, the number of students enrolled in course BC, the number of students enrolled in course AC, the number of students enrolled in course ABC. The school can calculate the number of students in this class based on these 7 data.
However, due to statistical errors, some data are wrong and these data should be ignored.
Smart you must know how to write a program to find the maximum number of students.
Now the school wants to count the number of students who enrolled in at least one course in each class and records the maximum number of students.
Each class uploaded 7 data, the number of students enrolled in course A in the class, the number of students enrolled in course B, the number of students enrolled in course C, the number of students enrolled in course AB, the number of students enrolled in course BC, the number of students enrolled in course AC, the number of students enrolled in course ABC. The school can calculate the number of students in this class based on these 7 data.
However, due to statistical errors, some data are wrong and these data should be ignored.
Smart you must know how to write a program to find the maximum number of students.
Input
The first line of the input gives the number of test cases T; T test cases follow.
Each case begins with one line with one integer N, indicates the number of class.
Then N lines follow, each line contains 7 data: a, b, c, d, e, f, g, indicates the number of students enrolled in A, B, C, AB, BC, AC, ABC in this class.
It's guaranteed that at least one data is right in each test case.
Limits
T≤100
1≤N≤100
0≤a,b,c,d,e,f,g≤100
Each case begins with one line with one integer N, indicates the number of class.
Then N lines follow, each line contains 7 data: a, b, c, d, e, f, g, indicates the number of students enrolled in A, B, C, AB, BC, AC, ABC in this class.
It's guaranteed that at least one data is right in each test case.
Limits
Output
For each test case output one line contains one integer denotes the max number of students who enrolled in at least one course among N classes.
Sample Input
224 5 4 4 3 2 25 3 1 2 0 0 020 4 10 2 3 4 96 12 6 3 5 3 2
Sample Output
715HintIn the second test case, the data uploaded by Class 1 is wrong. Because we can't find a solution which satisfies the limitation. As for Class 2, we can calculate the number of students who only enrolled in course A is 2, the number of students who only enrolled in course B is 6, and nobody enrolled in course C,the number of students who only enrolled in courses A and B is 1, the number of students who only enrolled in courses B and C is 3, the number of students who only enrolled in courses A and C is 1, the number of students who enrolled in all courses is 2, so the total number in Class 2 is 2 + 6 + 0 + 1 + 3 + 1 + 2 = 15.
#include<cstdio>#include<iostream>#include<string.h>#include<algorithm>using namespace std;int main(){int a,b,c,d,e,f,g;int t;int n;scanf("%d",&t);int k,h,l;int kk;while(t--){int ans=0;scanf("%d",&n);for(int i=0;i<n;i++){kk=0;scanf("%d%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f,&g);k=d+f-g;h=d+e-g;l=e+f-g;if(k<0||h<0||l<0)kk=1;a=a-k;b=b-h;c=c-l;if(a<0||b<0||c<0)kk=1;d=d-g;e=e-g;f=f-g;if(d<0||e<0||f<0)kk=1;if(!kk)ans=max(ans,a+b+c+d+e+f+g);}printf("%d\n",ans);} }
阅读全文
0 0
- hdu6106 (思维水)
- HDU6106-Classes
- HDU6106 Classes
- HDU6106-Classes
- hdu6106--Classes
- HDU6106 Classes 模拟|签到
- Hdu6106 Classes(2017多校第6场)
- hdu5112-思维&水
- Array 【思维】水
- hdu6075(思维水题)
- HDU6077 思维(水)
- 思维
- 思维
- 思维
- 思维
- 思维
- 思维
- HDU6106 Classes(思路,2017 HDU多校联赛 第6场)
- 解决已经安装了新版本的.net framework,在visual studio的target framework没有显示的问题
- java-IO-objectInputStream
- java获取某时、当日0点等时间点的极优获取方式
- 用OpenCV的VideoCapture类读取avi视频文件,并以帧流的形式显示出来!
- 设置div位于浏览器窗口的center
- hdu6106 (思维水)
- vsftp设置不同用户登录ftp的根目录不同
- LeetCode 93 Restore IP Addresses(Python详解及实现)
- Hello
- Perhydropolysilazane
- hbase filter shell 操作
- java springMVC 上传文件
- Ajax请求Session过期简单实现
- 出门“带脸”就行?人脸识别成“香饽饽”