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 |
|---|---|---|---|---|---|---|---|
p03031 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto k = vector<int>(m);
auto s = vector<vector<int>>(m);
auto p = vector<int>(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
f... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
auto k = vector<int>(m);
auto s = vector<vector<int>>(m);
auto p = vector<int>(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
f... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 841,821 | 841,820 | u855985627 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int n, m;
VI k(20), p(20);
int s[20][20];
int sj[20] = {0};
int ans = 0;
void dps(int i) {
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int n, m;
VI k(20), p(20);
int s[20][20];
int sj[20] = {0};
int ans = 0;
void dps(int i) {
if ... | [
"assignment.change"
] | 841,825 | 841,826 | u408650734 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int n, m;
VI k(20), p(20);
int s[20][20];
int sj[20] = {0};
int ans = 0;
void dps(int i) {
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int n, m;
VI k(20), p(20);
int s[20][20];
int sj[20] = {0};
int ans = 0;
void dps(int i) {
if ... | [
"assignment.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 841,827 | 841,826 | u408650734 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int bit, i, j, M, N;
int number[10], switches[10][10], onoff[10];
int ultimatesum = 0;
cin >> N >> M;
for (i = 0; i < M; i++) {
cin >> number[i];
for (j = 0; j < number[i]; j++)
scanf("%d", &switches[i][j]);
}
for (i = 0; i < M; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int bit, i, j, M, N;
int number[10], switches[10][10], onoff[10];
int ultimatesum = 0;
cin >> N >> M;
for (i = 0; i < M; i++) {
cin >> number[i];
for (j = 0; j < number[i]; j++)
scanf("%d", &switches[i][j]);
}
for (i = 0; i < M; i++... | [
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,840 | 841,841 | u399527001 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// alias
#define gcd __gcd
#define pb pu... | #include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// alias
#define gcd __gcd
#define pb pu... | [
"variable_declaration.value.change"
] | 841,850 | 841,851 | u303059352 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> v(k);
int x;
for (int i = 0; i < k; ++i) {
cin >> x;
v[i].resize(x);
for (int j = 0; j < x; ++j) {
cin >> v[i][j];
--v[i][j];
}
}
vector<int> p(k);
for (int i ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> v(k);
int x;
for (int i = 0; i < k; ++i) {
cin >> x;
v[i].resize(x);
for (int j = 0; j < x; ++j) {
cin >> v[i][j];
--v[i][j];
}
}
vector<int> p(k);
for (int i ... | [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 841,856 | 841,857 | u146240825 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int s[M] = {}, tmps, k, p[M];
for (int i = 0; i < M; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> tmps;
s[i] |= 1 << (tmps - 1);
}
}
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int s[M] = {}, tmps, k, p[M];
for (int i = 0; i < M; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> tmps;
s[i] |= 1 << (tmps - 1);
}
}
for (int i = 0; i < M; i++) {
cin >> p[i];
}
int... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,859 | 841,860 | u303454114 | cpp |
p03031 | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, n_pow = 0, ans = 0;
cin >> n >> m;
vector<vector<int>> s(m);
vector<int> p(m);
for (auto &ss : s) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int tmp;
cin >> tmp;
ss.push_b... | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, n_pow = 0, ans = 0;
cin >> n >> m;
vector<vector<int>> s(m);
vector<int> p(m);
for (auto &ss : s) {
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int tmp;
cin >> tmp;
ss.push_b... | [] | 841,861 | 841,862 | u911828387 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> vec(M);
for (int i = 0; i < M; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec[i][j];
--vec[i][j];
}
}
vector<int> p(M);
for (int i = 0... | [
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 841,863 | 841,864 | u031920644 | cpp |
p03031 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 841,870 | 841,871 | u378419207 | cpp |
p03031 | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
t... | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
t... | [] | 841,874 | 841,875 | u170650966 | cpp |
p03031 | #include <iostream>
using namespace std;
int n, m, k[15], s[15][15], p[15], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> k[i];
for (int j = 1; j <= k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 1; i <= m; i++)
cin >> p[i];
for (int i = 1; i < (1 << (n)); i++)... | #include <iostream>
using namespace std;
int n, m, k[15], s[15][15], p[15], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> k[i];
for (int j = 1; j <= k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 1; i <= m; i++)
cin >> p[i];
for (int i = 0; i < (1 << (n)); i++)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,876 | 841,877 | u790515578 | cpp |
p03031 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | [
"control_flow.branch.if.condition.change"
] | 841,890 | 841,891 | u658899890 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
vector<int> v[15];
int p[20];
int N, M;
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
v[i].push_back(x);
}
}
for (int i = 0; i < M; i++)
... | #include <iostream>
#include <vector>
using namespace std;
vector<int> v[15];
int p[20];
int N, M;
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
x--;
v[i].push_back(x);
}
}
for (int i = 0; i < M... | [
"expression.unary.arithmetic.add"
] | 841,903 | 841,904 | u090967649 | cpp |
p03031 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
vector<int> p(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int tmp;
cin >> tmp;
s[i].push_back(tmp);
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
vector<int> p(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int tmp;
cin >> tmp;
tmp--;
s[i].push_b... | [
"expression.unary.arithmetic.add"
] | 841,905 | 841,906 | u195054737 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
void check(int &ans, int N, int &M, vector<int> sw, vector<vector<int>> &vec,
vector<int> &p) {
if (N == 0) {
bool x = true;
for (int i = 0; i < M; i++) {
int y;
for (int j = 0; j < vec[i].size(); j++) {
y += sw[vec[i][j] - 1];
... | #include <bits/stdc++.h>
using namespace std;
void check(int &ans, int N, int &M, vector<int> sw, vector<vector<int>> &vec,
vector<int> &p) {
if (N == 0) {
bool x = true;
for (int i = 0; i < M; i++) {
int y = 0;
for (int j = 0; j < vec[i].size(); j++) {
y += sw[vec[i][j] - 1];... | [
"variable_declaration.value.change"
] | 841,909 | 841,910 | u664207511 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, s;
cin >> n >> m;
vector<vector<int>> light(m);
vector<int> p(n);
for (int i = 0; i < m; i++) {
cin >> k;
light[i] = vector<int>(k);
for (int j = 0; j < k; j++)
cin >> light[i][j];
}
for (int i = 0; i < m; i++)
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, s;
cin >> n >> m;
vector<vector<int>> light(m);
vector<int> p(n);
for (int i = 0; i < m; i++) {
cin >> k;
light[i] = vector<int>(k);
for (int j = 0; j < k; j++)
cin >> light[i][j];
}
for (int i = 0; i < m; i++)
c... | [] | 841,924 | 841,925 | u798086274 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// typedefリスト
typedef long long llint;
typedef vector<long long int> vint;
typedef vector<vector<int>> vvint;
typedef vector<string> vstr;
int main(v... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// typedefリスト
typedef long long llint;
typedef vector<long long int> vint;
typedef vector<vector<int>> vvint;
typedef vector<string> vstr;
int main(v... | [
"control_flow.branch.if.condition.change"
] | 841,930 | 841,931 | u846679133 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// typedefリスト
typedef long long llint;
typedef vector<long long int> vint;
typedef vector<vector<int>> vvint;
typedef vector<string> vstr;
int main(v... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// typedefリスト
typedef long long llint;
typedef vector<long long int> vint;
typedef vector<vector<int>> vvint;
typedef vector<string> vstr;
int main(v... | [
"control_flow.branch.if.condition.change"
] | 841,932 | 841,931 | u846679133 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cin.sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
x--;
s[i].pus... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cin.sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
int x;
cin >> x;
x--;
s[i].pus... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 841,935 | 841,936 | u846041485 | cpp |
p03031 | #include <bitset>
#include <iostream>
#include <iterator>
#include <sstream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> s(N, vector<int>());
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int n;
ci... | #include <bitset>
#include <iostream>
#include <iterator>
#include <sstream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> s(N, vector<int>());
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int n;
ci... | [
"control_flow.loop.for.initializer.change"
] | 841,939 | 841,940 | u013936801 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int *k = new int[m];
vector<vector<int>> s;
int *p = new int[m];
int max = 1;
for (int i = 0; i < n; i+... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int *k = new int[m];
vector<vector<int>> s;
int *p = new int[m];
int max = 1;
for (int i = 0; i < n; i+... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 841,947 | 841,948 | u961816320 | cpp |
p03031 | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
... | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
... | [
"literal.number.change",
"call.arguments.change"
] | 841,958 | 841,959 | u231573377 | cpp |
p03031 | #include <iostream>
using namespace std;
int N, M;
int bulb[11];
int p[11];
int countbit(int v) {
unsigned int c; // c accumulates the total bits set in v
for (c = 0; v; c++)
v &= v - 1; // clear the least significant bit set
return c;
}
int main() {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
in... | #include <iostream>
using namespace std;
int N, M;
int bulb[11];
int p[11];
int countbit(int v) {
unsigned int c; // c accumulates the total bits set in v
for (c = 0; v; c++)
v &= v - 1; // clear the least significant bit set
return c;
}
int main() {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 841,979 | 841,980 | u081249228 | cpp |
p03031 | // wawando's template
#include <algorithm>
#include <cctype>
#include <climits> // LLONG_MAX , LLONG_MIN , INT_MAX , INT_MIN
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime> //clock_t , clock() , CLOCKS_PER_SEC
#include <deque>
#include <fstream>
#include <functional>
#include ... | // wawando's template
#include <algorithm>
#include <cctype>
#include <climits> // LLONG_MAX , LLONG_MIN , INT_MAX , INT_MIN
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime> //clock_t , clock() , CLOCKS_PER_SEC
#include <deque>
#include <fstream>
#include <functional>
#include ... | [
"identifier.change",
"call.arguments.change"
] | 841,985 | 841,986 | u109770730 | cpp |
p03031 | #include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <vector>
using namespace std;
using Int = long long;
signed main() {
Int n, m;
cin >> n >> m;
vector<vector<Int>> k_s;
vector<Int> p;
for (Int i = 0; i < m; i++) {
Int tmp_k;
cin >> tmp_k;
vector<Int> tmp_vs;
tmp_vs.push... | #include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <vector>
using namespace std;
using Int = long long;
signed main() {
Int n, m;
cin >> n >> m;
vector<vector<Int>> k_s;
vector<Int> p;
for (Int i = 0; i < m; i++) {
Int tmp_k;
cin >> tmp_k;
vector<Int> tmp_vs;
tmp_vs.push... | [
"control_flow.loop.for.condition.change",
"call.arguments.add",
"call.arguments.change"
] | 841,987 | 841,988 | u148215098 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int k;
int s;
std::vector<int> mask(M, 0);
std::vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> s;
mask.at(i) |= (1 << s);
}
}
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int k;
int s;
std::vector<int> mask(M, 0);
std::vector<int> p(M);
for (int i = 0; i < M; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> s;
mask.at(i) |= (1 << s);
}
}
for (int i = 0; i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 841,989 | 841,990 | u578276786 | cpp |
p03031 | #include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<std::vector<int>> sij(M);
std::vector<int> p(M);
for (int i = 0; i < M; ++i) {
int k, s;
std::cin >> k;
sij[i].reserve(k);
for (int j = 0; j < k; ++j) {
std::cin >> s;
sij[i].push_back(s... | #include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<std::vector<int>> sij(M);
std::vector<int> p(M);
for (int i = 0; i < M; ++i) {
int k, s;
std::cin >> k;
sij[i].reserve(k);
for (int j = 0; j < k; ++j) {
std::cin >> s;
sij[i].push_back(s... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 841,993 | 841,994 | u477096296 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 841,999 | 842,000 | u906208439 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.array_dimensions.change"
] | 842,001 | 842,000 | u906208439 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
bool a[M][N];
rep(i, M) rep(j, N) a[i][j] = false;
rep(i, M) {
int k;
cin >> k;
rep(i, k) {
int x;
cin >> x;
x--;
a[i][x]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
bool a[M][N];
rep(i, M) rep(j, N) a[i][j] = false;
rep(i, M) {
int k;
cin >> k;
rep(j, k) {
int x;
cin >> x;
x--;
a[i][x]... | [] | 842,002 | 842,003 | u944316525 | cpp |
p03031 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, m, k[11], s[11][11], p[11], sum = 0;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> k[i];
for (int j = 1; j <= k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 1; i <= m; i++) {
cin >> p[... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, m, k[20], s[20][20], p[20], sum = 0;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> k[i];
for (int j = 1; j <= k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 1; i <= m; i++) {
cin >> p[... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 842,008 | 842,009 | u064722905 | cpp |
p03031 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, m, k[11], s[11][11], p[11], sum = 0;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> k[i];
for (int j = 1; j <= k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 1; i <= m; i++) {
cin >> p[... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, m, k[20], s[20][20], p[20], sum = 0;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> k[i];
for (int j = 1; j <= k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 1; i <= m; i++) {
cin >> p[... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 842,008 | 842,010 | u064722905 | cpp |
p03031 | #include <bits/stdc++.h>
#include <cmath>
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a > b ? b : a)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (lint i = (lint)(n); i > 0; --i)
#define reps(i, a, b) for (lint i = a; i <= (lint)(b); i++)
typedef long long lint;
typedef long doub... | #include <bits/stdc++.h>
#include <cmath>
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a > b ? b : a)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (lint i = (lint)(n); i > 0; --i)
#define reps(i, a, b) for (lint i = a; i <= (lint)(b); i++)
typedef long long lint;
typedef long doub... | [
"literal.number.change",
"call.arguments.change"
] | 842,036 | 842,037 | u365694286 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, k, kazu, kari, amari, max = 1, gomi, hantei, kotae, ans = 0;
cin >> n >> m;
int a[m][n], p[m];
for (i = 0; i < n; i++) {
max *= 2;
}
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
a[i][j] = 0;
}
}
for (i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, k, kazu, kari, amari, max = 1, gomi, hantei, kotae, ans = 0;
cin >> n >> m;
int a[m][n], p[m];
for (i = 0; i < n; i++) {
max *= 2;
}
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
a[i][j] = 0;
}
}
for (i =... | [
"assignment.change"
] | 842,043 | 842,044 | u016726316 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> K(M);
vector<int> S(10000000, 0);
for (int i = 0; i < M; i++) {
cin >> K[i];
// cout << K[i] << " ";
for (int j = M * i; j < M * i + K[i]; j++) {
... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> K(M);
vector<int> S(M * N + 10, 0);
for (int i = 0; i < M; i++) {
cin >> K[i];
for (int j = M * i; j < M * i + K[i]; j++) {
cin >> S[j];
}
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,047 | 842,048 | u190018920 | cpp |
p03031 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 842,049 | 842,050 | u222293734 | cpp |
p03031 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using names... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using names... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,058 | 842,059 | u194463155 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE se... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE se... | [
"expression.operation.binary.add"
] | 842,062 | 842,063 | u297590902 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 5, mod = 1e9 + 7;
vector<int> vi[15];
int a[15], p[15];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, k, x;
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
cin >> k;
while (k--) {
cin >> x;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 5, mod = 1e9 + 7;
vector<int> vi[15];
int a[15], p[15];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, k, x;
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
cin >> k;
while (k--) {
cin >> x;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 842,066 | 842,067 | u187582424 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define up(i, a, b) for (int i = (a); i <= (b); i++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define up(i, a, b) for (int i = (a); i <= (b); i++)... | [
"literal.number.change",
"call.arguments.change"
] | 842,069 | 842,070 | u084557456 | cpp |
p03031 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using... | [
"identifier.change",
"call.arguments.change"
] | 842,075 | 842,076 | u844133200 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 842,090 | 842,091 | u665172861 | cpp |
p03031 | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[]) {... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[]) {... | [
"expression.operation.binary.add"
] | 842,092 | 842,093 | u495704746 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> adj[15];
int nyala[15];
bool cek(int x) {
for (int i = 1; i <= m; i++) {
int tmp = 0;
for (int j = 0; j < adj[i].size(); j++) {
int cur = adj[i][j];
if ((1 << cur) & x)
tmp++;
}
if (nyala[i] != tmp % 2)
ret... | #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> adj[15];
int nyala[15];
bool cek(int x) {
for (int i = 1; i <= m; i++) {
int tmp = 0;
for (int j = 0; j < adj[i].size(); j++) {
int cur = adj[i][j] - 1;
if ((1 << cur) & x)
tmp++;
}
if (nyala[i] != tmp % 2)
... | [
"assignment.change"
] | 842,094 | 842,095 | u320128666 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typede... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typede... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 842,096 | 842,097 | u693027786 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typede... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(), a.end()
typedef pair<int, int> pint;
typede... | [
"variable_declaration.value.change",
"identifier.change",
"call.arguments.change"
] | 842,098 | 842,097 | u693027786 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> s(M);
for (int i = 0; i < N; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
s[i] |= (1 << --a);
}
}
ve... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> s(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
s[i] |= (1 << --a);
}
}
ve... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 842,101 | 842,102 | u587172770 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
s[i].resize(k);
for (... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
s[i].resize(k);
for (... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 842,113 | 842,112 | u261886891 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < ... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 842,116 | 842,117 | u843175622 | cpp |
p03031 | #include <cstdio>
#include <iostream>
#include <vector>
#define N 15
using namespace std;
int n, m, k, c, ans, p[N];
vector<int> s[N];
int main() {
int i, j, x, t;
cin >> n >> m;
for (i = 0; i < m; i++) {
scanf("%d", &k);
for (j = 0; j < k; j++) {
scanf("%d", &t);
s[j].push_back(t - 1);
}... | #include <cstdio>
#include <iostream>
#include <vector>
#define N 15
using namespace std;
int n, m, k, c, ans, p[N];
vector<int> s[N];
int main() {
int i, j, x, t;
cin >> n >> m;
for (i = 0; i < m; i++) {
scanf("%d", &k);
for (j = 0; j < k; j++) {
scanf("%d", &t);
s[i].push_back(t - 1);
}... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 842,122 | 842,123 | u230265105 | cpp |
p03031 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 842,124 | 842,125 | u783676040 | cpp |
p03031 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef unsigned char uchar;
#define umap unordered_map
const static ull IN... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef unsigned char uchar;
#define umap unordered_map
const static ull IN... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 842,126 | 842,127 | u097665156 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> S[N], T(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
S[i].push_back(s - 1);
}
}
for (int i = 0; i < M; i++) {
cin >> T[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> S[M], T(M);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
S[i].push_back(s - 1);
}
}
for (int i = 0; i < M; i++) {
cin >> T[... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 842,134 | 842,135 | u133391510 | cpp |
p03031 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (long long i = l; i < r; i++)
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
class dijkstra {
int V;
int d[100002];
priority_queue<P, vector<P>, greater<P>> que;
void update(i... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (long long i = l; i < r; i++)
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
class dijkstra {
int V;
int d[100002];
priority_queue<P, vector<P>, greater<P>> que;
void update(i... | [
"expression.operation.binary.remove"
] | 842,141 | 842,142 | u073057072 | cpp |
p03031 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 500500;
int n, m;
int a[100][100], p[110];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d", &a[i][0]);
for (int j = 1; j <= a[i][0]; j++)
scanf("%d", &a[i][j]);
}
for (int i = 1; i <= ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 500500;
int n, m;
int a[100][100], p[110];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d", &a[i][0]);
for (int j = 1; j <= a[i][0]; j++)
scanf("%d", &a[i][j]);
}
for (int i = 1; i <= ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 842,152 | 842,153 | u308881771 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m), p(m);
int s[10][10];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> k(m), p(m);
int s[10][10];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 842,172 | 842,173 | u949692208 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int s[N] = {0};
int d[M][N] = {0};
int p[M];
int k;
int ins;
int count = 0;
int sum;
int tmp;
int flug;
int max;
for (int i = 0; i < M; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> ins... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int s[N] = {0};
int d[M][N] = {0};
int p[M];
int k;
int ins;
int count = 0;
int sum;
int tmp;
int flug;
int max;
for (int i = 0; i < M; i++) {
cin >> k;
for (int j = 0; j < k; j++) {
cin >> ins... | [
"assignment.change"
] | 842,182 | 842,183 | u279066739 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n, m;
int x;
int k;
cin >> n >> m;
int sw[m][n];
int jou[m];
int ans = 0;
bool flag;
int nishin[n];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n, m;
int x;
int k;
cin >> n >> m;
int sw[m][n];
int jou[m];
int ans = 0;
bool flag;
int nishin[n];
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.change"
] | 842,184 | 842,185 | u806159048 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M), p(M);
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
s[i] = vector<int>(k[i]);
for (int j = 0; j < k[i]; j++)
cin >> s[i]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M), p(M);
vector<vector<int>> s(M);
for (int i = 0; i < M; i++) {
cin >> k[i];
s[i] = vector<int>(k[i]);
for (int j = 0; j < k[i]; j++)
cin >> s[i]... | [
"assignment.change"
] | 842,188 | 842,189 | u129667379 | cpp |
p03031 | #include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
int k[M];
std::vector<int> s[M];
int n = 1;
for (int i = 0; i < N; ++i)
n *= 2;
for (int i = 0; i < M; ++i) {
std::cin >> k[i];
for (int j = 0; j < k[i]; ++j) {
int tmp = 0;
std::cin >> tmp;
s[i... | #include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
int k[M];
std::vector<int> s[M];
int n = 1;
for (int i = 0; i < N; ++i)
n *= 2;
for (int i = 0; i < M; ++i) {
std::cin >> k[i];
for (int j = 0; j < k[i]; ++j) {
int tmp = 0;
std::cin >> tmp;
s[i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 842,190 | 842,191 | u047150897 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define LLINF (1LL << 60)
typedef long long ll;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
// C++14 (GCC 5.4.1)
int main() {
int N, M;
cin >> N >> M;
int k, l;
vector<int> S(M, 0), P(M);
rep(i, M) {
cin >> k;
... | #include <bits/stdc++.h>
using namespace std;
#define LLINF (1LL << 60)
typedef long long ll;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
// C++14 (GCC 5.4.1)
int main() {
int N, M;
cin >> N >> M;
int k, l;
vector<int> S(M, 0), P(M);
rep(i, M) {
cin >> k;
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 842,192 | 842,193 | u216459554 | cpp |
p03031 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,202 | 842,203 | u903311413 | cpp |
p03031 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,204 | 842,203 | u903311413 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | [
"expression.operation.binary.remove"
] | 842,211 | 842,212 | u962104148 | cpp |
p03031 | #include <bits/stdc++.h>
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pi 3.14159265
#define oo 1000000000
using namespace std;
#define prime 1000000007
const ll N = 300005;
#define W(x... | #include <bits/stdc++.h>
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pi 3.14159265
#define oo 1000000000
using namespace std;
#define prime 1000000007
const ll N = 300005;
#define W(x... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 842,213 | 842,214 | u680926371 | cpp |
p03031 | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> Bit(M, 0);
vector<long long> mod(M, 0);
for (int i = 0; i < N; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
Bit[i] ^= 1 << (s - 1);
... | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> Bit(M, 0);
vector<long long> mod(M, 0);
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
Bit[i] ^= 1 << (s - 1);
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 842,215 | 842,216 | u501643136 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
cin >> a;
for (int i = 0; i < a; i++) {
int t;
cin >> t;
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
for (int i = 0; i < a; i++) {
cout << p... | #include <bits/stdc++.h>
using namespace std;
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
cin >> a;
for (int i = 0; i < a; i++) {
int t;
cin >> in >> t;
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
for (int i = 0; i < a; i++) {
cou... | [
"expression.operation.binary.add"
] | 842,229 | 842,230 | u962609087 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
int main() {
int n;
cin >> n;
pair<pair<string, int>, int> p[n];
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
int main() {
int n;
cin >> n;
pair<pair<string, int>, int> p[n];
rep(i, n) {
... | [
"assignment.change"
] | 842,235 | 842,236 | u789075914 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> t(N);
for (int i = 0; i < N; ++i) {
string s;
int p;
cin >> s >> p;
t.emplace_back(make_tuple(s, p, i + 1));
}
sort(t.begin(), t.end(), [&](auto &a, auto &b) {
return get<0>(a) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> t(N);
for (int i = 0; i < N; ++i) {
string s;
int p;
cin >> s >> p;
t[i] = make_tuple(s, p, i + 1);
}
sort(t.begin(), t.end(), [&](auto &a, auto &b) {
return get<0>(a) < get<0>(... | [
"call.arguments.change"
] | 842,252 | 842,253 | u335241815 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> arr;
tuple<string, int, int> p;
string x;
int y, z;
for (int i = 0; i < N; i++) {
cin >> x;
cin >> y;
arr.push_back(make_tuple(x, y, i + 1));
}
sort(arr.rbegin(), arr.rend());
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> arr;
tuple<string, int, int> p;
string x;
int y, z;
for (int i = 0; i < N; i++) {
cin >> x;
cin >> y;
arr.push_back(make_tuple(x, -y, i + 1));
}
sort(arr.begin(), arr.end());
in... | [
"expression.operation.unary.add",
"call.arguments.change",
"call.function.change"
] | 842,258 | 842,259 | u950567701 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> tpl(n);
for (int i = 0; i < n; i++) {
string a;
int b;
cin >> a >> b;
tpl[i] = make_tuple(a, b, i + 1);
}
sort(tpl.begin(), tpl.end());
for (int i = 0; i < n; i++) {
int num;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> tpl(n);
for (int i = 0; i < n; i++) {
string a;
int b;
cin >> a >> b;
tpl[i] = make_tuple(a, 100 - b, i + 1);
}
sort(tpl.begin(), tpl.end());
for (int i = 0; i < n; i++) {
int ... | [
"assignment.change"
] | 842,260 | 842,261 | u820057330 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
map<pair<string, int>, int> R;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
string t;
int s;
cin >> t >> s;
pair<string, int> p(t, s);
R[p] = i + 1;
}
for (auto p : R) {
auto k = p.first;
auto v = p.second;
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
map<pair<string, int>, int> R;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
string t;
int s;
cin >> t >> s;
pair<string, int> p(t, -s);
R[p] = i + 1;
}
for (auto p : R) {
auto k = p.first;
auto v = p.second;
cout <<... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 842,278 | 842,279 | u101018317 | cpp |
p03030 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s1[N];
string s2[N];
int p1[N];
int p2[N];
for (int i = 0; i < N; i++) {
cin >> s1[i] >> p1[i];
}
for (int i = 0; i < N; i++) {
s2[i] = s1[... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s1[N];
string s2[N];
int p1[N];
int p2[N];
for (int i = 0; i < N; i++) {
cin >> s1[i] >> p1[i];
}
for (int i = 0; i < N; i++) {
s2[i] = s1[... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 842,280 | 842,281 | u878454346 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> p;
for (int i = 0; i < n; i++) {
string name;
int sco;
cin >> name >> sco;
// p = make_pair(sco, name);
sco *= -1;
p.push_back(make_tuple(name, sco, i + 1));
}
sort(p.begin(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> p;
for (int i = 0; i < n; i++) {
string name;
int sco;
cin >> name >> sco;
// p = make_pair(sco, name);
sco *= -1;
p.push_back(make_tuple(name, sco, i + 1));
}
sort(p.begin(... | [
"expression.operation.binary.remove"
] | 842,284 | 842,285 | u729695898 | cpp |
p03030 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
int P[N];
int num[N];
for (int i = 0; i < N; ++i) {
cin >> S[i] >> P[i];
num[N] = i + 1;
}
int i = 0;
int flag = 0;
int swap_P;
int swap_num;
string swap_S;
// 点数大きい順に並べる
while (1)... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
int P[N];
int num[N];
for (int i = 0; i < N; ++i) {
cin >> S[i] >> P[i];
num[i] = i + 1;
}
int i = 0;
int flag = 0;
int swap_P;
int swap_num;
string swap_S;
// 点数大きい順に並べる
while (1)... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 842,286 | 842,287 | u894788154 | cpp |
p03030 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
int P[N];
int num[N];
for (int i = 0; i < N; ++i) {
cin >> S[i] >> P[i];
num[N] = i + 1;
}
int i = 0;
int flag = 0;
int swap_P;
int swap_num;
string swap_S;
// 点数大きい順に並べる
while (1)... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
int P[N];
int num[N];
for (int i = 0; i < N; ++i) {
cin >> S[i] >> P[i];
num[i] = i + 1;
}
int i = 0;
int flag = 0;
int swap_P;
int swap_num;
string swap_S;
// 点数大きい順に並べる
while (1)... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 842,288 | 842,287 | u894788154 | cpp |
p03032 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define ll long long
using namespace std;
void file... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define ll long long
using namespace std;
void file... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 842,291 | 842,292 | u353919145 | cpp |
p03032 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define maxn 100
using namespace std;
int n, l, r, a[maxn], p, b[maxn], cnt, sum, ans = 0;
int main() {
scanf("%d%d", &n, &p);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 0; i <= p; i++) { //Ò»¹²½øÐÐÁ˼¸´ÎÈ¡µÄ²Ù×÷
for (int j = 0;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define maxn 100
using namespace std;
int n, l, r, a[maxn], p, b[maxn], cnt, sum, ans = 0;
int main() {
scanf("%d%d", &n, &p);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 0; i <= min(n, p); i++) { //Ò»¹²½øÐÐÁ˼¸´ÎÈ¡µÄ²Ù×÷
for (in... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 842,293 | 842,294 | u089230684 | cpp |
p03032 | #include <bits/stdc++.h>
typedef long long ll;
#define dbg cout << "Freak" << endl;
#define dbgg(i) cout << i << endl;
#define N 1e9 + 7;
using namespace std;
ll t;
ll arr[200005];
int main() {
ll a, b, c, d, e, f, g, i, j, k, sum;
vector<ll> v;
cin >> a >> b;
for (i = 1; i <= a; i++)
cin >> arr[i];
f = 0... | #include <bits/stdc++.h>
typedef long long ll;
#define dbg cout << "Freak" << endl;
#define dbgg(i) cout << i << endl;
#define N 1e9 + 7;
using namespace std;
ll t;
ll arr[200005];
int main() {
ll a, b, c, d, e, f, g, i, j, k, sum;
vector<ll> v;
cin >> a >> b;
for (i = 1; i <= a; i++)
cin >> arr[i];
f = 0... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 842,295 | 842,296 | u089230684 | cpp |
p03032 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
/*----------------------------------ここからマクロ----------------------------------*/
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define vecin(a) rep(i, ... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
/*----------------------------------ここからマクロ----------------------------------*/
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define vecin(a) rep(i, ... | [
"expression.operation.binary.remove"
] | 842,299 | 842,300 | u527652459 | cpp |
p03032 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
/*----------------------------------ここからマクロ----------------------------------*/
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define vecin(a) rep(i, ... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
/*----------------------------------ここからマクロ----------------------------------*/
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define vecin(a) rep(i, ... | [
"expression.operation.binary.add"
] | 842,301 | 842,300 | u527652459 | cpp |
p03032 | #include "bits/stdc++.h"
// region Template
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int MOD = 10... | #include "bits/stdc++.h"
// region Template
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int MOD = 10... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 842,314 | 842,315 | u557558723 | cpp |
p03032 | #include <bits/stdc++.h> // ver2.2.5
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define COUNT(a, i) upper_bound(ALL(a), i) - lower_bound(ALL(a), i)
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int, int>
#define VPii vector<Pii>
#define Tiii ... | #include <bits/stdc++.h> // ver2.2.5
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define COUNT(a, i) upper_bound(ALL(a), i) - lower_bound(ALL(a), i)
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int, int>
#define VPii vector<Pii>
#define Tiii ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 842,322 | 842,323 | u095453583 | cpp |
p03032 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> vo... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> vo... | [
"variable_declaration.type.change"
] | 842,348 | 842,349 | u562608561 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T>... | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T>... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,355 | 842,356 | u093681822 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | [
"expression.operation.binary.remove"
] | 842,363 | 842,362 | u824905100 | cpp |
p03032 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric> // accumulate(v.begin(), v.end(), 0)
#include <vector>
using namespace std;
#define ll long long
int main() {
int N, K;
cin >> N >> K;
vector<ll> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
ll ans = 0;
f... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric> // accumulate(v.begin(), v.end(), 0)
#include <vector>
using namespace std;
#define ll long long
int main() {
int N, K;
cin >> N >> K;
vector<ll> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
ll ans = 0;
f... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,364 | 842,365 | u137747137 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"expression.operation.binary.add"
] | 842,368 | 842,369 | u895971408 | cpp |
p03032 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (... | [
"expression.operation.binary.add"
] | 842,375 | 842,376 | u135572611 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 842,383 | 842,384 | u603234915 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 842,385 | 842,386 | u603234915 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 842,385 | 842,387 | u603234915 | cpp |
p03032 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | [
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 842,396 | 842,397 | u103557284 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename U> using pv = vector<pair<T, U>>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
using ll = long lon... | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename U> using pv = vector<pair<T, U>>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
using ll = long lon... | [
"control_flow.loop.for.condition.change"
] | 842,398 | 842,399 | u195036695 | cpp |
p03032 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
deque<int> jewel;
for (int i = 0; i < N; i++) {
int num;
cin >> num;
jewel.push_back(num);
}
int ans = -1;
for (int i = 0; i < min(N, K); i++) {
for (int j = 0; j < min(N, K) - i; j++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
deque<int> jewel;
for (int i = 0; i < N; i++) {
int num;
cin >> num;
jewel.push_back(num);
}
int ans = -1;
for (int i = 0; i <= min(N, K); i++) {
for (int j = 0; j <= min(N, K) - i; j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 842,407 | 842,408 | u986480146 | cpp |
p03032 | #define MOD 1000000007
#if 1
//------------------------------------------------------------
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <class T> struct Entry {
static void Run() { T().Run(); }
};
struct MyMain;
#if defined(TEST)
#include "test.hpp"
#else
signed main() {
cin.... | #define MOD 1000000007
#if 1
//------------------------------------------------------------
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <class T> struct Entry {
static void Run() { T().Run(); }
};
struct MyMain;
#if defined(TEST)
#include "test.hpp"
#else
signed main() {
cin.... | [
"expression.operation.binary.add"
] | 842,426 | 842,427 | u658243311 | cpp |
p03032 | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | [
"call.add",
"call.arguments.add",
"literal.number.type.widen.change"
] | 842,430 | 842,431 | u442810826 | cpp |
p03032 | #include <iostream>
#include <vector>
//#include <string>
#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;
// ... | #include <iostream>
#include <vector>
//#include <string>
#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;
// ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 842,432 | 842,433 | u755310927 | cpp |
p03032 | //解説見た
#include <bits/stdc++.h>
typedef long long lint;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
int main() {
int n, k;
cin >> n >> k;
int v[50];
rep(i, n) cin >> v[i];
int ans = 0;
rep(a, min(n, k)) {
rep(b, min(n, k) - a) {
int va = 0;
vector... | //解説見た
#include <bits/stdc++.h>
typedef long long lint;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
int main() {
int n, k;
cin >> n >> k;
int v[50];
rep(i, n) cin >> v[i];
int ans = 0;
rep(a, min(n, k) + 1) {
rep(b, min(n, k) - a + 1) {
int va = 0;
... | [
"expression.operation.binary.add"
] | 842,438 | 842,439 | u870575557 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.