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 |
|---|---|---|---|---|---|---|---|
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << (X + Y) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
} | [] | 1,011,439 | 1,011,440 | u726957641 | cpp |
p03219 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int x, y;
cin >> x >> y;
cout << (x + y) / 2 << ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << en... | [] | 1,011,464 | 1,011,465 | u846820729 | cpp |
p03219 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,011,494 | 1,011,495 | u154645927 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int x;
int y;
cin >> x >> y;
cout << x + y << endl;
} | #include <iostream>
using namespace std;
int main() {
int x;
int y;
cin >> x >> y;
cout << x + (y / 2) << endl;
} | [] | 1,011,506 | 1,011,507 | u600215903 | cpp |
p03219 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cstdio>
#include <i... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cstdio>
#include <i... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,011,550 | 1,011,551 | u641145334 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a / 2 + b;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a + b / 2;
return 0;
}
| [
"expression.operation.binary.remove"
] | 1,011,562 | 1,011,563 | u562321612 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
ll x, y;
cin >> x >> y;
cout << (x + y) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
ll x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
return 0;
}
| [] | 1,011,568 | 1,011,569 | u326152409 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a, b;
cout << a + (b / 2);
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a + (b / 2);
}
| [] | 1,011,585 | 1,011,586 | u026276318 | cpp |
p03219 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x + y) / 2 << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
} | [] | 1,011,593 | 1,011,594 | u553461888 | cpp |
p03219 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"call.arguments.change"
] | 1,011,597 | 1,011,598 | u900727536 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x * y / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,011,608 | 1,011,609 | u110383054 | cpp |
p03219 | #include <iostream>
using namespace std;
int main(void) {
long long int a, b, c, i, j, k, n;
cin >> a, b;
cout << a + b / 2;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long long int a, b, c, i, j, k, n;
cin >> a >> b;
cout << a + b / 2;
return 0;
} | [] | 1,011,665 | 1,011,666 | u208723543 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x, y;
cout << x + (y / 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + (y / 2) << endl;
} | [] | 1,011,683 | 1,011,684 | u069652661 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x, y;
cout << x + y / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + (y / 2) << endl;
} | [] | 1,011,685 | 1,011,684 | u069652661 | cpp |
p03219 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int X, Y;
cin >> X >> Y;
cout << (X + Y) / 2;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2;
} | [] | 1,011,733 | 1,011,734 | u174509352 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x * y / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,011,761 | 1,011,762 | u469451657 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x, y;
cout << (x + y / 2) << endl;
} | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x + y / 2) << endl;
} | [] | 1,011,769 | 1,011,770 | u207460172 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x, y;
cout << (x + y) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x + y / 2) << endl;
} | [] | 1,011,771 | 1,011,770 | u207460172 | cpp |
p03219 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int X, Y;
cin >> X, Y;
cout << X + Y / 2 << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
} | [] | 1,011,772 | 1,011,773 | u947375463 | cpp |
p03219 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int X, Y;
cin >> X, Y;
cout << X + X / 2 << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
} | [
"identifier.change",
"io.output.change"
] | 1,011,774 | 1,011,773 | u947375463 | cpp |
p03219 | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int X, Y;
cin >> X >> Y;
cout << (X + Y) / 2 << endl;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
return 0;
} | [] | 1,011,858 | 1,011,859 | u060467857 | cpp |
p03219 | #include <iostream>
int main() {
int X, Y;
std::cin >> X, Y;
std::cout << X + Y / 2 << std::endl;
return 0;
} | #include <iostream>
int main() {
int X, Y;
std::cin >> X >> Y;
std::cout << X + Y / 2 << std::endl;
return 0;
} | [] | 1,011,918 | 1,011,919 | u024764559 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x + y) / 2 << "\n";
} | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << "\n";
} | [] | 1,011,936 | 1,011,937 | u672995180 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x + y) / 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2;
return 0;
}
| [] | 1,011,997 | 1,011,998 | u809153881 | cpp |
p03219 | #include <algorithm>
#define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(a) a.begin(), a.... | #include <algorithm>
#define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(a) a.begin(), a.... | [] | 1,012,007 | 1,012,008 | u382102154 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
int x, y;
cin >> x >> y;
cout << (x + y) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
return 0;
} | [] | 1,012,009 | 1,012,010 | u209857301 | cpp |
p03219 | #include <iostream>
using namespace std;
main() {
int X, Y;
cin >> X >> Y;
cout << (X + Y) / 2 << endl;
}
| #include <iostream>
using namespace std;
main() {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
}
| [] | 1,012,050 | 1,012,051 | u975837479 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x;
cin >> y;
cout << (x + y) / 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x;
cin >> y;
cout << x + (y / 2);
return 0;
} | [] | 1,012,070 | 1,012,071 | u137093687 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int N, K;
ll ans;
int main() {
cin >> N >> K;
vector<ll> A(N + 1), s;
for (int i = 0; i < N; i++) {
cin >> A[i + 1];
A[i + 1] += A[i];
}
for (i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int N, K;
ll ans;
int main() {
cin >> N >> K;
vector<ll> A(N + 1), s;
for (int i = 0; i < N; i++) {
cin >> A[i + 1];
A[i + 1] += A[i];
}
for (i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,012,126 | 1,012,127 | u394482932 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 1000000007, MAX = 1005;
vector<vector<bool>> C(50, vector<bool>(MAX *(MAX + 1) / 2, 0));
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N), sum(N + 1), T;
for (int i = 0; i < N * (N +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 1000000007, MAX = 1005;
vector<vector<bool>> C(50, vector<bool>(MAX *(MAX + 1) / 2, 0));
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N), sum(N + 1), T;
for (int i = 0; i < N * (N +... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,012,128 | 1,012,129 | u133391510 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,012,164 | 1,012,165 | u052332717 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,012,166 | 1,012,165 | u052332717 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,012,167 | 1,012,165 | u052332717 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,012,193 | 1,012,194 | u093219895 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for ... | [] | 1,012,210 | 1,012,211 | u334351654 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for ... | [
"variable_declaration.type.change"
] | 1,012,212 | 1,012,211 | u334351654 | cpp |
p03215 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | [
"expression.operation.binary.remove"
] | 1,012,224 | 1,012,225 | u099918199 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1005;
int p[N], n, k;
vector<ll> a, b;
ll pw2[100];
int main() {
pw2[0] = 1;
for (int i = 1; i <= 60; i++)
pw2[i] = pw2[i - 1] * 2;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &p[i]);
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1005;
int p[N], n, k;
vector<ll> a, b;
ll pw2[100];
int main() {
pw2[0] = 1;
for (int i = 1; i <= 60; i++)
pw2[i] = pw2[i - 1] * 2;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &p[i]);
for (int i = 1; ... | [
"call.add"
] | 1,012,277 | 1,012,278 | u857223495 | cpp |
p03215 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp> namespace mp =
//boost::multiprecision; //mp::cpp_intで宣言
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
#define i_5 (ll)(1E9 + 5)
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typedef... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp> namespace mp =
//boost::multiprecision; //mp::cpp_intで宣言
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
#define i_5 (ll)(1E9 + 5)
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typedef... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,012,279 | 1,012,280 | u763881112 | cpp |
p03215 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using UINT64 = unsigned long long;
#define NMAX 1010
int main(void) {
IOS... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using UINT64 = unsigned long long;
#define NMAX 1010
int main(void) {
int... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,012,319 | 1,012,320 | u330661451 | cpp |
p03215 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using UINT64 = unsigned long long;
#define NMAX 1010
int main(void) {
IOS... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using UINT64 = unsigned long long;
#define NMAX 1010
int main(void) {
int... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,012,321 | 1,012,320 | u330661451 | cpp |
p03215 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using UINT64 = unsigned long long;
#define NMAX 1010
int main(void) {
IOS... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using UINT64 = unsigned long long;
#define NMAX 1010
int main(void) {
IOS... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,012,319 | 1,012,322 | u330661451 | cpp |
p03215 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using UINT64 = unsigned long long;
#define NMAX 1010
int main(void) {
IOS... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
using UINT64 = unsigned long long;
#define NMAX 1010
int main(void) {
IOS... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,012,321 | 1,012,322 | u330661451 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 1000
int N, K;
long long a[MAXN];
long long A[MAXN][MAXN];
long long power(long long x, int n) {
if (n == 0) {
return 1;
}
if (n % 2) {
return x * power(x, n - 1);
} else {
return power(x * x, n / 2);
}
}
int main() {
cin >> N >> K;... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 1000
int N, K;
long long a[MAXN];
long long A[MAXN][MAXN];
long long power(long long x, int n) {
if (n == 0) {
return 1;
}
if (n % 2) {
return x * power(x, n - 1);
} else {
return power(x * x, n / 2);
}
}
int main() {
cin >> N >> K;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,012,323 | 1,012,324 | u987039629 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[2000];
signed main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
vector<int> vec;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= n; j++) {
vec.push_back(a[j]... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[2000];
signed main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
vector<int> vec;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= n; j++) {
vec.push_back(a[j]... | [
"literal.number.type.widen.change"
] | 1,012,347 | 1,012,348 | u344122377 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAX_N = 1000;
lint a[MAX_N + 5];
vector<lint> sum;
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
a[i + 1] += a[i];
}
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAX_N = 1000;
lint a[MAX_N + 5];
vector<lint> sum;
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
a[i + 1] += a[i];
}
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.number.type.widen.change"
] | 1,012,355 | 1,012,356 | u354638986 | cpp |
p03215 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
//-------------------------↓↓↓↓↓↓------------------------
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k, a[1000 + 100], ke[1000 * (1000 + 1) / 2 + 100], ke_cou = 0, add;
ll ans = 0, want, cou = 0;
cin >> n >> k;
for (... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
//-------------------------↓↓↓↓↓↓------------------------
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k, a[1000 + 100], ke[1000 * (1000 + 1) / 2 + 100], ke_cou = 0, add;
ll ans = 0, want, cou = 0;
cin >> n >> k;
for (... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 1,012,362 | 1,012,363 | u876335718 | cpp |
p03215 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [] | 1,012,364 | 1,012,365 | u628047647 | cpp |
p03215 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"control_flow.branch.if.condition.change"
] | 1,012,366 | 1,012,365 | u628047647 | cpp |
p03215 | #include "bits/stdc++.h"
using namespace std;
long long a[1001];
int main() {
int n, k;
long long mx = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
a[i] += a[i - 1];
}
vector<long long> b(0);
for (int i = 0; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
... | #include "bits/stdc++.h"
using namespace std;
long long a[1001];
int main() {
int n, k;
long long mx = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
a[i] += a[i - 1];
}
vector<long long> b(0);
for (int i = 0; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
... | [
"control_flow.branch.if.condition.change"
] | 1,012,369 | 1,012,370 | u676010686 | cpp |
p03215 | #include "bits/stdc++.h"
using namespace std;
long long a[1001];
int main() {
int n, k;
long long mx = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
a[i] += a[i - 1];
}
vector<long long> b(0);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= n; ++j) {
... | #include "bits/stdc++.h"
using namespace std;
long long a[1001];
int main() {
int n, k;
long long mx = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
a[i] += a[i - 1];
}
vector<long long> b(0);
for (int i = 0; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,012,371 | 1,012,370 | u676010686 | cpp |
p03215 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i =... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i =... | [
"expression.operator.change"
] | 1,012,374 | 1,012,375 | u093420647 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll b[1001000];
bool del[1001000] = {};
ll a[1001];
int cnt[100];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
int c = 0;
int tp = 0;
for (int i = 1; i <= n; i++) {
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll b[1001000];
bool del[1001000] = {};
ll a[1001];
int cnt[100];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
int c = 0;
int tp = 0;
for (int i = 1; i <= n; i++) {
for (... | [
"control_flow.branch.if.condition.change"
] | 1,012,378 | 1,012,379 | u891178744 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll b[1001000];
bool del[1001000] = {};
ll a[1001];
int cnt[100];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
int c = 0;
int tp = 0;
for (int i = 1; i <= n; i++) {
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll b[1001000];
bool del[1001000] = {};
ll a[1001];
int cnt[100];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
int c = 0;
int tp = 0;
for (int i = 1; i <= n; i++) {
for (... | [
"control_flow.branch.if.condition.change"
] | 1,012,378 | 1,012,380 | u891178744 | cpp |
p03215 | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = a; i < n; i++)
#define RREP(i, a, n) for (ll i = n - 1; i >= a; i--)
typedef long long ll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
using namespace std;
ll n, k;
ll a[1010];
ll sum[1010];
map<ll, ll> mp;
int main() {
cin >> n >> k;
REP(i, 0, n) cin >> a... | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = a; i < n; i++)
#define RREP(i, a, n) for (ll i = n - 1; i >= a; i--)
typedef long long ll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
using namespace std;
ll n, k;
ll a[1010];
ll sum[1010];
map<ll, ll> mp;
int main() {
cin >> n >> k;
REP(i, 0, n) cin >> a... | [
"control_flow.branch.if.condition.change",
"literal.number.type.widen.change"
] | 1,012,383 | 1,012,384 | u204337666 | cpp |
p03215 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll K;
cin >> K;
ll a[1000];
for (int i = 0; i < N; i++) {
c... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll K;
cin >> K;
ll a[1000];
for (int i = 0; i < N; i++) {
c... | [
"control_flow.branch.if.condition.change"
] | 1,012,398 | 1,012,399 | u989740992 | cpp |
p03215 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll K;
cin >> K;
ll a[1000];
for (int i = 0; i < N; i++) {
c... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll K;
cin >> K;
ll a[1000];
for (int i = 0; i < N; i++) {
c... | [
"control_flow.branch.if.condition.change"
] | 1,012,400 | 1,012,399 | u989740992 | cpp |
p03215 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll K;
cin >> K;
ll a[1000];
for (int i = 0; i < N; i++) {
c... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll K;
cin >> K;
ll a[1000];
for (int i = 0; i < N; i++) {
c... | [
"control_flow.branch.if.condition.change"
] | 1,012,401 | 1,012,399 | u989740992 | cpp |
p03215 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [
"control_flow.branch.if.condition.change"
] | 1,012,404 | 1,012,405 | u918357423 | cpp |
p03215 | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<long long> now;
for (int i = 0; i < n; i++) {
long long sum = 0;
for (int j = i; j < n; j++) {
sum += a[j];
now.... | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<long long> now;
for (int i = 0; i < n; i++) {
long long sum = 0;
for (int j = i; j < n; j++) {
sum += a[j];
now.... | [
"control_flow.branch.if.condition.change"
] | 1,012,409 | 1,012,410 | u623115612 | cpp |
p03215 | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<long long> now;
for (int i = 0; i < n; i++) {
long long sum = 0;
for (int j = i; j < n; j++) {
sum += a[j];
now.... | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<long long> now;
for (int i = 0; i < n; i++) {
long long sum = 0;
for (int j = i; j < n; j++) {
sum += a[j];
now.... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 1,012,411 | 1,012,410 | u623115612 | cpp |
p03215 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
//////////////////////////////////... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
//////////////////////////////////... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,012,418 | 1,012,419 | u259396003 | cpp |
p03215 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, i, j, k;
cin >> n >> k;
long long a[n + 1], sum[n + 1];
sum[0] = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
vector<long long> v;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, i, j, k;
cin >> n >> k;
long long a[n + 1], sum[n + 1];
sum[0] = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
vector<long long> v;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,012,423 | 1,012,424 | u595893956 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
ll judge(vector<ll> &p2, int exp, int K, ll ans) {
//... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
void judge(vector<ll> &p2, int exp, int K, ll ans) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,012,436 | 1,012,435 | u906880177 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
ll judge(vector<ll> &p2, int exp, int K, ll ans) {
//... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
void judge(vector<ll> &p2, int exp, int K, ll ans) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,012,437 | 1,012,435 | u906880177 | cpp |
p03215 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL =... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,012,438 | 1,012,439 | u544732702 | cpp |
p03215 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL =... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.type.widen.change"
] | 1,012,440 | 1,012,439 | u544732702 | cpp |
p03215 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL =... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,012,441 | 1,012,442 | u544732702 | cpp |
p03215 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 1,012,450 | 1,012,449 | u652683896 | cpp |
p03215 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | [
"call.remove"
] | 1,012,472 | 1,012,473 | u491153752 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef int _int;
#define int long long
const int N = 1005;
int n, k, a[N], b[N * N], flg, ans;
bool mked[N * N], mkes[N * N];
_int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i], a[i] += a[i - 1];
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef int _int;
#define int long long
const int N = 1005;
int n, k, a[N], b[N * N], flg, ans;
bool mked[N * N], mkes[N * N];
_int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i], a[i] += a[i - 1];
for (int i = 0; i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 1,012,479 | 1,012,480 | u454097714 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
ll beki[45];
beki[0] = 1;
for (int i = 1; i <= 42; i++) {
beki[i] = beki[i - 1] * 2;
}
ll n;
cin >> n;
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
ll beki[45];
beki[0] = 1;
for (int i = 1; i <= 42; i++) {
beki[i] = beki[i - 1] * 2;
}
ll n;
cin >> n;
ll... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,012,489 | 1,012,490 | u980655160 | cpp |
p03215 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P2;
typedef pair<pair<int, int>, int> P3;
typedef pair<pair<int, int>, pair<int, int>> P4;
#define PB(a) push_back(a)
#define MP(a, b) make_pair((a), (b))
#define M3P(a, b, c) make_pair(make_pair((a), (b)), (c))
#define M4P(a, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P2;
typedef pair<pair<int, int>, int> P3;
typedef pair<pair<int, int>, pair<int, int>> P4;
#define PB(a) push_back(a)
#define MP(a, b) make_pair((a), (b))
#define M3P(a, b, c) make_pair(make_pair((a), (b)), (c))
#define M4P(a, ... | [
"control_flow.branch.if.condition.change"
] | 1,012,495 | 1,012,496 | u007446928 | cpp |
p03215 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int long long
using namespace std;
int a[1000];
vector<int>... | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int long long
using namespace std;
int a[1000];
vector<int>... | [
"control_flow.branch.if.condition.change"
] | 1,012,513 | 1,012,512 | u016612263 | cpp |
p03215 | #include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define reps(i, s, n) for (int(i) = (s);... | #include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define reps(i, s, n) for (int(i) = (s);... | [] | 1,012,557 | 1,012,558 | u065125881 | cpp |
p03216 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(), in.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
retu... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(), in.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
retu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,012,595 | 1,012,596 | u842028864 | cpp |
p03216 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,012,606 | 1,012,607 | u041513069 | cpp |
p03216 | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for (int i = int(m); i < int(n); ++i)
#define rep(i, n) rep2(i, 0, n)
using ll = long long;
using V = vector<int>;
char s[1000000];
ll t[3][1000001];
int main() {
int n, q;
scanf("%d%s%d", &n, s, &q);
V D, C;
rep(i, n) {
rep(j, 3) t[j][i... | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for (int i = int(m); i < int(n); ++i)
#define rep(i, n) rep2(i, 0, n)
using ll = long long;
using V = vector<int>;
char s[1000000];
ll t[3][1000001];
int main() {
int n, q;
scanf("%d%s%d", &n, s, &q);
V D, C;
rep(i, n) {
rep(j, 3) t[j][i... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,012,612 | 1,012,613 | u366381207 | cpp |
p03219 | #include <stdio.h>
int main() {
int n = 0, m = 0;
scanf("%d,%d", &n, &m);
printf("%d\n", n + (m / 2));
return 0;
} | #include <stdio.h>
int main() {
int n = 0, m = 0;
scanf("%d%d", &n, &m);
printf("%d\n", n + (m / 2));
return 0;
}
| [
"literal.string.change",
"call.arguments.change"
] | 1,012,703 | 1,012,704 | u859125915 | cpp |
p03219 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | [] | 1,012,713 | 1,012,714 | u846813901 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
cout << a + b / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a + b / 2 << endl;
}
| [] | 1,012,715 | 1,012,716 | u605372599 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x, y;
cout << x + (y / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + (y / 2);
} | [
"expression.operation.binary.remove"
] | 1,012,717 | 1,012,718 | u530497183 | cpp |
p03219 | // C Library
#include <cassert> // (assert.h) C Diagnostics Library (header)
#include <cctype> // (ctype.h) Character handling functions (header)
#include <cerrno> // (errno.h) C Errors (header)
#include <cfloat> // (float.h) Characteristics of floating-point types (header)
#include <ciso646> // (iso646.h) ISO 646 A... | // C Library
#include <cassert> // (assert.h) C Diagnostics Library (header)
#include <cctype> // (ctype.h) Character handling functions (header)
#include <cerrno> // (errno.h) C Errors (header)
#include <cfloat> // (float.h) Characteristics of floating-point types (header)
#include <ciso646> // (iso646.h) ISO 646 A... | [] | 1,012,726 | 1,012,727 | u743561048 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << (X + Y) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
return 0;
}
| [] | 1,012,765 | 1,012,766 | u752830922 | cpp |
p03219 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define fst first
#define snd second
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0)... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define fst first
#define snd second
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0)... | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 1,012,778 | 1,012,779 | u378951346 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A + B - 29;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
cout << A + B / 2;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,012,789 | 1,012,790 | u683270882 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A + B - 29;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A + B / 2;
return 0;
} | [] | 1,012,789 | 1,012,791 | u683270882 | cpp |
p03219 | #include <stdio.h>
int main() {
float x, y, z;
scanf("%f%f", &x, &y);
z = x + y / 2;
printf("%f", z);
} | #include <stdio.h>
int main() {
int x, y, z;
scanf("%d%d", &x, &y);
z = x + y / 2;
printf("%d", z);
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,012,805 | 1,012,806 | u823344427 | cpp |
p03219 | #include <stdio.h>
int main() {
int x, y, z;
scanf("%d%d", &x, &y);
z = x + y / 2;
scanf("%d", z);
} | #include <stdio.h>
int main() {
int x, y, z;
scanf("%d%d", &x, &y);
z = x + y / 2;
printf("%d", z);
} | [
"identifier.change",
"call.function.change"
] | 1,012,807 | 1,012,806 | u823344427 | cpp |
p03219 | #include <functional>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define v_exists(elem, v) find(v.begin(), v.end(), elem) != v.end()
#define s_exists(elem, s) s.find(elem) != s.end()
using namespace std;
long gcd(long a, long b) { return b == 0 ? a : ... | #include <functional>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define v_exists(elem, v) find(v.begin(), v.end(), elem) != v.end()
#define s_exists(elem, s) s.find(elem) != s.end()
using namespace std;
long gcd(long a, long b) { return b == 0 ? a : ... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,012,816 | 1,012,817 | u604896914 | cpp |
p03219 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
// Xを半分にしてYとの和を出力
int main() {
int X, Y;
cin >> X >> Y;
cout << (X + Y * 2) / 2 << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
// Xを半分にしてYとの和を出力
int main() {
int X, Y;
cin >> X >> Y;
cout << (X * 2 + Y) / 2 << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 1,012,831 | 1,012,832 | u462329577 | cpp |
p03219 | #include <stdio.h>
int main(void) {
int X, Y;
scanf("%d", X);
scanf("%d", Y);
printf("%d", X + Y / 2);
return 0;
} | #include <stdio.h>
int main(void) {
int X, Y;
scanf("%d", &X);
scanf("%d", &Y);
printf("%d", X + Y / 2);
return 0;
} | [
"expression.operation.unary.reference.add"
] | 1,012,833 | 1,012,834 | u109806376 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
cout << a + (b / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a + (b / 2) << endl;
} | [] | 1,012,842 | 1,012,843 | u258375111 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int i1, i2;
char ch;
inline int read() {
i1 = i2 = ch = 0;
while (!isdigit(ch))
i1 |= ch == '-', ch = getchar();
while (isdigit(ch))
i2 = (i2 << 1) + (i2 << 3) + (ch ^ 48), ch = getchar();
return i1 ? -i2 : i2;
}
int main() {
int x = read(), y = read();
... | #include <bits/stdc++.h>
using namespace std;
int i1, i2;
char ch;
inline int read() {
i1 = i2 = ch = 0;
while (!isdigit(ch))
i1 |= ch == '-', ch = getchar();
while (isdigit(ch))
i2 = (i2 << 1) + (i2 << 3) + (ch ^ 48), ch = getchar();
return i1 ? -i2 : i2;
}
int main() {
int x = read(), y = read();
... | [
"call.arguments.change"
] | 1,012,850 | 1,012,851 | u920282748 | cpp |
p03219 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x + y) / 2;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << x + (y / 2);
return 0;
}
| [] | 1,012,950 | 1,012,951 | u152997492 | cpp |
p03219 | #include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X + (Y << 1) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X + (Y >> 1) << endl;
return 0;
} | [
"io.output.change"
] | 1,012,903 | 1,012,904 | u745250049 | cpp |
p03220 | // vector<vector<int>> data(3,
// vector<int>(4));//int型の2次元配列(3×4要素の)の宣言 int64_t a; 10のi乗pow(10,
// i);
/*string s; stringでの文字列を数字型に変える方法
cin >> s;
rep(i,s.size()-2) {
int a= (s.at(i)-'0')*100 + (s.at(i+1)-'0')*10+ s.at(i+2) -'0';
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i ... | // vector<vector<int>> data(3,
// vector<int>(4));//int型の2次元配列(3×4要素の)の宣言 int64_t a; 10のi乗pow(10,
// i);
/*string s; stringでの文字列を数字型に変える方法
cin >> s;
rep(i,s.size()-2) {
int a= (s.at(i)-'0')*100 + (s.at(i+1)-'0')*10+ s.at(i+2) -'0';
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i ... | [
"variable_declaration.type.primitive.change"
] | 1,012,971 | 1,012,972 | u037563046 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
double C = 10000;
int ans;
cin >> N >> T >> A;
for (int i = 1; i <= N; ++i) {
int h;
cin >> h;
if (C > abs(A - T - 0.006 * h)) {
C = abs(A - T - 0.006 * h);
ans = i;
}
}
cout << ans << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
double C = 10000;
int ans;
cin >> N >> T >> A;
for (int i = 1; i <= N; ++i) {
int h;
cin >> h;
if (C > abs(A - (T - 0.006 * h))) {
C = abs(A - (T - 0.006 * h));
ans = i;
}
}
cout << ans << endl;
return ... | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,012,973 | 1,012,974 | u854617136 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
ll n, t, a;
cin >> n >> t >> a;
vector<ll> h(n);
rep(i, n) { cin >> h.at(i); }
ll ans = 0, mini = 10000001;
rep(i, n) {
double tem = t - 0.006 * h.at(i);
if (mini > ab... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
double n, t, a;
cin >> n >> t >> a;
vector<double> h(n);
rep(i, n) { cin >> h.at(i); }
double ans = 0, mini = 10000001;
rep(i, n) {
double tem = t - 0.006 * h.at(i);
i... | [
"variable_declaration.type.change"
] | 1,012,975 | 1,012,976 | u130651752 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
rep(i, n) { cin >> h.at(i); }
int ans = 1, count = 1e6;
rep(i, n) {
if (count > abs(a - (1000 * t - 6 * h.at(i)))) {
count = abs(a - (1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<int> h(n);
rep(i, n) { cin >> h.at(i); }
int ans = 1, count = 1e6;
rep(i, n) {
if (count > abs(1000 * a - (1000 * t - 6 * h.at(i)))) {
count = abs... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,012,977 | 1,012,978 | u130651752 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.