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 9
values |
|---|---|---|---|---|---|---|---|
p02945 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, list[3];
cin >> A >> B;
list[0] = A + B;
list[1] = A - B;
list[2] = A * B;
sort(list, list + 2, greater<int>());
cout << list[0] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, list[3];
cin >> A >> B;
list[0] = A + B;
list[1] = A - B;
list[2] = A * B;
sort(list, list + 3, greater<int>());
cout << list[0] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 743,892 | 743,893 | u313578168 | cpp |
p02945 | #include <bits/stdc++.h>
#define print(x) cout << x << endl;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, tmp;
cin >> A;
cin >> B;
tmp = max(A + B, A - B);
tmp = max(A + B, A * B);
print(tmp);
return 0;
}
| #include <bits/stdc++.h>
#define print(x) cout << x << endl;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, tmp;
cin >> A;
cin >> B;
tmp = max(A + B, A - B);
tmp = max(tmp, A * B);
print(tmp);
return 0;
}
| [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 743,894 | 743,895 | u854413258 | cpp |
p02945 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, ... | [
"call.add",
"call.arguments.change"
] | 743,905 | 743,906 | u950174376 | cpp |
p02945 | #include <bits/stdc++.h>
#define ll long long
#define all(x) (x).begin(), (x).end()
#define SZ(x) (x).size()
#define fir first
#define sec second
void scan() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
using namespace std;
const int maxn = 2e5 + 7;
int a[... | #include <bits/stdc++.h>
#define ll long long
#define all(x) (x).begin(), (x).end()
#define SZ(x) (x).size()
#define fir first
#define sec second
void scan() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
using namespace std;
const int maxn = 2e5 + 7;
int a[... | [
"call.remove"
] | 744,043 | 744,044 | u620866522 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, ans, ans2, p;
cin >> a >> b;
cout << max(a * b, min(a + b, a - b)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, ans, ans2, p;
cin >> a >> b;
cout << max(a * b, max(a + b, a - b)) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 744,062 | 744,063 | u902787159 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int sum(int x, int y) { return x + y; }
int sub(int x, int y) { return x - y; }
int mul(int x, int y) { return x * y; }
int main(void) {
int a, b, sm, sb, ml, gr;
scanf("%d %d", &a, &b);
sm = sum(a, b);
sb = sub(a, b);
ml = mul(a, b);
if (sm >= sb && sm >= m... | #include <bits/stdc++.h>
using namespace std;
int sum(int x, int y) { return x + y; }
int sub(int x, int y) { return x - y; }
int mul(int x, int y) { return x * y; }
int main(void) {
int a, b, sm, sb, ml, gr = 1010;
scanf("%d %d", &a, &b);
sm = sum(a, b);
sb = sub(a, b);
ml = mul(a, b);
if (sm >= sb && ... | [
"variable_declaration.value.change",
"control_flow.branch.else.remove"
] | 744,087 | 744,088 | u308280771 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int sum(int x, int y) { return x + y; }
int sub(int x, int y) { return x - y; }
int mul(int x, int y) { return x * y; }
int main(void) {
int a, b, sm, sb, ml, gr;
scanf("%d %d", &a, &b);
sm = sum(a, b);
sb = sub(a, b);
ml = mul(a, b);
if (sm >= sb && sm >= m... | #include <bits/stdc++.h>
using namespace std;
int sum(int x, int y) { return x + y; }
int sub(int x, int y) { return x - y; }
int mul(int x, int y) { return x * y; }
int main(void) {
int a, b, sm, sb, ml, gr;
scanf("%d %d", &a, &b);
sm = sum(a, b);
sb = sub(a, b);
ml = mul(a, b);
if (sm >= sb && sm >= m... | [
"control_flow.branch.else.remove"
] | 744,087 | 744,089 | u308280771 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
main() {
int M, A, B;
cin >> A, B;
M = max(max(A + B, A - B), A * B);
cout << M << endl;
} | #include <bits/stdc++.h>
using namespace std;
main() {
int M, A, B;
cin >> A >> B;
M = max(max(A + B, A - B), A * B);
cout << M << endl;
} | [] | 744,097 | 744,098 | u384561774 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max((A + B, A - B), A * B) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max(max(A + B, A - B), A * B) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 744,099 | 744,100 | u470566982 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#define DB(x) cout << #x << " = " << x << endl;
#define LEFT(n) (2 * (n))
#define RIGHT(n) (2 * (n) + 1)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> node;
// typedef vector <vector <ll>> matrix;
const ll INF = 1e9;
const double EPS = 1e-... | #include <bits/stdc++.h>
using namespace std;
#define DB(x) cout << #x << " = " << x << endl;
#define LEFT(n) (2 * (n))
#define RIGHT(n) (2 * (n) + 1)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> node;
// typedef vector <vector <ll>> matrix;
const ll INF = 1e9;
const double EPS = 1e-... | [
"call.add"
] | 744,110 | 744,111 | u351158222 | cpp |
p02945 | #include <stdio.h>
int sum(int x, int y) { return x + y; }
int sub(int x, int y) { return x - y; }
int mul(int x, int y) { return x * y; }
int main() {
int a, b, sm, sb, ml, gr;
scanf("%d %d", &a, &b);
sm = sum(a, b);
sb = sub(a, b);
ml = mul(a, b);
if (sm > sb && sm > ml)
gr = sm;
else if (sb > sm &&... | #include <stdio.h>
int sum(int x, int y) { return x + y; }
int sub(int x, int y) { return x - y; }
int mul(int x, int y) { return x * y; }
int main() {
int a, b, sm, sb, ml, gr;
scanf("%d %d", &a, &b);
sm = sum(a, b);
sb = sub(a, b);
ml = mul(a, b);
if (sm > sb && sm > ml)
gr = sm;
else if (sb > sm &&... | [
"call.remove"
] | 744,112 | 744,113 | u601685273 | cpp |
p02816 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typede... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typede... | [
"call.arguments.change"
] | 743,926 | 743,927 | u328811800 | cpp |
p02816 | #include <bits/stdc++.h>
using namespace std;
const int max_n = 2e5 + 5;
int start_1[max_n], start_2[max_n], tab_1[max_n], tab_2[max_n],
napis[3 * max_n], P[3 * max_n], n;
vector<pair<int, int>> wynik;
void wczytaj(int *tab, int *start) {
cin >> start[0];
for (int i = 1; i < n; i++) {
cin >> start[i];
... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 2e5 + 5;
int start_1[max_n], start_2[max_n], tab_1[max_n], tab_2[max_n],
napis[3 * max_n], P[3 * max_n], n;
vector<pair<int, int>> wynik;
void wczytaj(int *tab, int *start) {
cin >> start[0];
for (int i = 1; i < n; i++) {
cin >> start[i];
... | [
"call.arguments.change"
] | 743,928 | 743,929 | u535632797 | cpp |
p02816 | #include <bits/stdc++.h>
using namespace std;
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
#define int long long
#define lop(i, s, e) for (int i = s; i < (int)e; i++)
#define rlop(i, e, s) for (int i = e; i >= s; i--)
#define prvec(v) ... | #include <bits/stdc++.h>
using namespace std;
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
#define int long long
#define lop(i, s, e) for (int i = s; i < (int)e; i++)
#define rlop(i, e, s) for (int i = e; i >= s; i--)
#define prvec(v) ... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 743,937 | 743,938 | u504543992 | cpp |
p02816 |
#include <bits/stdc++.h>
#define rep(i, n) for (double i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<double, double> P;
const int INF = 1001001001;
// Morris-Pratt
template <typename T> struct MP {
int n;
T t;
vector<int> a;
MP() {}
MP(const T &t) : t(t) {
n = t.size();
... |
#include <bits/stdc++.h>
#define rep(i, n) for (double i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<double, double> P;
const int INF = 1001001001;
// Morris-Pratt
template <typename T> struct MP {
int n;
T t;
vector<int> a;
MP() {}
MP(const T &t) : t(t) {
n = t.size();
... | [
"control_flow.branch.if.condition.change"
] | 743,944 | 743,945 | u289381123 | cpp |
p02816 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using ull = long long unsigned;
using P = pair<ll, ll>;
vector<int> f(vector<int> &a) {
int n = a.size();
vector<int> res(n);
rep(i, n) res[i] = a[i] ^ a[(i + 1) % n];
return res;
}
// Morris-Pratt... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using ull = long long unsigned;
using P = pair<ll, ll>;
vector<int> f(vector<int> &a) {
int n = a.size();
vector<int> res(n);
rep(i, n) res[i] = a[i] ^ a[(i + 1) % n];
return res;
}
// Morris-Pratt... | [
"call.arguments.change"
] | 743,946 | 743,947 | u289381123 | cpp |
p02816 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
int const MAXN = 2e5;
int a[MAXN], b[MAXN];
int c[MAXN - 1], d[MAXN + MAXN - 2];
int next_pos[MAXN];
int main() {
int N;
std::cin >> N;
for (int i = 0; i < N; ++i)
std::cin >> a[i];
for (int i = 0; i < N; ++i)
std::cin >> b[i];
f... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
int const MAXN = 2e5;
int a[MAXN], b[MAXN];
int c[MAXN - 1], d[MAXN + MAXN - 2];
int next_pos[MAXN];
int main() {
int N;
std::cin >> N;
for (int i = 0; i < N; ++i)
std::cin >> a[i];
for (int i = 0; i < N; ++i)
std::cin >> b[i];
f... | [
"assignment.change"
] | 743,965 | 743,966 | u294638337 | cpp |
p02816 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | [
"expression.operation.binary.remove"
] | 743,967 | 743,968 | u478275206 | cpp |
p02816 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define STR string
#define Fst first
#define Snd second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
int n;
... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define STR string
#define Fst first
#define Snd second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
int n;
... | [
"call.add"
] | 743,973 | 743,974 | u152424169 | cpp |
p02816 | #include <bits/stdc++.h>
using namespace std;
const long long md = 2038077799;
long long n, a[202020], b[202020], aa[202020], bb[202020], ha, hb,
bs = 1400312813;
vector<long long> v;
long long pw(long long x, long long y) {
long long rt = 1;
while (y) {
if (y & 1) {
rt *= x;
rt %= md;
}
... | #include <bits/stdc++.h>
using namespace std;
const long long md = 2038077799;
long long n, a[202020], b[202020], aa[202020], bb[202020], ha, hb,
bs = 1400312813;
vector<long long> v;
long long pw(long long x, long long y) {
long long rt = 1;
while (y) {
if (y & 1) {
rt *= x;
rt %= md;
}
... | [
"expression.operation.binary.add"
] | 743,975 | 743,976 | u386107860 | cpp |
p02816 | #include <bits/stdc++.h>
using namespace std;
long long n, a[200003], b[200003], x[200003], y[200003], pw[200003];
const long long base = 1100000000, mod = 2147483647;
bool check(int i) {
long long vala = (i == 0 ? 0 : x[i - 1]) +
(x[n - 1] - ((i == 0) ? 0 : x[i - 1] * pw[n - i])) * pw[i],
... | #include <bits/stdc++.h>
using namespace std;
long long n, a[200003], b[200003], x[200003], y[200003], pw[200003];
const long long base = 1100000000, mod = 2147483647;
bool check(int i) {
long long vala = (i == 0 ? 0 : x[i - 1]) +
(x[n - 1] - ((i == 0) ? 0 : x[i - 1] * pw[n - i] % mod)) *
... | [
"assignment.change"
] | 743,977 | 743,978 | u123270724 | cpp |
p02816 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 743,983 | 743,984 | u858670323 | cpp |
p02816 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
// Verified: ABC135F
vector<int> FindAllByRollingHash(const vector<int64> &s,
const vector<int64> &key) {
if (s.size() < key.size())
return {};
constexpr int64 P1 = 1000000007;
... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
// Verified: ABC135F
vector<int> FindAllByRollingHash(const vector<int64> &s,
const vector<int64> &key) {
if (s.size() < key.size())
return {};
constexpr int64 P1 = 1000000007;
... | [
"control_flow.branch.if.add"
] | 744,014 | 744,015 | u771276542 | cpp |
p02816 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n)
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n)
#define gets(s) ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 744,019 | 744,020 | u264405855 | cpp |
p02816 | #include <bits/stdc++.h>
#define GO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
typedef vector<int> vec;
const int Max = 1e6 + 5;
const int Mod = 1e9 + 7;
int n, a[Max], b[Max], cnt[Max], ans[Max];
int f[Max];
void KMP(int sh) {
for (int i = 1, j = 0; i < n; i++) {
... | #include <bits/stdc++.h>
#define GO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
typedef vector<int> vec;
const int Max = 1e6 + 5;
const int Mod = 1e9 + 7;
int n, a[Max], b[Max], cnt[Max], ans[Max];
int f[Max];
void KMP(int sh) {
for (int i = 1, j = 0; i < n; i++) {
... | [
"assignment.change"
] | 744,026 | 744,027 | u073836689 | cpp |
p02816 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unis... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unis... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 744,028 | 744,029 | u006204672 | cpp |
p02816 | #include <iostream>
#include <vector>
#define int long long int
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
vector... | #include <iostream>
#include <vector>
#define int long long int
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 5), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ve... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 744,030 | 744,031 | u778887443 | cpp |
p02816 | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
//不動小数点の計算高速化
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // ... | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
//不動小数点の計算高速化
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // ... | [
"expression.operation.binary.remove"
] | 744,034 | 744,035 | u986437843 | cpp |
p02816 | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
au... | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
au... | [
"control_flow.branch.if.condition.change"
] | 744,036 | 744,037 | u986437843 | cpp |
p02816 | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
au... | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
au... | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 744,038 | 744,039 | u986437843 | cpp |
p02816 | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
au... | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
au... | [
"expression.operation.binary.remove"
] | 744,038 | 744,040 | u986437843 | cpp |
p02816 | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
au... | //#undef _DEBUG
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
au... | [
"control_flow.return.add"
] | 744,041 | 744,042 | u986437843 | cpp |
p02913 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | [
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 744,122 | 744,123 | u600402037 | cpp |
p02913 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 744,124 | 744,123 | u600402037 | cpp |
p02913 | #include <algorithm>
#include <cstdio>
using namespace std;
#define int long long
#define uint unsigned int
#define dotimes(i, n) for (int i = 0, i##max__ = (n); i < i##max__; i++)
#define whole(x, f, ...) \
([&](decltype((x)) c) { return (f)(begin(c), end(c), #... | #include <algorithm>
#include <cstdio>
using namespace std;
#define int long long
#define uint unsigned int
#define dotimes(i, n) for (int i = 0, i##max__ = (n); i < i##max__; i++)
#define whole(x, f, ...) \
([&](decltype((x)) c) { return (f)(begin(c), end(c), #... | [
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 744,125 | 744,126 | u281670674 | cpp |
p02913 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
string S;
vector<int> Zalgo(const string &S) {
int N = (int)S.size();
vector<int> res(N);
res[0] = N;
int i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
string S;
vector<int> Zalgo(const string &S) {
int N = (int)S.size();
vector<int> res(N);
res[0] = N;
int i... | [
"expression.operation.binary.remove"
] | 744,131 | 744,132 | u455366471 | cpp |
p02913 | //#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
//区間削除は出来ない
template ... | //#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
//区間削除は出来ない
template ... | [
"literal.number.change"
] | 744,133 | 744,134 | u986437843 | cpp |
p02913 | //#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
//区間削除は出来ない
template ... | //#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
//区間削除は出来ない
template ... | [
"literal.number.change"
] | 744,133 | 744,135 | u986437843 | cpp |
p02913 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 744,145 | 744,146 | u211259428 | cpp |
p02913 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ... | [
"control_flow.branch.if.condition.change"
] | 744,147 | 744,148 | u639032323 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | [
"assignment.change"
] | 744,149 | 744,150 | u934272719 | cpp |
p02913 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 744,154 | 744,155 | u264405855 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
vector<int> z_function(string s) {
int n = (int)s.length();
vector<int> z(n);
for (int i = 1, l = 0, r = 0; i < n; ++i) {
if (i <= r)
z[i] = min(r - i + 1, z[i - l]);
while (i + z[i] < n && s[z[i]] == s[i + z[i]])
++z[i];
if (i + z[i] - 1 > r)... | #include <bits/stdc++.h>
using namespace std;
vector<int> z_function(string s) {
int n = (int)s.length();
vector<int> z(n);
for (int i = 1, l = 0, r = 0; i < n; ++i) {
if (i <= r)
z[i] = min(r - i + 1, z[i - l]);
while (i + z[i] < n && s[z[i]] == s[i + z[i]])
++z[i];
if (i + z[i] - 1 > r)... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 744,160 | 744,161 | u845907943 | cpp |
p02913 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
void Zalgorithm(string s, vector<int> &Z, int i, int j) {
while (i < s.size()) {
while ((i + j < s.size()) && (s[j] == s[i + j])) {
++j;
}
Z[i] = j;
if (j == 0) {
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
void Zalgorithm(string s, vector<int> &Z, int i, int j) {
while (i < s.size()) {
while ((i + j < s.size()) && (s[j] == s[i + j])) {
++j;
}
Z[i] = j;
if (j == 0) {
... | [
"expression.operation.binary.remove"
] | 744,170 | 744,171 | u762158020 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) ... | [
"expression.operation.binary.add"
] | 744,176 | 744,177 | u666394517 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
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;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
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;
... | [
"call.add",
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 744,178 | 744,179 | u736647947 | cpp |
p02913 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"expression.operation.binary.remove"
] | 744,180 | 744,181 | u242679311 | cpp |
p02913 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vecto... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vecto... | [
"expression.operation.binary.remove"
] | 744,182 | 744,183 | u242679311 | cpp |
p02913 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 744,197 | 744,198 | u328294851 | cpp |
p02913 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <st... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <st... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 744,213 | 744,214 | u930898631 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int N;
string S;
cin >> N >> S;
priority_queue<int> que;
int A[N][N];
for (int i = N - 1; i >= 0; i--) {
int j = i + 1;
while (j < N) {
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int N;
string S;
cin >> N >> S;
priority_queue<int> que;
int A[N][N];
for (int i = N - 1; i >= 0; i--) {
int j = i + 1;
while (j < N) {
in... | [
"control_flow.branch.if.condition.change"
] | 744,225 | 744,226 | u879436400 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int N;
string S;
cin >> N >> S;
priority_queue<int> que;
int A[N][N];
for (int i = N - 1; i >= 0; i--) {
int j = i + 1;
while (j < N) {
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int N;
string S;
cin >> N >> S;
priority_queue<int> que;
int A[N][N];
for (int i = N - 1; i >= 0; i--) {
int j = i + 1;
while (j < N) {
in... | [
"expression.operation.binary.remove"
] | 744,227 | 744,226 | u879436400 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int result = 0;
cin >> N;
cin >> S;
int A[N];
int c = N;
for (int b = 0; b < c; b++) {
for (int a = 0; a < c; a++)
A[a] = 0;
A[0] = N;
int i = 1, j = 0;
while (i < N) {
while (i + j < N && S[j] ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int result = 0;
cin >> N;
cin >> S;
int A[N];
int c = N;
for (int b = 0; b < c; b++) {
for (int a = 0; a < c; a++)
A[a] = 0;
A[0] = N;
int i = 1, j = 0;
while (i < N) {
while (i + j < N && S[j] ==... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 744,232 | 744,233 | u073895786 | cpp |
p02913 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 744,234 | 744,235 | u179970156 | cpp |
p02913 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <new>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <new>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#... | [
"literal.number.change",
"call.arguments.change"
] | 744,244 | 744,245 | u783675879 | cpp |
p02913 | #include <bits/stdc++.h>
class rolling_hash {
public:
using u64 = std::uint_fast64_t;
using size_type = std::uint_fast32_t;
static constexpr u64 MOD = (1uL << 61) - 1;
static constexpr u64 base = 20200213;
std::string str;
std::vector<u64> hash_, pow;
private:
static constexpr u64 mask30 = (1ul << 30)... | #include <bits/stdc++.h>
class rolling_hash {
public:
using u64 = std::uint_fast64_t;
using size_type = std::uint_fast32_t;
static constexpr u64 MOD = (1uL << 61) - 1;
static constexpr u64 base = 20200213;
std::string str;
std::vector<u64> hash_, pow;
private:
static constexpr u64 mask30 = (1ul << 30)... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 744,258 | 744,259 | u424655672 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, N) for (int i = 0; i < (N); ++i)
int main() {
int a, b, c, d, e, ans;
cin >> a >> b;
c = a + b;
d = a * b;
e = a - b;
ans = max(b, c);
ans = max(ans, d);
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, N) for (int i = 0; i < (N); ++i)
int main() {
int a, b, c, d, e, ans;
cin >> a >> b;
c = a + b;
d = a * b;
e = a - b;
ans = max(c, d);
ans = max(ans, e);
cout << ans << endl;
... | [
"call.arguments.change",
"call.arguments.add",
"assignment.value.change",
"identifier.change"
] | 744,282 | 744,283 | u654884616 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int s = a + b;
if (a - b > s)
s = a - b;
if (a * b > s)
s = s * b;
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int s = a + b;
if (a - b > s)
s = a - b;
if (a * b > s)
s = a * b;
cout << s << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 744,286 | 744,287 | u808738521 | cpp |
p02945 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#d... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#d... | [
"call.arguments.change",
"call.remove",
"expression.operator.arithmetic.change",
"io.output.change"
] | 744,288 | 744,289 | u421426760 | cpp |
p02945 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#d... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#d... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 744,290 | 744,289 | u421426760 | cpp |
p02945 | //#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include ... | //#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include ... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 744,293 | 744,294 | u272028993 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll NN = 1e6 + 10;
ll a, b;
int main() {
cin >> a >> b;
ll ma = 0;
ma = max(ma, a + b);
ma = max(ma, a - b);
ma = max(ma, a * b);
cout << ma << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll NN = 1e6 + 10;
ll a, b;
int main() {
cin >> a >> b;
ll ma = -1e10;
ma = max(ma, a + b);
ma = max(ma, a - b);
ma = max(ma, a * b);
cout << ma << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 744,295 | 744,296 | u682427554 | cpp |
p02945 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int m = A + B;
if (m > A - B) {
m = A - B;
}
if (m > A * B) {
m = A * B;
}
cout << m << endl;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int m = A + B;
if (m < A - B) {
m = A - B;
}
if (m < A * B) {
m = A * B;
}
cout << m << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 744,303 | 744,304 | u937950774 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, a[3];
scanf("%lld %lld", &A, &B);
a[0] = A - B;
a[1] = A * B;
a[2] = A + B;
sort(a, a + 2);
printf("%lld", a[2]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, a[3];
scanf("%lld %lld", &A, &B);
a[0] = A - B;
a[1] = A * B;
a[2] = A + B;
sort(a, a + 3);
printf("%lld", a[2]);
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 744,330 | 744,331 | u083496316 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, MX = -1000000;
cin >> a >> b;
max(MX, max(a - b, max(a * b, a + b)));
cout << MX << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, MX = -1e9;
cin >> a >> b;
MX = max(MX, max(a - b, max(a * b, a + b)));
cout << MX << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 744,347 | 744,348 | u418568023 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, MX = -1e9;
cin >> a >> b;
max(MX, max(a - b, max(a * b, a + b)));
cout << MX << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, MX = -1e9;
cin >> a >> b;
MX = max(MX, max(a - b, max(a * b, a + b)));
cout << MX << endl;
return 0;
} | [
"assignment.change"
] | 744,350 | 744,348 | u418568023 | cpp |
p02945 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 744,358 | 744,359 | u965118468 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max((a + b, a - b), a * b);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(max(a + b, a - b), a * b);
} | [
"call.add",
"call.arguments.change"
] | 744,370 | 744,371 | u661467504 | cpp |
p02945 | #include <assert.h>
#include <math.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
template <typename T> void in(T &x) { std::cin >> x; }
template <typename T> void out(const T H) { std::cout << (H); }
template <typename T1, typename... T2> void out(const T1 H,... | #include <assert.h>
#include <math.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
template <typename T> void in(T &x) { std::cin >> x; }
template <typename T> void out(const T H) { std::cout << (H); }
template <typename T1, typename... T2> void out(const T1 H,... | [
"misc.opposites",
"identifier.change",
"call.arguments.change"
] | 744,380 | 744,381 | u811925505 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (1000000007);
int main() {
ll a, b;
cin >> a, b;
ll ans = max({(a + b), (a - b), (a * b)});
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (1000000007);
int main() {
ll a, b;
cin >> a >> b;
ll ans = max({(a + b), (a - b), (a * b)});
cout << ans << endl;
return 0;
} | [] | 744,388 | 744,389 | u493491082 | cpp |
p02945 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) {
int t;
while (b > 0) {
t = b;
b = a % b;
a = t;
}
return a;
}
int l... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) {
int t;
while (b > 0) {
t = b;
b = a % b;
a = t;
}
return a;
}
int l... | [] | 744,390 | 744,391 | u953532675 | cpp |
p02945 | // https://algospot.com/judge/problem/read/CLOCKSYNC
#include <algorithm>
#include <climits>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define LF '\n';
#define MOD 1000000007
typedef unsigned long... | // https://algospot.com/judge/problem/read/CLOCKSYNC
#include <algorithm>
#include <climits>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define LF '\n';
#define MOD 1000000007
typedef unsigned long... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 744,396 | 744,397 | u888251784 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int a, b;
int main() {
cin >> a >> b;
cout << max({a + b, a - 1, a * b});
}
/*
Good Luck
-Lucina
*/
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int a, b;
int main() {
cin >> a >> b;
cout << max({a + b, a - b, a * b});
}
/*
Good Luck
-Lucina
*/
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 744,400 | 744,401 | u047398677 | cpp |
p02945 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debugv(x) \
rep(i, x.size()) cerr << x[i] << (i == x.size() - 1 ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debugv(x) \
rep(i, x.size()) cerr << x[i] << (i == x.size() - 1 ... | [
"expression.operation.binary.remove"
] | 744,402 | 744,403 | u265065462 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, a, b, c;
cin >> A >> B;
a = A + b;
b = A - B;
c = A * B;
vector<int> AA(3);
AA.at(0) = a;
AA.at(1) = b;
AA.at(2) = c;
sort(AA.begin(), AA.end());
cout << AA.at(2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, a, b, c;
cin >> A >> B;
a = A + B;
b = A - B;
c = A * B;
vector<int> AA(3);
AA.at(0) = a;
AA.at(1) = b;
AA.at(2) = c;
sort(AA.begin(), AA.end());
cout << AA.at(2) << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 744,412 | 744,413 | u804980376 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ret;
cin >> a >> b;
ret = a + b;
ret = a - b > ret ? a - b : ret;
ret = a * b > ret ? a - b : ret;
cout << ret << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ret;
cin >> a >> b;
ret = a + b;
ret = a - b > ret ? a - b : ret;
ret = a * b > ret ? a * b : ret;
cout << ret << endl;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 744,414 | 744,415 | u065089468 | cpp |
p02945 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
using namespace std;
#define ll long long
int main() {
int A, B, max = 0;
cin >> A >> B;
if (A + B > max)
max = A + B;
if (A - B > max)
max = A - B;
if (A * B > max)
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
using namespace std;
#define ll long long
int main() {
int A, B, max = -200;
cin >> A >> B;
if (A + B > max)
max = A + B;
if (A - B > max)
max = A - B;
if (A * B > max)
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 744,428 | 744,429 | u668443884 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int s;
int d;
int m;
s = A + B;
d = A - B;
m = A * B;
int max;
if (s >= d) {
max = s;
if (m >= s) {
max = m;
}
} else {
max = d;
if (m <= d) {
max = m;
}
}
cout << max << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int s;
int d;
int m;
s = A + B;
d = A - B;
m = A * B;
int max;
if (s >= d) {
max = s;
if (m >= s) {
max = m;
}
} else {
max = d;
if (m >= d) {
max = m;
}
}
cout << max << en... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 744,438 | 744,439 | u566571310 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A;
cout << max(A + B, max(A - B, A * B)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max(A + B, max(A - B, A * B)) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 744,442 | 744,443 | u239087789 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define test... | #include <bits/stdc++.h>
using namespace std;
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define test... | [] | 744,454 | 744,455 | u995696863 | cpp |
p02945 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
int max(int x, int y) { return (x > y ? x : y); }
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b, a - b);
ans = max(ans, a * b);
return ans;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
int max(int x, int y) { return (x > y ? x : y); }
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b, a - b);
ans = max(ans, a * b);
cout << ans;
}
| [
"io.output.change"
] | 744,460 | 744,461 | u098679988 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for (ll i = a; i < b; i += 1)
#define pp pair<ll, ll>
#define sz(v) int(v.size())
#define hell (ll)1000000007
#define hell1 (ll)100000009
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for (ll i = a; i < b; i += 1)
#define pp pair<ll, ll>
#define sz(v) int(v.size())
#define hell (ll)1000000007
#define hell1 (ll)100000009
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 744,469 | 744,470 | u889695981 | cpp |
p02945 |
#include <bits/stdc++.h>
using namespace std;
struct compare {
bool operator()(const int &first, const int &second) {
return first > second;
}
};
void solve() {
long long a, b;
cin >> a >> b;
int x = a * b;
int y = a + b;
int z = a - b;
int mx = (x, y);
cout << max(z, mx) << endl;
}
int main() {... |
#include <bits/stdc++.h>
using namespace std;
struct compare {
bool operator()(const int &first, const int &second) {
return first > second;
}
};
void solve() {
long long a, b;
cin >> a >> b;
int x = a * b;
int y = a + b;
int z = a - b;
int mx = max(x, y);
cout << max(z, mx) << endl;
}
int main(... | [
"call.add"
] | 744,477 | 744,478 | u466983830 | cpp |
p02945 | #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)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
us... | #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)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
us... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 744,481 | 744,482 | u881647420 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 0 && B > 0) {
if (A + B > A * B) {
cout << (A + B) << endl;
} else {
cout << (A * B) << endl;
}
} else if (A > 0 && B == 0) {
cout << A << endl;
} else if (A > 0 && B < 0) {
cout << (A - B... | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 0 && B > 0) {
if (A + B > A * B) {
cout << (A + B) << endl;
} else {
cout << (A * B) << endl;
}
} else if (A > 0 && B == 0) {
cout << A << endl;
} else if (A > 0 && B < 0) {
cout << (A - B... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 744,497 | 744,498 | u763012775 | cpp |
p02945 | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
int x, y, z;
x = a + b;
y = a - b;
z = a * b;
if (x >= y || x >= z) {
printf("%d\n", x);
} else if (y >= z || y >= x) {
printf("%d\n", y);
} else if (z >= x, z >= y) {
printf("%d\n", z);
}
}
| #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
int x, y, z;
x = a + b;
y = a - b;
z = a * b;
if (x >= y && x >= z) {
printf("%d\n", x);
} else if (y >= z && y >= x) {
printf("%d\n", y);
} else if (z >= x && z >= y) {
printf("%d\n", z);
}
// printf("%d%d%d",x,y,z);
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 744,511 | 744,512 | u937776252 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int max;
int A, B;
cin >> A >> B;
max = A + B;
if (max < A - B) {
max = A - B;
}
if (max = A * B) {
max = A * B;
}
cout << max;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int max;
int A, B;
cin >> A >> B;
max = A + B;
if (max < A - B) {
max = A - B;
}
if (max < A * B) {
max = A * B;
}
cout << max;
} | [
"control_flow.branch.if.condition.change"
] | 744,516 | 744,517 | u454600293 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int maxAns = 0;
int x = a + b, y = a - b, z = a * b;
maxAns = max(x, y);
maxAns = max(y, z);
cout << maxAns << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int maxAns = 0;
int x = a + b, y = a - b, z = a * b;
maxAns = max(x, y);
maxAns = max(maxAns, z);
cout << maxAns << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 744,532 | 744,533 | u185037583 | cpp |
p02945 | #include <iostream>
using namespace std;
int main(void) {
int A, B, C[3], max, i;
cin >> A;
cin >> B;
C[0] = A + B;
C[1] = A - B;
C[2] = A * B;
max = C[0];
for (i = 0; i <= 2; i++) {
if (max > C[i]) {
max = C[i];
}
}
cout << max << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int A, B, C[3], max, i;
cin >> A;
cin >> B;
C[0] = A + B;
C[1] = A - B;
C[2] = A * B;
max = C[0];
for (i = 0; i <= 2; i++) {
if (max < C[i]) {
max = C[i];
}
}
cout << max << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 744,542 | 744,543 | u566116575 | cpp |
p02946 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"expression.operation.binary.remove"
] | 744,561 | 744,562 | u151236434 | cpp |
p02946 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int k, x;
cin >> k >> x;
int max = x + (k - 1);
int min = x - (k - 1);
for (int i = min; i <= max; i++) {
cout << i;
}
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int k, x;
cin >> k >> x;
int max = x + (k - 1);
int min = x - (k - 1);
for (int i = min; i <= max; i++) {
cout << i << " ";
}
} | [
"io.output.change"
] | 744,571 | 744,572 | u178938628 | cpp |
p02946 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, k, j;
cin >> a >> b;
k = a + b - 1;
j = b - a + 1;
for (int z = j; z < k; z++) {
if (z < 1000000 || z > -1000000) {
cout << z << " ";
}
}
cout << endl;
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, k, j;
cin >> a >> b;
k = a + b;
j = b - a + 1;
for (int z = j; z < k; z++) {
if (z < 1000000 || z > -1000000) {
cout << z << " ";
}
}
cout << endl;
}
| [
"expression.operation.binary.remove"
] | 744,573 | 744,574 | u783388585 | cpp |
p02946 | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
scanf("%d %d", &k, &x);
for (int i = x - k + 1; i < x; i++) {
printf("%d", i);
}
for (int i = x; i < x + k; i++) {
printf("%d", i);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, x;
scanf("%d %d", &k, &x);
for (int i = x - k + 1; i < x; i++) {
printf("%d ", i);
}
for (int i = x; i < x + k; i++) {
printf("%d ", i);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 744,577 | 744,578 | u379682992 | cpp |
p02946 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long t, j, p, r, i;
cin >> t >> j;
p = t - j + 1;
if (p < -1000000)
p = -1000000;
r = t + j - 1;
if (r > 1000000)
r = 1000000;
for (i = p; i <= r; i++)
cout << i << " ";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long t, j, p, r, i;
cin >> j >> t;
p = t - j + 1;
if (p < -1000000)
p = -1000000;
r = t + j - 1;
if (r > 1000000)
r = 1000000;
for (i = p; i <= r; i++)
cout << i << " ";
return 0;
}
| [
"expression.operation.binary.remove"
] | 744,605 | 744,606 | u662180008 | cpp |
p02946 | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = X - K + 1; i < X + K - 1; i++) {
cout << i;
if (i == X + K - 2)
cout << endl;
else
cout << ' ';
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = X - K + 1; i <= X + K - 1; i++) {
cout << i;
if (i == X + K - 1)
cout << endl;
else
cout << ' ';
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 744,618 | 744,619 | u306482197 | cpp |
p02946 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int k, x;
cin >> k >> x;
rep(i, k * 2) {
if (i != k * 2 - 1)
cout << x - k + 1 + i << " ";
else
cout << x - k + 1 + i << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int k, x;
cin >> k >> x;
rep(i, k * 2 - 1) {
if (i != k * 2 - 2)
cout << x - k + 1 + i << " ";
else
cout << x - k + 1 + i << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 744,625 | 744,626 | u442855610 | cpp |
p02946 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k - 1; i++) {
cout << i << " ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i <= x + k - 1; i++) {
cout << i << " ";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 744,627 | 744,628 | u716903426 | cpp |
p02946 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int k, x;
cin >> k >> x;
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int k, x;
cin >> k >> x;
int... | [] | 744,643 | 744,644 | u741815956 | cpp |
p02946 | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (long int i = (X - K); i < (X + K + 1); i++) {
cout << i;
if (i == X + K) {
cout << endl;
} else {
cout << " ";
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (long int i = (X - K + 1); i < (X + K); i++) {
cout << i;
if (i == X + K - 1) {
cout << endl;
} else {
cout << " ";
}
}
} | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 744,647 | 744,648 | u436660228 | cpp |
p02946 | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = 0; i < (2 * K - 1); i++) {
cout << X + 1 - K + i << (i == 2 * K - 1 ? " " : "");
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
for (int i = 0; i < (2 * K - 1); i++) {
cout << X + 1 - K + i << (i != 2 * K - 1 ? " " : "");
}
cout << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 744,651 | 744,652 | u669315378 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.