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 |
|---|---|---|---|---|---|---|---|
p03112 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
u... | [
"identifier.change",
"control_flow.loop.for.condition.change"
] | 925,008 | 925,009 | u135572611 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
static const ll INF = (int)1e18;
int main() {
vector<ll> s, t;
ll A, B, Q;
scanf("%lld %lld %lld", &A, &B, &Q);
s.push_back(-INF);
t.push_back(-INF);
ll s_, t_;
for (int i = 0; i < A; i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
static const ll INF = 1e18;
int main() {
vector<ll> s, t;
ll A, B, Q;
scanf("%lld %lld %lld", &A, &B, &Q);
s.push_back(-INF);
t.push_back(-INF);
ll s_, t_;
for (int i = 0; i < A; i++) {
... | [] | 925,020 | 925,021 | u603234915 | cpp |
p03112 | #include <algorithm>
#include <array>
#include <iostream>
using namespace std;
using int64 = long long int;
constexpr int MaxAB = 100000 + 10;
int64 P[2][MaxAB];
int L[2];
pair<int, int> LeftRight(int64 position, int type) {
if (L[type] == 1) {
return make_pair(0, 0);
}
auto where = upper_bound(P[type], P... | #include <algorithm>
#include <array>
#include <iostream>
using namespace std;
using int64 = long long int;
constexpr int MaxAB = 100000 + 10;
int64 P[2][MaxAB];
int L[2];
pair<int, int> LeftRight(int64 position, int type) {
if (L[type] == 1) {
return make_pair(0, 0);
}
auto where = upper_bound(P[type], P... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 925,029 | 925,030 | u636614373 | cpp |
p03112 | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
#define pb push_back
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s, t;
s.pb(-1e18);
t.pb(-1e18);
FOR(i, 0, A) {
ll x;
cin ... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
#define pb push_back
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s, t;
s.pb(-1e18);
t.pb(-1e18);
FOR(i, 0, A) {
ll x;
cin ... | [
"variable_declaration.type.change"
] | 925,031 | 925,032 | u508571192 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const ll INF = 1e9;
int dx[4] = {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const ll INF = 1e18;
int dx[4] = ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 925,037 | 925,038 | u863279562 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vll s, t, x;
for (int i = 0; i < A; ++i) {
ll s_;
cin >> s_;
s.push_back(s_);
}
for (int i = 0; i < B; ++i) {
ll t_;
cin >> t_;
t.push_back(t_);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vll s, t, x;
for (int i = 0; i < A; ++i) {
ll s_;
cin >> s_;
s.push_back(s_);
}
for (int i = 0; i < B; ++i) {
ll t_;
cin >> t_;
t.push_back(t_);
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 925,041 | 925,042 | u826487371 | cpp |
p03112 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int A, B, Q;
cin >> A >> B >> Q;
vector<long long> s(A);
vector<long long> t(B);
vector<long long> x(Q);
for (int i = 0; i < A; i++) {
... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int A, B, Q;
cin >> A >> B >> Q;
vector<long long> s(A);
vector<long long> t(B);
vector<long long> x(Q);
for (int i = 0; i < A; i++) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 925,050 | 925,051 | u494037974 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
const ll INF = 1e15;
int main() {
int A, B, Q;
ll x;
cin >> A >> B >> Q;
ll s[A], t[B], ans[Q];
rep(i, A) cin >> s[i];
rep(i, B) cin >> t[i];
rep(i, Q) {
cin >> x;
int su = lower... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
const ll INF = 1e15;
int main() {
int A, B, Q;
ll x;
cin >> A >> B >> Q;
ll s[A], t[B], ans[Q];
rep(i, A) cin >> s[i];
rep(i, B) cin >> t[i];
rep(i, Q) {
cin >> x;
int su = lower... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 925,052 | 925,053 | u970690920 | cpp |
p03112 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int A, B, Q;
ll s[100000], t[100000];
ll solve(ll a) {
ll ans = 1e18;
if (lower_bound(s, s + A, a) != s) {
//左の神社
ll tmp = 0;
ll pos = *(lower_bound(s, s + A, a) - 1);
tmp += (a - *(lower_bound(s, s + A, a) - 1))... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int A, B, Q;
ll s[100000], t[100000];
ll solve(ll a) {
ll ans = 1e18;
if (lower_bound(s, s + A, a) != s) {
//左の神社
ll tmp = 0;
ll pos = *(lower_bound(s, s + A, a) - 1);
tmp += (a - *(lower_bound(s, s + A, a) - 1))... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 925,058 | 925,059 | u107077805 | cpp |
p03112 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int A, B, Q;
ll s[100000], t[100000];
ll solve(ll a) {
ll ans = 1145141919810893;
if (lower_bound(s, s + A, a) != s) {
//左の神社
ll tmp = 0;
ll pos = *(lower_bound(s, s + A, a) - 1);
tmp += (a - *(lower_bound(s, s +... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int A, B, Q;
ll s[100000], t[100000];
ll solve(ll a) {
ll ans = 1e18;
if (lower_bound(s, s + A, a) != s) {
//左の神社
ll tmp = 0;
ll pos = *(lower_bound(s, s + A, a) - 1);
tmp += (a - *(lower_bound(s, s + A, a) - 1))... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 925,060 | 925,059 | u107077805 | cpp |
p03112 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int A, B, Q;
vector<long long> s;
vector<long long> t;
vector<long long> x;
void chmin(long long &a, long long b) {
if (a > b)
a = b;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(),... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int A, B, Q;
vector<long long> s;
vector<long long> t;
vector<long long> x;
void chmin(long long &a, long long b) {
if (a > b)
a = b;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(),... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 925,063 | 925,064 | u193690465 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll a, b, q;
cin >> a >> b >> q;
ll s[a + 2], t[b + 2], x[q];
for (int i = 1; i < a + 1; i++) {
cin >> s[i];
}
for (int i = 1; i < b + 1; i++) {
cin >> t[i];
}
for (int i = 0; i < q... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll a, b, q;
cin >> a >> b >> q;
ll s[a + 2], t[b + 2], x[q];
for (int i = 1; i < a + 1; i++) {
cin >> s[i];
}
for (int i = 1; i < b + 1; i++) {
cin >> t[i];
}
for (int i = 0; i < q... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 925,065 | 925,066 | u179970156 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll a, b, q;
cin >> a >> b >> q;
ll s[a + 2], t[b + 2], x[q];
for (int i = 1; i < a + 1; i++) {
cin >> s[i];
}
for (int i = 1; i < b + 1; i++) {
cin >> t[i];
}
for (int i = 0; i < q... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll a, b, q;
cin >> a >> b >> q;
ll s[a + 2], t[b + 2], x[q];
for (int i = 1; i < a + 1; i++) {
cin >> s[i];
}
for (int i = 1; i < b + 1; i++) {
cin >> t[i];
}
for (int i = 0; i < q... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 925,067 | 925,066 | u179970156 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
//#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
//#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 925,068 | 925,069 | u554953477 | cpp |
p03112 | #include <bits/stdc++.h>
#define ld long double
#define int long long
using namespace std;
const int N = 2e5 + 50;
const int mod = 1e9 + 7;
const int inf = 1e17;
int dx[] = {0, 1, -1, 0, -1, 1, 1, -1};
int dy[] = {1, 0, 0, -1, -1, 1, -1, 1};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(... | #include <bits/stdc++.h>
#define ld long double
#define int long long
using namespace std;
const int N = 2e5 + 50;
const int mod = 1e9 + 7;
const int inf = 1e17;
int dx[] = {0, 1, -1, 0, -1, 1, 1, -1};
int dy[] = {1, 0, 0, -1, -1, 1, -1, 1};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 925,070 | 925,071 | u715191077 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define INF 1e9 + 7
#define LLINF 1e18
using namespace std;
const int MOD = 1e9 + 7;
int main(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define INF 1e9 + 7
#define LLINF 1e18
using namespace std;
const int MOD = 1e9 + 7;
int main(... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 925,076 | 925,077 | u241367243 | cpp |
p03112 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
#define INF 10000000000
using namespace std;
int A, B, Q;
int main(void) {
scanf("%d %d %d", &A, &B, &Q);
vector<long long int> s, t, x;
int i = 0, j = 0, k = 0;
long long int input;
for (i = 1; i <= A; i++) {
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
#define INF 1000000000000000
using namespace std;
int A, B, Q;
int main(void) {
scanf("%d %d %d", &A, &B, &Q);
vector<long long int> s, t, x;
int i = 0, j = 0, k = 0;
long long int input;
for (i = 1; i <= A; i++) {... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 925,088 | 925,089 | u692704469 | cpp |
p03112 | // All Library
// #include <bits/stdc++.h> //
// https://github.com/gcc-mirror/gcc/blob/master/libstdc%2B%2B-v3/include/precompiled/stdc%2B%2B.h
// C Library
// #include <cassert> // (assert.h) C Diagnostics Library (header)
// #include <cctype> // (ctype.h) Character handling functions (header)
// #include <cerrno> /... | // All Library
// #include <bits/stdc++.h> //
// https://github.com/gcc-mirror/gcc/blob/master/libstdc%2B%2B-v3/include/precompiled/stdc%2B%2B.h
// C Library
// #include <cassert> // (assert.h) C Diagnostics Library (header)
// #include <cctype> // (ctype.h) Character handling functions (header)
// #include <cerrno> /... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 925,094 | 925,095 | u743561048 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
long a, b, q, s[100002], t[100002], ans, i, j, k, x, c, d;
int main() {
scanf("%ld%ld%ld", &a, &b, &q);
for (i = 1; i <= a; i++)
scanf("%ld", &s[i]);
s[a + 1] = 1e18;
s[0] = -1e18;
sort(s, s + a + 2);
for (i = 1; i <= b; i++)
scanf("%ld", &t[i]);
t[b +... | #include <bits/stdc++.h>
using namespace std;
long a, b, q, s[100002], t[100002], ans, i, j, k, x, c, d;
int main() {
scanf("%ld%ld%ld", &a, &b, &q);
for (i = 1; i <= a; i++)
scanf("%ld", &s[i]);
s[a + 1] = 1e18;
s[0] = -1e18;
sort(s, s + a + 2);
for (i = 1; i <= b; i++)
scanf("%ld", &t[i]);
t[b +... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 925,096 | 925,097 | u743561048 | cpp |
p03112 | #define rep(i, x) for (int i = 0; i < x; i++)
#define mod 1000000007
#define MOD 998244353
#define inf 1e18
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <ma... | #define rep(i, x) for (int i = 0; i < x; i++)
#define mod 1000000007
#define MOD 998244353
#define inf 1e18
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <ma... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 925,098 | 925,099 | u407614884 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1000000000000;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1000000000000;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 925,105 | 925,106 | u637771514 | cpp |
p03125 | #include <iostream>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (!b % a)
cout << a + b;
else
cout << b - a;
return 0;
} | #include <iostream>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (!(b % a))
cout << a + b;
else
cout << b - a;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 925,109 | 925,110 | u411546337 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << (a + b);
else
cout << (a - b);
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << (a + b);
else
cout << (b - a);
}
| [
"expression.operation.binary.remove"
] | 925,115 | 925,116 | u795955612 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B & A == 0) {
cout << A + B << endl;
} else if (B & A != 0) {
cout << B - A << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else if (B % A != 0) {
cout << B - A << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 925,117 | 925,118 | u834753207 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A % B == 0) {
cout << A + B << endl;
return 0;
}
cout << B - A << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
return 0;
}
cout << B - A << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,119 | 925,120 | u884776614 | cpp |
p03125 | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << a - b;
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
return 0;
} | [
"expression.operation.binary.remove"
] | 925,123 | 925,124 | u141633429 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0) {
cout << a + b;
} else {
cout << b - a;
}
cout << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
cout << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,125 | 925,126 | u614159574 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << a - b;
}
cout << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
cout << endl;
}
| [
"expression.operation.binary.remove"
] | 925,127 | 925,126 | u614159574 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << a - b;
}
cout << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
cout << endl;
}
| [
"expression.operation.binary.remove"
] | 925,127 | 925,128 | u614159574 | cpp |
p03125 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,129 | 925,130 | u186506670 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << "A + B" << endl;
} else {
cout << "B - A" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
}
| [] | 925,141 | 925,142 | u039537827 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
int main() {
ll a, b;
cin >> a >> b;
ll ans;
if (a % b)
ans = b - a;
else
ans = a + b;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
int main() {
ll a, b;
cin >> a >> b;
ll ans;
if (b % a)
ans = b - a;
else
ans = a + b;... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,143 | 925,144 | u718758485 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,149 | 925,150 | u330661451 | cpp |
p03125 | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
int a, b;
cin >> a >> b;
if (b & a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
} | [
"control_flow.branch.if.condition.change"
] | 925,151 | 925,152 | u037675438 | cpp |
p03125 | #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
int ans = B % A == 0 ? (A + B) : (A - B);
std::cout << ans << std::endl;
return 0;
}
| #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
int ans = B % A == 0 ? (A + B) : (B - A);
std::cout << ans << std::endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 925,155 | 925,156 | u059605263 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << A - B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
} | [
"expression.operation.binary.remove"
] | 925,161 | 925,162 | u164730704 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 1001001001;
/*
*
* */
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (A % B == 0) {
ans = A + B;
} else {
ans = B - A;
}
cout << ans << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 1001001001;
/*
*
* */
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (B % A == 0) {
ans = A + B;
} else {
ans = B - A;
}
cout << ans << endl;
return 0;
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,163 | 925,164 | u067267880 | cpp |
p03125 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | [
"expression.operation.binary.remove"
] | 925,176 | 925,177 | u835805357 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Ye... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Ye... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,182 | 925,183 | u152335469 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a... | [
"expression.operation.binary.remove"
] | 925,184 | 925,185 | u856877925 | cpp |
p03125 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << b - a;
else
cout << b - a << endl;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << b + a << endl;
else
cout << b - a << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"io.output.newline.add"
] | 925,193 | 925,194 | u120050685 | cpp |
p03125 | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (b % a == 0)
std::cout << a + b << '\n';
else {
std::cout << a - b << '\n';
}
return 0;
}
| #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (b % a == 0)
std::cout << a + b << '\n';
else {
std::cout << b - a << '\n';
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 925,195 | 925,196 | u203979694 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
c... | [
"expression.operation.binary.remove"
] | 925,197 | 925,198 | u593934357 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
} | [
"expression.operation.binary.remove"
] | 925,199 | 925,200 | u201928947 | cpp |
p03125 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,201 | 925,202 | u276969395 | cpp |
p03125 | #include <bits/stdc++.h>
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned lon... | #include <bits/stdc++.h>
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned lon... | [
"expression.operation.binary.remove"
] | 925,210 | 925,211 | u858670323 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (A % B == 0 ? A + B : B - A) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : B - A) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 925,226 | 925,227 | u303453927 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << a * b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 925,228 | 925,229 | u717762991 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a * b << endl;
} else {
cout << a + b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 925,230 | 925,229 | u717762991 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 925,231 | 925,232 | u823722490 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = b - a;
if (b % a == 0)
ans = a - b;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = b - a;
if (b % a == 0)
ans = a + b;
cout << ans << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 925,239 | 925,240 | u578871832 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = b - a;
if (a % b == 0)
ans = a - b;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = b - a;
if (b % a == 0)
ans = a + b;
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 925,241 | 925,240 | u578871832 | cpp |
p03125 | #include <cstdio>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a % b == 0) {
printf("%d", a + b);
}
else
printf("%d", b - a);
}
| #include <cstdio>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b % a == 0) {
printf("%d", a + b);
}
else {
printf("%d", b - a);
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,244 | 925,245 | u928286472 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % b)
cout << a - b << endl;
else
cout << a + b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> b >> a;
if (a % b)
cout << a - b << endl;
else
cout << a + b << endl;
} | [
"expression.operation.binary.remove"
] | 925,247 | 925,248 | u802434195 | cpp |
p03125 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.unary.add"
] | 925,249 | 925,250 | u125669112 | cpp |
p03125 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a - b << endl;
else
cout << b - a <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a <... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 925,256 | 925,257 | u534923072 | cpp |
p03125 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0)
cout << a - b << endl;
else
cout << b - a <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a <... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 925,258 | 925,257 | u534923072 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0)
cout << a + b << endl;
else
cout << b - a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,263 | 925,264 | u071304940 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
return 0;
}
cout << a - b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
return 0;
}
cout << b - a << endl;
}
| [
"expression.operation.binary.remove"
] | 925,271 | 925,272 | u188588273 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
}
else {
cout << a - b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
}
else {
cout << b - a << endl;
}
}
| [
"expression.operation.binary.remove"
] | 925,275 | 925,276 | u751515087 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A % B) {
cout << B - A << endl;
} else {
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A) {
cout << B - A << endl;
} else {
cout << A + B << endl;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,279 | 925,280 | u538808095 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << A - B;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
} | [
"expression.operation.binary.remove"
] | 925,281 | 925,282 | u659267170 | cpp |
p03125 | #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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A % B == 0)... | #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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0)... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,287 | 925,288 | u423665486 | cpp |
p03125 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
} | [
"expression.operation.binary.remove"
] | 925,289 | 925,290 | u437095746 | cpp |
p03125 | #include <algorithm>
#include <complex>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - 1 << endl;
}
} | #include <algorithm>
#include <complex>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 925,291 | 925,292 | u583963729 | cpp |
p03125 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
class Stream {
public:
Stream() {}
//配列以外の入力を受け取る
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
class Stream {
public:
Stream() {}
//配列以外の入力を受け取る
... | [
"expression.operation.binary.remove"
] | 925,301 | 925,302 | u269291896 | cpp |
p03125 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr ... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 925,303 | 925,304 | u486105630 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
}
| [
"expression.operation.binary.remove"
] | 925,309 | 925,310 | u296989351 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0)
cout << a + b;
else
cout << b - a;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,315 | 925,316 | u387692529 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
if (!b % a)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 925,320 | 925,321 | u191484928 | cpp |
p03125 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
} | [
"expression.operation.binary.remove"
] | 925,322 | 925,323 | u233586402 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << ((B % A == 0) ? A + B : A - B) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << ((B % A == 0) ? A + B : B - A) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 925,324 | 925,325 | u568877271 | cpp |
p03125 | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#defin... | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#defin... | [
"expression.operation.binary.remove"
] | 925,326 | 925,327 | u164081575 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A != 0)
cout << A + B;
else
cout << B - A;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << A + B;
else
cout << B - A;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 925,328 | 925,329 | u884647366 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A != 0)
cout << A - B;
else
cout << A + B;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << A + B;
else
cout << B - A;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 925,331 | 925,329 | u884647366 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(a, b) \
if ((a) > (b)) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(a, b) \
if ((a) > (b)) ... | [
"expression.operation.binary.remove"
] | 925,335 | 925,336 | u552847961 | cpp |
p03125 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
... | [
"expression.operation.binary.remove"
] | 925,344 | 925,345 | u519759783 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0) {
cout << a + b;
} else
cout << b - a;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else
cout << b - a;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,370 | 925,371 | u478705580 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int A, B;
cin >> A >> B;
if (A ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int A, B;
cin >> A >> B;
if (B ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,372 | 925,373 | u557207741 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>... | [
"control_flow.branch.if.condition.change"
] | 925,374 | 925,375 | u893584578 | cpp |
p03125 | #include <stdio.h>
int main() {
int A, B;
scanf("%d %D", &A, &B);
if (B % A == 0) {
printf("%d", A + B);
} else {
printf("%d", B - A);
}
return 0;
} | #include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (B % A == 0) {
printf("%d\n", A + B);
} else {
printf("%d\n", B - A);
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 925,388 | 925,389 | u089230684 | cpp |
p03125 | #include <stdio.h>
int main() {
int A, B;
scanf("%d %D", &A, &B);
if (B % A == 0) {
printf("%d", A + B);
} else {
printf("%d", B - A);
}
return 0;
} | #include <stdio.h>
int main() {
int A, B;
scanf(" %d %d", &A, &B);
if (B % A == 0) {
printf("%d", A + B);
} else {
printf("%d", B - A);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 925,388 | 925,390 | u089230684 | cpp |
p03125 | #include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (A % B == 0)
printf("%d", A + B);
else
printf("%d", B - A);
return 0;
} | #include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (B % A == 0)
printf("%d", A + B);
else
printf("%d", B - A);
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,391 | 925,392 | u089230684 | cpp |
p03125 | #include <stdio.h>
int main() {
int A, B;
scanf("%d %D", &A, &B);
if (B % A == 0) {
printf("%d", A + B);
} else {
printf("%d", B - A);
}
return 0;
} | #include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (B % A == 0)
printf("%d", A + B);
else
printf("%d", B - A);
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 925,388 | 925,392 | u089230684 | cpp |
p03125 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A % B == 0)
cout << B + A;
else
cout << B - A;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << B + A;
else
cout << B - A;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,397 | 925,398 | u337949146 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,399 | 925,400 | u209457657 | cpp |
p03125 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout <<... | [
"expression.operation.binary.remove"
] | 925,403 | 925,404 | u843929518 | cpp |
p03125 | #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b & a == 0) {
printf("%d", a + b);
} else {
printf("%d", b - a);
}
return 0;
}
| #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b % a == 0) {
printf("%d", a + b);
} else {
printf("%d", b - a);
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 925,405 | 925,406 | u353919145 | cpp |
p03125 | #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b & a == 0) {
printf("%d", a + b);
} else {
printf("%d", b - a);
}
return 0;
}
| #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b % a == 0) {
printf("%d", a + b);
} else {
printf("%d", b - a);
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 925,405 | 925,407 | u353919145 | cpp |
p03125 | #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b & a == 0) {
printf("%d", a + b);
} else {
printf("%d", b - a);
}
return 0;
}
| #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b % a == 0) {
printf("%d", a + b);
} else {
printf("%d", b - a);
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 925,405 | 925,408 | u353919145 | cpp |
p03125 | #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b & a == 0) {
printf("%d", a + b);
} else {
printf("%d", b - a);
}
return 0;
}
| #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b % a == 0) {
printf("%d\n", a + b);
} else {
printf("%d\n", b - a);
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 925,405 | 925,409 | u353919145 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = b % a;
if (c == 0) {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = b % a;
if (c == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 925,410 | 925,411 | u353919145 | cpp |
p03125 | #include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (B % A == 0) {
printf("%d", A + B);
} else {
printf("%d", A - B);
}
return 0;
} | #include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (B % A == 0) {
printf("%d", A + B);
} else {
printf("%d", B - A);
}
return 0;
} | [
"expression.operation.binary.remove"
] | 925,412 | 925,413 | u018679195 | cpp |
p03125 | #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
b % a == 0 ? printf("%d\n", a + b) : printf("%d\n", a - b);
return 0;
}
| #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
b % a == 0 ? printf("%d\n", a + b) : printf("%d\n", b - a);
return 0;
}
| [
"expression.operation.binary.remove"
] | 925,414 | 925,415 | u567412106 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
}
| [
"expression.operation.binary.remove"
] | 925,416 | 925,417 | u317830102 | cpp |
p03125 | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a % b == 0) {
printf("%d\n", a + b);
} else {
printf("%d\n", b - a);
}
return 0;
}
| #include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b % a == 0) {
printf("%d\n", a + b);
} else {
printf("%d\n", b - a);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,418 | 925,419 | u863370423 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long lon... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long lon... | [
"expression.operation.binary.remove"
] | 925,442 | 925,443 | u459759631 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << a - b;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 925,444 | 925,445 | u746613804 | cpp |
p03125 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << A - B << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
}
| [
"expression.operation.binary.remove"
] | 925,446 | 925,447 | u963353562 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B;
cin >> A >> B;
if (A % B == 0)
cout << A + B <... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << A + B <... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,452 | 925,453 | u530957410 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.