Submission #10241207

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, k; cin >> n >> k;
  n -= 2;
  if (n <= 0) {
    cout << "0\n";
    return 0;
  }
  vector<vector<int> > cal(13, vector<int>(7));
  REP(i, 13) REP(j, 7) cal[i][j] = 7 * i + j + 1;
  vector<vector<int> > sum(11, vector<int>(5, 0));
  REP(i, 11) REP(j, 5) {
    REP(y, 3) REP(x, 3) sum[i][j] += cal[i + y][j + x];
  }
  ll ans = 0;
  int t = 0;
  REP(i, 11) REP(j, 5) t += sum[i][j] % 11 == k;
  ans += 1LL * t * (n / 11);
  n %= 11;
  REP(i, n) REP(j, 5) ans += sum[i][j] % 11 == k;
  cout << ans << '\n';
  return 0;
}

Submission Info

Judge Result