Codeforces Round #452 (Div. 2) B

直接暴力

#include<iostream>#include<algorithm>#include<iomanip>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<cmath>#include<set>#include<queue>#include<stack>#include<map>#define PI acos(-1.0)#define in freopen("in.txt", "r", stdin)#define out freopen("out.txt", "w", stdout)#define kuaidian ios::sync_with_stdio(0);using namespace std;typedef long long ll;typedef unsigned long long ull;const int maxn = 2e5 + 7, maxd = 1e8;const ll mod = 1e9 + 7;const int INF = 0x7f7f7f7f;int a[99] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};int b[33];int n;int main() {    scanf("%d", &n);    for(int i = 0; i < n; ++i) scanf("%d", &b[i]);    for(int i = 0; i+n-1 < 60; ++i) {        int f = 0;        for(int j = 0; j < n; ++j) {            if(a[i+j] != b[j]) { f = 1; break; }        }        if(!f) return puts("YES")*0;    }    return puts("NO") * 0;    return 0;}