Submission #1482077

---

Source Code Expand

//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

signed main(void)
{
  int n, k;
  cin >> n >> k;
  int num = 81, ret = 0;
  REP(i, 11) {
    int tmp = num;
    REP(j, 5) {
      if(tmp%11==k) ret++;
      tmp += 9;
    }
    num += 63;
  }

  int ans = (n-3)/11*ret;
  // cout << ans << endl;
  n -= 3;
  if(n < 0) {
    cout << 0 << endl;
    return 0;
  }
  n %= 11;
  // cout << n << endl;
  num = 81;
  REP(i, n+1) {
    int tmp = num;
    REP(j, 5) {
      // cout << tmp << " ";
      if(tmp%11==k) ans++;
      tmp += 9;
    }
    // cout << endl;
    num += 63;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result