zoukankan      html  css  js  c++  java
  • Codeforces Round #445 A. ACM ICPC【暴力】

    A. ACM ICPC
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard 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 aiTeam 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 are1 + 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.

    【题意】:存在某三个和另外三个相等输出YES,否则输出NO

    【分析】:暴力

    【代码】:

    #include <bits/stdc++.h>
    
    using namespace std;
    const int maxn = 505;
    
    int main()
    {
        int a[10],sum[50];
        memset(sum,0,sizeof(sum));
        for(int i=1;i<=6;i++)
        {
            cin>>a[i];
            if(a[1]+a[2]+a[3]==a[4]+a[5]+a[6])
            {
                printf("YES
    ");
                return 0;
            }
    
            if(a[1]+a[2]+a[4]==a[3]+a[5]+a[6])
            {
                printf("YES
    ");
                return 0;
            }
    
            if(a[1]+a[2]+a[5]==a[3]+a[4]+a[6])
            {
                printf("YES
    ");
                return 0;
            }
    
            if(a[1]+a[2]+a[6]==a[3]+a[4]+a[5])
            {
                printf("YES
    ");
                return 0;
            }
    
            if(a[1]+a[3]+a[4]==a[2]+a[5]+a[6])
            {
                printf("YES
    ");
                return 0;
            }
    
            if(a[1]+a[3]+a[5]==a[2]+a[4]+a[6])
            {
                printf("YES
    ");
                return 0;
            }
    
            if(a[1]+a[3]+a[6]==a[2]+a[4]+a[5])
            {
                printf("YES
    ");
                return 0;
            }
    
            if(a[2]+a[3]+a[4]==a[1]+a[5]+a[6])
            {
                printf("YES
    ");
                return 0;
            }
    
            if(a[2]+a[3]+a[5]==a[1]+a[4]+a[6])
            {
                printf("YES
    ");
                return 0;
            }
    
            if(a[2]+a[3]+a[6]==a[1]+a[4]+a[5])
            {
                printf("YES
    ");
                return 0;
            }
    
    
        }
        printf("NO
    ");
        return 0;
    }
    我的傻逼代码
    #include <bits/stdc++.h>
    
    using namespace std;
    #include<cstdlib>
    #include<cstring>
    #include<algorithm>
    #include<cmath>
    #include<cstdio>
    #include<iostream>
    using namespace std;
    int a[7],sum=0;
    
    int main()
    {
        for(int i=0;i<6;i++)
        {
            cin>>a[i];
            sum+=a[i];
        }
        for(int i=0;i<6;i++)
        {
            for(int j=i+1;j<6;j++)
            {
                for(int k=j+1;k<6;k++)
                {
                    if(2*(a[i]+a[j]+a[k])==sum)
                    {
                        printf("YES
    ");
                        return 0;
                    }
                }
            }
        }
        printf("NO
    ");
    }
    枚举
    #include <bits/stdc++.h>
    
    using namespace std;
    
    int main() {
        int a[6];
        for(int i = 0; i < 6; i++)    cin >> a[i];
        sort(a, a + 6);
        do{
            if((a[0] + a[1] + a[2]) == (a[3] + a[4] + a[5])){
                cout << "YES";
                return 0;
            }
        }while(next_permutation(a, a + 6));
        cout << "NO";
        return 0;
    }
    next_permutation的妙用
  • 相关阅读:
    Android 屏幕适配问题分析
    Android应用程序结构
    国内市场各品牌手机后门介绍
    获取Android设备WIFI的MAC地址 “MAC地址”
    Android 如何判断指定服务是否在运行中 “Service”
    Android强制关闭某个指定应用 “关闭应用”
    如何在Android中的Activity启动第三方应用程序?
    js事件(十二)
    js文本对象模型[DOM]【续】(Node节点类型)
    js文本对象模型【DOM】(十一)
  • 原文地址:https://www.cnblogs.com/Roni-i/p/7831053.html
Copyright © 2011-2022 走看看