hiho week 139 register

Ended

Participants:518

Verdict:Accepted
Score:100 / 100
Submitted:2017-02-26 09:53:14

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<bits/stdc++.h>
using namespace std;
struct node{
    double x;
    int y;
}a[100];
bool ok(double s){
    if(floor(s)==ceil(s) && ((int)s)%5==0) return 1;
    return 0;
}
int main(){
    int T;
    cin>>T;
    while(T--){
        for(int i=0;i<=100;i++) a[i].x=a[i].y=0;
        int n;
        cin>>n;
        for(int i=0;i<n;i++) cin>>a[i].x>>a[i].y;
        n+=2;
        int ans=0;
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                for(int k=j+1;k<n;k++){
                    if(ok(a[i].x+a[j].x+a[k].x))
                        ans=max(ans,a[i].y+a[j].y+a[k].y);      
                }
            }
        } 
        cout<<ans<<endl;
    }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX