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 |
|---|---|---|---|---|---|---|---|
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9 + 7;
ll n, k, bd[101][200001], a;
int main() {
cin >> n >> k;
memset(bd, 0, sizeof(bd));
bd[0][k] = 1;
for (int i = 1; i <= n; i++) {
cin >> a;
bd[i][k] = 1;
for (int j = k - 1; j >= 0; j--) {
bd[i][j] = (b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9 + 7;
ll n, k, bd[101][200001], a;
int main() {
cin >> n >> k;
memset(bd, 0, sizeof(bd));
bd[0][k] = 1;
for (int i = 1; i <= n; i++) {
cin >> a;
bd[i][k] = 1;
for (int j = k - 1; j >= 0; j--) {
bd[i][j] = (b... | [
"assignment.change"
] | 980,904 | 980,903 | u762629133 | cpp |
p03172 | #include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
//order_of_key (k) : Number of items strictly smaller than k .
//find_by_order(k) : K-t... | #include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
//order_of_key (k) : Number of items strictly smaller than k .
//find_by_order(k) : K-t... | [
"literal.number.change",
"io.output.change"
] | 980,916 | 980,917 | u109311178 | cpp |
p03172 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.e... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.e... | [
"assignment.change"
] | 980,924 | 980,925 | u086672186 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<vector<long long>> mll;
typedef vector<pair<long long, long long>> vpl;
typedef pair<long long, long long> pll;
#define minimize(var, val) (var = min((val), var))
const long long MOD = 1e9 + 7;
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<vector<long long>> mll;
typedef vector<pair<long long, long long>> vpl;
typedef pair<long long, long long> pll;
#define minimize(var, val) (var = min((val), var))
const long long MOD = 1e9 + 7;
int main(... | [
"assignment.change"
] | 980,929 | 980,930 | u737620206 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<vector<long long>> mll;
typedef vector<pair<long long, long long>> vpl;
typedef pair<long long, long long> pll;
#define minimize(var, val) (var = min((val), var))
const long long MOD = 1e9 + 7;
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<vector<long long>> mll;
typedef vector<pair<long long, long long>> vpl;
typedef pair<long long, long long> pll;
#define minimize(var, val) (var = min((val), var))
const long long MOD = 1e9 + 7;
int main(... | [
"assignment.value.change",
"assignment.change"
] | 980,931 | 980,930 | u737620206 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<vector<long long>> mll;
typedef vector<pair<long long, long long>> vpl;
typedef pair<long long, long long> pll;
#define minimize(var, val) (var = min((val), var))
const long long MOD = 1e9 + 7;
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<vector<long long>> mll;
typedef vector<pair<long long, long long>> vpl;
typedef pair<long long, long long> pll;
#define minimize(var, val) (var = min((val), var))
const long long MOD = 1e9 + 7;
int main(... | [
"assignment.change"
] | 980,932 | 980,933 | u513227008 | cpp |
p03172 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#de... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#de... | [
"assignment.change"
] | 980,942 | 980,943 | u509031869 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, j, n, k;
cin >> n >> k;
vector<long long int> a(n);
for (i = 0; i < n; i++)
cin >> a[i];
long long int mod = 1000000007;
vector<vector<long long int>> poss(n + 1);
poss[1] = vector<l... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, j, n, k;
cin >> n >> k;
vector<long long int> a(n);
for (i = 0; i < n; i++)
cin >> a[i];
long long int mod = 1000000007;
vector<vector<long long int>> poss(n + 1);
poss[1] = vector<l... | [
"expression.operation.binary.remove"
] | 980,944 | 980,945 | u780411062 | cpp |
p03172 | #include <algorithm>
#include <iostream>
using namespace std;
long long int MOD = 1000000007;
long long int dp[105][100005], sum[105][100005];
int N, K;
int a[100005];
int main(void) {
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
dp[0][K] = 1;
for (int i = 1; i <= N; i++) {
s... | #include <algorithm>
#include <iostream>
using namespace std;
long long int MOD = 1000000007;
long long int dp[105][100005], sum[105][100005];
int N, K;
int a[100005];
int main(void) {
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
dp[0][K] = 1;
for (int i = 1; i <= N; i++) {
s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 980,954 | 980,955 | u835297884 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << " = " << x << endl;
#define MAXN 112
#define MAXK 112345
#define ll long long
#define fi first
#define se second
#define pll pair<ll, ll>
#define MOD 1000000007
int N, K;
int vals[MAXN];
ll dp[MAXN][MAXK];
ll prefix[MAXN][MAXK];
ll add(ll a, ... | #include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << " = " << x << endl;
#define MAXN 112
#define MAXK 112345
#define ll long long
#define fi first
#define se second
#define pll pair<ll, ll>
#define MOD 1000000007
int N, K;
int vals[MAXN];
ll dp[MAXN][MAXK];
ll prefix[MAXN][MAXK];
ll add(ll a, ... | [
"expression.operation.binary.add"
] | 980,956 | 980,957 | u183528320 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define llinf 1e17
#define nllinf -4e18
#define vll vector<ll>
#define sll set<ll>
#define pll pair<ll, ll>
#define vpll vector<pair<ll, ll>>
#define repup(a, b, i) for (i = a; i <= b; i++)
#define repdown(a, b, i) for (i = b; i >= a; i--)
#define re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define llinf 1e17
#define nllinf -4e18
#define vll vector<ll>
#define sll set<ll>
#define pll pair<ll, ll>
#define vpll vector<pair<ll, ll>>
#define repup(a, b, i) for (i = a; i <= b; i++)
#define repdown(a, b, i) for (i = b; i >= a; i--)
#define re... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 980,960 | 980,961 | u651678455 | cpp |
p03172 | #include <iostream>
using namespace std;
int a[101];
long long b[101][100005];
long long c[101][100005];
int main() {
int mod = 1000000000 + 7;
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < k; i++)
if (i <= a[0])
b[1][i] = 1;
for (int i = 2; i <= n; i++... | #include <iostream>
using namespace std;
int a[101];
long long b[101][100005];
long long c[101][100005];
int main() {
int mod = 1000000000 + 7;
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i <= k; i++)
if (i <= a[0])
b[1][i] = 1;
for (int i = 2; i <= n; i+... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 980,968 | 980,969 | u933569811 | cpp |
p03172 | #include <bits/stdc++.h>
#define ld long double
#define F first
#define S second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define reunique(x) (x).resize(std::unique(all(x)) - (x).begin())
#define roflan ... | #include <bits/stdc++.h>
#define ld long double
#define F first
#define S second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define reunique(x) (x).resize(std::unique(all(x)) - (x).begin())
#define roflan ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 980,974 | 980,975 | u266436174 | cpp |
p03172 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#i... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#i... | [
"assignment.change"
] | 980,976 | 980,977 | u922164368 | cpp |
p03172 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1));
rep(i, n + 1) { dp[i][0] = 1; }
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1));
rep(i, n + 1) { dp[i][0] = 1; }
... | [
"assignment.change"
] | 980,978 | 980,979 | u762183504 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
fo... | [
"assignment.change"
] | 980,986 | 980,987 | u741856489 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(x) (x).begin(), (x).end()
#define foreach(u... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(x) (x).begin(), (x).end()
#define foreach(u... | [
"expression.operation.binary.add"
] | 980,995 | 980,996 | u057866967 | cpp |
p03172 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define pii pair<int, int>
#define ll long long
#define IMAX 1000000007
#define in2d(i, j, H, W) (0 <= i && i < H && 0 <= j && j < W)
using ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define pii pair<int, int>
#define ll long long
#define IMAX 1000000007
#define in2d(i, j, H, W) (0 <= i && i < H && 0 <= j && j < W)
using ... | [
"assignment.change"
] | 980,999 | 981,000 | u537874719 | cpp |
p03172 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define pii pair<int, int>
#define ll long long
#define IMAX 1000000007
#define in2d(i, j, H, W) (0 <= i && i < H && 0 <= j && j < W)
using ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define pii pair<int, int>
#define ll long long
#define IMAX 1000000007
#define in2d(i, j, H, W) (0 <= i && i < H && 0 <= j && j < W)
using ... | [
"call.arguments.change",
"assignment.change"
] | 981,001 | 981,000 | u537874719 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define mp make_pair
#define pb push_back
#define xx first... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define mp make_pair
#define pb push_back
#define xx first... | [] | 981,002 | 981,003 | u420597302 | cpp |
p03172 | #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.change"
] | 981,004 | 981,005 | u941028483 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vpl = vector<pll>;
using vvpl = vector<vpl>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ld = long double;
using vd = vector<ld>;
usin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vpl = vector<pll>;
using vvpl = vector<vpl>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ld = long double;
using vd = vector<ld>;
usin... | [] | 981,006 | 981,007 | u615346437 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vpl = vector<pll>;
using vvpl = vector<vpl>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ld = long double;
using vd = vector<ld>;
usin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vpl = vector<pll>;
using vvpl = vector<vpl>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ld = long double;
using vd = vector<ld>;
usin... | [
"assignment.change"
] | 981,008 | 981,007 | u615346437 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, mod = 1000000007;
cin >> n >> k;
vector<int> A(n, 0);
for (int i = 0; i < n; i++)
cin >> A[i];
vector<vector<long long int>> dp(n, vector<long long int>(k + 1, 0));
vector<vector<long long int>> prefix(n, vector<long long int>(k + 1, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, mod = 1000000007;
cin >> n >> k;
vector<int> A(n, 0);
for (int i = 0; i < n; i++)
cin >> A[i];
vector<vector<long long int>> dp(n, vector<long long int>(k + 1, 0));
vector<vector<long long int>> prefix(n, vector<long long int>(k + 1, ... | [
"assignment.change"
] | 981,009 | 981,010 | u719635221 | cpp |
p03172 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9L + 7;
int n;
vector<int> inp;
vector<vector<ll>> dp;
ll candp(int k, int i = 0) {
// cout<<i<<" "<<j<<" "<<c<<" "<<sum<<'\n';
if (k == 0)
return 1;
if (i == n)
return 0;
if (dp[i][k] != -1)
return dp[i][k];
ll ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9L + 7;
int n;
vector<int> inp;
vector<vector<ll>> dp;
ll candp(int k, int i = 0) {
// cout<<i<<" "<<j<<" "<<c<<" "<<sum<<'\n';
if (k == 0)
return 1;
if (i == n)
return 0;
if (dp[i][k] != -1)
return dp[i][k];
ll ... | [
"expression.operation.unary.arithmetic.remove"
] | 980,802 | 980,803 | u351351871 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int m = 1e9 + 7;
int a[n + 1], s[k + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1][k + 1];
dp[0][0] = 1;
for (i = 1; i <= k; i++)
dp[0][i] = 0;
for (i = 1; i <= n; i++) {
s[0] = dp[i - 1][0]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int m = 1e9 + 7;
int a[n + 1], s[k + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1][k + 1];
dp[0][0] = 1;
for (i = 1; i <= k; i++)
dp[0][i] = 0;
for (i = 1; i <= n; i++) {
s[0] = dp[i - 1][0]... | [
"assignment.change"
] | 980,804 | 980,805 | u391913928 | cpp |
p03172 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
typedef long long ll;
#define pb push_back
typedef pair<ll, ll> pi;
... |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
typedef long long ll;
#define pb push_back
typedef pair<ll, ll> pi;
... | [
"assignment.change"
] | 980,806 | 980,807 | u230561415 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll int
ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, k;
cin >> n >> k;
ll x[n], dp[k + 1] = {};
dp[0] = 1;
for (ll &i : x)
cin >> i;
for (ll i = 0; i < n; i++) {
ll pre[k + 2] = {};
for (ll j = 0; j <= k; j++)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, k;
cin >> n >> k;
ll x[n], dp[k + 1] = {};
dp[0] = 1;
for (ll &i : x)
cin >> i;
for (ll i = 0; i < n; i++) {
ll pre[k + 2] = {};
for (ll j = 0; j <= k;... | [
"preprocessor.define.value.change",
"call.arguments.change"
] | 980,808 | 981,011 | u699490860 | cpp |
p03172 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#incl... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#incl... | [
"call.arguments.change"
] | 981,012 | 981,013 | u406924690 | cpp |
p03172 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#incl... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#incl... | [
"call.arguments.change"
] | 981,014 | 981,013 | u406924690 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _cin \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define READ freopen("input.txt", "r", stdin);
#define WRITE freopen("output... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _cin \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define READ freopen("input.txt", "r", stdin);
#define WRITE freopen("output... | [
"assignment.change"
] | 981,017 | 981,018 | u272596102 | cpp |
p03172 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int solve(vector<int> &v, int n, int k) {
long long dp[n + 2][k + 2];
for (int j = 0; j <= k; j++)
dp[1][j] = (j > v[1]) ? 0 : 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
dp[i][j] = dp[i - 1][j... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int solve(vector<int> &v, int n, int k) {
long long dp[n + 2][k + 2];
for (int j = 0; j <= k; j++)
dp[1][j] = (j > v[1]) ? 0 : 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
dp[i][j] = dp[i - 1][j... | [
"assignment.change"
] | 981,023 | 981,024 | u817291402 | cpp |
p03172 | #include <bits/stdc++.h>
#define boost_io \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define debug(x) cout << #x << ":" << ... | #include <bits/stdc++.h>
#define boost_io \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define debug(x) cout << #x << ":" << ... | [
"expression.operation.binary.add"
] | 981,030 | 981,031 | u087802159 | cpp |
p03172 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ld double
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n + 2][k + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ld double
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n + 2][k + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i ... | [
"assignment.change"
] | 981,032 | 981,033 | u332705919 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int solve(vector<int> &vec, int n, int k) {
int dp[n + 2][k + 2];
for (int j = 0; j <= k; j++)
dp[1][j] = (j > vec[1]) ? 0 : 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int solve(vector<int> &vec, int n, int k) {
int dp[n + 2][k + 2];
for (int j = 0; j <= k; j++)
dp[1][j] = (j > vec[1]) ? 0 : 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (j == 0)
... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 981,036 | 981,037 | u922620013 | cpp |
p03172 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ff first
#define endl "\n"
#define ss second
#define li list<int>
#define vi vector<int>
#define ll long long int
#define pii pair<int, int>
#define vii vector<pair<int, int>>
#define mp ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ff first
#define endl "\n"
#define ss second
#define li list<int>
#define vi vector<int>
#define ll long long int
#define pii pair<int, int>
#define vii vector<pair<int, int>>
#define mp ... | [
"assignment.change"
] | 981,045 | 981,046 | u535940884 | cpp |
p03172 | #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;
int main() {
ll n, k;
cin >> n >> k;
vec a(n);
for (ll i = 0; i < n; i++)
cin >> a[i];
... | #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;
int main() {
ll n, k;
cin >> n >> k;
vec a(n);
for (ll i = 0; i < n; i++)
cin >> a[i];
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 981,047 | 981,048 | u718758485 | cpp |
p03172 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int a[n + 2];
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 2][k + 2];
for (int j = 0; j <= k; j++) {
dp[1][j] = a[1] >= j ? 1 : 0;
}
for... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int a[n + 2];
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 2][k + 2];
for (int j = 0; j <= k; j++) {
dp[1][j] = a[1] >= j ? 1 : 0;
}
for... | [
"assignment.change"
] | 981,049 | 981,050 | u536383397 | cpp |
p03172 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int a[n + 2];
a[0] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 2][k + 2];
for (int j = 0; j <= k; j++) {
dp[1][j] = a[1] >= j ? 1 : 0;
}
for (int ... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int a[n + 2];
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 2][k + 2];
for (int j = 0; j <= k; j++) {
dp[1][j] = a[1] >= j ? 1 : 0;
}
for... | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 981,051 | 981,050 | u536383397 | cpp |
p03172 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int a[n + 2];
a[0] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 2][k + 2];
for (int j = 0; j <= k; j++) {
dp[1][j] = a[1] >= j ? 1 : 0;
}
for (int ... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int a[n + 2];
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 2][k + 2];
for (int j = 0; j <= k; j++) {
dp[1][j] = a[1] >= j ? 1 : 0;
}
for... | [
"assignment.change",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 981,052 | 981,050 | u536383397 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
ll arr[n + 1];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
ll dp[n + 1][k + 1]; // dp[i][j] is number of ways to distribute j candies
// among fir... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
ll arr[n + 1];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
ll dp[n + 1][k + 1]; // dp[i][j] is number of ways to distribute j candies
// among fir... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 981,058 | 981,059 | u238930677 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint MOD = 1e9 + 7;
signed main() {
lint N, K;
cin >> N >> K;
vector<lint> a(N);
for (lint i = 0; i < N; i++)
cin >> a[i];
vector<vector<lint>> dp(N + 1, vector<lint>(K + 1, 0));
for (lint i = 0; i <= N; i++)
dp[i][0] = 1;
... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint MOD = 1e9 + 7;
signed main() {
lint N, K;
cin >> N >> K;
vector<lint> a(N);
for (lint i = 0; i < N; i++)
cin >> a[i];
vector<vector<lint>> dp(N + 1, vector<lint>(K + 1, 0));
for (lint i = 0; i <= N; i++)
dp[i][0] = 1;
... | [
"assignment.change"
] | 981,064 | 981,065 | u265359795 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define dbg(n) cout << #n << ' ' << n << endl;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define dbg(n) cout << #n << ' ' << n << endl;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i]... | [
"assignment.change"
] | 981,068 | 981,069 | u486906248 | cpp |
p03172 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define inp 20
#define check exit(0)
#define nl cout << endl;
#define mod 1000000007
#define ll long long int
#define trace(x) cerr << #x << " : " << x << endl;
#define deb(v) ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define inp 20
#define check exit(0)
#define nl cout << endl;
#define mod 1000000007
#define ll long long int
#define trace(x) cerr << #x << " : " << x << endl;
#define deb(v) ... | [
"assignment.value.change"
] | 981,070 | 981,071 | u319910051 | cpp |
p03172 | #include <bits/stdc++.h>
#define ll long long
#define INF LLONG_MAX
#define dd double
#define fi first
#define se second
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define dll deque<long long>
#define qll queue<long long>... | #include <bits/stdc++.h>
#define ll long long
#define INF LLONG_MAX
#define dd double
#define fi first
#define se second
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define dll deque<long long>
#define qll queue<long long>... | [] | 981,072 | 981,073 | u228876479 | cpp |
p03172 | #include <bits/stdc++.h>
#define ll long long
#define INF LLONG_MAX
#define dd double
#define fi first
#define se second
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define dll deque<long long>
#define qll queue<long long>... | #include <bits/stdc++.h>
#define ll long long
#define INF LLONG_MAX
#define dd double
#define fi first
#define se second
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define dll deque<long long>
#define qll queue<long long>... | [] | 981,074 | 981,073 | u228876479 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
int solve(vector<int> &v, int n, int k) {
ve... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
int solve(vector<int> &v, int n, int k) {
ve... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 981,078 | 981,079 | u210383346 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
// 自動でmodを取ってくれる整数型
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
// 自動でmodを取ってくれる整数型
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;... | [
"expression.operation.binary.remove"
] | 981,083 | 981,084 | u393698851 | cpp |
p03172 | // AUTHOR: RAVAN_2070
// PUNE INSTITUTE OF COMPUTER TECHNOLOGY
// Atcoder Educational DP
// M-Candies
/*
I ♥ CLARICE STARLING
EXPLAINATION BELOW->
Dp
*/
// Iterative Solution
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fastio ... | // AUTHOR: RAVAN_2070
// PUNE INSTITUTE OF COMPUTER TECHNOLOGY
// Atcoder Educational DP
// M-Candies
/*
I ♥ CLARICE STARLING
EXPLAINATION BELOW->
Dp
If you think in terms of Brute force
Ans can found by considering all subsequences for which sum of candies given
is exactly == K and just go on a... | [
"assignment.change"
] | 981,089 | 981,090 | u799238092 | cpp |
p03172 | // AUTHOR: RAVAN_2070
// PUNE INSTITUTE OF COMPUTER TECHNOLOGY
// Atcoder Educational DP
// M-Candies
/*
I ♥ CLARICE STARLING
EXPLAINATION BELOW->
Dp
*/
// Iterative Solution
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fastio ... | // AUTHOR: RAVAN_2070
// PUNE INSTITUTE OF COMPUTER TECHNOLOGY
// Atcoder Educational DP
// M-Candies
/*
I ♥ CLARICE STARLING
EXPLAINATION BELOW->
Dp
*/
// Iterative Solution
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fastio ... | [
"assignment.change"
] | 981,089 | 981,091 | u799238092 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = (int)1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll a[n + 1], dp[n + 1][k + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0][0] = 1;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = (int)1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll a[n + 1], dp[n + 1][k + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0][0] = 1;
for (int i =... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 981,096 | 981,097 | u217234114 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = (int)1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll a[n + 1], dp[n + 1][k + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0][0] = 1;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = (int)1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll a[n + 1], dp[n + 1][k + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0][0] = 1;
for (int i =... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 981,098 | 981,097 | u217234114 | cpp |
p03172 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ... | [
"assignment.change"
] | 981,104 | 981,105 | u639032323 | cpp |
p03172 | // dp(i,j) -> no of ways to distribute j candies to first i children
/*
dp(n,k) = dp(n-1,k) + dp(n-1,k-1) + dp(n-1,k-2) + ...... + dp(n-1,k-an)
dp(i,j) = dp(i-1,j-x) for x from [0,ai]
base case:-
dp(1,j) = {
1 , j<=a1
0 , j>a1
}
dp(i,k-1) = dp(i,k) - dp(i-1,k) + dp(i-1,k-1-ai)
dp(... | // dp(i,j) -> no of ways to distribute j candies to first i children
/*
dp(n,k) = dp(n-1,k) + dp(n-1,k-1) + dp(n-1,k-2) + ...... + dp(n-1,k-an)
dp(i,j) = dp(i-1,j-x) for x from [0,ai]
base case:-
dp(1,j) = {
1 , j<=a1
0 , j>a1
}
dp(i,k-1) = dp(i,k) - dp(i-1,k) + dp(i-1,k-1-ai)
dp(... | [
"assignment.change"
] | 981,106 | 981,107 | u493816639 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1e9 + 7;
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<vector<long long>> dp(N, vector<long long>(K + 1, 0));
for (int i = 0; i < N; i++) {
for (int j = 0; j < K + 1; j++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int mod = 1e9 + 7;
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<vector<long long>> dp(N, vector<long long>(K + 1, 0));
for (int i = 0; i < N; i++) {
for (int j = 0; j < K + 1; j++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"expression.operator.change",
"assignment.change"
] | 981,108 | 981,109 | u929569377 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
int main() {
int mod = 1e9 + 7;
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<vector<long long>> dp(N, vector<long long>(K + 1, 0));
for (int i = 0; i < N; i++) {
for (int j = 0; j < K + 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int mod = 1e9 + 7;
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<vector<long long>> dp(N, vector<long long>(K + 1, 0));
for (int i = 0; i < N; i++) {
for (int j = 0; j < K + 1; j++) {
... | [
"expression.operator.change",
"assignment.change"
] | 981,110 | 981,109 | u929569377 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#d... | [
"assignment.change"
] | 981,111 | 981,112 | u867529352 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 1e9 + 5;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n + 1);
for (auto i = 1; i <= n; ++i) {
cin >> a[i];
}
// dp[i][j] - No. of ways to distribute j... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 1e9 + 5;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n + 1);
for (auto i = 1; i <= n; ++i) {
cin >> a[i];
}
// dp[i][j] - No. of ways to distribute j... | [
"assignment.change"
] | 981,117 | 981,118 | u859247867 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define INF 9223372036854;
#define ll long long
const long long m = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
ll dp[2][k + 1];
memset(dp, 0, sizeof(dp));
ll arr[n] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll i, j, x, l, c;
for (i =... | #include <bits/stdc++.h>
using namespace std;
#define INF 9223372036854;
#define ll long long
const long long m = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
ll dp[2][k + 1];
memset(dp, 0, sizeof(dp));
ll arr[n] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll i, j, x, l, c;
for (i =... | [
"expression.operation.binary.add"
] | 981,119 | 981,120 | u759567410 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7; /// A simpler way to write 1,000,000,007
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 1][k + 1];
dp[0][0] = 1;
for (int i = 1; i <= k; i++) /// Set the initial values
... | #include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7; /// A simpler way to write 1,000,000,007
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 1][k + 1];
dp[0][0] = 1;
for (int i = 1; i <= k; i++) /// Set the initial values
... | [
"literal.number.change",
"assignment.value.change"
] | 981,123 | 981,124 | u091850723 | cpp |
p03172 | #include <algorithm>
#include <iostream>
#include <vector>
#define pb push_back
#define mp make_pair
using namespace std;
const long long mod = 1e9 + 7;
void solve() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<long long> dp(k + 1, ... | #include <algorithm>
#include <iostream>
#include <vector>
#define pb push_back
#define mp make_pair
using namespace std;
const long long mod = 1e9 + 7;
void solve() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<long long> dp(k + 1, ... | [
"expression.operation.binary.add"
] | 981,125 | 981,126 | u183606119 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define pb push_back
#define mk make_pair
#define precise(x) cout << fixed << setprecision(12) << x
#define test cout << "#";
const ll INF = 1e18L + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define pb push_back
#define mk make_pair
#define precise(x) cout << fixed << setprecision(12) << x
#define test cout << "#";
const ll INF = 1e18L + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
... | [] | 981,131 | 981,132 | u466535000 | cpp |
p03172 |
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... |
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | [
"expression.operation.binary.add"
] | 981,133 | 981,134 | u829147556 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fr(i, n) for (int i = 0; i < n; i++)
#define rep(i, st, en) for (int i = st; i <= en; i++)
#define repn(i, st, en) for (int i = st; i >= en; i--)
#define sq(a) (a * a)
typedef long long ll;
typedef pair<int, in... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fr(i, n) for (int i = 0; i < n; i++)
#define rep(i, st, en) for (int i = st; i <= en; i++)
#define repn(i, st, en) for (int i = st; i >= en; i--)
#define sq(a) (a * a)
typedef long long ll;
typedef pair<int, in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 981,135 | 981,136 | u639514683 | cpp |
p03172 | /*
author : Divyansh Gupta
*/
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
void print_err() { cerr << "\n"; }
template <class T, class... Arg> void print_err(T x, Arg &&..... | /*
author : Divyansh Gupta
*/
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
void print_err() { cerr << "\n"; }
template <class T, class... Arg> void print_err(T x, Arg &&..... | [
"assignment.change"
] | 981,139 | 981,140 | u992065512 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, string> PIS;
typedef vector<int> vec;
typedef priority_queue<int> PQ;
#define endl '\n'
#define pi 3.141592653589793
#define pb push_back
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, string> PIS;
typedef vector<int> vec;
typedef priority_queue<int> PQ;
#define endl '\n'
#define pi 3.141592653589793
#define pb push_back
#d... | [
"assignment.change"
] | 981,141 | 981,142 | u829019938 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define f(i, x, y) for (int i = x; i < y; i++)
#define ll long long
#define mp make_pair
#define F first
#define S second
#define N 100005
#define mod 1000000007
int main() {
int n, k;
cin >> n >> k;
int a[n];
f(i, 0, n) cin >> a[i];
int dp[n + 1][k + 1];
mem... | #include <bits/stdc++.h>
using namespace std;
#define f(i, x, y) for (int i = x; i < y; i++)
#define ll long long
#define mp make_pair
#define F first
#define S second
#define N 100005
#define mod 1000000007
int main() {
int n, k;
cin >> n >> k;
int a[n];
f(i, 0, n) cin >> a[i];
ll dp[n + 1][k + 1];
mems... | [
"variable_declaration.type.change"
] | 981,143 | 981,144 | u440947888 | cpp |
p03172 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define cyes cout << "YES" << endl
#define cno cout << "NO" << endl
#define sp << " " <<
#define cst(x) cout << fixed << setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
using namespace std;
using... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define cyes cout << "YES" << endl
#define cno cout << "NO" << endl
#define sp << " " <<
#define cst(x) cout << fixed << setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
using namespace std;
using... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 981,158 | 981,159 | u314260680 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INTF 1000000007
int main() {
int n, k;
cin >> n >> k;
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
vector<ll> pref(k + 1, 0);
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
pref[0] = dp[i - 1][0... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INTF 1000000007
int main() {
int n, k;
cin >> n >> k;
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
vector<ll> pref(k + 1, 0);
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
pref[0] = dp[i - 1][0... | [
"expression.operation.binary.remove"
] | 981,160 | 981,161 | u060865231 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
// input_from_file;
ll n, m, k, x;
cin >> n >> k;
vector<ll> vec(n + 1, 0);
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
// input_from_file;
ll n, m, k, x;
cin >> n >> k;
vector<ll> vec(n + 1, 0);
... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 981,162 | 981,163 | u066630187 | cpp |
p03173 | #include <bits/stdc++.h>
#define REP(i, a, b) for (long long i = a; i <= b; ++i)
#define REPN(i, a, b) for (long long i = a; i <= b; --i)
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rep0(i, b) for (long long i = 0; i < b; ++i)
#define REP0(i, b) for (long long i = 0; i <= b; ++i)
#include <cmath>
#in... | #include <bits/stdc++.h>
#define REP(i, a, b) for (long long i = a; i <= b; ++i)
#define REPN(i, a, b) for (long long i = a; i <= b; --i)
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rep0(i, b) for (long long i = 0; i < b; ++i)
#define REP0(i, b) for (long long i = 0; i <= b; ++i)
#include <cmath>
#in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 981,170 | 981,171 | u747883255 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<long long int> A(n);
for (int i = 0; i < n; ++i)
cin >> A[i];
vector<vector<long long int>> dp(n, vector<long long int>(n, INT_MAX));
int L, R;
for (L = n - 1; L >= 0; --L) {
for (R = L; R < n; ++... | // C++ program to print all the cycles
// in an undirected graph
#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<long long int> A(n);
for (int i = 0; i < n; ++i)
cin >> A[i];
vector<vector<long long int>> dp(n, vector<long long int>(n, 1e18 + 8));
in... | [
"assignment.change"
] | 981,177 | 981,178 | u150020640 | cpp |
p03173 | #include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN = 500005;
const long MOD = (long)(1e9 + 7);
vector<int> adj[MAXN];
vector<pair<int, int>> G[MAXN];
Int N, M, K;
Int B, C, H, W;
Int X, Y, Z;
vector<Int> A;
Int ceilS(Int x, Int y) { return (x + y - 1) / y; }
using... | #include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN = 500005;
const long MOD = (long)(1e9 + 7);
vector<int> adj[MAXN];
vector<pair<int, int>> G[MAXN];
Int N, M, K;
Int B, C, H, W;
Int X, Y, Z;
vector<Int> A;
Int ceilS(Int x, Int y) { return (x + y - 1) / y; }
using... | [] | 981,181 | 981,182 | u212948109 | cpp |
p03173 | #include <cstring>
#include <iostream>
using namespace std;
int a[401];
int dp[401][401], h[401][401];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
memset(dp, 0x3f, sizeof(dp));
for (int len = 1; len <= n; len++)
for (int i = 1; i <= n; i++) {
int j = i + len - 1;
... | #include <cstring>
#include <iostream>
using namespace std;
long long a[401];
long long dp[401][401], h[401][401];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
memset(dp, 0x3f, sizeof(dp));
for (int len = 1; len <= n; len++)
for (int i = 1; i <= n; i++) {
int j = i + l... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 981,185 | 981,186 | u490890356 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | [] | 981,193 | 981,194 | u900229905 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll, pair<ll, char>>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll, pair<ll, char>>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) ... | [] | 981,197 | 981,198 | u806983635 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll, pair<ll, char>>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll, pair<ll, char>>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) ... | [
"identifier.replace.remove",
"literal.replace.add"
] | 981,200 | 981,198 | u806983635 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
vector<int> imos(N + 1);
vector<vector<int64_t>> dp(N, vector<int64_t>(N));
for (int i = 0; i < N; i++) {
cin >> p[i];
imos[i + 1] = p[i];
imos[i + 1] += imos[i];
}
for (int i = 1; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> p(N);
vector<int64_t> imos(N + 1);
vector<vector<int64_t>> dp(N, vector<int64_t>(N));
for (int i = 0; i < N; i++) {
cin >> p[i];
imos[i + 1] = p[i];
imos[i + 1] += imos[i];
}
for (int i = 1; i < N; i... | [
"variable_declaration.type.primitive.change"
] | 981,203 | 981,204 | u158290747 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
cin.sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
cin.sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define rep(i, ... | [
"variable_declaration.type.change"
] | 981,207 | 981,206 | u176621115 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define fr(i... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define fr(i... | [] | 981,212 | 981,213 | u928817789 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define fr(i... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define fr(i... | [
"variable_declaration.value.change",
"identifier.change"
] | 981,214 | 981,215 | u928817789 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define fr(i... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define fr(i... | [
"variable_declaration.value.change",
"identifier.change"
] | 981,216 | 981,217 | u928817789 | cpp |
p03173 | #include <bits/stdc++.h>
#define filename "slimes"
#define int long long
#define oo 1e9
#define N 405
using namespace std;
int n, a[N];
int f[N][N];
bool chk[N][N];
void open() {
// freopen(filename".inp","r",stdin) ;
// freopen(filename".out","w",stdout) ;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.ti... | #include <bits/stdc++.h>
#define filename "slimes"
#define int long long
#define oo 1e18
#define N 405
using namespace std;
int n, a[N];
int f[N][N];
bool chk[N][N];
void open() {
// freopen(filename".inp","r",stdin) ;
// freopen(filename".out","w",stdout) ;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.t... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 981,225 | 981,226 | u416328102 | cpp |
p03173 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll n, x... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll n, x... | [
"literal.number.change",
"variable_declaration.value.change"
] | 981,227 | 981,228 | u028221335 | cpp |
p03173 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int n, ... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll n, x... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 981,229 | 981,228 | u028221335 | cpp |
p03173 | // https://atcoder.jp/contests/dp/tasks/dp_n
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define gcd __gcd
#define inf INT_MAX
#define INF LLONG_MAX
#define minf INT_MIN
#d... | // https://atcoder.jp/contests/dp/tasks/dp_n
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define gcd __gcd
#define inf INT_MAX
#define INF LLONG_MAX
#define minf INT_MIN
#d... | [
"variable_declaration.type.change"
] | 981,230 | 981,231 | u315416184 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define int long long
#define pb push_back
#define mod 1000000007
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define inf 1e18
#define pre(x, y) fixed << setprecision(y) << x
#define pq priority_queue<int>
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define int long long
#define pb push_back
#define mod 1000000007
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define inf 1e18
#define pre(x, y) fixed << setprecision(y) << x
#define pq priority_queue<int>
#def... | [
"assignment.value.change",
"identifier.change"
] | 981,232 | 981,233 | u851992913 | cpp |
p03173 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [
"variable_declaration.type.change"
] | 981,234 | 981,235 | u881931540 | cpp |
p03173 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 981,236 | 981,235 | u881931540 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long... | [
"control_flow.loop.for.condition.change"
] | 981,246 | 981,247 | u023403724 | cpp |
p03173 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#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<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#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<in... | [
"io.output.change"
] | 981,257 | 981,258 | u682269149 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int MAX = 305;
const int NIL = -1;
const ll LINF = 1LL << 50;
const int mod = 1e+9 + 7;
/* global variables */
/* funciton */
/* main */
int main() {
int N;
cin >> N;
vector<ll> a(N);... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int MAX = 305;
const int NIL = -1;
const ll LINF = 1LL << 50;
const int mod = 1e+9 + 7;
/* global variables */
/* funciton */
/* main */
int main() {
int N;
cin >> N;
vector<ll> a(N);... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 981,259 | 981,260 | u603234915 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18L + 18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<int> a(N);
vector<vector<long long>> dp(N, vector<long long>(N));
for (int i = 0; i < N; ++i) {
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18L + 18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N;
cin >> N;
vector<long long> a(N);
vector<vector<long long>> dp(N, vector<long long>(N));
for (int i = 0; i < N; ++i) {
cin >> ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 981,261 | 981,262 | u934482833 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
const int MAX_N = 1e5 + 5;
const int MAX_L = 20; // ~ Log N
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vect... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
const int MAX_N = 1e5 + 5;
const int MAX_L = 20; // ~ Log N
const int MOD = 1e9 + 7;
const int INF = 1e18 + 7;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vec... | [
"literal.number.change",
"expression.operation.binary.change"
] | 981,263 | 981,264 | u022282624 | cpp |
p03173 | #include <climits>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
typedef long long LL;
constexpr int kMax = 400;
int main() {
LL dp[kMax][kMax];
int N;
std::cin >> N;
std::vector<LL> a(N), ac(N + 1);
for (int i = 0; i < N; ++i)
std::cin >> a[i];
ac[0] = 0;
for (int i = 0... | #include <climits>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
typedef long long LL;
constexpr int kMax = 401;
int main() {
LL dp[kMax][kMax];
int N;
std::cin >> N;
std::vector<LL> a(N), ac(N + 1);
for (int i = 0; i < N; ++i)
std::cin >> a[i];
ac[0] = 0;
for (int i = 0... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 981,267 | 981,268 | u116523315 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[401][401];
ll a[401];
void solve(ll n, ll m) {
if (dp[n][m] != -1) {
return;
}
dp[n][m] = INT_MAX;
ll sum = 0;
if (n == m) {
dp[n][m] = 0;
return;
}
for (int i = n; i <= m; i++) {
sum += a[i];
}
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[401][401];
ll a[401];
void solve(ll n, ll m) {
if (dp[n][m] != -1) {
return;
}
dp[n][m] = LONG_LONG_MAX;
ll sum = 0;
if (n == m) {
dp[n][m] = 0;
return;
}
for (int i = n; i <= m; i++) {
sum += a[i];
}
fo... | [
"assignment.value.change",
"identifier.change"
] | 981,269 | 981,270 | u139996323 | cpp |
p03173 | #include <cstring>
#include <iostream>
#include <vector>
#define INF (1LL << 60)
using namespace std;
long long int dp[3001][3001];
long long int sum[3001][3001];
long long int slimes(vector<int> &v, int i, int j) {
if (i == j)
return 0;
if (dp[i][j] != -1)
return dp[i][j]; // Look-Up
long long int minC... | #include <cstring>
#include <iostream>
#include <vector>
#define INF (1LL << 60)
using namespace std;
long long int dp[3001][3001];
long long int sum[3001][3001];
long long int slimes(vector<int> &v, int i, int j) {
if (i == j)
return 0;
if (dp[i][j] != -1)
return dp[i][j]; // Look-Up
long long int minC... | [
"call.arguments.change"
] | 981,271 | 981,272 | u148301183 | cpp |
p03173 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
void prefix(ll arr[], ll n, vector<ll> &sum) {
ll s = 0;
for (ll i = 0; i < n; i++) {
s = s + arr[i];
sum[i] = s;
// cout<<i<<" "<<sum[i]<<endl;
}
}
int main() {
ll n;
cin >> n;
ll arr[n];
... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
void prefix(ll arr[], ll n, vector<ll> &sum) {
ll s = 0;
for (ll i = 0; i < n; i++) {
s = s + arr[i];
sum[i] = s;
// cout<<i<<" "<<sum[i]<<endl;
}
}
int main() {
ll n;
cin >> n;
ll arr[n];
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.change"
] | 981,293 | 981,294 | u507656909 | cpp |
p03173 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n + 1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define f first
#def... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n + 1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define f first
#def... | [
"literal.number.change"
] | 981,303 | 981,304 | u205731847 | cpp |
p03173 |
#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 ll INF = 1e18;
int dp[405][405];
vector<int> s(405);
int dfs(int l, int r) {
if (dp[l][r] != -1)
return dp[l][r];
int now = 1001001001;
for (int i = l; i <= r - 1; ... |
#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 ll INF = 1e18;
ll dp[405][405];
vector<ll> s(405);
ll dfs(int l, int r) {
if (dp[l][r] != -1)
return dp[l][r];
ll now = INF;
for (int i = l; i <= r - 1; i++) {
... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 981,305 | 981,306 | u289381123 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.