problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
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 = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007 // 10^9+7
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
const int INF = numeric_limits<int>::max();
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
// 負の数にも対応した % 演算
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0)
res += m;
return res;
}
// greatest common divisor
long long gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
// least common multiple
long long lcm(ll a, ll b) { return a / gcd(a, b) * b; }
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
return 0;
}
| #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 = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007 // 10^9+7
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
const int INF = numeric_limits<int>::max();
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
// 負の数にも対応した % 演算
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0)
res += m;
return res;
}
// greatest common divisor
long long gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
// least common multiple
long long lcm(ll a, ll b) { return a / gcd(a, b) * b; }
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
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,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;
int main() {
cout << fixed << setprecision(10);
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>
#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;
int main() {
cout << fixed << setprecision(10);
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,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 <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // 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> // 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 <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // 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,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>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
vector<int> bitSearch(int bit, int n) {
vector<int> S;
rep(i, n) if (bit & (1 << i)) S.push_back(i);
return S;
}
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b);
}
| #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>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
vector<int> bitSearch(int bit, int n) {
vector<int> S;
rep(i, n) if (bit & (1 << i)) S.push_back(i);
return S;
}
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a);
}
| [
"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 &);
inline kin &operator>>(char *);
template <class T> inline void get(T *, int);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} in;
class kout {
public:
inline void open(FILE *, int);
inline void close(void);
inline void print(void);
inline kout &operator<<(char);
inline kout &operator<<(int);
inline kout &operator<<(long long);
inline kout &operator<<(double);
inline kout &operator<<(long double);
inline kout &operator<<(const char *);
template <class T> inline void put(T *, int, char, char);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} out;
int main(int argc, char **argv) {
in.open(stdin, 512);
out.open(stdout, 512);
in.scan();
int a, b;
in >> a >> b;
out << (a % b ? b - a : a + b) << '\n';
out.print();
in.close();
out.close();
return 0;
}
inline void kin::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kin::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kin::scan(void) {
int readsiz =
(int)std::fread((void *)buf, (std::size_t)1, (std::size_t)siz, fp);
if (readsiz != siz)
buf[readsiz] = '\x00';
idx = 0;
return;
}
inline kin &kin::operator>>(char &var) {
if (!buf[idx]) {
var = '\x00';
return *this;
}
var = buf[idx];
if (++idx == siz)
scan();
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(int &var) {
if (!buf[idx]) {
var = 0;
return *this;
}
int sign = -1;
if (buf[idx] == '-') {
sign = 1;
if (++idx == siz)
scan();
}
var = 0;
while (buf[idx] >= '0') {
var = var * 10 - (int)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long long &var) {
if (!buf[idx]) {
var = 0LL;
return *this;
}
long long sign = -1LL;
if (buf[idx] == '-') {
sign = 1LL;
if (++idx == siz)
scan();
}
var = 0LL;
while (buf[idx] >= '0') {
var = var * 10LL - (long long)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(double &var) {
if (!buf[idx]) {
var = 0.0;
return *this;
}
double sign = -1.0;
if (buf[idx] == '-') {
sign = 1.0;
if (++idx == siz)
scan();
}
var = 0.0;
while (buf[idx] >= '0') {
var = var * 10.0 - (double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
double dig = 1.0;
while (buf[idx] >= '0') {
var -= (double)(buf[idx] - '0') * (dig /= 10.0);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long double &var) {
if (!buf[idx]) {
var = 0.0L;
return *this;
}
long double sign = -1.0L;
if (buf[idx] == '-') {
sign = 1.0L;
if (++idx == siz)
scan();
}
var = 0.0L;
while (buf[idx] >= '0') {
var = var * 10.0L - (long double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
long double dig = 1.0L;
while (buf[idx] >= '0') {
var -= (long double)(buf[idx] - '0') * (dig /= 10.0L);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(char *var) {
if (!buf[idx]) {
var[0] = '\x00';
return *this;
}
int ptr = 0;
while (buf[idx] >= '!') {
var[ptr++] = buf[idx];
if (++idx == siz)
scan();
}
var[ptr] = '\x00';
if (++idx == siz)
scan();
return *this;
}
template <class T> inline void kin::get(T *var, int num) {
for (int i = 0; i < num; ++i)
(*this) >> var[i];
return;
}
inline void kout::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kout::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kout::print(void) {
std::fwrite((void *)buf, (std::size_t)1, (std::size_t)idx, fp);
idx = 0;
return;
}
inline kout &kout::operator<<(char val) {
buf[idx] = val;
if (++idx == siz)
print();
return *this;
}
inline kout &kout::operator<<(int val) {
if (val < 0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1;
char dig[10];
int ptr = 0;
do {
int tmp = val / 10;
dig[ptr++] = (char)-(val - tmp * 10) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(long long val) {
if (val < 0LL) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1LL;
char dig[19];
int ptr = 0;
do {
long long tmp = val / 10LL;
dig[ptr++] = (char)-(val - tmp * 10LL) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(double val) {
if (val < 0.0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0;
double dig = 1.0;
while (val / dig <= -10.0)
dig *= 10.0;
int tmp;
while (dig >= 1.0) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 12; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
return *this;
}
inline kout &kout::operator<<(long double val) {
if (val < 0.0L) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0L;
long double dig = 1.0L;
while (val / dig <= -10.0L)
dig *= 10.0L;
int tmp;
while (dig >= 1.0L) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 16; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
return *this;
}
inline kout &kout::operator<<(const char *val) {
for (int i = 0; val[i]; ++i) {
buf[idx] = val[i];
if (++idx == siz)
print();
}
return *this;
}
template <class T> inline void kout::put(T *val, int num, char spc, char end) {
--num;
for (int i = 0; i < num; ++i)
(*this) << val[i] << spc;
(*this) << val[num] << end;
return;
}
|
#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 &);
inline kin &operator>>(char *);
template <class T> inline void get(T *, int);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} in;
class kout {
public:
inline void open(FILE *, int);
inline void close(void);
inline void print(void);
inline kout &operator<<(char);
inline kout &operator<<(int);
inline kout &operator<<(long long);
inline kout &operator<<(double);
inline kout &operator<<(long double);
inline kout &operator<<(const char *);
template <class T> inline void put(T *, int, char, char);
private:
FILE *fp;
char *buf;
int siz;
int idx;
} out;
int main(int argc, char **argv) {
in.open(stdin, 512);
out.open(stdout, 512);
in.scan();
int a, b;
in >> a >> b;
out << (b % a ? b - a : a + b) << '\n';
out.print();
in.close();
out.close();
return 0;
}
inline void kin::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kin::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kin::scan(void) {
int readsiz =
(int)std::fread((void *)buf, (std::size_t)1, (std::size_t)siz, fp);
if (readsiz != siz)
buf[readsiz] = '\x00';
idx = 0;
return;
}
inline kin &kin::operator>>(char &var) {
if (!buf[idx]) {
var = '\x00';
return *this;
}
var = buf[idx];
if (++idx == siz)
scan();
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(int &var) {
if (!buf[idx]) {
var = 0;
return *this;
}
int sign = -1;
if (buf[idx] == '-') {
sign = 1;
if (++idx == siz)
scan();
}
var = 0;
while (buf[idx] >= '0') {
var = var * 10 - (int)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long long &var) {
if (!buf[idx]) {
var = 0LL;
return *this;
}
long long sign = -1LL;
if (buf[idx] == '-') {
sign = 1LL;
if (++idx == siz)
scan();
}
var = 0LL;
while (buf[idx] >= '0') {
var = var * 10LL - (long long)(buf[idx] - '0');
if (++idx == siz)
scan();
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(double &var) {
if (!buf[idx]) {
var = 0.0;
return *this;
}
double sign = -1.0;
if (buf[idx] == '-') {
sign = 1.0;
if (++idx == siz)
scan();
}
var = 0.0;
while (buf[idx] >= '0') {
var = var * 10.0 - (double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
double dig = 1.0;
while (buf[idx] >= '0') {
var -= (double)(buf[idx] - '0') * (dig /= 10.0);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(long double &var) {
if (!buf[idx]) {
var = 0.0L;
return *this;
}
long double sign = -1.0L;
if (buf[idx] == '-') {
sign = 1.0L;
if (++idx == siz)
scan();
}
var = 0.0L;
while (buf[idx] >= '0') {
var = var * 10.0L - (long double)(buf[idx] - '0');
if (++idx == siz)
scan();
}
if (buf[idx] == '.') {
if (++idx == siz)
scan();
long double dig = 1.0L;
while (buf[idx] >= '0') {
var -= (long double)(buf[idx] - '0') * (dig /= 10.0L);
if (++idx == siz)
scan();
}
}
var *= sign;
if (++idx == siz)
scan();
return *this;
}
inline kin &kin::operator>>(char *var) {
if (!buf[idx]) {
var[0] = '\x00';
return *this;
}
int ptr = 0;
while (buf[idx] >= '!') {
var[ptr++] = buf[idx];
if (++idx == siz)
scan();
}
var[ptr] = '\x00';
if (++idx == siz)
scan();
return *this;
}
template <class T> inline void kin::get(T *var, int num) {
for (int i = 0; i < num; ++i)
(*this) >> var[i];
return;
}
inline void kout::open(FILE *fpa, int siza) {
fp = fpa;
buf = new char[siza];
siz = siza;
idx = 0;
return;
}
inline void kout::close(void) {
fp = nullptr;
delete[] buf;
buf = nullptr;
siz = 0;
idx = 0;
return;
}
inline void kout::print(void) {
std::fwrite((void *)buf, (std::size_t)1, (std::size_t)idx, fp);
idx = 0;
return;
}
inline kout &kout::operator<<(char val) {
buf[idx] = val;
if (++idx == siz)
print();
return *this;
}
inline kout &kout::operator<<(int val) {
if (val < 0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1;
char dig[10];
int ptr = 0;
do {
int tmp = val / 10;
dig[ptr++] = (char)-(val - tmp * 10) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(long long val) {
if (val < 0LL) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1LL;
char dig[19];
int ptr = 0;
do {
long long tmp = val / 10LL;
dig[ptr++] = (char)-(val - tmp * 10LL) + '0';
val = tmp;
} while (val);
while (ptr--) {
buf[idx] = dig[ptr];
if (++idx == siz)
print();
}
return *this;
}
inline kout &kout::operator<<(double val) {
if (val < 0.0) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0;
double dig = 1.0;
while (val / dig <= -10.0)
dig *= 10.0;
int tmp;
while (dig >= 1.0) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 12; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (double)tmp * dig;
dig /= 10.0;
}
return *this;
}
inline kout &kout::operator<<(long double val) {
if (val < 0.0L) {
buf[idx] = '-';
if (++idx == siz)
print();
} else
val *= -1.0L;
long double dig = 1.0L;
while (val / dig <= -10.0L)
dig *= 10.0L;
int tmp;
while (dig >= 1.0L) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
buf[idx] = '.';
if (++idx == siz)
print();
for (int i = 0; i < 16; ++i) {
buf[idx] = (char)-(tmp = (int)(val / dig)) + '0';
if (++idx == siz)
print();
val -= (long double)tmp * dig;
dig /= 10.0L;
}
return *this;
}
inline kout &kout::operator<<(const char *val) {
for (int i = 0; val[i]; ++i) {
buf[idx] = val[i];
if (++idx == siz)
print();
}
return *this;
}
template <class T> inline void kout::put(T *val, int num, char spc, char end) {
--num;
for (int i = 0; i < num; ++i)
(*this) << val[i] << spc;
(*this) << val[num] << end;
return;
}
| [
"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 MOD = (int)1e9 + 7;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
cout << ((b % a == 0) ? a + b : a - b) << endl;
return 0;
}
| #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 MOD = (int)1e9 + 7;
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,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) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << A + B;
else
cout << 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) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << A + B;
else
cout << B - A;
} | [
"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, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int ab(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
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 <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, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int ab(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
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,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;
cin >> A >> B;
int ans;
if (B % A == 0)
ans = A + B;
else
ans = A - B;
cout << ans << endl;
// system("pause");
return 0;
} | #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;
cin >> A >> B;
int ans;
if (B % A == 0)
ans = A + B;
else
ans = B - A;
cout << ans << endl;
// system("pause");
return 0;
} | [
"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)
#define DEBUG
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 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)
#define DEBUG
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,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) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
int main() {
int a, b;
cin >> a >> b;
cout << ((b % a) ? a + b : b - a) << "\n";
return 0;
} | #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) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
int main() {
int a, b;
cin >> a >> b;
cout << (!(b % a) ? a + b : b - a) << "\n";
return 0;
} | [
"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 N, int P, int M) //繰り返し自乗法
{
if (P == 0)
return 1;
if (P % 2 == 0) {
int t = mpow(N, P / 2, M);
return t * t % M;
}
return N * mpow(N, P - 1, M) % M;
}
signed 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 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 N, int P, int M) //繰り返し自乗法
{
if (P == 0)
return 1;
if (P % 2 == 0) {
int t = mpow(N, P / 2, M);
return t * t % M;
}
return N * mpow(N, P - 1, M) % M;
}
signed 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,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++)
#define FORl(i, m, n) for (ll i = m; i < (ll)n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int a, b;
cin >> a >> b;
int ans;
if (b % a == 0) {
ans = a + b;
} else {
ans = a - b;
}
cout << ans << endl;
}
| #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++)
#define FORl(i, m, n) for (ll i = m; i < (ll)n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int a, b;
cin >> a >> b;
int ans;
if (b % a == 0) {
ans = a + b;
} else {
ans = b - a;
}
cout << ans << endl;
}
| [
"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 // vector誤字保険
#define ednl endl // endl誤字保険
#define opt() \
cin.tie(0); \
ios::sync_with_stdio(false) // 入出力速度改善
#define rep(i, l, r) \
for (ll i = (l); i < (r); i++) // 範囲[l, r)で刻み1のfor文(順方向)
#define repp(i, l, r, k) \
for (ll i = (l); i < (r); i += (k)) // 範囲[l, r)で刻みkのfor文(順方向)
#define rrep(i, l, r) \
for (ll i = (r - 1); i >= (l); i--) // 範囲[l, r)で刻み1のfor文(逆方向)
#define rrepp(i, l, r, k) \
for (ll i = (r - 1); i >= (l); i -= (k)) // 範囲[l, r)で刻みkのfor文(逆方向)
#define all(x) (x).begin(), (x).end() // vectorのポインタ位置指定用
#define max(p, q) ((p) > (q) ? (p) : (q)) // max拡張
#define min(p, q) ((p) < (q) ? (p) : (q)) // min拡張
#define bit(n, m) (((n) >> (m)) & 1) // 変数nのm番目のbitを取り出す
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dy[] = {0, 1, 0, -1}; // 4方向近傍
int dx[] = {1, 0, -1, 0}; // 4方向近傍
int main() {
ll a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b) << ednl;
}
| #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 // vector誤字保険
#define ednl endl // endl誤字保険
#define opt() \
cin.tie(0); \
ios::sync_with_stdio(false) // 入出力速度改善
#define rep(i, l, r) \
for (ll i = (l); i < (r); i++) // 範囲[l, r)で刻み1のfor文(順方向)
#define repp(i, l, r, k) \
for (ll i = (l); i < (r); i += (k)) // 範囲[l, r)で刻みkのfor文(順方向)
#define rrep(i, l, r) \
for (ll i = (r - 1); i >= (l); i--) // 範囲[l, r)で刻み1のfor文(逆方向)
#define rrepp(i, l, r, k) \
for (ll i = (r - 1); i >= (l); i -= (k)) // 範囲[l, r)で刻みkのfor文(逆方向)
#define all(x) (x).begin(), (x).end() // vectorのポインタ位置指定用
#define max(p, q) ((p) > (q) ? (p) : (q)) // max拡張
#define min(p, q) ((p) < (q) ? (p) : (q)) // min拡張
#define bit(n, m) (((n) >> (m)) & 1) // 変数nのm番目のbitを取り出す
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dy[] = {0, 1, 0, -1}; // 4方向近傍
int dx[] = {1, 0, -1, 0}; // 4方向近傍
int main() {
ll a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << ednl;
}
| [
"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;
int main() {
int a, b;
cin >> a >> b;
if ((b % a) == 0)
cout << b - a << endl;
else
cout << b + a << endl;
} | #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;
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.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>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<long long> vlong;
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define INF 2e9
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b);
return (0);
}
| #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>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<long long> vlong;
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define INF 2e9
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a);
return (0);
}
| [
"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(all(a))
#define REVERSE(a) reverse(all(a))
#define int long long
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define VIin(a) \
for (int i = 0; i < a.size(); i++) \
cin >> a[i]
#define OUT(a) cout << a << endl
typedef vector<int> VI;
typedef vector<VI> VVI;
const int MOD = 1e9 + 7;
const long long INF = 1LL << 60;
/*最大公約数*/ int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ int lcm(int a, int b) {
int g = gcd(a, b);
return a / g * b;
}
/*素数判定*/ int isPrime(int n) {
if (n < 2) {
return 0;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
/*約数列挙*/ vector<int> getDivisor(int n) {
vector<int> v;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
//----------------------------------------------
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b;
cin >> a >> b;
if (b % a == 0)
OUT(a + b);
else
OUT(a - b);
return 0;
} | #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(all(a))
#define REVERSE(a) reverse(all(a))
#define int long long
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define VIin(a) \
for (int i = 0; i < a.size(); i++) \
cin >> a[i]
#define OUT(a) cout << a << endl
typedef vector<int> VI;
typedef vector<VI> VVI;
const int MOD = 1e9 + 7;
const long long INF = 1LL << 60;
/*最大公約数*/ int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ int lcm(int a, int b) {
int g = gcd(a, b);
return a / g * b;
}
/*素数判定*/ int isPrime(int n) {
if (n < 2) {
return 0;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
/*約数列挙*/ vector<int> getDivisor(int n) {
vector<int> v;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
//----------------------------------------------
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b;
cin >> a >> b;
if (b % a == 0)
OUT(a + b);
else
OUT(b - a);
return 0;
} | [
"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_popcountll(n))
#define SUBS(s, f, t) (s.substr(f - 1, t - f + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
struct Grid {
ll x, y, t;
};
struct Edge {
ll to, cost;
};
struct Graph {
vector<vector<Edge>> E;
int V;
const ll Inf = llINF;
const int MAX_V = 201010;
vector<ll> d;
Graph(int n) : E(n) {
d.resize(MAX_V);
E.resize(n);
V = n;
}
void init() {
for (int i = 0; i < MAX_V; i++)
d[i] = Inf;
}
void add_edge(ll from, ll to, ll cost) { E[from].pb({to, cost}); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d, e;
cin >> a >> b;
if (b % a)
cout << b + a << endl;
else
cout << b - a << endl;
return 0;
}
| #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_popcountll(n))
#define SUBS(s, f, t) (s.substr(f - 1, t - f + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
struct Grid {
ll x, y, t;
};
struct Edge {
ll to, cost;
};
struct Graph {
vector<vector<Edge>> E;
int V;
const ll Inf = llINF;
const int MAX_V = 201010;
vector<ll> d;
Graph(int n) : E(n) {
d.resize(MAX_V);
E.resize(n);
V = n;
}
void init() {
for (int i = 0; i < MAX_V; i++)
d[i] = Inf;
}
void add_edge(ll from, ll to, ll cost) { E[from].pb({to, cost}); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d, e;
cin >> a >> b;
if (b % a == 0)
cout << b + a << endl;
else
cout << b - a << endl;
return 0;
}
| [
"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 vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define pq priority_queue
#define ipair pair<int, int>
#define spair pair<string, string>
#define lpair pair<LL, LL>
#define MP make_pair
#define MM multimap
#define PB push_back
#define INF 2147483647
#define _INF -2147483647
#define pi 3.1415926536
#define MAXN 100004
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>
#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 vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define pq priority_queue
#define ipair pair<int, int>
#define spair pair<string, string>
#define lpair pair<LL, LL>
#define MP make_pair
#define MM multimap
#define PB push_back
#define INF 2147483647
#define _INF -2147483647
#define pi 3.1415926536
#define MAXN 100004
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,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 <boost/algorithm/string/classification.hpp> // is_any_of
#include <boost/algorithm/string/split.hpp>
using boost::algorithm::split; // split(result, s, boost::is_any_of(","));
#include <boost/algorithm/string/join.hpp>
using boost::algorithm::join; // string s = join(arr, "");
#include <boost/algorithm/string/replace.hpp>
using boost::algorithm::replace_all; // replace_all(s, "AtCoder", "A");
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/range/algorithm.hpp> // boost::sort(arr)
using boost::multiprecision::cpp_int;
*/
/* print(arr)
template <class T>
void print(vector<T> &vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << " ";
}
cout << endl;
}
*/
/* fast cin and precise cout
cin.tie(nullptr);
ios::sync_with_stdio(false);
getline(cin, s);
cout << fixed << setprecision(15);
*/
/* sum function
int sum(vector<int> &arr) {
int res = accumulate(arr.begin(), arr.end(), 0);
return res;
}
*/
int main() {
int a, b;
cin >> a >> b;
cout << (a % b == 0 ? a + b : b - a) << endl;
}
| #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 <boost/algorithm/string/classification.hpp> // is_any_of
#include <boost/algorithm/string/split.hpp>
using boost::algorithm::split; // split(result, s, boost::is_any_of(","));
#include <boost/algorithm/string/join.hpp>
using boost::algorithm::join; // string s = join(arr, "");
#include <boost/algorithm/string/replace.hpp>
using boost::algorithm::replace_all; // replace_all(s, "AtCoder", "A");
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/range/algorithm.hpp> // boost::sort(arr)
using boost::multiprecision::cpp_int;
*/
/* print(arr)
template <class T>
void print(vector<T> &vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << " ";
}
cout << endl;
}
*/
/* fast cin and precise cout
cin.tie(nullptr);
ios::sync_with_stdio(false);
getline(cin, s);
cout << fixed << setprecision(15);
*/
/* sum function
int sum(vector<int> &arr) {
int res = accumulate(arr.begin(), arr.end(), 0);
return res;
}
*/
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
}
| [
"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::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
int a, b;
cin >> a >> b;
if (a % b == 0)
COUT(b + a);
else
COUT(b - a);
return 0;
}
| #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::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
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,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
using namespace ::std;
int jo(ll int jxo, ll int jyo) {
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { return (toxbig - 0x20); }
char tolow(char toxlow) { return (toxlow + 0x20); }
int main() {
int a, b;
cin >> a, b;
cout << (b % a ? b - a : b + a);
}
// int *p = new int[N];
// vector<int> 変数名(要素数);
// sort(変数名.begin(),変数名.end());//昇順ソート
// vector<vector<int>> 変数名(左の個数, vector<int>(右の個数));
//
| #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
using namespace ::std;
int jo(ll int jxo, ll int jyo) {
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { return (toxbig - 0x20); }
char tolow(char toxlow) { return (toxlow + 0x20); }
int main() {
int a, b;
cin >> a >> b;
cout << (b % a ? (b - a) : (b + a));
}
// int *p = new int[N];
// vector<int> 変数名(要素数);
// sort(変数名.begin(),変数名.end());//昇順ソート
// vector<vector<int>> 変数名(左の個数, vector<int>(右の個数));
//
| [] | 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;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int A, B;
cin >> A >> B;
int ans = (A % B == 0) ? (A + B) : (B - A);
cout << ans << endl;
} | #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;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int A, B;
cin >> A >> B;
int ans = (B % A == 0) ? (A + B) : (B - A);
cout << ans << endl;
} | [
"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) {
cout << a + b << endl;
return 0;
}
cout << a - b << endl;
return 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) {
cout << a + b << endl;
return 0;
}
cout << b - a << endl;
return 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, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < n; ++i)
#define FORR(i, s, n) for (int i = n - 1; i >= s; --i)
#define ALL(c) (c).begin(), (c).end()
#define CLEAR(v) memset(v, 0, sizeof(v))
#define MP(a, b) make_pair((a), (b))
#define ABS(a) ((a) > 0 ? (a) : -(a))
#define F first
#define S second
int main(int argc, char **argv) {
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;
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, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < n; ++i)
#define FORR(i, s, n) for (int i = n - 1; i >= s; --i)
#define ALL(c) (c).begin(), (c).end()
#define CLEAR(v) memset(v, 0, sizeof(v))
#define MP(a, b) make_pair((a), (b))
#define ABS(a) ((a) > 0 ? (a) : -(a))
#define F first
#define S second
int main(int argc, char **argv) {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
return 0;
}
| [
"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>
using namespace std;
#define ll long long
#define MOD 1000000007
#define PI acos(-1)
#define pb push_back
#define endl '\n'
#define Yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define NO cout << "NO" << endl
#define pllll pair<ll, ll>
#define plls pair<ll, string>
#define psll pair<string, ll>
#define For(i, n) for (int i = 0; i < n; i++)
#define phoge print("hoge")
#define phugo print("hugo")
#define vll vector<ll>
#define v2ll vec2<ll>
#define v3ll vec3<ll>
template <typename T> using vec = vector<T>;
template <typename T> using vec2 = vector<vector<T>>;
template <typename T> using vec3 = vector<vector<vector<ll>>>;
template <typename T> using uset = unordered_set<T>;
template <typename T, typename S> using umap = unordered_map<T, S>;
bool inRange(ll a, ll x, ll b) {
if (a > b) {
swap(a, b);
}
return (a <= x && x <= b);
}
bool between(ll a, ll x, ll b) {
if (a > b) {
swap(a, b);
}
return (a < x && x < b);
}
template <typename T> void sort(T &a, T &b) {
if (a > b) {
swap(a, b);
}
}
template <typename T> void input(T *data, int n) {
For(i, n) { cin >> data[i]; }
}
template <typename T, typename S> void input(T *data1, S *data2, int n) {
For(i, n) { cin >> data1[i] >> data2[i]; }
}
template <typename T> void input(vector<T> &vec, int n) {
T temp;
For(i, n) {
cin >> temp;
vec.push_back(temp);
}
}
template <typename T, typename S>
void input(vector<T> &vec1, vector<S> &vec2, int n) {
T temp1;
S temp2;
For(i, n) {
cin >> temp1 >> temp2;
vec1.push_back(temp1);
vec2.push_back(temp2);
}
}
template <typename T> void sort(vector<T> &ary) {
sort(ary.begin(), ary.end());
}
template <typename T> void rsort(vector<T> &ary) {
sort(ary.rbegin(), ary.rend());
}
void rstring(string &str) {
string temp = str;
For(i, (int)str.size()) { str[i] = temp[(str.size() - 1) - i]; }
}
template <typename T> T print(T x) {
cout << x << endl;
return x;
}
template <typename T> void print(T *x, int n) {
For(i, n) { cout << x[i] << " "; }
cout << endl;
}
template <typename T> void print(vector<T> &x) {
for (auto t : x) {
cout << t << " ";
}
cout << endl;
}
template <typename T, typename S> void print(pair<T, S> &p) {
out2(p.first, p.second);
}
template <typename T> T gcd(T n, T m) {
if (n % m == 0) {
return m;
} else {
return gcd<T>(m, n % m);
}
}
void lsum(vll &a, vll &sum) {
sum[0] = a[0];
for (int i = 1; i < (int)a.size(); i++) {
sum[i] = sum[i - 1] + a[i];
}
}
void rsum(vll &a, vll &sum) {
sum[(int)a.size() - 1] = a[(int)a.size() - 1];
for (int i = (int)a.size() - 2; i >= 0; i--) {
sum[i] = sum[i + 1] + a[i];
}
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
UnionFind() {}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size() {
int count = 0;
for (int i = 0; i < (int)par.size(); i++) {
if (par[i] == i) {
count++;
}
}
return count;
}
};
template <class Abel> struct PotentialUnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
PotentialUnionFind(int n = 1, Abel SUM_UNITY = 0) { init(n, SUM_UNITY); }
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
for (int i = 0; i < n; ++i)
par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y, Abel w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y), w = -w;
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) { return weight(y) - weight(x); }
};
template <typename T, typename S> struct _CountMap {
T data;
void add(S key, int n) {
auto itr = data.find(key);
if (itr == data.end()) {
data.insert(pair<S, ll>(key, n));
} else {
itr->second += n;
}
}
auto top() { return data.begin(); }
int val(S key) { return data[key]; }
int size() { return data.size(); }
int sub(S key, int n) {
auto elm = data.find(key);
int ret = min(elm->second, n);
if (ret == elm->second) {
data.erase(elm);
}
elm->second -= ret;
return ret;
}
int &operator[](S key) {
auto itr = data.find(key);
if (itr == data.end()) {
data.insert(pair<S, int>(key, 0));
}
return itr->second;
}
};
struct Area {
vector<ll> data;
Area(ll range) : data(range + 1) {}
void add(pair<ll, ll> newdata) {
data[newdata.first]++;
data[newdata.second]--;
}
ll num() {
ll sum = 0;
ll ret = 0;
For(i, (int)data.size()) {
sum += data[i];
if (sum != 0) {
ret++;
for (i++; i < (int)data.size() && (sum += data[i]) != 0; i++)
;
}
}
return ret;
}
};
struct Interval {
vector<pllll> data;
void add(ll s, ll f) { data.push_back(pllll(f, s)); }
ll num() {
sort(data);
ll ret = 0;
ll lastf = -1;
for (auto t : data) {
if (t.first == lastf) {
continue;
}
if (t.second >= lastf) {
lastf = t.first;
ret++;
}
}
return ret;
}
};
template <typename T> using CountMap = _CountMap<map<T, ll>, T>;
template <typename T>
using CountMapr = _CountMap<multimap<T, ll, greater<T>>, T>;
void factoring(ll n, CountMap<ll> &p) {
for (ll i = 2; i + i <= n; i++) {
while (n % i == 0) {
p.add(i, 1);
n /= i;
}
}
}
template <typename T, typename S> using rmap = multimap<T, S, greater<T>>;
template <typename T> using rset = multiset<T, greater<T>>;
vector<ll> fac(2001); // n!(mod M)
vector<ll> ifac(2001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % 1000000007;
x = x * x % 1000000007;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % 1000000007;
return tmp * fac[a] % 1000000007;
}
ll syakutori(vll &data, ll key) {
ll ans = 0;
ll sum = 0;
ll cur = 0;
For(i, data.size()) {
while (sum <= key) {
if (cur == data.size()) {
break;
} else {
sum += data[cur];
cur++;
}
}
ans += cur - i - 1 + ((sum <= key) ? 1 : 0);
sum -= data[i];
}
return ans;
}
ll bfs(vec2<char> &s, v2ll &passed, queue<pllll> &que, queue<ll> &depth) {
pllll edge[4] = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};
pllll now, next;
ll nowd;
ll ans = 0;
while (!que.empty()) {
now = que.front();
que.pop();
nowd = depth.front();
depth.pop();
for (auto t : edge) {
next = {now.first + t.first, now.second + t.second};
if (next.first == s.size() || next.second == s[0].size() ||
min(next.first, next.second) < 0) {
continue;
}
if (passed[next.first][next.second]) {
continue;
}
passed[next.first][next.second] = 1;
que.push(next);
depth.push(nowd + 1);
ans = max(ans, nowd + 1);
}
}
return ans;
}
int main() {
ll n, m, k, a, b, c, x, y, z, h, w, sum = 0;
string s;
cin >> a >> b;
if (b % a == 0) {
print(a + b);
} else {
print(a - b);
}
return 0;
} | #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>
using namespace std;
#define ll long long
#define MOD 1000000007
#define PI acos(-1)
#define pb push_back
#define endl '\n'
#define Yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define NO cout << "NO" << endl
#define pllll pair<ll, ll>
#define plls pair<ll, string>
#define psll pair<string, ll>
#define For(i, n) for (int i = 0; i < n; i++)
#define phoge print("hoge")
#define phugo print("hugo")
#define vll vector<ll>
#define v2ll vec2<ll>
#define v3ll vec3<ll>
template <typename T> using vec = vector<T>;
template <typename T> using vec2 = vector<vector<T>>;
template <typename T> using vec3 = vector<vector<vector<ll>>>;
template <typename T> using uset = unordered_set<T>;
template <typename T, typename S> using umap = unordered_map<T, S>;
bool inRange(ll a, ll x, ll b) {
if (a > b) {
swap(a, b);
}
return (a <= x && x <= b);
}
bool between(ll a, ll x, ll b) {
if (a > b) {
swap(a, b);
}
return (a < x && x < b);
}
template <typename T> void sort(T &a, T &b) {
if (a > b) {
swap(a, b);
}
}
template <typename T> void input(T *data, int n) {
For(i, n) { cin >> data[i]; }
}
template <typename T, typename S> void input(T *data1, S *data2, int n) {
For(i, n) { cin >> data1[i] >> data2[i]; }
}
template <typename T> void input(vector<T> &vec, int n) {
T temp;
For(i, n) {
cin >> temp;
vec.push_back(temp);
}
}
template <typename T, typename S>
void input(vector<T> &vec1, vector<S> &vec2, int n) {
T temp1;
S temp2;
For(i, n) {
cin >> temp1 >> temp2;
vec1.push_back(temp1);
vec2.push_back(temp2);
}
}
template <typename T> void sort(vector<T> &ary) {
sort(ary.begin(), ary.end());
}
template <typename T> void rsort(vector<T> &ary) {
sort(ary.rbegin(), ary.rend());
}
void rstring(string &str) {
string temp = str;
For(i, (int)str.size()) { str[i] = temp[(str.size() - 1) - i]; }
}
template <typename T> T print(T x) {
cout << x << endl;
return x;
}
template <typename T> void print(T *x, int n) {
For(i, n) { cout << x[i] << " "; }
cout << endl;
}
template <typename T> void print(vector<T> &x) {
for (auto t : x) {
cout << t << " ";
}
cout << endl;
}
template <typename T, typename S> void print(pair<T, S> &p) {
out2(p.first, p.second);
}
template <typename T> T gcd(T n, T m) {
if (n % m == 0) {
return m;
} else {
return gcd<T>(m, n % m);
}
}
void lsum(vll &a, vll &sum) {
sum[0] = a[0];
for (int i = 1; i < (int)a.size(); i++) {
sum[i] = sum[i - 1] + a[i];
}
}
void rsum(vll &a, vll &sum) {
sum[(int)a.size() - 1] = a[(int)a.size() - 1];
for (int i = (int)a.size() - 2; i >= 0; i--) {
sum[i] = sum[i + 1] + a[i];
}
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
UnionFind() {}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size() {
int count = 0;
for (int i = 0; i < (int)par.size(); i++) {
if (par[i] == i) {
count++;
}
}
return count;
}
};
template <class Abel> struct PotentialUnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
PotentialUnionFind(int n = 1, Abel SUM_UNITY = 0) { init(n, SUM_UNITY); }
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
for (int i = 0; i < n; ++i)
par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y, Abel w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y), w = -w;
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) { return weight(y) - weight(x); }
};
template <typename T, typename S> struct _CountMap {
T data;
void add(S key, int n) {
auto itr = data.find(key);
if (itr == data.end()) {
data.insert(pair<S, ll>(key, n));
} else {
itr->second += n;
}
}
auto top() { return data.begin(); }
int val(S key) { return data[key]; }
int size() { return data.size(); }
int sub(S key, int n) {
auto elm = data.find(key);
int ret = min(elm->second, n);
if (ret == elm->second) {
data.erase(elm);
}
elm->second -= ret;
return ret;
}
int &operator[](S key) {
auto itr = data.find(key);
if (itr == data.end()) {
data.insert(pair<S, int>(key, 0));
}
return itr->second;
}
};
struct Area {
vector<ll> data;
Area(ll range) : data(range + 1) {}
void add(pair<ll, ll> newdata) {
data[newdata.first]++;
data[newdata.second]--;
}
ll num() {
ll sum = 0;
ll ret = 0;
For(i, (int)data.size()) {
sum += data[i];
if (sum != 0) {
ret++;
for (i++; i < (int)data.size() && (sum += data[i]) != 0; i++)
;
}
}
return ret;
}
};
struct Interval {
vector<pllll> data;
void add(ll s, ll f) { data.push_back(pllll(f, s)); }
ll num() {
sort(data);
ll ret = 0;
ll lastf = -1;
for (auto t : data) {
if (t.first == lastf) {
continue;
}
if (t.second >= lastf) {
lastf = t.first;
ret++;
}
}
return ret;
}
};
template <typename T> using CountMap = _CountMap<map<T, ll>, T>;
template <typename T>
using CountMapr = _CountMap<multimap<T, ll, greater<T>>, T>;
void factoring(ll n, CountMap<ll> &p) {
for (ll i = 2; i + i <= n; i++) {
while (n % i == 0) {
p.add(i, 1);
n /= i;
}
}
}
template <typename T, typename S> using rmap = multimap<T, S, greater<T>>;
template <typename T> using rset = multiset<T, greater<T>>;
vector<ll> fac(2001); // n!(mod M)
vector<ll> ifac(2001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % 1000000007;
x = x * x % 1000000007;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % 1000000007;
return tmp * fac[a] % 1000000007;
}
ll syakutori(vll &data, ll key) {
ll ans = 0;
ll sum = 0;
ll cur = 0;
For(i, data.size()) {
while (sum <= key) {
if (cur == data.size()) {
break;
} else {
sum += data[cur];
cur++;
}
}
ans += cur - i - 1 + ((sum <= key) ? 1 : 0);
sum -= data[i];
}
return ans;
}
ll bfs(vec2<char> &s, v2ll &passed, queue<pllll> &que, queue<ll> &depth) {
pllll edge[4] = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};
pllll now, next;
ll nowd;
ll ans = 0;
while (!que.empty()) {
now = que.front();
que.pop();
nowd = depth.front();
depth.pop();
for (auto t : edge) {
next = {now.first + t.first, now.second + t.second};
if (next.first == s.size() || next.second == s[0].size() ||
min(next.first, next.second) < 0) {
continue;
}
if (passed[next.first][next.second]) {
continue;
}
passed[next.first][next.second] = 1;
que.push(next);
depth.push(nowd + 1);
ans = max(ans, nowd + 1);
}
}
return ans;
}
int main() {
ll n, m, k, a, b, c, x, y, z, h, w, sum = 0;
string s;
cin >> a >> b;
if (b % a == 0) {
print(a + b);
} else {
print(b - a);
}
return 0;
} | [
"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() {
int a, b;
cin >> a >> b;
if (a % b == 0)
cout << a + b << endl;
else
cout << b - a << endl;
}
| #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() {
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,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.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
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;
#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.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
return 0;
}
| [
"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() {
int a, b;
cin >> a >> b;
if ((b / a) == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | #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() {
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",
"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() {
int a, b;
cin >> a >> b;
if (b / a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | #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() {
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",
"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.