ZOJ3959 Problem Preparation

水题 给出n个数 排序后判断它们是否在10~13内 并且最小的数要为1 且至少两个数要为1 还要满足相邻两数之差小于等于2

AC代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

namespace io {
    const int SIZE = 1e7 + 10;
    char inbuff[SIZE];
    char *l, *r;
    inline void init() {
        l = inbuff;
        r = inbuff + fread(inbuff, 1, SIZE, stdin);
    }
    inline char gc() {
        if (l == r) init();
        return (l != r) ? *(l++) : EOF;
    }
    void read(int &x) {
        x = 0; char ch = gc();
        while(!isdigit(ch)) ch = gc();
        while(isdigit(ch)) x = x * 10 + ch - '0', ch = gc();
    }
} using io::read;

int main(){
    int t;
    scanf("%d", &t);
    int n;
    int s[105];
    bool flag;
    while (t--){
        scanf("%d", &n);
        memset(s, 0, sizeof(s));
        flag = true;
        for (int i = 1; i <= n; i++) scanf("%d", &s[i]);
        sort(s + 1, s + n + 1);
        if (n < 10 || n > 13) flag = false;
        if (s[1] != 1 || s[2] != 1) flag = false;
        for (int i = 3; i < n; i++){
            if (s[i] - s[i - 1] > 2){
                flag = false;
                break;
            }
        }
        if (flag) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}