problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03178 | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) ... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) ... | [
"expression.operation.binary.add"
] | 984,876 | 984,875 | u784072785 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
string s;
ll n, d;
ll dp[10010][110][2];
ll add(ll a, ll b) { return (a + b) % MOD; }
int main() {
cin >> s >> d;
n = s.size();
dp[0][0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < d; j++) {
fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
string s;
ll n, d;
ll dp[10010][110][2];
ll add(ll a, ll b) { return (a + b) % MOD; }
int main() {
cin >> s >> d;
n = s.size();
dp[0][0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < d; j++) {
fo... | [
"io.output.change"
] | 984,881 | 984,882 | u026200720 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
#define sz(x) ((int)x.size())
int d;
vector<vector<int>> dp(100005, vector<int>(101, -1));
const int mod = 1000 * 1000 * 1000 + 7;
int digitDP(int index, int rem, int fit, string &number) {
if (index == -1)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
#define sz(x) ((int)x.size())
int d;
vector<vector<int>> dp(100005, vector<int>(101, -1));
const int mod = 1000 * 1000 * 1000 + 7;
int digitDP(int index, int rem, int fit, string &number) {
if (index == -1)
... | [
"assignment.change"
] | 984,883 | 984,884 | u146623199 | cpp |
p03178 | #include <bits/stdc++.h>
#define N 2000009
#define ll long long
#define ld long double
#define ff first
#define ss second
#define inf 1000000005
#define mod 1000000007
using namespace std;
string s;
ll d, dp[10001][2][100];
int main() {
cin >> s >> d;
int n = s.size();
dp[n][0][0] = 1;
dp[n][1][0] = 1;
for (i... | #include <bits/stdc++.h>
#define N 2000009
#define ll long long
#define ld long double
#define ff first
#define ss second
#define inf 1000000005
#define mod 1000000007
using namespace std;
string s;
ll d, dp[10001][2][100];
int main() {
cin >> s >> d;
int n = s.size();
dp[n][0][0] = 1;
dp[n][1][0] = 1;
for (i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 984,895 | 984,896 | u969825174 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
void debug() { cout << endl; }
template <typename T, typename... Args> void debug(T x, Args... args) {
cout << x << " ";
debug(args...);
}
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef l... | #include <bits/stdc++.h>
using namespace std;
void debug() { cout << endl; }
template <typename T, typename... Args> void debug(T x, Args... args) {
cout << x << " ";
debug(args...);
}
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef l... | [
"literal.number.change",
"expression.operation.binary.change"
] | 984,899 | 984,900 | u921552251 | cpp |
p03178 | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
string s;
int d, n, z;
ll dp[10001][101][2];
ll sol;
int main() {
cin >> s >> d;
n = s.size();
dp[0][0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < d; j++) {
for (int k = 0; k < 10; k++) {
... | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
string s;
int d, n, z;
ll dp[10001][101][2];
ll sol;
int main() {
cin >> s >> d;
n = s.size();
dp[0][0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < d; j++) {
for (int k = 0; k < 10; k++) {
... | [
"expression.operation.binary.remove"
] | 984,903 | 984,904 | u787597250 | cpp |
p03178 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1001001001;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : divisio... |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1001001001;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : divisio... | [] | 984,921 | 984,922 | u289381123 | cpp |
p03178 | // thuanqvbn03
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100005;
const int Mod = 1000000007;
int n, D;
string s;
long long dp[MaxN], tmp[MaxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
cin >> D;
n = s.size();
for (int i = s[0] - '0' - 1; i ... | // thuanqvbn03
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100005;
const int Mod = 1000000007;
int n, D;
string s;
long long dp[MaxN], tmp[MaxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
cin >> D;
n = s.size();
for (int i = s[0] - '0' - 1; i ... | [
"assignment.change"
] | 984,931 | 984,932 | u124636763 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
// clang-format off
#define forn(i, x, y) for(int i = x; i < y; i++)
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(NULL)
// clang-format on
const long long MOD = 1000000007;
using LL = long long;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
usin... | #include <bits/stdc++.h>
using namespace std;
// clang-format off
#define forn(i, x, y) for(int i = x; i < y; i++)
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(NULL)
// clang-format on
const long long MOD = 1000000007;
using LL = long long;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
usin... | [
"assignment.change"
] | 984,941 | 984,942 | u315212004 | cpp |
p03178 | #include <algorithm>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
#define ll long long
using namespace std;
ll mod =... | #include <algorithm>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
#define ll long long
using namespace std;
ll mod =... | [
"call.arguments.add"
] | 984,950 | 984,951 | u819168380 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int dp[10001][10][2];
int solve(string &K, int &D, int pos, int d, bool tight) {
if (dp[pos][d][tight] != -1)
return dp[pos][d][tight];
int ub = (tight) ? (K[pos] - '0') : 9;
int len = K.length() - 1;
if (pos == l... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int dp[10001][101][2];
int solve(string &K, int &D, int pos, int d, bool tight) {
if (dp[pos][d][tight] != -1)
return dp[pos][d][tight];
int ub = (tight) ? (K[pos] - '0') : 9;
int len = K.length() - 1;
if (pos == ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 984,952 | 984,953 | u934503037 | cpp |
p03178 | #include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define ff first
#define ss second
#define N 100001
template <typename T, typename G>
ostream &operator<<(ostream &out, const pair<T, G> &a) {
return out << "( " << a.ff << ", " << a.ss << ")";
}
temp... | #include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define ff first
#define ss second
#define N 100001
template <typename T, typename G>
ostream &operator<<(ostream &out, const pair<T, G> &a) {
return out << "( " << a.ff << ", " << a.ss << ")";
}
temp... | [
"expression.unary.arithmetic.add"
] | 984,992 | 984,993 | u080922289 | cpp |
p03178 | #include <bits/stdc++.h>
#define oo 1000000007
using namespace std;
long long k;
long long dp[10005][105][2];
string s;
vector<long long> num;
long long solve(long long idx, long long sum, long long tight) {
if (idx == num.size())
return (sum % k == 0);
if (dp[idx][sum][tight] != -1)
return dp[idx][sum][tig... | #include <bits/stdc++.h>
#define oo 1000000007
using namespace std;
long long k;
long long dp[10005][105][2];
string s;
vector<long long> num;
long long solve(long long idx, long long sum, long long tight) {
if (idx == num.size())
return (sum % k == 0);
if (dp[idx][sum][tight] != -1)
return dp[idx][sum][tig... | [
"call.arguments.change",
"assignment.change"
] | 984,994 | 984,995 | u057283103 | cpp |
p03178 | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
#define rep(a, n) for (ll a = 0; a < n; a++)
#define repi(a, b, ... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
#define rep(a, n) for (ll a = 0; a < n; a++)
#define repi(a, b, ... | [] | 985,017 | 985,018 | u834771741 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
long long MOD = (long long)(1e9 + 7);
int main() {
string s;
long long k;
cin >> s;
cin >> k;
long long dp[s.length() + 1][2][k];
memset(dp, 0, 2 * sizeof(long long) * (s.length() + 1) * k);
dp[s.length()][0][0] = 1;
dp[s.length()][1][0] = 1;
for (long lon... | #include <bits/stdc++.h>
using namespace std;
long long MOD = (long long)(1e9 + 7);
int main() {
string s;
long long k;
cin >> s;
cin >> k;
long long dp[s.length() + 1][2][k];
memset(dp, 0, 2 * sizeof(long long) * (s.length() + 1) * k);
dp[s.length()][0][0] = 1;
dp[s.length()][1][0] = 1;
for (long lon... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 985,021 | 985,022 | u552024502 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
long long MOD = (long long)(1e9 + 7);
int main() {
string s;
long long k;
cin >> s;
cin >> k;
long long dp[s.length() + 1][2][k];
memset(dp, 0, 2 * sizeof(long long) * (s.length() + 1) * k);
dp[s.length()][0][0] = 1;
dp[s.length()][1][0] = 1;
for (long lon... | #include <bits/stdc++.h>
using namespace std;
long long MOD = (long long)(1e9 + 7);
int main() {
string s;
long long k;
cin >> s;
cin >> k;
long long dp[s.length() + 1][2][k];
memset(dp, 0, 2 * sizeof(long long) * (s.length() + 1) * k);
dp[s.length()][0][0] = 1;
dp[s.length()][1][0] = 1;
for (long lon... | [
"assignment.change"
] | 985,023 | 985,022 | u552024502 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n, k) ((((n) % (k)) + (k)) % (k))
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef l... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n, k) ((((n) % (k)) + (k)) % (k))
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef l... | [
"literal.number.change",
"call.arguments.change"
] | 985,024 | 985,025 | u803272803 | cpp |
p03178 | //#pragma GCC optimize("Ofast")
//#ifdef DEBUG
//#define _GLIBCXX_DEBUG
//#endif
// -Ofast
// -O3
// -O2
// -fsanitize=address
// -fsanitize=undefined
// add_compile_options()
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vecto... | //#pragma GCC optimize("Ofast")
//#ifdef DEBUG
//#define _GLIBCXX_DEBUG
//#endif
// -Ofast
// -O3
// -O2
// -fsanitize=address
// -fsanitize=undefined
// add_compile_options()
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vecto... | [
"assignment.change",
"assignment.value.change"
] | 985,026 | 985,027 | u326470310 | cpp |
p03178 | //#pragma GCC optimize("Ofast")
//#ifdef DEBUG
//#define _GLIBCXX_DEBUG
//#endif
// -Ofast
// -O3
// -O2
// -fsanitize=address
// -fsanitize=undefined
// add_compile_options()
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vecto... | //#pragma GCC optimize("Ofast")
//#ifdef DEBUG
//#define _GLIBCXX_DEBUG
//#endif
// -Ofast
// -O3
// -O2
// -fsanitize=address
// -fsanitize=undefined
// add_compile_options()
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vecto... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.change",
"assignment.value.change"
] | 985,028 | 985,027 | u326470310 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
vector<vector<ll>> dp0, dp1;
int main() {
string K;
int D;
cin >> K >> D;
int le... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
vector<vector<ll>> dp0, dp1;
int main() {
string K;
int D;
cin >> K >> D;
int le... | [
"assignment.value.change"
] | 985,029 | 985,030 | u808943968 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
vector<vector<ll>> dp0, dp1;
int main() {
string K;
int D;
cin >> K >> D;
int le... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
vector<vector<ll>> dp0, dp1;
int main() {
string K;
int D;
cin >> K >> D;
int le... | [
"assignment.value.change"
] | 985,031 | 985,032 | u462437857 | cpp |
p03178 | /* Press F to pay respects */
#define _CRT_SECURE_NO_DEPRECATE
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define SYNC ... | /* Press F to pay respects */
#define _CRT_SECURE_NO_DEPRECATE
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define SYNC ... | [
"assignment.value.change"
] | 985,039 | 985,040 | u606068762 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
long long x, p[19][169][2];
vector<long long> d;
string a;
long long cal(long long i, long long s, bool t) {
if (i == d.size())
return !s;
if (p[i][s][t] > -1)
return p[i][s][t];
long long tp = 0, lim = (t) ? d[i] : 9;
for (long long dg = 0; dg <= lim; dg++... | #include <bits/stdc++.h>
using namespace std;
long long x, p[10001][100][2];
vector<long long> d;
string a;
long long cal(long long i, long long s, bool t) {
if (i == d.size())
return !s;
if (p[i][s][t] > -1)
return p[i][s][t];
long long tp = 0, lim = (t) ? d[i] : 9;
for (long long dg = 0; dg <= lim; d... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 985,045 | 985,046 | u272327542 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int k, n, num[10000009];
long long b, dp[20][100009][2];
string s;
int get_digit() {
fill(num, num + 1000009, -1);
int n = s.size();
s = " " + s;
for (int i = 1; i <= n; i++)
num[i] = (int)(s[i] - 48);
return n;
}
long long digit_d... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int k, n, num[10000009];
long long b, dp[200000][109][2];
string s;
int get_digit() {
fill(num, num + 1000009, -1);
int n = s.size();
s = " " + s;
for (int i = 1; i <= n; i++)
num[i] = (int)(s[i] - 48);
return n;
}
long long digit_... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 985,047 | 985,048 | u686210458 | cpp |
p03178 | #include <iostream>
using namespace std;
using ll = long long;
constexpr int MOD = 1e9 + 7;
int N;
int a[100010];
ll dp[10010][2][110];
int main() {
string K;
int D;
cin >> K >> D;
int N = K.size();
dp[0][1][0] = 1;
for (int i = 0; i < N; ++i) {
for (int tight = 0; tight < 2; ++tight) {
int x = ... | #include <iostream>
using namespace std;
using ll = long long;
constexpr int MOD = 1e9 + 7;
int N;
int a[100010];
ll dp[10010][2][110];
int main() {
string K;
int D;
cin >> K >> D;
int N = K.size();
dp[0][1][0] = 1;
for (int i = 0; i < N; ++i) {
for (int tight = 0; tight < 2; ++tight) {
int x = ... | [
"assignment.value.change",
"assignment.compound.arithmetic.replace.remove",
"expression.operator.arithmetic.replace.add"
] | 985,053 | 985,054 | u843175622 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define dd double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vll vector<long long>
#define vdd vector<double>
#define vpii vector<pair<int, int>>
#define vpll v... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define dd double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vll vector<long long>
#define vdd vector<double>
#define vpii vector<pair<int, int>>
#define vpll v... | [
"variable_declaration.remove"
] | 985,096 | 985,097 | u609653115 | cpp |
p03178 | #include <bits/stdc++.h>
#define int long long int // comment for large arrays
#define pll pair<int, int>
#define dbl long double
#define ff first
#define ss second
#define endl "\n"
#define mod 1000000007
#define eps 0.00000001
#define INF 10000000000000001
#define all(x) (x).begin(), (x).end()
#define LB(v, x) (lower... | #include <bits/stdc++.h>
#define int long long int // comment for large arrays
#define pll pair<int, int>
#define dbl long double
#define ff first
#define ss second
#define endl "\n"
#define mod 1000000007
#define eps 0.00000001
#define INF 10000000000000001
#define all(x) (x).begin(), (x).end()
#define LB(v, x) (lower... | [
"assignment.change"
] | 985,101 | 985,100 | u889896098 | cpp |
p03178 | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define pb push_back
#... | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define pb push_back
#... | [
"assignment.value.change"
] | 985,116 | 985,117 | u896034488 | cpp |
p03178 | #define NDEBUG
NDEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#incl... | #define NDEBUG
NDEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#incl... | [
"assignment.value.change"
] | 985,118 | 985,119 | u060679524 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
int main() {
string K;
int D;
cin >> K >> D;
static long long dp[10001][2][100] = {};
dp[0][0][0] = 1;
for (size_t i = 0; i < K.size(); ++i) {
for (int j = 0; j < 2; ++j) {
for (int k = 0; k < D; ++k) {
for (int d = 0; d <= (j ? 9 : K[i] - '0... | #include <bits/stdc++.h>
using namespace std;
int main() {
string K;
int D;
cin >> K >> D;
static long long dp[10001][2][100] = {};
dp[0][0][0] = 1;
for (size_t i = 0; i < K.size(); ++i) {
for (int j = 0; j < 2; ++j) {
for (int k = 0; k < D; ++k) {
for (int d = 0; d <= (j ? 9 : K[i] - '0... | [
"expression.operation.binary.remove"
] | 985,122 | 985,123 | u879581330 | cpp |
p03178 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define putchar(x) cout << (x)
#define repeat(x) \
int _ = 0; \
_ < (x); ... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define putchar(x) cout << (x)
#define repeat(x) \
int _ = 0; \
_ < (x); ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 985,124 | 985,125 | u097873932 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (int i = l; i <= r; i++)
#define vi vector<int>
#define vvi vector<vi>
#define st string
int mod = 1e9 + 7;
void addMod(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
int main() {
st k;
cin >> k;
int d;
cin >> d;
vvi dp(d,... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (int i = l; i <= r; i++)
#define vi vector<int>
#define vvi vector<vi>
#define st string
int mod = 1e9 + 7;
void addMod(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
int main() {
st k;
cin >> k;
int d;
cin >> d;
vvi dp(d,... | [
"assignment.value.change"
] | 985,132 | 985,133 | u027266662 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
int main() {
// S: just seems like a standard DP where you keep track of the
// residues
// |K|D states, 10 transitions?
// 10^7 should totally be fine
// oh wait, the fact that it has to be less than K (which isn't
// just 10^x)
// ... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
int main() {
// S: just seems like a standard DP where you keep track of the
// residues
// |K|D states, 10 transitions?
// 10^7 should totally be fine
// oh wait, the fact that it has to be less than K (which isn't
// just 10^x)
// ... | [
"expression.operation.binary.add"
] | 985,136 | 985,137 | u716813192 | cpp |
p03178 | /*
, -- 、
/;;;;;;',
i二二二i
, ' ヽ ???
i ﾉﾉﾉﾉﾉﾍ .',
〉ﾘi' ﾟ ヮﾟﾉﾚく WAyon..........
○⊂}〈lﾄ--ｲl〉{つ●
,ｒ/ー i-ヽヽ
｀｀i_ﾗi_ﾗ
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
const int INF =... | /*
, -- 、
/;;;;;;',
i二二二i
, ' ヽ ???
i ﾉﾉﾉﾉﾉﾍ .',
〉ﾘi' ﾟ ヮﾟﾉﾚく WAyon..........
○⊂}〈lﾄ--ｲl〉{つ●
,ｒ/ー i-ヽヽ
｀｀i_ﾗi_ﾗ
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
const int INF =... | [
"assignment.value.change"
] | 985,138 | 985,139 | u923474266 | cpp |
p03178 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [] | 985,146 | 985,147 | u614128939 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"expression.operation.binary.remove"
] | 985,170 | 985,171 | u987913144 | cpp |
p03178 |
// Problem : S - Digit Sum
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_s
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/p... |
// Problem : S - Digit Sum
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_s
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/p... | [
"expression.operation.binary.add"
] | 985,180 | 985,181 | u524492594 | cpp |
p03178 | #include <iostream>
#include <string>
using namespace std;
const int M = 1e9 + 7;
string k;
int d;
long long dp[10005][100][2];
int main() {
cin >> k >> d;
dp[0][0][0] = 1;
for (int i = 0; i < k.length(); i++) {
for (int j = 0; j < d; j++) {
dp[i + 1][(j + (k[i] - '0')) % d][0] += dp[i][j][0];
... | #include <iostream>
#include <string>
using namespace std;
const int M = 1e9 + 7;
string k;
int d;
long long dp[10005][100][2];
int main() {
cin >> k >> d;
dp[0][0][0] = 1;
for (int i = 0; i < k.length(); i++) {
for (int j = 0; j < d; j++) {
dp[i + 1][(j + (k[i] - '0')) % d][0] += dp[i][j][0];
... | [
"assignment.change"
] | 985,196 | 985,197 | u896847891 | cpp |
p03178 | #include <bits/stdc++.h>
#define x first
#define y second
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define xmod (ll)(1e9 + 7)
using namespace std;
ll len, dp_l[10005][105], d, dp_s[10005][105], sum, num;
string s;
int main() {
ios::sync_with_s... | #include <bits/stdc++.h>
#define x first
#define y second
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define xmod (ll)(1e9 + 7)
using namespace std;
ll len, dp_l[10005][105], d, dp_s[10005][105], sum, num;
string s;
int main() {
ios::sync_with_s... | [] | 985,200 | 985,201 | u600091451 | cpp |
p03178 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
#define chmax(x, v) \
do { \
x = max(x, v); ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
#define chmax(x, v) \
do { \
x = max(x, v); ... | [
"assignment.value.change"
] | 985,204 | 985,205 | u702996070 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | [] | 985,208 | 985,209 | u422633119 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 985,210 | 985,209 | u422633119 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
int32_t main() {
// digit DP
// f(index,sum,same)
string k;
cin >> k;
int d;
cin >> d;
int f[k.length() + 5][d + 5][2];
memset(f, 0, sizeof(f));
for (int j = 0; j <= k[0] - '0'; j++) {
int v = j % d;
if ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
int32_t main() {
// digit DP
// f(index,sum,same)
string k;
cin >> k;
int d;
cin >> d;
int f[k.length() + 5][d + 5][2];
memset(f, 0, sizeof(f));
for (int j = 0; j <= k[0] - '0'; j++) {
int v = j % d;
if ... | [] | 985,213 | 985,214 | u444829472 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
int32_t main() {
// digit DP
// f(index,sum,same)
string k;
cin >> k;
int d;
cin >> d;
int f[k.length() + 5][d + 5][2];
memset(f, 0, sizeof(f));
for (int j = 0; j <= k[0]; j++) {
int v = j % d;
if (j < k... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
int32_t main() {
// digit DP
// f(index,sum,same)
string k;
cin >> k;
int d;
cin >> d;
int f[k.length() + 5][d + 5][2];
memset(f, 0, sizeof(f));
for (int j = 0; j <= k[0] - '0'; j++) {
int v = j % d;
if ... | [
"control_flow.loop.for.condition.change"
] | 985,215 | 985,214 | u444829472 | cpp |
p03178 | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
#define MOD 1000000007
int main() {
std::string a;
std::cin >> a;
for (auto &c : a)
c -= '0';
int n = a.size();
int d = ri();
int dp[n][d][2]; // 1 : strict
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= a[0]; i++)
d... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
#define MOD 1000000007
int main() {
std::string a;
std::cin >> a;
for (auto &c : a)
c -= '0';
int n = a.size();
int d = ri();
int dp[n][d][2]; // 1 : strict
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= a[0]; i++)
d... | [] | 985,232 | 985,233 | u040490988 | cpp |
p03178 | #include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define endl "\n"
#endif
using namespace std;
typedef unsigned long long int lu;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> v;
typedef vector<lu> vu;
typedef vector<v> vv;
typedef vector<vu> vvu;
typedef vector<ld> vld;
typedef vector<bool> vb;
type... | #include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define endl "\n"
#endif
using namespace std;
typedef unsigned long long int lu;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> v;
typedef vector<lu> vu;
typedef vector<v> vv;
typedef vector<vu> vvu;
typedef vector<ld> vld;
typedef vector<bool> vb;
type... | [
"assignment.value.change"
] | 985,252 | 985,253 | u513227008 | cpp |
p03178 | #include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define endl "\n"
#endif
using namespace std;
typedef unsigned long long int lu;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> v;
typedef vector<lu> vu;
typedef vector<v> vv;
typedef vector<vu> vvu;
typedef vector<ld> vld;
typedef vector<bool> vb;
type... | #include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define endl "\n"
#endif
using namespace std;
typedef unsigned long long int lu;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> v;
typedef vector<lu> vu;
typedef vector<v> vv;
typedef vector<vu> vvu;
typedef vector<ld> vld;
typedef vector<bool> vb;
type... | [
"assignment.change",
"assignment.value.change"
] | 985,254 | 985,253 | u513227008 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define sp << " " <<
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define int long long
#define double long double
#define INF 1e18
#define PI 3.14159265359
int power(int p, int y) {
int res = 1;
p = p % mod;
while (y > 0) {
if (y & 1)
... | #include <bits/stdc++.h>
using namespace std;
#define sp << " " <<
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define int long long
#define double long double
#define INF 1e18
#define PI 3.14159265359
int power(int p, int y) {
int res = 1;
p = p % mod;
while (y > 0) {
if (y & 1)
... | [] | 985,260 | 985,261 | u456418106 | cpp |
p03178 | #define DEBUG 1
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = l... | #define DEBUG 1
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = l... | [
"assignment.value.change"
] | 985,267 | 985,268 | u426683236 | cpp |
p03178 | #include <bits/stdc++.h>
#define ll long long int
#define M 1000000007
#define mod 998244353
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pi pair<ll, ll>
using namespace std;
const ll N = 200010;
vector<ll> ar;
ll k;
ll dp[10001][2][101];
ll func(ll idx, ll t, ll m) {
if (idx < 0) {
if (m ... | #include <bits/stdc++.h>
#define ll long long int
#define M 1000000007
#define mod 998244353
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pi pair<ll, ll>
using namespace std;
const ll N = 200010;
vector<ll> ar;
ll k;
ll dp[10001][2][101];
ll func(ll idx, ll t, ll m) {
if (idx < 0) {
if (m ... | [
"assignment.change"
] | 985,278 | 985,279 | u813854705 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
const int module = 1e9 + 7;
void doc() {
freopen("OB.inp", "r", stdin);
freopen("OB.out", "w", stdout);
}
void solve() {
string K;
int D;
cin >> K >> D;
int n = (int)K.size();
int F[n + 1][D][2];
for (int i = 0; i <= n; i++) {
for (int j = 0; j < D; j... | #include <bits/stdc++.h>
using namespace std;
const int module = 1e9 + 7;
void doc() {
freopen("OB.inp", "r", stdin);
freopen("OB.out", "w", stdout);
}
void solve() {
string K;
int D;
cin >> K >> D;
int n = (int)K.size();
int F[n + 1][D][2];
for (int i = 0; i <= n; i++) {
for (int j = 0; j < D; j... | [
"assignment.value.change"
] | 985,280 | 985,282 | u521455622 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | [
"assignment.change"
] | 985,286 | 985,289 | u612858131 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
ll dp[10005][105][2];
int n;
string str;
int k;
vector<int> v;
ll get(int pos, ll sum, bool f) {
ll &ans = dp[pos][sum][f];
if (pos == n) {
if (sum % k == 0)
return (ans = 1);
else
return (ans = 0);
}
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
ll dp[10005][105][2];
int n;
string str;
int k;
vector<int> v;
ll get(int pos, ll sum, bool f) {
ll &ans = dp[pos][sum][f];
if (pos == n) {
if (sum % k == 0)
return (ans = 1);
else
return (ans = 0);
}
... | [
"call.remove"
] | 985,290 | 985,291 | u200439351 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
ll dp[10005][105][2];
int n;
string str;
int k;
vector<int> v;
ll get(int pos, ll sum, bool f) {
ll &ans = dp[pos][sum][f];
if (pos == n) {
if (sum % k == 0)
return (ans = 1);
else
return (ans = 0);
}
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
ll dp[10005][105][2];
int n;
string str;
int k;
vector<int> v;
ll get(int pos, ll sum, bool f) {
ll &ans = dp[pos][sum][f];
if (pos == n) {
if (sum % k == 0)
return (ans = 1);
else
return (ans = 0);
}
... | [
"assignment.add"
] | 985,292 | 985,294 | u200439351 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ull unsigned long long
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
ll dp[10005][105][2];
int main() {
string s;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ull unsigned long long
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
ll dp[10005][105][2];
int main() {
string s;
cin >> ... | [
"expression.operation.binary.remove"
] | 985,300 | 985,301 | u923368296 | cpp |
p03178 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | [
"assignment.value.change"
] | 985,319 | 985,322 | u941028483 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
ll mod = 1000000007;
string k;
ll d;
ll dp[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
ll mod = 1000000007;
string k;
ll d;
ll dp[... | [
"call.remove"
] | 985,351 | 985,352 | u139573956 | cpp |
p03178 | /*------U Have To DO It------*/
/* BY-> RicoProg */
/* ___
__|__|
| |___ */
#include <bits/stdc++.h>
using namespace std;
//---------------------------------------------------MACROS----------------------------------------------------------
#define ll long long
#define ld long double
... | /*------U Have To DO It------*/
/* BY-> RicoProg */
/* ___
__|__|
| |___ */
#include <bits/stdc++.h>
using namespace std;
//---------------------------------------------------MACROS----------------------------------------------------------
#define ll long long
#define ld long double
... | [
"assignment.value.change"
] | 985,371 | 985,374 | u822265595 | cpp |
p03178 | #include "bits/stdc++.h"
using namespace std;
#define REP(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define rep(i, n) REP((i), 0, (n))
using ll = long long;
constexpr ll MOD = 1e9 + 7;
vector<vector<vector<ll>>> way(ll D) {
// 桁数 -> 末尾数字 -> D除算の余り -> 場合の数
vector<vector<vector<ll>>> dp(1e4 + 3,
... | #include "bits/stdc++.h"
using namespace std;
#define REP(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define rep(i, n) REP((i), 0, (n))
using ll = long long;
constexpr ll MOD = 1e9 + 7;
vector<vector<vector<ll>>> way(ll D) {
// 桁数 -> 末尾数字 -> D除算の余り -> 場合の数
vector<vector<vector<ll>>> dp(1e4 + 3,
... | [
"expression.operation.binary.remove"
] | 985,395 | 985,397 | u692632484 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// DON'T USE THES... | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// DON'T USE THES... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 985,451 | 985,452 | u645327277 | cpp |
p03178 | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 985,487 | 985,489 | u925782032 | cpp |
p03178 | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"control_flow.return.remove",
"assignment.change",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 985,487 | 985,492 | u925782032 | cpp |
p03178 | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
#define int ll
// 0 -> a-1
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
// a -> b-1
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
// a-1 -> 0
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
// a-1 -> b
... | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
#define int ll
// 0 -> a-1
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
// a -> b-1
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
// a-1 -> 0
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
// a-1 -> b
... | [
"call.arguments.change",
"assignment.change"
] | 985,591 | 985,598 | u946322619 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
string s;
ll d, dp[100001][101][3];
ll cal(string s) {
int len = s.size();
for (int x = 1; x <= 9; x++) {
if (x < s[0] - '0')
dp[1][x % d][0]++;
else if (x > s[0] - '0')
dp[1][x % d][2]++;
else
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
string s;
ll d, dp[100001][101][3];
ll cal(string s) {
int len = s.size();
for (int x = 1; x <= 9; x++) {
if (x < s[0] - '0')
dp[1][x % d][0]++;
else if (x > s[0] - '0')
dp[1][x % d][2]++;
else
... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"assignment.change"
] | 985,626 | 985,627 | u004109131 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
string s;
int d;
void add(int &x, int v) { x = (x + v) % MOD; }
void solve() {
// dp[i][j][k]: 到第i位为止，和为k mod
// d的数有几个。j代表是否前面都和s中第i位相同
vector<vector<vector<int>>> dp(s.size() + 1,
vector<vector<int>>(2, ve... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
string s;
int d;
void add(int &x, int v) { x = (x + v) % MOD; }
void solve() {
// dp[i][j][k]: 到第i位为止，和为k mod
// d的数有几个。j代表是否前面都和s中第i位相同
vector<vector<vector<int>>> dp(s.size() + 1,
vector<vector<int>>(2, ve... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 985,277 | 985,281 | u656351541 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"assignment.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 985,353 | 985,350 | u347057617 | cpp |
p03178 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 10010;
const int M = 110;
const int mod = 1e9 + 7;
ll f[M][N]; // f[i][j] i-bit的数数位之和%d等于j的个数
string num;
int d;
void init() {
f[0][0] = 1;
for (int i = 1; i <= num.size(); i++) {
for (int j = 0; j ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 100010;
const int M = 110;
const int mod = 1e9 + 7;
ll f[N][M]; // f[i][j] i-bit的数数位之和%d等于j的个数
string num;
int d;
void init() {
f[0][0] = 1;
for (int i = 1; i <= num.size(); i++) {
for (int j = 0; j... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 985,385 | 985,387 | u473530997 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main() {
string K;
cin >> K;
int D;
cin >> D;
int L = K.size();
vector<int> N(L);
for (int i = 0; i < L; i++) {
N[i] = K[i] - '0';
}
vector<vector<vector<long long>>> dp(
L + 1, vector<vector<long long>>(2, vector<... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main() {
string K;
cin >> K;
int D;
cin >> D;
int L = K.size();
vector<int> N(L);
for (int i = 0; i < L; i++) {
N[i] = K[i] - '0';
}
vector<vector<vector<long long>>> dp(
L + 1, vector<vector<long long>>(2, vector<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 985,407 | 985,405 | u424374375 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main() {
string K;
cin >> K;
int D;
cin >> D;
int L = K.size();
vector<int> N(L);
for (int i = 0; i < L; i++) {
N[i] = K[i] - '0';
}
vector<vector<vector<long long>>> dp(
L + 1, vector<vector<long long>>(2, vector<... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main() {
string K;
cin >> K;
int D;
cin >> D;
int L = K.size();
vector<int> N(L);
for (int i = 0; i < L; i++) {
N[i] = K[i] - '0';
}
vector<vector<vector<long long>>> dp(
L + 1, vector<vector<long long>>(2, vector<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 985,409 | 985,405 | u424374375 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
int MOD = 1000000007;
int main() {
string K;
cin >> K;
int D;
cin >> D;
int L = K.size();
vector<int> N(L);
for (int i = 0; i < L; i++) {
N[i] = K[i] - '0';
}
vector<vector<vector<long long>>> dp(
L + 1, vector<vector<long long>>(2, vector<long l... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main() {
string K;
cin >> K;
int D;
cin >> D;
int L = K.size();
vector<int> N(L);
for (int i = 0; i < L; i++) {
N[i] = K[i] - '0';
}
vector<vector<vector<long long>>> dp(
L + 1, vector<vector<long long>>(2, vector<... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 985,412 | 985,405 | u424374375 | cpp |
p03178 | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>... | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>... | [
"assignment.change"
] | 985,430 | 985,436 | u302000346 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define long long
const int K_SIZE = 2e5;
const int MAX_D = 110;
const int MOD = 1e9 + 7;
int dp[K_SIZE][MAX_D][2];
void modadd(int &a, int b) { a = (a + b) % MOD; }
signed main(void) {
string K;
cin >> K;
int D;
cin >> D;
//初期値について
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define long long
const int K_SIZE = 2e5;
const int MAX_D = 110;
const int MOD = 1e9 + 7;
int dp[K_SIZE][MAX_D][2];
void modadd(int &a, int b) { a = (a + b) % MOD; }
signed main(void) {
string K;
cin >> K;
int D;
cin >> D;
//初期値について
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 985,488 | 985,490 | u904123392 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
const int maxn = (int)1e4 + 10;
const int maxd = 100 + 10;
const int mod = (int)1e9 + 7;
char s[maxn];
long long dp[maxn][maxd];
long long dp2[maxn][maxd];
int n, d;
long long modu(long long a, long long b, long long m) {
return (a + b + m) % m;
}
int main() {
scanf(... | #include <bits/stdc++.h>
using namespace std;
const int maxn = (int)1e4 + 10;
const int maxd = 100 + 10;
const int mod = (int)1e9 + 7;
char s[maxn];
long long dp[maxn][maxd];
long long dp2[maxn][maxd];
int n, d;
long long modu(long long a, long long b, long long m) {
return (a + b + 10 * m) % m;
}
int main() {
s... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 985,500 | 985,502 | u376648895 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define fop(i, m, n) for (int i = (m); i < (n); i++)
#define FOP(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define test(x) cout << #x << ' ' << x << endl;
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define pii pair<int, int... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define fop(i, m, n) for (int i = (m); i < (n); i++)
#define FOP(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define test(x) cout << #x << ' ' << x << endl;
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define pii pair<int, int... | [
"assignment.add"
] | 985,529 | 985,532 | u325685340 | cpp |
p03178 | #include <bits/stdc++.h>
const int MOD = 1e9 + 7;
int main() {
std::string s;
std::cin >> s;
int n = s.size();
int d;
std::cin >> d;
std::vector<std::vector<int>> dp(n, std::vector<int>(d, 0));
int xx = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < s[i] - '0'; j++) {
dp[i][(xx + j) % d... | #include <bits/stdc++.h>
const int MOD = 1e9 + 7;
int main() {
std::string s;
std::cin >> s;
int n = s.size();
int d;
std::cin >> d;
std::vector<std::vector<int>> dp(n, std::vector<int>(d, 0));
int xx = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < s[i] - '0'; j++) {
dp[i][(xx + j) % d... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 985,559 | 985,561 | u128456980 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
string s;
int K;
vector<int> f(1e4 + 1);
vector<vector<int>> eq(1e4 + 1, vector<int>(1e2 + 3, 0));
vector<vector<int>> lt(1e4 + 1, vector<int>(1e2 + 3, 0));
int mod(int a, int b) {
a %= b;
if (a < 0)
a += b;
return... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
string s;
int K;
vector<int> f(1e4 + 1);
vector<vector<int>> eq(1e4 + 1, vector<int>(1e2 + 3, 0));
vector<vector<int>> lt(1e4 + 1, vector<int>(1e2 + 3, 0));
int mod(int a, int b) {
a %= b;
if (a < 0)
a += b;
return... | [
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 985,592 | 985,593 | u030848580 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define __ << " " <<
#define ___ << " "
#define bash push_back
#define ALL(x) x.begin(), x.end()
//#define int long long
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision... | #include <bits/stdc++.h>
using namespace std;
#define __ << " " <<
#define ___ << " "
#define bash push_back
#define ALL(x) x.begin(), x.end()
//#define int long long
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision... | [
"identifier.change",
"expression.operation.binary.change"
] | 985,609 | 985,610 | u678146855 | cpp |
p03178 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [] | 985,648 | 985,649 | u965118468 | cpp |
p03178 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#includ... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#includ... | [
"expression.operation.binary.remove"
] | 985,650 | 985,651 | u845000384 | cpp |
p03178 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e4 + 5;
ll dp[N][150][2], sum, ans;
int n;
string s;
int main() {
cin >> s >> n;
sum = s[0] - '0';
dp[0][sum % n][1] = 1;
for (int i = 0; i < s[0] - '0'; i++)
dp[0][i % n][0] = 1;
for (int i = 1; i <... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e4 + 5;
ll dp[N][150][2], sum, ans;
int n;
string s;
int main() {
cin >> s >> n;
sum = s[0] - '0';
dp[0][sum % n][1] = 1;
for (int i = 0; i < s[0] - '0'; i++)
dp[0][i % n][0] += 1;
for (int i = 1; i ... | [
"assignment.value.change"
] | 985,682 | 985,683 | u785897267 | cpp |
p03178 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(... | [
"assignment.change"
] | 985,714 | 985,715 | u822169805 | cpp |
p03178 |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) \
... |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) \
... | [
"call.add",
"call.arguments.change"
] | 985,729 | 985,730 | u263369790 | cpp |
p03178 | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a,... | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a,... | [
"call.add",
"call.arguments.change"
] | 985,733 | 985,734 | u065898443 | cpp |
p03178 | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a,... | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a,... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 985,735 | 985,736 | u065898443 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int dp[10003][100][2];
int main() {
string K;
int D;
cin >> K >> D;
int n = K.length();
for (int i = 0; i < K[0] - '0'; i++) {
dp[0][i % D][0] = 1;
}
dp[0][(K[0] - '0') % D][1] = 1;
for (int i = 1; i < n; i++) {
for (in... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
const int mod = 1e9 + 7;
int dp[10003][100][2];
int main() {
string K;
int D;
cin >> K >> D;
int n = K.length();
for (int i = 0; i < K[0] - '0'; i++) {
dp[0][i % D][0]++;
}
dp[0][(K[0] - '0') % D][1]++;
for (int i = 1; i < n;... | [] | 985,758 | 985,759 | u621389035 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int dp[10003][100][2];
main() {
string K;
int D;
cin >> K >> D;
int n = K.length();
for (int i = 0; i < K[0] - '0'; i++) {
dp[0][i % D][0] = 1;
}
dp[0][(K[0] - '0') % D][1] = 1;
for (int i = 1; i < n; i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int dp[10003][100][2];
main() {
string K;
int D;
cin >> K >> D;
int n = K.length();
for (int i = 0; i < K[0] - '0'; i++) {
dp[0][i % D][0]++;
}
dp[0][(K[0] - '0') % D][1]++;
for (int i = 1; i < n; i++) ... | [] | 985,760 | 985,761 | u621389035 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define y1 hasjdnasd
#define ii pair<int, int>
#define iii pair<int, ii>
#define iv pair<ii, ii>
#define fi first
#define se second
#define pb push_back
#define fr front()
#define FOR(i, x, n) for (int i = x; i <= n; ++i)
#define FORD(i, x, n) for (int i = x; i >= n; --i... | #include <bits/stdc++.h>
using namespace std;
#define y1 hasjdnasd
#define ii pair<int, int>
#define iii pair<int, ii>
#define iv pair<ii, ii>
#define fi first
#define se second
#define pb push_back
#define fr front()
#define FOR(i, x, n) for (int i = x; i <= n; ++i)
#define FORD(i, x, n) for (int i = x; i >= n; --i... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 985,764 | 985,765 | u812951529 | cpp |
p03175 | #include <iostream>
#include <vector>
using namespace std;
#define MAXN 100020
#define pb push_back
#define MOD 1000000007
int N;
vector<int> e[MAXN];
long long dp[MAXN][2];
bool vis[MAXN];
void dfs(int n) {
vis[n] = true;
if (e[n].size() == 1 && n != 0) {
dp[n][0] = 1;
dp[n][1] = 1;
return;
}
dp... | #include <iostream>
#include <vector>
using namespace std;
#define MAXN 100020
#define pb push_back
#define MOD 1000000007
int N;
vector<int> e[MAXN];
long long dp[MAXN][2];
bool vis[MAXN];
void dfs(int n) {
vis[n] = true;
if (e[n].size() == 1 && n != 0) {
dp[n][0] = 1;
dp[n][1] = 1;
return;
}
dp... | [] | 985,821 | 985,822 | u719290158 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[100001][2];
vector<ll> g[100001];
bool vis[100001];
ll mod = 1e9 + 7;
void dfs(ll cur) {
vis[cur] = 1;
if (g[cur].size() == 1) {
if (vis[g[cur][0]]) {
dp[cur][0] = dp[cur][1] = 1;
return;
}
}
ll x1, x2;
x1 = x2 = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[100001][2];
vector<ll> g[100001];
bool vis[100001];
ll mod = 1e9 + 7;
void dfs(ll cur) {
vis[cur] = 1;
if (g[cur].size() == 1) {
if (vis[g[cur][0]]) {
dp[cur][0] = dp[cur][1] = 1;
return;
}
}
ll x1, x2;
x1 = x2 = 1;
... | [
"literal.number.change",
"assignment.value.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 985,868 | 985,869 | u924895886 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
#define INF 1000000000000000000
#define MOD 1000000007
int n;
vector<int> nei[1000000];
lld DP[1000000][2];
bool done[1000000];
void compute(int node) {
done[node] = true;
int cnt = 0;
DP[node][0] = 1;
DP[node][1] = 1;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
#define INF 1000000000000000000
#define MOD 1000000007
int n;
vector<int> nei[1000000];
lld DP[1000000][2];
bool done[1000000];
void compute(int node) {
done[node] = true;
int cnt = 0;
DP[node][0] = 1;
DP[node][1] = 1;
for (int i = 0; i... | [
"expression.operator.change"
] | 985,876 | 985,877 | u575705530 | cpp |
p03175 | #include <bits/stdc++.h>
using namespace std;
#define DIM 200009
#define INF 1e18 + 9
#define MODULO 1000000007
#define amen exit(0)
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define pairll pair<int, int>
#define fi first
#define se second
#define ld long double
long long i, j, k, l, n, ... | #include <bits/stdc++.h>
using namespace std;
#define DIM 200009
#define INF 1e18 + 9
#define MODULO 1000000007
#define amen exit(0)
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define pairll pair<int, int>
#define fi first
#define se second
#define ld long double
long long i, j, k, l, n, ... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 985,976 | 985,977 | u829708993 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<pii> vpii;
... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<pii> vpii;
... | [
"expression.operation.binary.remove"
] | 985,986 | 985,987 | u832039789 | cpp |
p03178 | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:16777216")
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#... | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:16777216")
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 986,005 | 986,006 | u562824357 | cpp |
p03178 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utilit... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utilit... | [
"expression.operation.binary.remove"
] | 986,007 | 986,008 | u864537413 | cpp |
p03178 | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | [] | 986,040 | 986,041 | u468700753 | cpp |
p03178 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll dp[20000][2][100];
int main() {
string s;
int d;
cin >> s >> d;
dp[0... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll dp[20000][2][100];
int main() {
string s;
int d;
cin >> s >> d;
dp[0... | [
"assignment.change"
] | 986,042 | 986,043 | u781091740 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbi... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbi... | [
"assignment.change"
] | 986,048 | 986,049 | u644069994 | cpp |
p03179 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 10000000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 10000000... | [
"variable_declaration.type.change",
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 986,055 | 986,056 | u021358975 | cpp |
p03179 | /*
Author : Xinyuan
*/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef long long int ll;
const int INF... | /*
Author : Xinyuan
*/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef long long int ll;
const int INF... | [] | 986,069 | 986,070 | u399802581 | cpp |
p03179 | /*
Author : Xinyuan
*/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef long long int ll;
const int INF... | /*
Author : Xinyuan
*/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef long long int ll;
const int INF... | [
"literal.number.change",
"variable_declaration.value.change"
] | 986,071 | 986,070 | u399802581 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.