2023年第14届蓝桥杯大赛软件赛省赛 C/C++ 大学 B 组

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e6 + 10, INF = 0x3f3f3f3f;

int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n = 100, a[110], st[13][33];

int main() {
  freopen("in.txt", "r", stdin);
  freopen("out2.txt", "w", stdout);
  for (int i = 1; i <= n; i++) cin >> a[i];

  for (int y1 = 1; y1 <= n-7; y1++) {
    if (a[y1] != 2) continue;
    for (int y2 = 2; y2 <= n-6; y2++) {
      if (a[y2] != 0) continue;
      for (int y3 = 3; y3 <= n-5; y3++) {
        if (a[y3] != 2) continue;
        for (int y4 = 4; y4 <= n-4; y4++) {
          if (a[y4] != 3) continue;

          for (int m1 = 5; m1 <= n-3; m1++) {
            for (int m2 = 6; m2 <= n-2; m2++) {
              int mm = a[m1] * 10 + a[m2];
              if (mm < 1 || mm > 12) continue;

              for (int d1 = 7; d1 <= n-1; d1++) {
                for (int d2 = 8; d2 <= n; d2++) {
                  int dd = a[d1] * 10 + a[d2];
                  if (dd >= 1 && dd <= mon[mm]) {
                    st[mm][dd] = 1;
                  }
                }
              }
            }
          }
        }
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= 12; i++)
    for (int j = 1; j <= mon[i]; j++) ans += st[i][j];
  cout << ans << endl;

  clock_t time = clock();
  cout << time / CLOCKS_PER_SEC / 60<< endl;
  return 0;
}