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 |
|---|---|---|---|---|---|---|---|
p03125 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | [
"expression.operation.binary.remove"
] | 925,456 | 925,457 | u366581326 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e9 + 7;
int main() {
ll a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << a - b;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e9 + 7;
int main() {
ll a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
}
| [
"expression.operation.binary.remove"
] | 925,462 | 925,463 | u747700442 | cpp |
p03125 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int A, B;
scanf("%d %d", &A, &B);
printf("%d\n", B % A == 0 ? A + B : A - B);
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int A, B;
scanf("%d %d", &A, &B);
printf("%d\n", B % A == 0 ? A + B : B - A);
return 0;
}
| [
"expression.operation.binary.remove"
] | 925,464 | 925,465 | u684448032 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
long long x[100010], y[100010], z[100010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long a, b, c, cnt = 0, ans = 0, n;
string s, v;
cin >> a >> b;
if (a % b == 0) {
cout << a + b << '\n';
} else {
cout << b - a << '\n';
}
}
| #include <bits/stdc++.h>
using namespace std;
long long x[100010], y[100010], z[100010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long a, b, c, cnt = 0, ans = 0, n;
string s, v;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << '\n';
} else {
cout << b - a << '\n';
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,466 | 925,467 | u600244905 | 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,468 | 925,469 | u714624983 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A % 2 == 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;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.remove"
] | 925,470 | 925,469 | u714624983 | cpp |
p03125 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
i... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
i... | [
"expression.operation.binary.remove"
] | 925,473 | 925,474 | u418810472 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
ll A, B;
cin >> A >> B;
if (B % A == 0) {
cout << B / A << endl;
} else {
cout << B - A << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
ll A, B;
cin >> A >> B;
if (B % A == 0) {
cout << B + A << endl;
} else {
cout << B - A << endl;
}
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 925,483 | 925,484 | u190875453 | cpp |
p03125 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"expression.operation.binary.remove"
] | 925,490 | 925,491 | u580593895 | cpp |
p03125 | #include <bits/stdc++.h>
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 <bits/stdc++.h>
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,494 | 925,495 | u861231819 | cpp |
p03125 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"expression.operation.binary.remove"
] | 925,498 | 925,499 | u516525290 | cpp |
p03125 | // B +/- A
#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;
} | // B +/- A
#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,500 | 925,501 | u896325626 | cpp |
p03125 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A % B == 0)
cout << A + B << endl;
else
cout << B - A << endl;
return 0;
}
| #include <iostream>
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;
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,502 | 925,503 | u563743611 | cpp |
p03125 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
int a, b;
cin >> a >> b;
if (a % b == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
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,504 | 925,505 | u088895504 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a % b == 0 ? a + b : b - a);
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a);
}
| [
"expression.operation.binary.remove"
] | 925,511 | 925,512 | u639300218 | cpp |
p03125 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
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>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
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,513 | 925,514 | u886613668 | cpp |
p03125 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
using namespace std;
typedef long long ll;
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))
#define _Pi 3.1415926535
using namespace std;
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",
"control_flow.branch.if.condition.change"
] | 925,529 | 925,530 | u445457059 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
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,531 | 925,532 | u648009244 | cpp |
p03125 |
#include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>>(char &);
inline kin &operator>>(int &);
inline kin &operator>>(long long &);
inline kin &operator>>(double &);
inline kin &operator>>(long double &);
in... |
#include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>>(char &);
inline kin &operator>>(int &);
inline kin &operator>>(long long &);
inline kin &operator>>(double &);
inline kin &operator>>(long double &);
in... | [
"expression.operation.binary.remove"
] | 925,533 | 925,534 | u316440712 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c;
if (b % a == 0)
c = a + b;
else
c = a - b;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c;
if (b % a == 0)
c = a + b;
else
c = b - a;
cout << c << endl;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 925,535 | 925,536 | u217508499 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int M... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int M... | [
"expression.operation.binary.remove"
] | 925,537 | 925,538 | u190761897 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b)... | [
"expression.operation.binary.remove"
] | 925,541 | 925,542 | u545364250 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a)
cout << b - a << endl;
cout << a + b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a)
cout << b - a << endl;
else
cout << a + b << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 925,549 | 925,550 | u608258653 | cpp |
p03125 | #include <bits/stdc++.h>
#include <iostream>
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 << a - b << endl;
} | #include <bits/stdc++.h>
#include <iostream>
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"
] | 925,551 | 925,552 | u740686641 | 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);
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);
return 0;
}
| [
"expression.operation.binary.remove"
] | 925,555 | 925,556 | u025394570 | cpp |
p03125 | #include <iostream>
int main() {
using namespace std;
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else {
cout << a - b << endl;
}
} | #include <iostream>
int main() {
using namespace std;
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else {
cout << b - a << endl;
}
} | [
"expression.operation.binary.remove"
] | 925,557 | 925,558 | u296160120 | cpp |
p03125 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | [
"expression.operation.binary.remove"
] | 925,561 | 925,562 | u776056110 | cpp |
p03125 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
typedef long long int ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
typedef long long int ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B... | [
"expression.operation.binary.remove",
"assignment.change"
] | 925,567 | 925,568 | u438265890 | cpp |
p03125 | #include <iostream>
void solve(int a, int b) {
if (b % a == 0)
std::cout << a + b;
else
std::cout << b - a;
}
int read() {
int t;
std::cin >> t;
return t;
}
int main() { solve(read(), read()); } | #include <iostream>
void solve(int b, int a) {
if (b % a == 0)
std::cout << a + b;
else
std::cout << b - a;
}
int read() {
int t;
std::cin >> t;
return t;
}
int main() { solve(read(), read()); } | [
"identifier.change"
] | 925,571 | 925,572 | u708618797 | cpp |
p03125 | #include <iostream>
void solve(int b, int a) {
if (b % a == 0)
std::cout << a + b;
else
std::cout << a - b;
}
int read() {
int t;
std::cin >> t;
return t;
}
int main() { solve(read(), read()); }
| #include <iostream>
void solve(int b, int a) {
if (b % a == 0)
std::cout << a + b;
else
std::cout << b - a;
}
int read() {
int t;
std::cin >> t;
return t;
}
int main() { solve(read(), read()); } | [
"expression.operation.binary.remove"
] | 925,573 | 925,572 | u708618797 | cpp |
p03125 | #include <iostream>
void solve(int a, int b) {
if (b % a == 0)
std::cout << a + b;
else
std::cout << a - b;
}
int read() {
int t;
std::cin >> t;
return t;
}
int main() { solve(read(), read()); } | #include <iostream>
void solve(int b, int a) {
if (b % a == 0)
std::cout << a + b;
else
std::cout << b - a;
}
int read() {
int t;
std::cin >> t;
return t;
}
int main() { solve(read(), read()); } | [
"identifier.change",
"expression.operation.binary.remove"
] | 925,574 | 925,572 | u708618797 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
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,583 | 925,584 | u552122040 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
#define INF (int)(1e9)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, start, end) for (int i = (start); i <= (end); i++)
#define all(n) begin(n), end(n)... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
#define INF (int)(1e9)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, start, end) for (int i = (start); i <= (end); i++)
#define all(n) begin(n), end(n)... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,599 | 925,600 | u959682820 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
(b % a == 0) ? cout << a + b << '\n' : cout << a - b << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
(b % a == 0) ? cout << a + b << '\n' : cout << b - a << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 925,601 | 925,602 | u551519692 | 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,607 | 925,608 | u936105062 | cpp |
p03125 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int b, c;
cin >> b >> c;
if (b % c == 0)
cout << b + c;
else
cout << c - b;
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
int b, c;
cin >> b >> c;
if (c % b == 0)
cout << b + c;
else
cout << c - b;
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,613 | 925,614 | u798851723 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a - b << endl;
else
cout << b - a << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 925,615 | 925,616 | u407213771 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
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;
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,619 | 925,620 | u904123392 | 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,621 | 925,622 | u472645805 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | [
"expression.operation.unary.add"
] | 925,628 | 925,629 | u517411077 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 998244353
#define int long long int
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mpow(int... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 998244353
#define int long long int
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mpow(int... | [
"expression.operation.binary.remove"
] | 925,630 | 925,631 | u568545273 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i... | [
"expression.operation.binary.remove",
"assignment.change"
] | 925,632 | 925,633 | u882037708 | 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;
} else {
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;
} else {
cout << b - a << endl;
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,634 | 925,635 | u533749093 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | [
"expression.operation.binary.remove"
] | 925,644 | 925,645 | u547754910 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef unsigned long long ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 1e12;
const int i_INF = 2147483647;
in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef unsigned long long ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 1e12;
const int i_INF = 2147483647;
in... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 925,657 | 925,658 | u726450206 | 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;
} 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;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,663 | 925,664 | u559112776 | cpp |
p03125 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"expression.operation.binary.remove"
] | 925,667 | 925,668 | u132033278 | cpp |
p03125 | #include <bits/stdc++.h>
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;
return 0;
} | #include <bits/stdc++.h>
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;
return 0;
} | [
"expression.operation.binary.remove"
] | 925,669 | 925,670 | u281840563 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define ANS cout << ans << endl
#define all(a) a.begin(), a.end()
#define SORT(a) sort(al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define ANS cout << ans << endl
#define all(a) a.begin(), a.end()
#define SORT(a) sort(al... | [
"expression.operation.binary.remove"
] | 925,675 | 925,676 | u969651765 | cpp |
p03125 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << (n))
#define BITCNT(n) (__builtin_popcou... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << (n))
#define BITCNT(n) (__builtin_popcou... | [
"control_flow.branch.if.condition.change"
] | 925,677 | 925,678 | u905715926 | 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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii ve... | #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 ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii ve... | [
"expression.operation.binary.remove"
] | 925,689 | 925,690 | u075520262 | cpp |
p03125 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << A - B;
}
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
} | [
"expression.operation.binary.remove"
] | 925,691 | 925,692 | u994956045 | cpp |
p03125 | #include <iostream>
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>
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,703 | 925,704 | u112318601 | cpp |
p03125 | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d", &a);
scanf("%d", &b);
if (b % a == 0) {
printf("%d\n", a + b);
} else {
printf("%d\n", a - b);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d", &a);
scanf("%d", &b);
if (b % a == 0) {
printf("%d\n", a + b);
} else {
printf("%d\n", b - a);
}
return 0;
} | [
"expression.operation.binary.remove"
] | 925,705 | 925,706 | u644911355 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#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",
"control_flow.branch.if.condition.change"
] | 925,713 | 925,714 | u553461888 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
cout << (((b % a) == 0) ? (a + b) : (b - a)) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 925,715 | 925,716 | u225581241 | cpp |
p03125 | #include <bits/stdc++.h>
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 <bits/stdc++.h>
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,723 | 925,724 | u937275419 | cpp |
p03125 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
if (a % b == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> 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,725 | 925,726 | u479202791 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << A - B << endl;
}
return 0;
} | #include <iostream>
using namespace std;
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,729 | 925,730 | u074372598 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, cnt = 0, c, d;
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() {
long long int a, b, cnt = 0, c, d;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else
cout << b - a << endl;
}
| [
"expression.operation.binary.remove"
] | 925,734 | 925,735 | u222613738 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, cnt = 0, c, d;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
}
cout << a - b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, cnt = 0, c, d;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else
cout << b - a << endl;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.operation.binary.remove"
] | 925,736 | 925,735 | u222613738 | cpp |
p03125 | #include <bits/stdc++.h>
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;
}
return 0;
}
| #include <bits/stdc++.h>
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;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 925,752 | 925,753 | u707853565 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
/* short names and const
using ll = long long;
using vll = vector<long long>;
using df = vector<vector<long long>>;
df data(n, vector<long long>(m));
const int MOD = 1e9 + 7;
const long long INF = 1e18;
*/
/* Boost!
#include <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
/* short names and const
using ll = long long;
using vll = vector<long long>;
using df = vector<vector<long long>>;
df data(n, vector<long long>(m));
const int MOD = 1e9 + 7;
const long long INF = 1e18;
*/
/* Boost!
#include <... | [
"expression.operation.binary.remove"
] | 925,764 | 925,765 | u844005364 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = b % a == 0 ? a + b : a - b;
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = b % a == 0 ? a + b : b - a;
cout << c << endl;
}
| [
"expression.operation.binary.remove"
] | 925,774 | 925,775 | u397130503 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : A - B) << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : B - A) << '\n';
}
| [
"expression.operation.binary.remove"
] | 925,776 | 925,777 | u459737327 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (b % a == 0) {
ans = a + b;
} else {
ans = a - b;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (b % a == 0) {
ans = a + b;
} else {
ans = b - a;
}
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 925,780 | 925,781 | u438592861 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,794 | 925,795 | u155216115 | 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,796 | 925,797 | u411557858 | cpp |
p03125 | #include <iostream>
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>
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,798 | 925,799 | u716314620 | cpp |
p03125 | #include <bits/stdc++.h>
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 <bits/stdc++.h>
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,800 | 925,801 | u058295774 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> b >> a;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
} | [
"expression.operation.binary.remove"
] | 925,802 | 925,803 | u768204022 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> b >> a;
if (b % a != 0)
cout << a + b;
else
cout << b - a;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
} | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 925,804 | 925,803 | u768204022 | 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;
}
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;
} else {
cout << b - a << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 925,805 | 925,806 | u318027064 | 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;
}
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;
} else {
cout << b - a << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 925,807 | 925,806 | u318027064 | cpp |
p03125 | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long... | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long... | [] | 925,808 | 925,809 | u319945100 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << A + B;
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;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 925,812 | 925,813 | u091665287 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
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>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++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",
"control_flow.branch.if.condition.change"
] | 925,814 | 925,815 | u200509145 | 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;
} else {
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;
} else {
cout << B - A << endl;
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,825 | 925,826 | u084069244 | 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,827 | 925,828 | u366115355 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | [
"expression.operation.binary.remove"
] | 925,833 | 925,834 | u995725911 | cpp |
p03125 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
int main() {
ll a, b;
cin >> a >> b;
if (b % a == 0)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
int main() {
ll a, b;
cin >> a >> b;
if (b % a == 0)... | [
"expression.operation.binary.remove"
] | 925,842 | 925,843 | u273928723 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
}
| [
"expression.operation.binary.remove"
] | 925,844 | 925,845 | u494379309 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | [
"expression.operation.binary.remove"
] | 925,856 | 925,857 | u900485130 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector... | [
"expression.operation.binary.remove"
] | 925,858 | 925,859 | u153867760 | 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,860 | 925,861 | u914086391 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
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;
#define rep(i, n) for (int i = 0; i < 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"
] | 925,866 | 925,867 | u551813187 | cpp |
p03125 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << A + B;
else
cout << A - B;
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << A + B;
else
cout << B - A;
return 0;
} | [
"expression.operation.binary.remove"
] | 925,876 | 925,877 | u895536055 | 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 if (B % A != 0) {
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 if (B % A != 0) {
cout << B - A;
}
}
| [
"expression.operation.binary.remove"
] | 925,878 | 925,879 | u224951113 | cpp |
p03125 | #include <bits/stdc++.h>
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define sort(a) sort((a).begin(), (a).end())
#define rev(a) reverse((a).begin(), (a).end())
using db = double;
using namespace std;
typedef long long ll;
int main(... | #include <bits/stdc++.h>
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define sort(a) sort((a).begin(), (a).end())
#define rev(a) reverse((a).begin(), (a).end())
using db = double;
using namespace std;
typedef long long ll;
int main(... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,880 | 925,881 | u702457163 | cpp |
p03125 | // abc118_a
// #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A == 1) {
cout << A + B << endl;
return 0;
}
if (B / A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
return 0;
} | // abc118_a
// #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A == 1) {
cout << A + B << endl;
return 0;
}
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 925,885 | 925,886 | u798557584 | cpp |
p03125 | #include <iostream>
#include <string>
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 <string>
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,891 | 925,892 | u840731541 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | [
"expression.operation.binary.remove"
] | 925,896 | 925,897 | u859765185 | 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);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a);
}
| [
"expression.operation.binary.remove"
] | 925,902 | 925,903 | u950901760 | cpp |
p03125 | #include <algorithm>
#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 <algorithm>
#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,917 | 925,918 | u256027816 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int main() {
i... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int main() {
i... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 925,919 | 925,920 | u003860320 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int main() {
i... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int main() {
i... | [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change"
] | 925,921 | 925,920 | u003860320 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
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;
typedef long long int lli;
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,922 | 925,923 | u194908943 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, d;
cin >> A >> B;
d = A % B;
if (d == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, d;
cin >> A >> B;
d = B % A;
if (d == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 925,924 | 925,925 | u910900288 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b) << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
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,926 | 925,927 | u392569193 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (b & a == 0) {
ans = a + b;
} else {
ans = b - a;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (b % a == 0) {
ans = a + b;
} else {
ans = b - a;
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 925,930 | 925,931 | u245414044 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.