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 |
|---|---|---|---|---|---|---|---|
p03176 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define n_l '\n'
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define n_l '\n'
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(... | [] | 984,128 | 984,129 | u368645334 | cpp |
p03176 | #include <bits/stdc++.h>
#define db(x) cout << x << " "
#define db1(x) cout << x << '\n'
#define db2(x, y) cout << x << " " << y << '\n'
#define db3(x, y, z) cout << x << " " << y << " " << z << '\n'
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, ... | #include <bits/stdc++.h>
#define db(x) cout << x << " "
#define db1(x) cout << x << '\n'
#define db2(x, y) cout << x << " " << y << '\n'
#define db3(x, y, z) cout << x << " " << y << " " << z << '\n'
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 984,130 | 984,131 | u483789716 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
long long MOD = (long long)(1e9 + 7);
vector<int> graph[(int)(1e5 + 7)];
int main() {
int n;
cin >> n;
vector<long long> h(n), a(n);
int base = 1;
while (base <= n)
base *= 2;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
long long MOD = (long long)(1e9 + 7);
vector<int> graph[(int)(1e5 + 7)];
int main() {
int n;
cin >> n;
vector<long long> h(n), a(n);
int base = 1;
while (base <= n)
base *= 2;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++)... | [
"expression.operation.binary.remove"
] | 984,132 | 984,133 | u552024502 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
ll m;
vec mul(vec &dp, mat &mt) {
vec ret(m);
for (ll i = 0; i < m; i++) {
for (ll j = 0; j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
ll m;
vec mul(vec &dp, mat &mt) {
vec ret(m);
for (ll i = 0; i < m; i++) {
for (ll j = 0; j... | [
"assignment.change"
] | 984,153 | 984,154 | u718758485 | cpp |
p03177 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
using VL = vector<long long>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
int n;
void show(VVL &vv) {
for (au... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
using VL = vector<long long>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
int n;
void show(VVL &vv) {
for (au... | [] | 984,155 | 984,156 | u590241855 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [] | 984,159 | 984,160 | u424211710 | cpp |
p03177 | // ysh_gpta
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set ... | // ysh_gpta
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set ... | [] | 984,176 | 984,177 | u898771121 | cpp |
p03177 | #include <bits/stdc++.h>
#define ll long long
#define X first
#define Y second
#define MP make_pair
using namespace std;
const int N = 123;
const ll mod = 1e9 + 7;
int n;
struct mtx {
int a[N][N], len = n;
mtx() { memset(a, 0, sizeof(a)); }
void operator*=(mtx b) {
int res[N][N];
memset(res, 0, sizeof... | #include <bits/stdc++.h>
#define ll long long
#define X first
#define Y second
#define MP make_pair
using namespace std;
const int N = 123;
const ll mod = 1e9 + 7;
int n;
struct mtx {
ll a[N][N], len = n;
mtx() { memset(a, 0, sizeof(a)); }
void operator*=(mtx b) {
int res[N][N];
memset(res, 0, sizeof(... | [] | 984,212 | 984,213 | u816631826 | cpp |
p03177 | #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... | [] | 984,228 | 984,229 | u021358975 | cpp |
p03177 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll MAX_N = 50 + 1;
cons... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll MAX_N = 50 + 1;
cons... | [] | 984,230 | 984,231 | u367713721 | cpp |
p03177 | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);
#define int long long int
using namespace std;
const int MAXN = 100, MOD = 1e9 + 7;
int n, k, base[MAXN][MAXN];
struct matrix {
int n, m;
int mx[MAXN][MAXN];
matrix(int n = 0, int m = 0) : n(n), m(m) { memset(mx, 0, sizeof(mx)); }
matrix ... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);
#define int long long int
using namespace std;
const int MAXN = 100, MOD = 1e9 + 7;
int n, k, base[MAXN][MAXN];
struct matrix {
int n, m;
int mx[MAXN][MAXN];
matrix(int n = 0, int m = 0) : n(n), m(m) { memset(mx, 0, sizeof(mx)); }
matrix ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 984,232 | 984,233 | u408388726 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = (ll)1e9 + 7;
void multiply(ll first[][50], ll second[][50], ll n) {
ll i, j, k, tmp[n][50];
memset(tmp, 0, sizeof(tmp));
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
for (k = 0; k < n; k++)
tmp[i][j] += first[i][k] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = (ll)1e9 + 7;
void multiply(ll first[][50], ll second[][50], ll n) {
ll i, j, k, tmp[n][50];
memset(tmp, 0, sizeof(tmp));
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
for (k = 0; k < n; k++)
(tmp[i][j] += first[i][k]... | [
"assignment.change"
] | 984,245 | 984,246 | u341555499 | cpp |
p03177 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | [
"assignment.value.change"
] | 984,249 | 984,250 | u264405855 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
//... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
//... | [
"assignment.change"
] | 984,255 | 984,256 | u344122377 | cpp |
p03172 | #include <bits/stdc++.h>
typedef int ll;
using namespace std;
int dp[102][100004];
int pref[102][100004];
int main() {
ios::sync_with_stdio(false);
int n, k;
int a[102];
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
int mod = 1e9 + 7;
memset(dp, 0, sizeof dp);
memset(pref, 0, sizeof pref)... | #include <bits/stdc++.h>
typedef int ll;
using namespace std;
int dp[102][100004];
int pref[102][100004];
int main() {
ios::sync_with_stdio(false);
int n, k;
int a[102];
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
int mod = 1e9 + 7;
memset(dp, 0, sizeof dp);
memset(pref, 0, sizeof pref)... | [
"assignment.change"
] | 984,262 | 984,263 | u758866199 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
const ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
rep(i, n) cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 2, 0));
dp[0][k] = 1;
rep(i, n) {
for (int j ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
const ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
rep(i, n) cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 2, 0));
dp[0][k] = 1;
rep(i, n) {
for (int j ... | [
"expression.operator.change",
"expression.operation.unary.add",
"assignment.change"
] | 984,266 | 984,267 | u970690920 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
const ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, n) cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 2, 0));
dp[0][k] = 1;
rep(i, n) {
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
const ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
rep(i, n) cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 2, 0));
dp[0][k] = 1;
rep(i, n) {
for (int j ... | [
"variable_declaration.type.change",
"expression.operator.change",
"expression.operation.unary.add",
"assignment.change"
] | 984,268 | 984,267 | u970690920 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long dp[n + 1][k + 1];
memset(dp, -1, sizeof(dp));
long long a[n + 1];
for (long long i = 1; i <= n; i++) {
cin >> a[i];
}
for (long long i = 0; i <= k; i++) {
if (i <= a[1])
dp[1][i] = 1;
e... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long dp[n + 1][k + 1];
memset(dp, -1, sizeof(dp));
long long a[n + 1];
for (long long i = 1; i <= n; i++) {
cin >> a[i];
}
for (long long i = 0; i <= k; i++) {
if (i <= a[1])
dp[1][i] = 1;
e... | [] | 984,271 | 984,272 | u633697116 | cpp |
p03172 | #include <algorithm>
#include <iostream>
#include <vector>
#define mod 1e9 + 5
using namespace std;
using ll = long long;
void add_self(int &a, int b) {
a += b;
a -= a >= mod ? mod : 0;
}
void sub_self(int &a, int b) {
a -= b;
a += a < 0 ? mod : 0;
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
vect... | #include <algorithm>
#include <iostream>
#include <vector>
#define mod 1e9 + 7
using namespace std;
using ll = long long;
void add_self(int &a, int b) {
a += b;
a -= a >= mod ? mod : 0;
}
void sub_self(int &a, int b) {
a -= b;
a += a < 0 ? mod : 0;
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
vect... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 984,277 | 984,278 | u236288355 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define off \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define off \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"expression.operation.binary.add"
] | 984,290 | 984,291 | u540942722 | cpp |
p03172 | #include <iostream>
#include <vector>
using namespace std;
int MAX = 1e9 + 7;
int dispatch(int total, vector<int> &criterias) {
if (total == 0)
return 1;
int n = criterias.size();
vector<vector<int>> records =
vector<vector<int>>(total + 1, vector<int>(n + 1, 0));
records[0][0] = 1;
for (int c... | #include <iostream>
#include <vector>
using namespace std;
int MAX = 1e9 + 7;
int dispatch(int total, vector<int> &criterias) {
if (total == 0)
return 1;
int n = criterias.size();
vector<vector<int>> records =
vector<vector<int>>(total + 1, vector<int>(n + 1, 0));
records[0][0] = 1;
for (int c... | [
"function.return_value.change"
] | 984,292 | 984,293 | u729714874 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make... | [
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 984,294 | 984,295 | u859541564 | cpp |
p03172 | // https://atcoder.jp/contests/dp/tasks/dp_m
#include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
vector<int> max_candie... | // https://atcoder.jp/contests/dp/tasks/dp_m
#include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
vector<int> max_candie... | [
"assignment.change"
] | 984,296 | 984,297 | u184819501 | cpp |
p03172 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
ll mod = 1000000007LL;
int main() {
cin.sync_with_stdio(false);
cin... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
ll mod = 1000000007LL;
int main() {
cin.sync_with_stdio(false);
cin... | [
"assignment.change"
] | 984,300 | 984,301 | u334624175 | cpp |
p03172 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
ll mod = 1000000007LL;
int main() {
cin.sync_with_stdio(false);
cin... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
ll mod = 1000000007LL;
int main() {
cin.sync_with_stdio(false);
cin... | [
"assignment.change"
] | 984,302 | 984,301 | u334624175 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
... | [
"assignment.change"
] | 984,303 | 984,304 | u179395482 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | [
"assignment.change"
] | 984,320 | 984,321 | u172929647 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fore(i, a, b) for (ll i = a; i <= b; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define fi first
#define se second
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fore(i, a, b) for (ll i = a; i <= b; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define fi first
#define se second
#defi... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 984,324 | 984,325 | u576115185 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fore(i, a, b) for (ll i = a; i <= b; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define fi first
#define se second
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fore(i, a, b) for (ll i = a; i <= b; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define fi first
#define se second
#defi... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 984,326 | 984,325 | u576115185 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
int a[N], dp[K + 1][N]; // intでは若干ケタが足らずWAが出る
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
dp[0][j] = 1;
}
for (int i = 1; i <= K; i++) {
if (i <= a[0]) {
dp[i][0] = 1... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
long int a[N], dp[K + 1][N]; // intでは若干ケタが足らずWAが出る
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
dp[0][j] = 1;
}
for (int i = 1; i <= K; i++) {
if (i <= a[0]) {
dp[i][0... | [
"variable_declaration.type.widen.change"
] | 984,329 | 984,330 | u543181229 | cpp |
p03172 | // M - Candies https://atcoder.jp/contests/dp/tasks/dp_m
/* 入力例
3 4
1 2 3
// →出力 5
// 横軸子供、縦軸アメのナップザック的２次元DP
//
各セルには左のセルの個数と上からのセルの個数の和から上からのセルから満杯になってものを引いた値が入る。
// 左からのセル(i, j-1)の個数は、そのセル j列の子供が０個持つことを意味し
// 上からのセル(i-1, j)の個数は、そのセル j列の子供が(i-1,
j)に一つ加えたアメを持つことを意味する。そのためj列の子が持ちきれなくたった分を引かないといけないが
// その個数は、DP表を考えると、dp... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
long int a[N], dp[K + 1][N]; // intでは若干ケタが足らずWAが出る
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
dp[0][j] = 1;
}
for (int i = 1; i <= K; i++) {
if (i <= a[0]) {
dp[i][0... | [
"variable_declaration.type.widen.change"
] | 984,331 | 984,330 | u543181229 | cpp |
p03172 | // M - Candies https://atcoder.jp/contests/dp/tasks/dp_m
/* 入力例
3 4
1 2 3
// →出力 5
// 横軸子供、縦軸アメのナップザック的２次元DP
//
各セルには左のセルの個数と上からのセルの個数の和から上からのセルから満杯になってものを引いた値が入る。
// 左からのセル(i, j-1)の個数は、そのセル j列の子供が０個持つことを意味し
// 上からのセル(i-1, j)の個数は、そのセル j列の子供が(i-1,
j)に一つ加えたアメを持つことを意味する。そのためj列の子が持ちきれなくたった分を引かないといけないが
// その個数は、DP表を考えると、dp... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
unsigned int a[N], dp[K + 1][N]; // intでは若干ケタが足らずWAが出る
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
dp[0][j] = 1;
}
for (int i = 1; i <= K; i++) {
if (i <= a[0]) {
dp[... | [
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 984,331 | 984,332 | u543181229 | cpp |
p03172 | // M - Candies https://atcoder.jp/contests/dp/tasks/dp_m
/* 入力例
3 4
1 2 3
// →出力 5
// 横軸子供、縦軸アメのナップザック的２次元DP
//
各セルには左のセルの個数と上からのセルの個数の和から上からのセルから満杯になってものを引いた値が入る。
// 左からのセル(i, j-1)の個数は、そのセル j列の子供が０個持つことを意味し
// 上からのセル(i-1, j)の個数は、そのセル j列の子供が(i-1,
j)に一つ加えたアメを持つことを意味する。そのためj列の子が持ちきれなくたった分を引かないといけないが
// その個数は、DP表を考えると、dp... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
unsigned int a[N], dp[K + 1][N]; // intでは若干ケタが足らずWAが出る
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
dp[0][j] = 1;
}
for (int i = 1; i <= K; i++) {
if (i <= a[0]) {
dp[... | [
"variable_declaration.type.widen.change"
] | 984,331 | 984,333 | u543181229 | cpp |
p03172 | // M - Candies https://atcoder.jp/contests/dp/tasks/dp_m
/* 入力例
3 4
1 2 3
// →出力 5
// 横軸子供、縦軸アメのナップザック的２次元DP
//
各セルには左のセルの個数と上からのセルの個数の和から上からのセルから満杯になってものを引いた値が入る。
// 左からのセル(i, j-1)の個数は、そのセル j列の子供が０個持つことを意味し
// 上からのセル(i-1, j)の個数は、そのセル j列の子供が(i-1,
j)に一つ加えたアメを持つことを意味する。そのためj列の子が持ちきれなくたった分を引かないといけないが
// その個数は、DP表を考えると、dp... | // M - Candies https://atcoder.jp/contests/dp/tasks/dp_m
/* 入力例
3 4
1 2 3
// →出力 5
// 横軸子供、縦軸アメのナップザック的２次元DP
//
各セルには左のセルの個数と上からのセルの個数の和から上からのセルから満杯になってものを引いた値が入る。
// 左からのセル(i, j-1)の個数は、そのセル j列の子供が０個持つことを意味し
// 上からのセル(i-1, j)の個数は、そのセル j列の子供が(i-1,
j)に一つ加えたアメを持つことを意味する。そのためj列の子が持ちきれなくたった分を引かないといけないが
// その個数は、DP表を考えると、dp... | [
"variable_declaration.type.widen.change"
] | 984,331 | 984,334 | u543181229 | cpp |
p03172 |
// // ///// ///
// // // // // //
// // // // // //
//// // // // //
// // // // /////////
// // // // // //
// // ///// // //
#include <bits/stdc++.h>
using namespace std;
#define forstl(i, v) for (auto &i : v)
#define forn(i, e) for (int i = 0; i < e; i... |
// // ///// ///
// // // // // //
// // // // // //
//// // // // //
// // // // /////////
// // // // // //
// // ///// // //
#include <bits/stdc++.h>
using namespace std;
#define forstl(i, v) for (auto &i : v)
#define forn(i, e) for (int i = 0; i < e; i... | [
"assignment.change"
] | 984,343 | 984,344 | u416198344 | cpp |
p03172 |
// // ///// ///
// // // // // //
// // // // // //
//// // // // //
// // // // /////////
// // // // // //
// // ///// // //
#include <bits/stdc++.h>
using namespace std;
#define forstl(i, v) for (auto &i : v)
#define forn(i, e) for (int i = 0; i < e; i... |
// // ///// ///
// // // // // //
// // // // // //
//// // // // //
// // // // /////////
// // // // // //
// // ///// // //
#include <bits/stdc++.h>
using namespace std;
#define forstl(i, v) for (auto &i : v)
#define forn(i, e) for (int i = 0; i < e; i... | [
"expression.operation.binary.remove",
"assignment.change"
] | 984,345 | 984,344 | u416198344 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int dp[N + 1][K + 1];
for (int i = 0; i < N + 1; i++) {
for (int j = 0; j < K + 1; j++) {
dp[i][j]... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int dp[N + 1][K + 1];
for (int i = 0; i < N + 1; i++) {
for (int j = 0; j < K + 1; j++) {
dp[i][j]... | [] | 984,350 | 984,351 | u983918956 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int dp[N + 1][K + 1];
for (int i = 0; i < N + 1; i++) {
for (int j = 0; j < K + 1; j++) {
dp[i][j]... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int dp[N + 1][K + 1];
for (int i = 0; i < N + 1; i++) {
for (int j = 0; j < K + 1; j++) {
dp[i][j]... | [
"assignment.change"
] | 984,352 | 984,351 | u983918956 | cpp |
p03172 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using... | [
"assignment.change"
] | 984,355 | 984,356 | u159208574 | cpp |
p03172 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unistd.h>
#include <unordered_map>
#include <vector>
using... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 984,357 | 984,358 | u159208574 | cpp |
p03172 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
//#include <math.h>
//#include <algorithm>
#include <vector>
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
using namespace std;
#define MOD 1000000007
int main(int argc, char *argv[]) {
long n, k;
scanf("%ld %ld", &... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
//#include <math.h>
//#include <algorithm>
#include <vector>
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
using namespace std;
#define MOD 1000000007
int main(int argc, char *argv[]) {
long n, k;
scanf("%ld %ld", &... | [
"assignment.change"
] | 984,359 | 984,360 | u209713918 | cpp |
p03172 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
v... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
v... | [
"assignment.change"
] | 984,361 | 984,362 | u048945791 | cpp |
p03172 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
v... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
v... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 984,363 | 984,362 | u048945791 | cpp |
p03172 | #include <bits/stdc++.h>
#define ll long long
#define MAX 300005
#define pp pair<int, pair<int, int>>
#define pb push_back
#define mod 1000000007
using namespace std;
/*
* author: Kruti_20
*/
ll power(ll x, ll y);
ll gcd(ll a, ll b);
ll dp[105][MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NU... | #include <bits/stdc++.h>
#define ll long long
#define MAX 300005
#define pp pair<int, pair<int, int>>
#define pb push_back
#define mod 1000000007
using namespace std;
/*
* author: Kruti_20
*/
ll power(ll x, ll y);
ll gcd(ll a, ll b);
ll dp[105][MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NU... | [
"expression.operation.binary.remove"
] | 984,364 | 984,365 | u352059674 | cpp |
p03172 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORALL(i, m) for (auto i = m.begin(); i != m.end(); ++i)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define TM_T template <class T>
using... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORALL(i, m) for (auto i = m.begin(); i != m.end(); ++i)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define TM_T template <class T>
using... | [] | 984,373 | 984,374 | u649373416 | cpp |
p03172 | //
// main.cpp
// atcoder-candies
//
// Created by r on 6/1/19.
// Copyright © 2019 r. All rights reserved.
//
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace s... | [
"assignment.change"
] | 984,375 | 984,376 | u707204861 | cpp |
p03172 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real =... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real =... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 984,387 | 984,388 | u876978301 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
long long n;
typedef struct node {
long long a[51][51];
long long scale;
struct node operator*(const struct node &tmp) {
struct node ret;
long long i, j, k;
ret.scale = scale;
memset(ret.a, 0, sizeof(ret.a));
for (k = 1; k <= scale; k++)
for ... | #include <bits/stdc++.h>
using namespace std;
long long n;
typedef struct node {
long long a[51][51];
long long scale;
struct node operator*(const struct node &tmp) {
struct node ret;
long long i, j, k;
ret.scale = scale;
memset(ret.a, 0, sizeof(ret.a));
for (k = 1; k <= scale; k++)
for ... | [
"assignment.value.change"
] | 984,402 | 984,403 | u963399321 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
long long n;
typedef struct node {
long long a[51][51];
long long scale;
struct node operator*(const struct node &tmp) {
struct node ret;
long long i, j, k;
ret.scale = scale;
memset(ret.a, 0, sizeof(ret.a));
for (k = 1; k <= scale; k++)
for ... | #include <bits/stdc++.h>
using namespace std;
long long n;
typedef struct node {
long long a[51][51];
long long scale;
struct node operator*(const struct node &tmp) {
struct node ret;
long long i, j, k;
ret.scale = scale;
memset(ret.a, 0, sizeof(ret.a));
for (k = 1; k <= scale; k++)
for ... | [
"assignment.value.change"
] | 984,404 | 984,403 | u963399321 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
long long n, k;
typedef struct node {
long long a[51][51];
struct node operator*(const struct node &tmp) {
int i, j, K;
struct node ret;
memset(ret.a, 0, sizeof(ret.a));
for (K = 1; K <= n; K++) {
for (i = 1; i <= n; i++) {
for (j = 1; j <=... | #include <bits/stdc++.h>
using namespace std;
long long n, k;
typedef struct node {
long long a[51][51];
struct node operator*(const struct node &tmp) {
int i, j, K;
struct node ret;
memset(ret.a, 0, sizeof(ret.a));
for (K = 1; K <= n; K++) {
for (i = 1; i <= n; i++) {
for (j = 1; j <=... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 984,405 | 984,406 | u356929542 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
#define oo 666666666
#define ll long long
#define ld long double
vector<vector<ll>> Mul(vector<vector<ll>> A, vector<vector<ll>> B, ll mod) {
int n = A.size();
vector<vector<ll>> ats(n, vector<ll>(n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
... | #include <bits/stdc++.h>
using namespace std;
#define oo 666666666
#define ll long long
#define ld long double
vector<vector<ll>> Mul(vector<vector<ll>> A, vector<vector<ll>> B, ll mod) {
int n = A.size();
vector<vector<ll>> ats(n, vector<ll>(n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
... | [] | 984,409 | 984,410 | u847400794 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 2000000000000000000LL
#define EPS 1e-9
#define debug(a) cerr << #a << "=" << (a) << "\n"
#define FastSlowInput \
ios_base::s... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 2000000000000000000LL
#define EPS 1e-9
#define debug(a) cerr << #a << "=" << (a) << "\n"
#define FastSlowInput \
ios_base::s... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 984,417 | 984,418 | u069951049 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | [
"variable_declaration.type.change"
] | 984,422 | 984,423 | u443685186 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | [
"identifier.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"variable_declaration.type.change",
"assignment.change"
] | 984,424 | 984,423 | u443685186 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define inf1 INT_MAX
#define inf2 LLONG_MAX
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define sbit __builtin_popcount
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define inf1 INT_MAX
#define inf2 LLONG_MAX
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define sbit __builtin_popcount
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i ... | [
"variable_declaration.type.change"
] | 984,426 | 984,427 | u663862781 | cpp |
p03176 | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define emp emplace
using namespace std;
using ll = long long int;
using ii = pair<int, int>;
const int MOD = 1000 * 1000 * 1000 + 7;
const int N = 2 * 100000;
int tree[... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define emp emplace
using namespace std;
using ll = long long int;
using ii = pair<int, int>;
const int MOD = 1000 * 1000 * 1000 + 7;
const int N = 2 * 100000;
ll tree[2... | [
"variable_declaration.type.change"
] | 984,436 | 984,437 | u540942722 | cpp |
p03176 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define int long long
using namespace std;
typedef pair<int, int> P;
template <typename T, typename E> // SegmentTree((要素数) int n_,(演算) F
// f,(更新) G g,(初期値) T d1)
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define int long long
using namespace std;
typedef pair<int, int> P;
template <typename T, typename E> // SegmentTree((要素数) int n_,(演算) F
// f,(更新) G g,(初期値) T d1)
... | [
"assignment.change"
] | 984,440 | 984,441 | u203033720 | cpp |
p03176 | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO ... | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 984,442 | 984,443 | u751730221 | cpp |
p03176 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
class SegTree {
public:
// Range Max Query
vector<int> ar;
int length;
SegTree(int n) {
length = 1;
while (n > length)
length *= 2;
ar.resize(2 * length - 1);
for (int i = 0; i < 2 * len... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
class SegTree {
public:
// Range Max Query
vector<ll> ar;
int length;
SegTree(int n) {
length = 1;
while (n > length)
length *= 2;
ar.resize(2 * length - 1);
for (int i = 0; i < 2 * leng... | [
"variable_declaration.type.change"
] | 984,453 | 984,454 | u107077805 | cpp |
p03176 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define c(P) cout << P << "\n"
#define dbg(P) cout << P << " "
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, x, n) for (ll i = x; i ... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define c(P) cout << P << "\n"
#define dbg(P) cout << P << " "
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, x, n) for (ll i = x; i ... | [
"expression.operation.unary.add"
] | 984,455 | 984,456 | u305721160 | cpp |
p03176 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define c(P) cout << P << "\n"
#define dbg(P) cout << P << " "
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, x, n) for (ll i = x; i ... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define c(P) cout << P << "\n"
#define dbg(P) cout << P << " "
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, x, n) for (ll i = x; i ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.unary.add"
] | 984,457 | 984,456 | u305721160 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
/*
* Supports range sum queries on a mutable array of Ts.
* Requires t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
/*
* Supports range sum queries on a mutable array of Ts.
* Requires t... | [] | 984,460 | 984,461 | u695197008 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = (int)2e5 + 10;
struct node {
int l, r;
node *left, *right;
ll val;
node(int L, int R) {
val = 0, l = L, r = R;
if (l == r)
return;
int m = l + r >> 1;
left = new node(l, m);
right = new node(m + 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = (int)2e5 + 10;
struct node {
int l, r;
node *left, *right;
ll val;
node(int L, int R) {
val = 0, l = L, r = R;
if (l == r)
return;
int m = l + r >> 1;
left = new node(l, m);
right = new node(m + 1... | [
"variable_declaration.type.change"
] | 984,466 | 984,467 | u013023508 | cpp |
p03176 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << '\n'
using namespace std;
type... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << '\n'
using namespace std;
type... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change",
"expression.operation.binary.remove"
] | 984,482 | 984,481 | u120143737 | cpp |
p03176 | /*DavitMarg*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctype.h>>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007ll
#define... | /*DavitMarg*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctype.h>>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007ll
#define... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 984,492 | 984,493 | u921233745 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define PER(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pf push_front
#define pb push_back
#define mk make_pair
#define S ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define PER(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pf push_front
#define pb push_back
#define mk make_pair
#define S ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 984,496 | 984,497 | u991534398 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define PER(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pf push_front
#define pb push_back
#define mk make_pair
#define S ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define PER(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pf push_front
#define pb push_back
#define mk make_pair
#define S ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 984,498 | 984,497 | u991534398 | cpp |
p03176 | #include <bits/stdc++.h>
#define ld long double
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI (acos(-1.0))
#define IN freopen("input.txt", "r", stdin)
#define OUT freopen("output.txt", "w", stdout)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (in... | #include <bits/stdc++.h>
#define ld long double
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI (acos(-1.0))
#define IN freopen("input.txt", "r", stdin)
#define OUT freopen("output.txt", "w", stdout)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (in... | [] | 984,523 | 984,524 | u274856119 | cpp |
p03176 | #include <iostream>
#define mid (l + r) / 2
#define ll long long
using namespace std;
const int N = 2e5 + 55;
ll tree[N * 4];
int h[N];
ll a[N];
void update(int l, int r, int node, int ind, int val) {
if (l == r) {
tree[node] = val;
return;
}
if (ind <= mid)
update(l, mid, node * 2, ind, val);
els... | #include <iostream>
#define mid (l + r) / 2
#define ll long long
using namespace std;
const int N = 2e5 + 55;
ll tree[N * 4];
int h[N];
ll a[N];
void update(int l, int r, int node, int ind, ll val) {
if (l == r) {
tree[node] = val;
return;
}
if (ind <= mid)
update(l, mid, node * 2, ind, val);
else... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 984,525 | 984,526 | u083991297 | cpp |
p03176 | // csjosh
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //required
// #include <ext/pb_ds/tree_policy.hpp> //required
// using namespace __gnu_pbds; //required
using namespace std;
#define ll long long
#define loop(x) for (int i = 0; i < x; i++)
#define llu unsigned long long
#define pb push_b... | // csjosh
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //required
// #include <ext/pb_ds/tree_policy.hpp> //required
// using namespace __gnu_pbds; //required
using namespace std;
#define ll long long
#define loop(x) for (int i = 0; i < x; i++)
#define llu unsigned long long
#define pb push_b... | [
"variable_declaration.type.change",
"io.output.change"
] | 984,533 | 984,534 | u353116207 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
long long t[600000];
int h[200001];
long long query(int index, int lb, int rb, int lq, int rq) {
if (lb == rb || (lq == lb && rb == rq))
return t[index];
int mid = (lb + rb) / 2;
if (lq > mid)
return query(index * 2 + 1, mid + 1, rb, lq, rq);
else if (rq <= ... | #include <bits/stdc++.h>
using namespace std;
long long t[600000];
int h[200001];
long long query(int index, int lb, int rb, int lq, int rq) {
if (lb == rb || (lq == lb && rb == rq))
return t[index];
int mid = (lb + rb) / 2;
if (lq > mid)
return query(index * 2 + 1, mid + 1, rb, lq, rq);
else if (rq <= ... | [
"control_flow.return.add"
] | 984,537 | 984,538 | u511639787 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
long long c[200001];
int h[200001];
long long max_v;
int n;
int lowbit(int x) { return x & -x; }
void updatemax(int index, long long value) {
while (index <= 200001) {
c[index] = max(c[index], value);
index += lowbit(index);
}
}
int maxrange(int index) {
long ... | #include <bits/stdc++.h>
using namespace std;
long long c[200001];
int h[200001];
long long max_v;
int n;
int lowbit(int x) { return x & -x; }
void updatemax(int index, long long value) {
while (index <= n) {
c[index] = max(c[index], value);
index += lowbit(index);
}
}
long long maxrange(int index) {
long... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 984,539 | 984,540 | u511639787 | cpp |
p03176 | #include "bits/stdc++.h"
#define N 200001
#define ZERO 0
using namespace std;
int n;
long long maxn = ZERO;
long long c[N];
int h[N];
int lowbit(int x) { return x & (-x); }
void updatemax(int index, long long value) {
while (index <= n) {
c[index] = max(c[index], value);
index += lowbit(index);
}
}
long lon... | #include "bits/stdc++.h"
#define N 200001
#define ZERO 0
using namespace std;
int n;
long long maxn = ZERO;
long long c[N];
int h[N];
int lowbit(int x) { return x & (-x); }
void updatemax(int index, long long value) {
while (index <= n) {
c[index] = max(c[index], value);
index += lowbit(index);
}
}
long lon... | [
"identifier.change",
"call.arguments.change"
] | 984,543 | 984,544 | u226709380 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
long long int st[800005];
long long int query(int node, int be, int en, int l, int r) {
if (be >= l && en <= r)
return st[node];
if (be > r || en < l)
return 0;
int mid = (be + en) >> 1;
long long int p1 = query(2 * node, be, mid, l, r);
long long int p2... | #include <bits/stdc++.h>
using namespace std;
long long int st[800005];
long long int query(int node, int be, int en, int l, int r) {
if (be >= l && en <= r)
return st[node];
if (be > r || en < l)
return 0;
int mid = (be + en) >> 1;
long long int p1 = query(2 * node, be, mid, l, r);
long long int p2... | [
"variable_declaration.type.widen.change"
] | 984,549 | 984,550 | u792036618 | cpp |
p03176 | /*
Author - linpaws07
*/
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define inf (int)1e9
#define f first
#define s second
#define eps 1e-9
#define PI 3.1415926535897932384626433832795
#define scd(t) scanf("%d", &t)
#def... | /*
Author - linpaws07
*/
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define inf (int)1e9
#define f first
#define s second
#define eps 1e-9
#define PI 3.1415926535897932384626433832795
#define scd(t) scanf("%d", &t)
#def... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 984,555 | 984,556 | u445244358 | cpp |
p03176 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using namespace std;
using ll = long long;
template <class T, T monoid> class RMQ {
public:
vector<T> dat;
int _n;
RMQ(int size) : _n{1} {... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using namespace std;
using ll = long long;
template <class T, T monoid> class RMQ {
public:
vector<T> dat;
int _n;
RMQ(int size) : _n{1} {... | [] | 984,568 | 984,569 | u772304668 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
const int mod = 1000000007;
typedef long long ll;
int n;
int dp[200005]; // dp[i] end with i's best solution
int a[200005], h[200005];
struct BIT {
ll data[200005];
void modify(int x, ll y) {
while (x <= n) {
... | #include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
const int mod = 1000000007;
typedef long long ll;
int n;
ll dp[200005]; // dp[i] end with i's best solution
int a[200005], h[200005];
struct BIT {
ll data[200005];
void modify(int x, ll y) {
while (x <= n) {
... | [
"variable_declaration.type.change"
] | 984,576 | 984,577 | u588911593 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
const int mod = 1000000007;
typedef long long ll;
int n;
int dp[100005]; // dp[i] end with i's best solution
int a[100005], h[100005];
struct BIT {
ll data[100005];
void modify(int x, ll y) {
while (x <= n) {
... | #include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
const int mod = 1000000007;
typedef long long ll;
int n;
ll dp[200005]; // dp[i] end with i's best solution
int a[200005], h[200005];
struct BIT {
ll data[200005];
void modify(int x, ll y) {
while (x <= n) {
... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 984,578 | 984,577 | u588911593 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
long long n, f[MAX], dp[MAX], a[MAX], h[MAX];
long long get(long long idx) {
long long res = 0;
for (; idx; idx -= (idx & (-idx)))
res = max(res, f[idx]);
return res;
}
void modify(long long idx, long long val) {
for (; idx < MAX; idx +=... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
long long n, f[MAX], dp[MAX], a[MAX], h[MAX];
long long get(long long idx) {
long long res = 0;
for (; idx; idx -= (idx & (-idx)))
res = max(res, f[idx]);
return res;
}
void modify(long long idx, long long val) {
for (; idx < MAX; idx +=... | [
"identifier.change",
"call.arguments.change"
] | 984,579 | 984,580 | u573738515 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 300001;
typedef long long ll;
#define f first
#define s second
const ll mod = 1e9 + 7;
ll nums[MAXN];
ll tree[MAXN];
void update(int pos, ll val) {
for (; pos < MAXN; pos += pos & -pos) {
tree[pos] = max(tree[pos], val);
}
}
ll query(int pos) {
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 300001;
typedef long long ll;
#define f first
#define s second
const ll mod = 1e9 + 7;
ll nums[MAXN];
ll tree[MAXN];
void update(int pos, ll val) {
for (; pos < MAXN; pos += pos & -pos) {
tree[pos] = max(tree[pos], val);
}
}
ll query(int pos) {
... | [
"expression.operation.binary.remove"
] | 984,610 | 984,611 | u693463436 | cpp |
p03176 | #include <bits/stdc++.h>
using namespace std;
long s[1 << 19];
int n;
void update(int p, int x, int k = 0, int l = 0, int r = n) {
if (r - l < 2) {
s[k] = x;
return;
}
int m = (l + r) / 2;
if (p < m)
update(p, x, 2 * k + 1, l, m);
else
update(p, x, 2 * k + 2, m, r);
s[k] = max(s[2 * k + 1],... | #include <bits/stdc++.h>
using namespace std;
long s[1 << 19];
int n;
void update(int p, long x, int k = 0, int l = 0, int r = n) {
if (r - l < 2) {
s[k] = x;
return;
}
int m = (l + r) / 2;
if (p < m)
update(p, x, 2 * k + 1, l, m);
else
update(p, x, 2 * k + 2, m, r);
s[k] = max(s[2 * k + 1]... | [
"variable_declaration.type.primitive.change"
] | 984,634 | 984,635 | u503549962 | cpp |
p03177 | #include <cstring>
#include <iostream>
using namespace std;
const int MAX = 51;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long G[MAX][MAX];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> G[i][j];
}
}
long long ans[MAX][MAX];... | #include <cstring>
#include <iostream>
using namespace std;
const int MAX = 51;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long G[MAX][MAX];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> G[i][j];
}
}
long long ans[MAX]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 984,696 | 984,697 | u879680955 | cpp |
p03177 | #include <bits/stdc++.h>
#define DIM 57
#define modulo 1000000007
using namespace std;
struct matrix {
long long n, a[DIM][DIM];
void mul(matrix b) {
matrix am = *this;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
a[i][j] = 0;
for (int k = 1; k <= n; ++k)
a[i... | #include <bits/stdc++.h>
#define DIM 57
#define modulo 1000000007
using namespace std;
struct matrix {
long long n, a[DIM][DIM];
void mul(matrix b) {
matrix am = *this;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
a[i][j] = 0;
for (int k = 1; k <= n; ++k)
a[i... | [
"literal.number.change",
"assignment.value.change"
] | 984,729 | 984,730 | u674071078 | cpp |
p03177 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 55;
struct Matrix {
long long *... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 55;
struct Matrix {
long long *... | [] | 984,741 | 984,742 | u738069880 | cpp |
p03177 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
long long MM = 1e9 + 7;
typedef vector<vector<long long>> mat;
mat mm(const mat &A, const mat &B, int N) {
mat rl(N, vector<long long>(N, 0));
for (auto i = 0; i < N; i++)
for (auto j = 0; j < N; j++)
f... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
long long MM = 1e9 + 7;
typedef vector<vector<long long>> mat;
mat mm(const mat &A, const mat &B, int N) {
mat rl(N, vector<long long>(N, 0));
for (auto i = 0; i < N; i++)
for (auto j = 0; j < N; j++)
f... | [
"variable_declaration.value.change"
] | 984,743 | 984,744 | u993688697 | cpp |
p03177 | /*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <vector... | /*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <vector... | [
"literal.string.change",
"call.arguments.change"
] | 984,745 | 984,746 | u536451615 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int dp[10002][102][2];
string s;
int d;
int fun(int idx, int cur, bool gr) {
if (idx == s.size())
return !cur;
int &ret = dp[idx][cur][gr];
if (~ret)
return ret;
ret = 0;
if (!gr) {
for (int i = 0; i < s[idx] - '0'; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int dp[10002][102][2];
string s;
int d;
int fun(int idx, int cur, bool gr) {
if (idx == s.size())
return !cur;
int &ret = dp[idx][cur][gr];
if (~ret)
return ret;
ret = 0;
if (!gr) {
for (int i = 0; i < s[i... | [
"variable_declaration.type.primitive.change"
] | 984,767 | 984,768 | u839354257 | cpp |
p03178 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<ll, ll, ll> T;
const long long INF = 1LL << 60;
const int MOD = 1000000000 + 7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template <typename T> inline strin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<ll, ll, ll> T;
const long long INF = 1LL << 60;
const int MOD = 1000000000 + 7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template <typename T> inline strin... | [
"expression.operation.binary.add"
] | 984,771 | 984,772 | u895393304 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define pb push_back
#define w(x) \
int x; \
cin >> x; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define pb push_back
#define w(x) \
int x; \
cin >> x; ... | [
"control_flow.branch.if.condition.change"
] | 984,776 | 984,777 | u193875150 | cpp |
p03178 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
string K;
cin >> K;
int n = K.size(... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
string K;
cin >> K;
int n = K.size(... | [
"assignment.change"
] | 984,778 | 984,779 | u270654502 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
// look at 0 - K and subtract 1.
string k;
int n, d;
const int MOD = 1e9 + 7;
// dp[i][j]: if we have i 0-9 choices and we want j mod d, how many ways?
int dp[10002][101];
// solve: int i is the first letter index of the suffix we look at. left is the
// modulus mod D we... | #include <bits/stdc++.h>
using namespace std;
// look at 0 - K and subtract 1.
string k;
int n, d;
const int MOD = 1e9 + 7;
// dp[i][j]: if we have i 0-9 choices and we want j mod d, how many ways?
int dp[10002][101];
// solve: int i is the first letter index of the suffix we look at. left is the
// modulus mod D we... | [] | 984,820 | 984,821 | u117022482 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
// look at 0 - K and subtract 1.
string k;
int n, d;
const int MOD = 1e9 + 7;
// dp[i][j]: if we have i 0-9 choices and we want j mod d, how many ways?
int dp[10001][101];
// solve: int i is the first letter index of the suffix we look at. left is the
// modulus mod D we... | #include <bits/stdc++.h>
using namespace std;
// look at 0 - K and subtract 1.
string k;
int n, d;
const int MOD = 1e9 + 7;
// dp[i][j]: if we have i 0-9 choices and we want j mod d, how many ways?
int dp[10002][101];
// solve: int i is the first letter index of the suffix we look at. left is the
// modulus mod D we... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"function.return_value.change"
] | 984,822 | 984,821 | u117022482 | cpp |
p03178 | #include <bits/stdc++.h>
#define int long long
#define counter(m) for (int i = 0; i < m; i++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine... | #include <bits/stdc++.h>
#define int long long
#define counter(m) for (int i = 0; i < m; i++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 984,828 | 984,829 | u052649041 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int mod = 1e9 ... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int mod = 1e9 ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 984,832 | 984,831 | u209457657 | cpp |
p03178 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
ll dp[1001][101][2];
ll solve(int i, string &s, int m, int d, bool tight) {
if (i == s.length()) {
if (m == 0) {
return 1;
}
return 0;
}
if (dp[i][m][tight] != -1)
return dp[i][m][tight];
int en = (... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
ll dp[10001][101][2];
ll solve(int i, string &s, int m, int d, bool tight) {
if (i == s.length()) {
if (m == 0) {
return 1;
}
return 0;
}
if (dp[i][m][tight] != -1)
return dp[i][m][tight];
int en = ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 984,838 | 984,837 | u746113754 | cpp |
p03178 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)... | [
"identifier.change",
"io.output.change"
] | 984,843 | 984,844 | u129079689 | cpp |
p03178 | #include <bits/stdc++.h>
#define l long
#define ll long long
#define ld long double
#define MOD 1000000007
#define MAX_N 10004
#define f first
#define s second
#define IOS \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#define l long
#define ll long long
#define ld long double
#define MOD 1000000007
#define MAX_N 10004
#define f first
#define s second
#define IOS \
ios_base::sync_with_stdio(false); ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 984,846 | 984,847 | u474855599 | cpp |
p03178 | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad... | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad... | [
"control_flow.branch.if.condition.change"
] | 984,850 | 984,851 | u232873057 | cpp |
p03178 | #include <bits/stdc++.h>
#define int long long
#define maxn 10005
#define maxc 105
using namespace std;
const int mod = 1e9 + 7;
// len sum last
int dp[maxn][maxc][10] = {};
string s;
int n, k;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> s >> k;
reverse(begin(s), end(s)... | #include <bits/stdc++.h>
#define int long long
#define maxn 10005
#define maxc 105
using namespace std;
const int mod = 1e9 + 7;
// len sum last
int dp[maxn][maxc][10] = {};
string s;
int n, k;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> s >> k;
reverse(begin(s), end(s)... | [
"literal.number.change",
"expression.operation.binary.change",
"literal.number.type.widen.change"
] | 984,869 | 984,870 | u635731706 | cpp |
p03178 | #include <bits/stdc++.h>
#define int long long
#define maxn 10005
#define maxc 105
using namespace std;
const int mod = 1e9 + 7;
// len sum last
int dp[maxn][maxc][10] = {};
string s;
int n, k;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> s >> k;
reverse(begin(s), end(s)... | #include <bits/stdc++.h>
#define int long long
#define maxn 10005
#define maxc 105
using namespace std;
const int mod = 1e9 + 7;
// len sum last
int dp[maxn][maxc][10] = {};
string s;
int n, k;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> s >> k;
reverse(begin(s), end(s)... | [
"assignment.change"
] | 984,871 | 984,870 | u635731706 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.