HDU 6106 Classes
来源:互联网 发布:mac截屏键 编辑:程序博客网 时间:2024/06/05 12:50
Classes
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 865 Accepted Submission(s): 516
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.
水题,注意看Hint,模拟这个,就过了
My ugly code
#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <iostream>#include <algorithm>#define ll long longusing namespace std;int T,N;int a,b,c,d,e,f,g;int main(){ scanf("%d",&T); while(T--){ scanf("%d",&N); int ans[10]; int kk=0; for(int i=1;i<=N;i++){ scanf("%d%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f,&g); ans[0]=d-g; ans[1]=e-g; ans[2]=f-g; ans[3]=a-ans[0]-ans[2]-g; ans[4]=b-ans[0]-ans[1]-g; ans[5]=c-ans[1]-ans[2]-g; ans[6]=g; if(ans[0] < 0 || ans[1] < 0 || ans[2] < 0 || ans[3] < 0 || ans[4] < 0 || ans[5] < 0 || ans[6] < 0) continue ; int tmp=0; for(int i=0;i<7;i++) tmp+=ans[i]; kk=max(kk,tmp); } printf("%d\n",kk); } return 0;}
阅读全文
0 0
- HDU 6106-Classes
- HDU 6106-Classes
- hdu 6106 Classes
- hdu-6106-Classes
- HDU 6106 Classes
- HDU 6106 Classes【水题】
- 【HDU 6106 Classes】
- hdu 6106 Classes (二分)
- HDU 6106 Classes 【】
- HDU 6106 Classes (水题)
- HDU 6106 Classes
- HDU 6106 Classes
- HDU 6106 Classes
- HDU 6106 Classes【简单思维】
- hdu 6106 Classes(容斥)
- HDU 6106 Classes(水~)
- HDU-Classes
- 2017 多校赛6 Classes hdu 6106
- java封装数组类
- js中事件捕获和事件冒泡
- Two Sum IV
- 数据结构实验之链表六:有序链表的建立
- 第八章(散列)
- HDU 6106 Classes
- 第一篇 基本元器件认识---电阻
- 欢迎使用CSDN-markdown编辑器
- 56.笔记go语言——go的函数类型
- jsp指令标签
- 【项目实践】——工具Eclipse中maven项目控制台无法打印内容
- mybatis的动态SQL(二)choose标签的使用
- 57.笔记go语言——闭包
- Ajax