Submission #47486840

---

Source Code Expand

/*
Author : Hocky Yudhiono
Sab 11 Nov 2023 07:03:21
*/

#include "bits/stdc++.h"
using namespace std;

typedef long long LL;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<LL, LL> PLL;
typedef pair<LL, LL> pll;
typedef long double ld;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define popf pop_front
#define pf push_front
#define popb pop_back
#define pb push_back
#define fi first
#define se second

const double EPS = 1e-9;
const int INFMEM = 63;

// Do dir^1 to get reverse direction
const int dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const int dy[8] = {1, -1, 0, 0, 1, -1, -1, 1};
const char dch[4] = {'R', 'L', 'D', 'U'};

// Do (dir + 2)%4 to get reverse direction
// const int dx[8] = {-1,0,1,0,-1,1,1,-1};
// const int dy[8] = {0,1,0,-1,1,1,-1,-1};
// const char dch[4] = {'U','R','D','L'};
const double PI = 3.141592653589793;

inline void fasterios() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
}
#define endl '\n'
const int MOD = 1000000007;
// const int MOD = 998244353;

int main() {
  fasterios();
  LL n; cin >> n;
  LL ans = 0;
  for (int i = 1; i <= n; i++) {
    string month = to_string(i);
    sort(all(month));
    month.erase(unique(all(month)), month.end());
    LL maxDay; cin >> maxDay;
    if (sz(month) > 1) continue;
    string tmp = "";
    assert(month[0] != '0');
    while (1) {
      tmp.pb(month[0]);
      LL day = stoll(tmp);
      if(day <= maxDay) {
        ans++;
      } else break;
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result