Submission #30922848


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
#define STRINGIFY(n) #n
#define TOSTRING(n) STRINGIFY(n)
#define PREFIX "#" TOSTRING(__LINE__) "| "
#define debug(x) \
{ \
  std::cout << PREFIX << #x << " = " << x << std::endl; \
}
std::ostream& output_indent(std::ostream& os, int ind) {
  for(int i = 0; i < ind; i++) os << " ";
  return os;
}
template<class S, class T> std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p);
template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v);
template<class S, class T> std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p) {
  return (os << "(" << p.first << ", " << p.second << ")");
}
template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
  os << "[";
  for(int i = 0;i < v.size();i++) os << v[i] << ", ";
  return (os << "]");
}
template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) { return std::vector<T>(n, std::forward<T>(val)); }
template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) {
  return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}
#include <iostream>
using i64 = long long;
template<i64 M> struct modint { i64 a;
  constexpr modint(const i64 x = 0): a((x%M+M)%M){}
  constexpr i64 value() const { return a; }
  constexpr modint inv() const { return this->pow(M-2); }
  constexpr modint pow(i64 r) const {
    modint ans(1); modint aa = *this;
    while(r) { if(r & 1) ans *= aa; aa *= aa; r >>= 1; }
    return ans;
  }
  constexpr bool operator==(const modint& r) const { return a == r.a; }
  constexpr bool operator!=(const modint& r) const { return a != r.a; }
  constexpr modint& operator=(const i64 r) { a = (r % M + M) % M; return *this; }
  constexpr modint& operator+=(const modint r) { a += r.a; if(a >= M) a -= M; return *this; }
  constexpr modint& operator-=(const modint r) { a -= r.a; if(a < 0) a += M; return *this; }
  constexpr modint& operator*=(const modint r) { a = a * r.a % M; return *this; }
  constexpr modint& operator/=(const modint r) { (*this) *= r.inv(); return *this; }
  constexpr modint operator+(const modint r) const { return modint(*this) += r; }
  constexpr modint operator-(const modint r) const { return modint(*this) -= r; }
  constexpr modint operator-() const { return modint(0) - modint(*this); }
  constexpr modint operator*(const modint r) const { return modint(*this) *= r; }
  constexpr modint operator/(const modint r) const { return modint(*this) /= r; }
  constexpr bool operator!=(const modint r) const { return this->value() != r.value(); }
};

template<const i64 M> std::ostream& operator<<(std::ostream& os, const modint<M>& m) { os << m.value(); return os; }

using fp = modint<(i64)(1e9+7)>;

int main() {
  string S;
  cin >> S;
  reverse(all(S));
  i64 N = S.size();
  vector<fp> dp(13);
  dp[0] = 1;
  i64 ten = 1;
  rep(i,0,N) {
    vector<fp> nxt(13);
    if(S[i] == '?') {
      rep(j,0,13) {
        rep(k,0,10) {
          nxt[(j + k * ten) % 13] += dp[j];
        }
      }
    }
    else {
      i64 k = S[i] - '0';
      rep(j,0,13) {
        nxt[(j + k * ten) % 13] += dp[j];
      }
    }
    ten *= 10;
    ten %= 13;
    swap(nxt, dp);
  }
  cout << dp[5] << endl;
}

Submission Info

Submission Time
Task D - Digits Parade
User niuez
Language C++ (GCC 9.2.1)
Score 400
Code Size 3485 Byte
Status AC
Exec Time 37 ms
Memory 3708 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:4:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
    4 | #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
      |                            ^
./Main.cpp:71:3: note: in expansion of macro ‘rep’
   71 |   rep(i,0,N) {
      |   ^~~
./Main.cpp:4:28: warning: unnecessary parentheses in declaration of ‘j’ [-Wparentheses]
    4 | #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
      |                            ^
./Main.cpp:74:7: note: in expansion of macro ‘rep’
   74 |       rep(j,0,13) {
      |       ^~~
./Main.cpp:4:28: warning: unnecessary parentheses in declaration of ‘k’ [-Wparentheses]
    4 | #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
      |                            ^
./Main.cpp:75:9: note: in expansion of macro ‘rep’
   75 |         rep(k,0,10) {
      |         ^~~
./Main.cpp:4:28: warning: unnecessary parentheses in declaration of ‘j’ [-Wparentheses]
    4 | #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
      |                            ^
./Main.cpp:82:7: note: in expansion of macro ‘rep’
   82 |       rep(j,0,13) {
      |       ^~~

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub1_11.txt, sub1_12.txt, sub1_13.txt, sub1_14.txt, sub1_15.txt, sub1_16.txt, sub1_17.txt, sub1_18.txt, sub1_19.txt, sub1_20.txt, sub1_21.txt, sub1_22.txt, sub1_23.txt, sub1_24.txt, sub1_25.txt, sub1_26.txt
Case Name Status Exec Time Memory
sample_01.txt AC 8 ms 3532 KiB
sample_02.txt AC 2 ms 3516 KiB
sample_03.txt AC 2 ms 3580 KiB
sample_04.txt AC 2 ms 3544 KiB
sub1_01.txt AC 19 ms 3628 KiB
sub1_02.txt AC 18 ms 3576 KiB
sub1_03.txt AC 2 ms 3452 KiB
sub1_04.txt AC 2 ms 3460 KiB
sub1_05.txt AC 16 ms 3632 KiB
sub1_06.txt AC 2 ms 3456 KiB
sub1_07.txt AC 3 ms 3536 KiB
sub1_08.txt AC 13 ms 3676 KiB
sub1_09.txt AC 31 ms 3672 KiB
sub1_10.txt AC 23 ms 3576 KiB
sub1_11.txt AC 3 ms 3488 KiB
sub1_12.txt AC 2 ms 3596 KiB
sub1_13.txt AC 3 ms 3580 KiB
sub1_14.txt AC 2 ms 3540 KiB
sub1_15.txt AC 2 ms 3464 KiB
sub1_16.txt AC 2 ms 3540 KiB
sub1_17.txt AC 37 ms 3708 KiB
sub1_18.txt AC 18 ms 3656 KiB
sub1_19.txt AC 32 ms 3668 KiB
sub1_20.txt AC 25 ms 3672 KiB
sub1_21.txt AC 13 ms 3664 KiB
sub1_22.txt AC 13 ms 3596 KiB
sub1_23.txt AC 12 ms 3592 KiB
sub1_24.txt AC 30 ms 3664 KiB
sub1_25.txt AC 2 ms 3388 KiB
sub1_26.txt AC 3 ms 3544 KiB