HDU 6106-Classes

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.

 

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

 

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

715
Hint
In 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.

题意：

学校设立了三门选修课程，假设这些课程是A，B，C。N个班的学生参加了这些课程。
现在，学校想计算每班入读至少一门课程的学生人数，并记录最多学生人数。
每班上传7份资料，在每班中，选课程A的学生人数，选课程B的学生人数，选课程C的学生人数，选课程AB的学生人数，选课程BC的学生人数，选课程AC的学生人数，选课程ABC的学生人数。根据这7个数据，学校可以计算这个班级的学生人数。

现在给你n个班的数据，有些班的数据是错误的，我们应判断出来并忽视它，在剩下数据对的班级里，利用给出的7组数据，求出班级人数，输出班级最多的人数

分析：

具体看代码，有注释哦！

#include<iostream>#include<cstring>using namespace std;int main(){    int a,b,c,d,e,f;    int m[8],n[8];    cin>>a;    while(a--)    {        cin>>b;        f=-1;        while(b--)        {            for(c=0;c<7;c++)                cin>>m[c];            m[5]=m[5]-m[6];//求出只报AC课程的人数            m[4]=m[4]-m[6];//求出只报BC课程的人数            m[3]=m[3]-m[6];//求出只报AB课程的人数            m[2]=m[2]-m[5]-m[4]-m[6];//求出只报C课程的人数            m[1]=m[1]-m[3]-m[4]-m[6];//求出只报B课程的人数            m[0]=m[0]-m[5]-m[3]-m[6];//求出只报A课程的人数            if(m[0]<0||m[1]<0||m[2]<0||m[3]<0||m[4]<0||m[5]<0||m[6]<0)                continue;//如果数据有错误则跳出            d=m[0]+m[1]+m[2]+m[3]+m[4]+m[5]+m[6];//如果数据没错就计算出班级人数            if(d>f)//比较求出最多的班级人数                f=d;        }        cout<<f<<endl;    }    return 0;}