CF488 B.Candy Boxes

数学+暴力

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#include<string.h>
#include<numeric>
#include<cmath>
#include<stdlib.h>
#include<vector>
#include<stack>
#include<set>
#define FOR(x, b, e)  for(int x=b;x<=(e);x++)
#define REP(x, n)     for(int x=0;x<(n);x++)
#define INF 1e7
#define MAXN 100010
#define maxn 1000010
#define Mod 1000007
#define N 1010
using namespace std;
typedef long long LL;

int x[5];
int n;
bool gao(int *y)
{
    int cnt = 0;
    bool vis[4] = {0};
    for (int i = 0;i < n;++ i) {
        for (int j = 0;j < 4;++ j) {
            if (!vis[j] && y[j] == x[i]) {        
                vis[j] = 1;
                cnt++;
                break;
            }
        }
    }
    if (cnt == n) {
        puts("YES");
        for (int i = 0;i < 4;++ i)
            if (!vis[i]) cout << y[i] << endl;
        exit(0);
    }
    return false;
}

int main()
{
    cin >> n;
    for(int i = 0;i < n;++ i)
        cin >> x[i];
    for (int i = 1;i <= 500;++ i)
        for (int j = i;j <= 2*i ;++ j) {
            int y[] = {i, j,4*i - j,3*i};
            gao(y);
        }
    puts("NO");
    return 0;
}