zoukankan      html  css  js  c++  java
  • Codeforces 890A

    A. ACM ICPC
    time limit per test2 seconds
    memory limit per test256 megabytes
    inputstandard input
    outputstandard output
    In a small but very proud high school it was decided to win ACM ICPC. This goal requires to compose as many teams of three as possible, but since there were only 6 students who wished to participate, the decision was to build exactly two teams.

    After practice competition, participant number i got a score of ai. Team score is defined as sum of scores of its participants. High school management is interested if it's possible to build two teams with equal scores. Your task is to answer that question.

    Input
    The single line contains six integers a1, ..., a6 (0 ≤ ai ≤ 1000) — scores of the participants

    Output
    Print "YES" (quotes for clarity), if it is possible to build teams with equal score, and "NO" otherwise.

    You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").

    Examples
    input
    1 3 2 1 2 1
    output
    YES
    input
    1 1 1 1 1 99
    output
    NO
    Note
    In the first sample, first team can be composed of 1st, 2nd and 6th participant, second — of 3rd, 4th and 5th: team scores are 1 + 3 + 1 = 2 + 1 + 2 = 5.

    In the second sample, score of participant number 6 is too high: his team score will be definitely greater.

     思路:

    问6个数能否被2人平分

    代码:

     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 int main() {
     4     ios::sync_with_stdio(false);
     5     int a[7];
     6     int sum=0;
     7     for(int i=1;i<=6;++i) {
     8         cin>>a[i];
     9         sum+=a[i];
    10     }
    11     if(sum%2!=0) {
    12         cout<<"NO"<<endl;
    13         return 0;
    14     }
    15     int flag=0;
    16     for(int i=1;i<=4;++i) {
    17         for(int j=i+1;j<=5;++j) {
    18             for(int k=j+1;k<=6;++k) {
    19                 if((a[i]+a[j]+a[k])==(sum/2)) {
    20                     flag=1;
    21                     break;
    22                 }
    23             }
    24         }
    25     }
    26     if(flag) cout<<"YES"<<endl;
    27     else cout<<"NO"<<endl;
    28     return 0;
    29 }
    View Code
  • 相关阅读:
    判断ip是内网还是外网, 判断请求来之pc还是mobile
    CentOS6.5(Kernel2.6) Compile PHP5.6
    java设计模式笔记
    Java定时quartz(spring)
    Transforming beans, maps, collections, java arrays and XML to JSON
    java socket通讯交互
    第一个WebService CXF的搭建
    java技术成长之路
    struts2中文乱码
    sql server分页(摘)
  • 原文地址:https://www.cnblogs.com/lemonbiscuit/p/7825019.html
Copyright © 2011-2022 走看看