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 | /*
Name: B +/- A
Author: TonyWu
Date: 23/02/19 20:06
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (!b % a)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | /*
Name: B +/- A
Author: TonyWu
Date: 23/02/19 20:06
*/
#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.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 926,483 | 926,484 | u823017070 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ \
REP(WW, n) cerr << v[WW] << ' '; \
cerr << endl << endl; \
}
#define SHOW2d(v, WW, HH) \
{ \
REP(W_, WW) { \
REP(H_, HH) cerr << v[W_][H_] << ' '; \
cerr << endl; \
} \
cerr << endl; \
}
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 998244353
#define fastcin() \
cin.tie(0); \
ios::sync_with_stdio(false)
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll a, b;
cin >> a >> b;
if (b % a)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ \
REP(WW, n) cerr << v[WW] << ' '; \
cerr << endl << endl; \
}
#define SHOW2d(v, WW, HH) \
{ \
REP(W_, WW) { \
REP(H_, HH) cerr << v[W_][H_] << ' '; \
cerr << endl; \
} \
cerr << endl; \
}
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 998244353
#define fastcin() \
cin.tie(0); \
ios::sync_with_stdio(false)
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll 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"
] | 926,490 | 926,491 | u382880969 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
int p;
cin >> a >> b;
if (b % a == 0) {
p = a + b;
} else {
p = a - b;
}
cout << p << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
int p;
cin >> a >> b;
if (b % a == 0) {
p = a + b;
} else {
p = b - a;
}
cout << p << endl;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 926,502 | 926,503 | u467826805 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << b + (b % a ? a : -a) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << b + (b % a == 0 ? a : -a) << endl;
} | [
"expression.operation.binary.add"
] | 926,510 | 926,511 | u647474992 | cpp |
p03125 | // https://atcoder.jp/contests/abc118/tasks/abc118_a
#include <iostream>
using namespace std;
int main() {
/* Magic word */
cin.tie(0);
ios::sync_with_stdio(false);
/* ---------- */
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? b - a : b + a) << '\n';
return 0;
}
| // https://atcoder.jp/contests/abc118/tasks/abc118_a
#include <iostream>
using namespace std;
int main() {
/* Magic word */
cin.tie(0);
ios::sync_with_stdio(false);
/* ---------- */
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? b + a : b - a) << '\n';
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 926,515 | 926,516 | u414220724 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int 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;
int 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"
] | 926,521 | 926,522 | u813182149 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0) ? a + b : b - a << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << ((b % a == 0) ? (a + b) : (b - a)) << '\n';
return 0;
} | [] | 926,528 | 926,529 | u894126219 | cpp |
p03125 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, K;
int main() {
scanf("%lld%lld", &N, &K);
printf("%lld", K % N ? N - K : N + K);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, K;
int main() {
scanf("%lld%lld", &N, &K);
printf("%lld", K % N ? K - N : N + K);
return 0;
} | [
"expression.operation.binary.remove"
] | 926,532 | 926,533 | u259396003 | cpp |
p03125 | #include <iostream>
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 <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",
"control_flow.branch.if.condition.change"
] | 926,536 | 926,537 | u864667985 | cpp |
p03125 | #include <iostream>
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int a, b;
std::cin >> a >> b;
std::cout << ((!(b % a)) ? a + b : a - b) << std::endl;
} | #include <iostream>
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int a, b;
std::cin >> a >> b;
std::cout << ((!(b % a)) ? a + b : b - a) << std::endl;
} | [
"expression.operation.binary.remove"
] | 926,544 | 926,545 | u751252197 | 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;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 926,550 | 926,551 | u797250661 | cpp |
p03125 | #include <algorithm>
#include <iomanip>
#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;
}
return 0;
} | #include <algorithm>
#include <iomanip>
#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;
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,557 | 926,558 | u086366728 | cpp |
p03125 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int X, Y, N, A, B, sum, ans;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else
cout << A - B << endl;
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int X, Y, N, A, B, sum, ans;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else
cout << B - A << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 926,573 | 926,574 | u644568158 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B = 0;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << A - B;
}
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B = 0;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
} | [
"expression.operation.binary.remove"
] | 926,575 | 926,576 | u048791623 | 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"
] | 926,583 | 926,584 | u724063025 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << a - b;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
return 0;
} | [
"expression.operation.binary.remove"
] | 926,591 | 926,592 | u555933327 | cpp |
p03125 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(j, n) for (int i = j; i < n; i++)
#define repd(j, n) for (int i = j; i > n; i--)
#define maxx 100010
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int a, b, ans;
cin >> a >> b;
if (a % b == 0) {
ans = a + b;
} else {
ans = b - a;
}
cout << ans;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(j, n) for (int i = j; i < n; i++)
#define repd(j, n) for (int i = j; i > n; i--)
#define maxx 100010
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int a, b, ans;
cin >> a >> b;
if (b % a == 0) {
ans = a + b;
} else {
ans = b - a;
}
cout << ans;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,593 | 926,594 | u407614884 | cpp |
p03125 | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d %d", &a, &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 %d", &a, &b);
if (b % a == 0) {
printf("%d\n", a + b);
} else {
printf("%d\n", b - a);
}
return 0;
} | [
"expression.operation.binary.remove"
] | 926,599 | 926,600 | u966052848 | cpp |
p03125 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
bool cmp(int a, int b) { return a > b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// Insert code
ll a, b;
cin >> a >> b;
if (b % 2 == 0)
cout << a + b;
else
cout << b - a;
// End code
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
bool cmp(int a, int b) { return a > b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// Insert code
ll a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
// End code
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 926,601 | 926,602 | u923181378 | cpp |
p03125 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
bool cmp(int a, int b) { return a > b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// Insert code
ll a, b;
cin >> a >> b;
if (b % 2 == 0)
cout << a + b;
else
cout << a - b;
// End code
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
bool cmp(int a, int b) { return a > b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// Insert code
ll a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
// End code
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 926,603 | 926,602 | u923181378 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
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 <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
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"
] | 926,606 | 926,607 | u170650966 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
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 <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
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"
] | 926,608 | 926,607 | u170650966 | cpp |
p03125 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define FORSTEP(i, start, end, step) for (int i = start; i < end; i += step)
#define ALL(a) a.begin(), a.end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define FORSTEP(i, start, end, step) for (int i = start; i < end; i += step)
#define ALL(a) a.begin(), a.end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
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"
] | 926,613 | 926,614 | u324303263 | 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"
] | 926,617 | 926,618 | u855087874 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
printf("%d\n", a % b == 0 ? a + b : b - a);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
printf("%d\n", b % a == 0 ? a + b : b - a);
return 0;
} | [
"expression.operation.binary.remove"
] | 926,619 | 926,620 | u203062059 | 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"
] | 926,621 | 926,622 | u756088996 | 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"
] | 926,623 | 926,624 | u608785059 | cpp |
p03125 | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << (A + B);
else
cout << (A - B);
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int A, B;
cin >> A >> B;
if (B % A == 0)
cout << (A + B);
else
cout << (B - A);
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,631 | 926,632 | u671401989 | cpp |
p03125 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <random>
#include <stdio.h>
#include <vector>
#define int_max 2147483647;
// AGC 30
void Problem_A(void) {
int a, b;
std::cin >> a >> b;
if (b % a == 0) {
std::cout << a + b;
} else {
std::cout << b - a;
}
}
void Problem_B(void) {
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> mat(n, std::vector<int>(m + 1));
for (int i = 0; i < n; i++) {
std::cin >> mat[i][0];
for (int j = 1; j <= int(mat[i][0]); j++) {
std::cin >> mat[i][j];
}
}
std::vector<int> manage_vec(m);
for (int i = 0; i < m; i++) {
manage_vec[i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 1; j <= int(mat[i][0]); j++) {
manage_vec[mat[i][j]] = manage_vec[mat[i][j]] + 1;
}
}
for (int i = 0; i < m; i++) {
if (manage_vec[i] == n) {
std::cout << i;
}
}
return;
}
int main(int argc, char const *argv[]) {
Problem_B();
return 0;
} |
#include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <random>
#include <stdio.h>
#include <vector>
#define int_max 2147483647;
// AGC 30
void Problem_A(void) {
int a, b;
std::cin >> a >> b;
if (b % a == 0) {
std::cout << a + b;
} else {
std::cout << b - a;
}
}
void Problem_B(void) {
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> mat(n, std::vector<int>(m + 1));
for (int i = 0; i < n; i++) {
std::cin >> mat[i][0];
for (int j = 1; j <= int(mat[i][0]); j++) {
std::cin >> mat[i][j];
}
}
std::vector<int> manage_vec(m);
for (int i = 0; i < m; i++) {
manage_vec[i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 1; j <= int(mat[i][0]); j++) {
manage_vec[mat[i][j]] = manage_vec[mat[i][j]] + 1;
}
}
for (int i = 0; i < m; i++) {
if (manage_vec[i] == n) {
std::cout << i;
}
}
return;
}
int main(int argc, char const *argv[]) {
Problem_A();
return 0;
} | [
"identifier.change",
"call.function.change"
] | 926,639 | 926,640 | u221285045 | cpp |
p03125 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#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 << a - b << endl;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#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"
] | 926,643 | 926,644 | u593433974 | cpp |
p03125 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define PB push_back
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define REPI(i, a, b) for (int i = a; i >= b; i--)
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int OO = 1e9 + 7;
const int MOD = 1e9 + 7;
const int N = 1e5 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("teleport.in","r",stdin);
// freopen("teleport.out","w",stdout);
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>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define PB push_back
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define REPI(i, a, b) for (int i = a; i >= b; i--)
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int OO = 1e9 + 7;
const int MOD = 1e9 + 7;
const int N = 1e5 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("teleport.in","r",stdin);
// freopen("teleport.out","w",stdout);
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"
] | 926,653 | 926,654 | u216673135 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i, n) rep(i, (n) + 1)
#define per(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define pere(i, n) rep(i, (n) + 1)
#define all(x) (x).begin(), (x).end()
#define SP << " " <<
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
typedef long long LL;
typedef long double LD;
int main() {
int a, b;
cin >> a >> b;
if (b % a) {
cout << b + a << endl;
} else {
cout << b - a << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i, n) rep(i, (n) + 1)
#define per(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define pere(i, n) rep(i, (n) + 1)
#define all(x) (x).begin(), (x).end()
#define SP << " " <<
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
typedef long long LL;
typedef long double LD;
int main() {
int a, b;
cin >> a >> b;
if (b % a) {
cout << b - a << endl;
} else {
cout << b + a << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 926,658 | 926,659 | u405923605 | 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;
return 0;
} 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;
return 0;
} else {
cout << b - a << endl;
return 0;
}
} | [
"expression.operation.binary.remove"
] | 926,660 | 926,661 | u653786383 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <map>
#include <string>
#include <vector>
int main(void) {
int64_t a, b;
std::cin >> a >> b;
b += (a % b == 0) ? a : -a;
std::cout << b << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <map>
#include <string>
#include <vector>
int main(void) {
int64_t a, b;
std::cin >> a >> b;
b += (b % a == 0) ? a : -a;
std::cout << b << std::endl;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 926,672 | 926,673 | u100280611 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long int int i = 0; i < n; i++)
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long int int i = 0; i < n; i++)
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
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"
] | 926,680 | 926,681 | u241908712 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d", &a, &b);
if (b % a == 0) {
printf("%d", b + a);
} else {
printf("%d", b - a);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b % a == 0) {
printf("%d", b + a);
} else {
printf("%d", b - a);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 926,692 | 926,693 | u858741867 | cpp |
p03125 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
if (a == b / a) {
cout << a + b;
} else {
cout << b - a;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.remove"
] | 926,696 | 926,697 | u048840514 | cpp |
p03125 | #include <cmath>
#include <iostream>
int main() {
int A;
int B;
std::cin >> A >> B;
if (B % A == 0) {
std::cout << A + B << std::endl;
} else {
std::cout << A - B << std::endl;
}
return 0;
} | #include <cmath>
#include <iostream>
int main() {
int A;
int B;
std::cin >> A >> B;
if (B % A == 0) {
std::cout << A + B << std::endl;
} else {
std::cout << B - A << std::endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 926,701 | 926,702 | u240226076 | cpp |
p03125 | #include <stdio.h>
int main(void) {
int a, b;
int ans;
scanf("%d", &a);
scanf("%d", &b);
if (b / a == 0) {
ans = a + b;
} else {
ans = a - b;
}
printf("%d\n", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
int ans;
scanf("%d", &a);
scanf("%d", &b);
if (b % a == 0) {
ans = a + b;
} else {
ans = b - a;
}
printf("%d\n", ans);
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 926,705 | 926,706 | u015875086 | cpp |
p03125 | #include <iostream>
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 <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",
"control_flow.branch.if.condition.change"
] | 926,707 | 926,708 | u752904037 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MAX 1000000001
using namespace std;
typedef long long ll;
int a, b;
int main() {
std::cin >> a >> b;
if (b % a == 0)
std::cout << (a + b) << '\n';
else
std::cout << (a - b) << '\n';
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MAX 1000000001
using namespace std;
typedef long long ll;
int a, b;
int main() {
std::cin >> a >> b;
if (b % a == 0)
std::cout << (a + b) << '\n';
else
std::cout << (b - a) << '\n';
}
| [
"expression.operation.binary.remove"
] | 926,712 | 926,713 | u255001744 | cpp |
p03125 | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int a, b;
cin >> a >> b;
cout << ((a % b == 0) ? a + b : b - a) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int a, b;
cin >> a >> b;
cout << ((b % a == 0) ? a + b : b - a) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,714 | 926,715 | u148019779 | cpp |
p03125 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, K;
int main() {
int A;
int B;
cin >> A >> B;
if (A % B == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, K;
int main() {
int A;
int 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"
] | 926,716 | 926,717 | u487068741 | cpp |
p03125 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, K;
int main() {
ll A;
ll B;
cin >> A >> B;
if (A % B == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, K;
int main() {
int A;
int B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
return 0;
}
| [
"variable_declaration.type.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,719 | 926,717 | u487068741 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A % B == 0) {
cout << A + B;
} else {
cout << B - A;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,726 | 926,727 | u850335688 | cpp |
p03125 | #include <bits/stdc++.h>
namespace FastIO {
const char *ln = "\n";
struct Reader {
char buf[1 << 20], *s, *t;
bool EOF_FLG;
Reader() : s(buf), t(buf), EOF_FLG(false){};
char gt() {
return s == t && ((t = (s = buf) + fread(buf, 1, 1 << 20, stdin)) == s)
? EOF
: (*s++);
}
Reader &operator>>(char *str) {
if (EOF_FLG)
return *str = 0, *this;
while ((*str = gt()) != ' ' && *str != '\n' && *str != EOF)
++str;
if (*str == EOF)
EOF_FLG = true;
*str = 0;
return *this;
}
template <typename T> Reader &operator>>(T &x) {
if (EOF_FLG)
return *this;
char c = 0, d;
while (c != EOF && (c < '0' || c > '9'))
d = c, c = gt();
if (c == EOF) {
EOF_FLG = true;
return *this;
} else
x = 0;
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + c - '0', c = gt();
if (d == '-')
x = -x;
return *this;
}
} in;
struct Writer {
char buf[1 << 20], *s, *t;
Writer() : s(buf), t(buf + (1 << 20)) {}
~Writer() { fwrite(buf, 1, s - buf, stdout); }
void pt(char c) {
(s == t) ? (fwrite(s = buf, 1, 1 << 20, stdout), *s++ = c) : (*s++ = c);
}
template <typename T> Writer &operator<<(T x) {
if (!x)
return pt('0'), *this;
if (x < 0)
pt('-'), x = -x;
char a[40], t = 0;
while (x)
a[t++] = x % 10, x /= 10;
while (t--)
pt(a[t] + '0');
return *this;
}
Writer &operator<<(const char *s) {
while (*s)
pt(*s++);
return *this;
}
} out;
} // namespace FastIO
using namespace FastIO;
namespace ZDY {
#define ll long long
#define db double
#define sht short
#define MB template <class T>
#define Fur(i, x, y) for (int i = x; i <= y; i++)
#define fur(i, x, y) for (i = x; i <= y; i++)
#define Fdr(i, x, y) for (int i = x; i >= y; i--)
#define fdr(i, x, y) for (i = x; i >= y; i--)
#define clr(x, y) memset(x, y, sizeof(x))
#define cpy(x, y) memcpy(x, y, sizeof(x))
#define inf 0x3f3f3f3f
#define fin(s) freopen(s ".in", "r", stdin)
#define fout(s) freopen(s ".out", "w", stdout)
#define l2(n) (int(log2(n)))
#define fl(i, x) for (int i = head[x], to; to = e[i].to, i; i = e[i].nxt)
#define fcin ios::sync_with_stdio(false)
MB T ABS(T x) { return x > 0 ? x : -x; }
MB T MAX(T x, T y) { return x >= y ? x : y; }
MB T MIN(T x, T y) { return x <= y ? x : y; }
MB T GCD(T x, T y) { return y ? GCD(y, x % y) : x; }
void SWAP(int &x, int &y) {
x ^= y;
y ^= x;
x ^= y;
}
} // namespace ZDY
using namespace ZDY;
using namespace std;
#define N 1000011
int main() {
int a, b;
cin >> a >> b;
if (a % b)
cout << b - a;
else
cout << a + b;
} | #include <bits/stdc++.h>
namespace FastIO {
const char *ln = "\n";
struct Reader {
char buf[1 << 20], *s, *t;
bool EOF_FLG;
Reader() : s(buf), t(buf), EOF_FLG(false){};
char gt() {
return s == t && ((t = (s = buf) + fread(buf, 1, 1 << 20, stdin)) == s)
? EOF
: (*s++);
}
Reader &operator>>(char *str) {
if (EOF_FLG)
return *str = 0, *this;
while ((*str = gt()) != ' ' && *str != '\n' && *str != EOF)
++str;
if (*str == EOF)
EOF_FLG = true;
*str = 0;
return *this;
}
template <typename T> Reader &operator>>(T &x) {
if (EOF_FLG)
return *this;
char c = 0, d;
while (c != EOF && (c < '0' || c > '9'))
d = c, c = gt();
if (c == EOF) {
EOF_FLG = true;
return *this;
} else
x = 0;
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + c - '0', c = gt();
if (d == '-')
x = -x;
return *this;
}
} in;
struct Writer {
char buf[1 << 20], *s, *t;
Writer() : s(buf), t(buf + (1 << 20)) {}
~Writer() { fwrite(buf, 1, s - buf, stdout); }
void pt(char c) {
(s == t) ? (fwrite(s = buf, 1, 1 << 20, stdout), *s++ = c) : (*s++ = c);
}
template <typename T> Writer &operator<<(T x) {
if (!x)
return pt('0'), *this;
if (x < 0)
pt('-'), x = -x;
char a[40], t = 0;
while (x)
a[t++] = x % 10, x /= 10;
while (t--)
pt(a[t] + '0');
return *this;
}
Writer &operator<<(const char *s) {
while (*s)
pt(*s++);
return *this;
}
} out;
} // namespace FastIO
using namespace FastIO;
namespace ZDY {
#define ll long long
#define db double
#define sht short
#define MB template <class T>
#define Fur(i, x, y) for (int i = x; i <= y; i++)
#define fur(i, x, y) for (i = x; i <= y; i++)
#define Fdr(i, x, y) for (int i = x; i >= y; i--)
#define fdr(i, x, y) for (i = x; i >= y; i--)
#define clr(x, y) memset(x, y, sizeof(x))
#define cpy(x, y) memcpy(x, y, sizeof(x))
#define inf 0x3f3f3f3f
#define fin(s) freopen(s ".in", "r", stdin)
#define fout(s) freopen(s ".out", "w", stdout)
#define l2(n) (int(log2(n)))
#define fl(i, x) for (int i = head[x], to; to = e[i].to, i; i = e[i].nxt)
#define fcin ios::sync_with_stdio(false)
MB T ABS(T x) { return x > 0 ? x : -x; }
MB T MAX(T x, T y) { return x >= y ? x : y; }
MB T MIN(T x, T y) { return x <= y ? x : y; }
MB T GCD(T x, T y) { return y ? GCD(y, x % y) : x; }
void SWAP(int &x, int &y) {
x ^= y;
y ^= x;
x ^= y;
}
} // namespace ZDY
using namespace ZDY;
using namespace std;
#define N 1000011
int main() {
int a, b;
cin >> a >> b;
if (b % a)
cout << b - a;
else
cout << a + b;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,730 | 926,731 | u127394455 | cpp |
p03125 | #include <iostream>
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 <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",
"control_flow.branch.if.condition.change"
] | 926,732 | 926,733 | u601575292 | 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;
cin >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 926,740 | 926,741 | u951141003 | cpp |
p03125 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B == 1 & A == 1) {
cout << A + B << endl;
return 0;
}
if (B % A == 0 && B != A)
cout << A + B << endl;
else
cout << B - A << endl;
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B == 1 & A == 1) {
cout << A + B << endl;
return 0;
}
if (B % A == 0)
cout << A + B << endl;
else
cout << B - A << endl;
} | [
"expression.operation.binary.remove"
] | 926,742 | 926,743 | u615887401 | cpp |
p03125 | #include <iostream>
int main() {
int A, B;
std::cin >> A, B;
if (B % A == 0) {
std::cout << A + B << std::endl;
} else {
std::cout << B - A << std::endl;
}
return 0;
}
| #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
if (B % A == 0) {
std::cout << A + B << std::endl;
} else {
std::cout << B - A << std::endl;
}
return 0;
}
| [] | 926,767 | 926,768 | u892351900 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int a, b;
scanf("%d", &a);
scanf("%d", &b);
if (a % b == 0)
printf("%d", a + b);
else
printf("%d", b - a);
return 0;
} | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int a, b;
scanf("%d", &a);
scanf("%d", &b);
if (b % a == 0)
printf("%d", a + b);
else
printf("%d", b - a);
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,769 | 926,770 | u591105068 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
typedef vector<P> vip;
int main() {
int a, b;
cin >> a >> b;
if (b % a)
cout << a - b << endl;
else
cout << a + b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
typedef vector<P> vip;
int main() {
int a, b;
cin >> a >> b;
if (b % a)
cout << b - a << endl;
else
cout << a + b << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,774 | 926,775 | u171026188 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) range(i, 0, n)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define range(i, a, n) for (int i = (a); i < (n); i++)
#define LINF ((ll)1ll << 60)
#define INF ((int)1 << 30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout << setprecision(a) << fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class S> S acm(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void YN(bool b) { cout << (b ? "YES" : "NO") << "\n"; }
void Yn(bool b) { cout << (b ? "Yes" : "No") << "\n"; }
void yn(bool b) { cout << (b ? "yes" : "no") << "\n"; }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
template <class T> void puta(T &&t) { cout << t << "\n"; }
template <class H, class... T> void puta(H &&h, T &&...t) {
cout << h << ' ';
puta(t...);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "[" << p.first << ", " << p.second << "]";
return os;
};
template <class S> auto &operator<<(ostream &os, vector<S> t) {
bool a = 1;
for (auto s : t) {
os << (a ? "" : " ") << s;
a = 0;
}
return os;
}
mt19937 _mt(chrono::steady_clock::now().time_since_epoch().count());
ll getrnd(ll l, ll r) { return uniform_int_distribution<ll>(l, r - 1)(_mt); }
/*
#define _cTime (chrono::system_clock::now())
#define progress
(chrono::duration_cast<chrono::milliseconds>(_cTime-_sTime).count()) #define
reset _sTime=_cTime auto reset;
*/
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b) << endl;
;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) range(i, 0, n)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define range(i, a, n) for (int i = (a); i < (n); i++)
#define LINF ((ll)1ll << 60)
#define INF ((int)1 << 30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout << setprecision(a) << fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class S> S acm(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void YN(bool b) { cout << (b ? "YES" : "NO") << "\n"; }
void Yn(bool b) { cout << (b ? "Yes" : "No") << "\n"; }
void yn(bool b) { cout << (b ? "yes" : "no") << "\n"; }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
template <class T> void puta(T &&t) { cout << t << "\n"; }
template <class H, class... T> void puta(H &&h, T &&...t) {
cout << h << ' ';
puta(t...);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "[" << p.first << ", " << p.second << "]";
return os;
};
template <class S> auto &operator<<(ostream &os, vector<S> t) {
bool a = 1;
for (auto s : t) {
os << (a ? "" : " ") << s;
a = 0;
}
return os;
}
mt19937 _mt(chrono::steady_clock::now().time_since_epoch().count());
ll getrnd(ll l, ll r) { return uniform_int_distribution<ll>(l, r - 1)(_mt); }
/*
#define _cTime (chrono::system_clock::now())
#define progress
(chrono::duration_cast<chrono::milliseconds>(_cTime-_sTime).count()) #define
reset _sTime=_cTime auto reset;
*/
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : -a + b) << endl;
;
}
| [
"expression.operation.binary.add"
] | 926,778 | 926,779 | u591883167 | cpp |
p03125 | #include <iostream>
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 <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",
"control_flow.branch.if.condition.change"
] | 926,780 | 926,781 | u891531063 | cpp |
p03125 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b;
if (b % a)
cout << b - a << endl;
else
cout << a - b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b;
if (b % a)
cout << b - a << endl;
else
cout << a + b << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 926,784 | 926,785 | u319282133 | cpp |
p03125 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
signed main() {
ll a, b, c, d, e, f;
string s, t;
ll A[10000], B[10000], C[10000];
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;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
signed main() {
ll a, b, c, d, e, f;
string s, t;
ll A[10000], B[10000], C[10000];
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"
] | 926,786 | 926,787 | u129134470 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X) (X).begin(), (X).end()
#define pb push_back
#define COUNT(V, X) \
(upper_bound((V).begin(), (V).end(), X) - \
lower_bound((V).begin(), (V).end(), X))
#define debug(x) cerr << #x << ':' << x << endl;
#define DEBUG(v) \
cerr << #v << ':'; \
for (auto xXx : v) \
cerr << xXx << ' '; \
cerr << endl;
#define Yes(X) \
if (X) { \
cout << "Yes" << endl; \
} else { \
cout << "No" << endl; \
}
#define YES(X) \
if (X) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define ctoi(C) (C - '0')
#define pow2(x) ((long long)((long long)1 << x))
/* alias */
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const long long dx[] = {1, 0, -1, 0};
const long long dy[] = {0, 1, 0, -1};
const long long dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
const long long dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long dx9[] = {1, 1, 0, -1, -1, -1, 0, 1, 0};
const long long dy9[] = {0, 1, 1, 1, 0, -1, -1, -1, 0};
const int INF = 1000000007;
const long long LINF = 1000000000000000007;
/* func */
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
long long max(long long x, int y) { return max(x, (long long)y); }
long long max(int x, long long y) { return max((long long)x, y); }
long long min(long long x, int y) { return min(x, (long long)y); }
long long min(int x, long long y) { return min((long long)x, y); }
/* liblary */
/* main */
signed main() {
ll A, B;
cin >> A >> B;
if (B % A)
cout << A + B << endl;
else
cout << B - A << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X) (X).begin(), (X).end()
#define pb push_back
#define COUNT(V, X) \
(upper_bound((V).begin(), (V).end(), X) - \
lower_bound((V).begin(), (V).end(), X))
#define debug(x) cerr << #x << ':' << x << endl;
#define DEBUG(v) \
cerr << #v << ':'; \
for (auto xXx : v) \
cerr << xXx << ' '; \
cerr << endl;
#define Yes(X) \
if (X) { \
cout << "Yes" << endl; \
} else { \
cout << "No" << endl; \
}
#define YES(X) \
if (X) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define ctoi(C) (C - '0')
#define pow2(x) ((long long)((long long)1 << x))
/* alias */
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const long long dx[] = {1, 0, -1, 0};
const long long dy[] = {0, 1, 0, -1};
const long long dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
const long long dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long dx9[] = {1, 1, 0, -1, -1, -1, 0, 1, 0};
const long long dy9[] = {0, 1, 1, 1, 0, -1, -1, -1, 0};
const int INF = 1000000007;
const long long LINF = 1000000000000000007;
/* func */
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
long long max(long long x, int y) { return max(x, (long long)y); }
long long max(int x, long long y) { return max((long long)x, y); }
long long min(long long x, int y) { return min(x, (long long)y); }
long long min(int x, long long y) { return min((long long)x, y); }
/* liblary */
/* main */
signed main() {
ll A, B;
cin >> A >> B;
if (B % A == 0)
cout << A + B << endl;
else
cout << B - A << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 926,788 | 926,789 | u205561862 | cpp |
p03125 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 300000000;
const LL MOD = 1000000007;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 300000000;
const LL MOD = 1000000007;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << -a + b << endl;
} | [
"expression.operation.binary.add"
] | 926,790 | 926,791 | u999803454 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 1000000000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
string char_to_str(char c) {
string tem(1, c);
return tem;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> // usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
#define S second
#define F first
#define int long long
//////////
signed 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;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 1000000000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
string char_to_str(char c) {
string tem(1, c);
return tem;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> // usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
#define S second
#define F first
#define int long long
//////////
signed main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
} | [
"expression.operation.binary.remove"
] | 926,792 | 926,793 | u883546077 | cpp |
p03125 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#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;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#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;
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,794 | 926,795 | u917944707 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << a - b;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,796 | 926,797 | u302400134 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 0x3b800001;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<pii> four = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) _rep2(i, n)
#define _rep2(i, n) _rep3(i, 0, n)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) _rrep2(i, n)
#define _rrep2(i, n) _rrep3(i, 0, n)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define yes(i) out(i ? "yes" : "no")
#define Yes(i) out(i ? "Yes" : "No")
#define YES(i) out(i ? "YES" : "NO")
#define Possible(i) out(i ? "Possible" : "Impossible")
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
template <class T> inline constexpr T gcd(T a, T b) {
if (!a || !b)
return 0;
return a % b ? gcd(b, a % b) : b;
}
template <class T> inline constexpr T lcm(T a, T b) {
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline ll pow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = pow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline ll modpow(ll a, ll b, ll mod) {
if (b == 0)
return 1;
ll ans = pow(a, b / 2);
return ans * ans * (b & 1 ? a : 1) % mod;
}
template <typename T> inline bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class T, class L> pair<T, L> operator+=(pair<T, L> a, pair<T, L> b) {
a.first += b.first;
a.second += b.second;
return a;
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
signed main() {
LL(a, b);
if (b % a == 0)
out(a + b);
out(b - a);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 0x3b800001;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<pii> four = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) _rep2(i, n)
#define _rep2(i, n) _rep3(i, 0, n)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) _rrep2(i, n)
#define _rrep2(i, n) _rrep3(i, 0, n)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define yes(i) out(i ? "yes" : "no")
#define Yes(i) out(i ? "Yes" : "No")
#define YES(i) out(i ? "YES" : "NO")
#define Possible(i) out(i ? "Possible" : "Impossible")
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
template <class T> inline constexpr T gcd(T a, T b) {
if (!a || !b)
return 0;
return a % b ? gcd(b, a % b) : b;
}
template <class T> inline constexpr T lcm(T a, T b) {
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline ll pow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = pow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline ll modpow(ll a, ll b, ll mod) {
if (b == 0)
return 1;
ll ans = pow(a, b / 2);
return ans * ans * (b & 1 ? a : 1) % mod;
}
template <typename T> inline bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class T, class L> pair<T, L> operator+=(pair<T, L> a, pair<T, L> b) {
a.first += b.first;
a.second += b.second;
return a;
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
signed main() {
LL(a, b);
if (b % a == 0)
out(a + b);
else
out(b - a);
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 926,798 | 926,799 | u874644572 | cpp |
p03125 | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
typedef long long ll;
typedef long double R;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// Problem Specific Parameter:
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 _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
typedef long long ll;
typedef long double R;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// Problem Specific Parameter:
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"
] | 926,804 | 926,805 | u013803727 | cpp |
p03125 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int A, B;
cin >> A >> B;
if (A % B == 0) {
cout << A + B;
} else {
cout << B - A;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,808 | 926,809 | u355387749 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))
const int INF = 1000000000;
const ll M = 1000000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1},
{-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
/*----------------------------------------------/
/- char : %c | char * : %s | short : %hd
/- int : %d | long : %ld | long long : %lld
/- unsigned short:%hu | unsigned int : %u | unsigned long: %lu
/- u_long long : %llu| (octal) : %o | (hexadecimal): %x
/- float : %f | double : %lf |
/----------------------------------------------*/
/*----------------------------------------------/
/- INT_MAX, LONG_MAX : 1<<15 = 2.1*pow(10, 9) (= 2147483647)
/- UINT_MAX, ULONG_MAX : 1<<16 = 4.2*pow(10, 9) (= 4294967295)
/- LLONG_MAX : 1<<63 = 9.2*pow(10, 18) (= 9223372036854775807)
/- ULLONG_MAX : 1<<64 = 1.8*pow(10, 19) (= 18446744073709551615)
/----------------------------------------------*/
int main() {
int A, B;
scanf("%d %d", &A, &B);
/* ====================================== */
if (A % B == 0) {
cout << A + B;
} else {
cout << B - A;
}
/* ====================================== */
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))
const int INF = 1000000000;
const ll M = 1000000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1},
{-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
/*----------------------------------------------/
/- char : %c | char * : %s | short : %hd
/- int : %d | long : %ld | long long : %lld
/- unsigned short:%hu | unsigned int : %u | unsigned long: %lu
/- u_long long : %llu| (octal) : %o | (hexadecimal): %x
/- float : %f | double : %lf |
/----------------------------------------------*/
/*----------------------------------------------/
/- INT_MAX, LONG_MAX : 1<<15 = 2.1*pow(10, 9) (= 2147483647)
/- UINT_MAX, ULONG_MAX : 1<<16 = 4.2*pow(10, 9) (= 4294967295)
/- LLONG_MAX : 1<<63 = 9.2*pow(10, 18) (= 9223372036854775807)
/- ULLONG_MAX : 1<<64 = 1.8*pow(10, 19) (= 18446744073709551615)
/----------------------------------------------*/
int main() {
int A, B;
scanf("%d %d", &A, &B);
/* ====================================== */
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
/* ====================================== */
cout << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,810 | 926,811 | u245366924 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string.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;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string.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;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 926,814 | 926,815 | u238235808 | cpp |
p03125 | /*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")*/
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define amen ;
#define vec vector
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define Str(x) to_string(x)
#define len(s) (int)s.size()
typedef long long ll;
typedef double d;
typedef long double lld;
typedef string str;
typedef unsigned long long ull;
typedef unsigned int ui;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
cin >> a >> b;
if (a % b) {
cout << a - b;
} else {
cout << a + b;
}
return 0;
} | /*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")*/
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define amen ;
#define vec vector
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define Str(x) to_string(x)
#define len(s) (int)s.size()
typedef long long ll;
typedef double d;
typedef long double lld;
typedef string str;
typedef unsigned long long ull;
typedef unsigned int ui;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
cin >> b >> a;
if (a % b) {
cout << a - b;
} else {
cout << a + b;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 926,816 | 926,817 | u787195982 | cpp |
p03125 | #include <bits/stdc++.h>
#define INT_INF (2 * 1e9)
#define LL_INF (2LL * 1e18)
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << endl;
#else
#define DBG(X)
#endif
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
static mt19937 _g(time(nullptr));
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
void solve() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
}
int main(int argc, char **argv) {
fast_io();
solve();
return 0;
}
| #include <bits/stdc++.h>
#define INT_INF (2 * 1e9)
#define LL_INF (2LL * 1e18)
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << endl;
#else
#define DBG(X)
#endif
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
static mt19937 _g(time(nullptr));
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
void solve() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
}
int main(int argc, char **argv) {
fast_io();
solve();
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,820 | 926,821 | u146975530 | cpp |
p03125 | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const int N = 1e7 + 600;
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const int N = 1e7 + 600;
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"
] | 926,822 | 926,823 | u624688258 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define start_routine() int begtime = clock();
#define end_routine() \
int endtime = clock(); \
cerr << endl \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms"; \
return 0
#define speed() cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(false)
#define exit(a, b) return cout << a, b;
#define PB push_back
#define MP make_pair
#define sd(n) scanf("%lld", &n)
#define pdn(n) printf("%lld\n", n);
#define pds(n) printf("%lld ", n);
#define endl '\n'
#define forn(a, b, i) for (int i = a; i < b; i += 1)
#define all(v) v.begin(), v.end()
using vi = vector<int>;
using vb = vector<bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
#define print(stuff) cout << stuff << endl
#define len(stuff) stuff.size()
#define int long long
#define float long double
const int upper = 5e5 + 2;
const int M = (int)998244353;
const int inf = (int)1e17;
const double eps = 1e-8;
int n, q;
vector<vector<pii>> adj;
#define left lft
#define right rgt
int left[upper], right[upper], arr[upper];
int idx[upper];
int next_id = 0;
int tree[8 * upper], tag[8 * upper];
vector<pair<pii, int>> queries[upper];
int response[upper];
void dfs(int root, int prev) {
bool is_leaf = true;
next_id += 1;
idx[root] = next_id;
for (auto i : adj[root]) {
if (i.first != prev) {
is_leaf = false;
dfs(i.first, root);
}
}
left[root] = inf, right[root] = -inf;
for (auto i : adj[root]) {
if (i.first != prev) {
left[root] = min(left[root], left[i.first]);
right[root] = max(right[root], right[i.first]);
}
}
if (is_leaf) {
left[root] = right[root] = idx[root];
}
}
void init() {
for (int i = 0; i < 4 * upper; i += 1)
tree[i] = inf, tag[i] = 0;
for (int i = 0; i < upper; i += 1)
arr[i] = inf;
}
void dfs0(int root, int prev, int covered) {
bool is_leaf = true;
for (auto i : adj[root]) {
if (i.first != prev) {
is_leaf = false;
dfs0(i.first, root, covered + i.second);
}
}
if (is_leaf) {
arr[idx[root]] = covered;
}
}
void build(int node, int l, int r) {
if (l == r) {
tree[node] = arr[l];
return;
}
int mid = (l + r) >> 1;
build(2 * node + 1, l, mid);
build(2 * node + 2, mid + 1, r);
tree[node] = min(tree[2 * node + 1], tree[2 * node + 2]);
}
int query(int node, int l, int r, int lq, int rq) {
if (rq < l or lq > r)
return inf;
if (l == r) {
tree[node] += tag[node];
tag[node] = 0;
return tree[node];
}
if (tag[node]) {
tag[2 * node + 1] += tag[node];
tag[2 * node + 2] += tag[node];
tree[node] += tag[node];
tag[node] = 0;
}
if (lq <= l and rq >= r)
return tree[node];
int mid = (l + r) >> 1;
return min(query(2 * node + 1, l, mid, lq, rq),
query(2 * node + 2, mid + 1, r, lq, rq));
}
void update(int node, int l, int r, int lu, int ru, int add) {
if (lu > r or ru < l)
return;
if (tag[node]) {
tree[node] += tag[node];
tag[2 * node + 1] += tag[node];
tag[2 * node + 2] += tag[node];
tag[node] = 0;
}
if (l >= lu and r <= ru) {
tag[node] += add;
return;
}
int mid = (l + r) >> 1;
update(2 * node + 1, l, mid, lu, ru, add);
update(2 * node + 2, mid + 1, r, lu, ru, add);
tree[node] = min(tree[2 * node + 1] + tag[2 * node + 1],
tree[2 * node + 2] + tag[2 * node + 2]);
}
void dfs_answer(int root, int prev) {
for (auto i : queries[root]) {
int ans = query(1, 1, upper, i.first.first, i.first.second);
response[i.second] = ans;
}
for (auto i : adj[root]) {
if (i.first == prev)
continue;
update(1, 1, upper, 1, upper, i.second);
update(1, 1, upper, left[i.first], right[i.first], -2 * i.second);
dfs_answer(i.first, root);
update(1, 1, upper, 1, upper, -i.second);
update(1, 1, upper, left[i.first], right[i.first], 2 * i.second);
}
}
signed main() {
start_routine();
speed();
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// freopen("errlog.txt", "w", stderr);
#endif
int a, b;
cin >> a >> b;
if (a % b == 0) {
cout << a + b;
} else {
cout << b - a;
}
end_routine();
} | #include <bits/stdc++.h>
using namespace std;
#define start_routine() int begtime = clock();
#define end_routine() \
int endtime = clock(); \
cerr << endl \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms"; \
return 0
#define speed() cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(false)
#define exit(a, b) return cout << a, b;
#define PB push_back
#define MP make_pair
#define sd(n) scanf("%lld", &n)
#define pdn(n) printf("%lld\n", n);
#define pds(n) printf("%lld ", n);
#define endl '\n'
#define forn(a, b, i) for (int i = a; i < b; i += 1)
#define all(v) v.begin(), v.end()
using vi = vector<int>;
using vb = vector<bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
#define print(stuff) cout << stuff << endl
#define len(stuff) stuff.size()
#define int long long
#define float long double
const int upper = 5e5 + 2;
const int M = (int)998244353;
const int inf = (int)1e17;
const double eps = 1e-8;
int n, q;
vector<vector<pii>> adj;
#define left lft
#define right rgt
int left[upper], right[upper], arr[upper];
int idx[upper];
int next_id = 0;
int tree[8 * upper], tag[8 * upper];
vector<pair<pii, int>> queries[upper];
int response[upper];
void dfs(int root, int prev) {
bool is_leaf = true;
next_id += 1;
idx[root] = next_id;
for (auto i : adj[root]) {
if (i.first != prev) {
is_leaf = false;
dfs(i.first, root);
}
}
left[root] = inf, right[root] = -inf;
for (auto i : adj[root]) {
if (i.first != prev) {
left[root] = min(left[root], left[i.first]);
right[root] = max(right[root], right[i.first]);
}
}
if (is_leaf) {
left[root] = right[root] = idx[root];
}
}
void init() {
for (int i = 0; i < 4 * upper; i += 1)
tree[i] = inf, tag[i] = 0;
for (int i = 0; i < upper; i += 1)
arr[i] = inf;
}
void dfs0(int root, int prev, int covered) {
bool is_leaf = true;
for (auto i : adj[root]) {
if (i.first != prev) {
is_leaf = false;
dfs0(i.first, root, covered + i.second);
}
}
if (is_leaf) {
arr[idx[root]] = covered;
}
}
void build(int node, int l, int r) {
if (l == r) {
tree[node] = arr[l];
return;
}
int mid = (l + r) >> 1;
build(2 * node + 1, l, mid);
build(2 * node + 2, mid + 1, r);
tree[node] = min(tree[2 * node + 1], tree[2 * node + 2]);
}
int query(int node, int l, int r, int lq, int rq) {
if (rq < l or lq > r)
return inf;
if (l == r) {
tree[node] += tag[node];
tag[node] = 0;
return tree[node];
}
if (tag[node]) {
tag[2 * node + 1] += tag[node];
tag[2 * node + 2] += tag[node];
tree[node] += tag[node];
tag[node] = 0;
}
if (lq <= l and rq >= r)
return tree[node];
int mid = (l + r) >> 1;
return min(query(2 * node + 1, l, mid, lq, rq),
query(2 * node + 2, mid + 1, r, lq, rq));
}
void update(int node, int l, int r, int lu, int ru, int add) {
if (lu > r or ru < l)
return;
if (tag[node]) {
tree[node] += tag[node];
tag[2 * node + 1] += tag[node];
tag[2 * node + 2] += tag[node];
tag[node] = 0;
}
if (l >= lu and r <= ru) {
tag[node] += add;
return;
}
int mid = (l + r) >> 1;
update(2 * node + 1, l, mid, lu, ru, add);
update(2 * node + 2, mid + 1, r, lu, ru, add);
tree[node] = min(tree[2 * node + 1] + tag[2 * node + 1],
tree[2 * node + 2] + tag[2 * node + 2]);
}
void dfs_answer(int root, int prev) {
for (auto i : queries[root]) {
int ans = query(1, 1, upper, i.first.first, i.first.second);
response[i.second] = ans;
}
for (auto i : adj[root]) {
if (i.first == prev)
continue;
update(1, 1, upper, 1, upper, i.second);
update(1, 1, upper, left[i.first], right[i.first], -2 * i.second);
dfs_answer(i.first, root);
update(1, 1, upper, 1, upper, -i.second);
update(1, 1, upper, left[i.first], right[i.first], 2 * i.second);
}
}
signed main() {
start_routine();
speed();
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// freopen("errlog.txt", "w", stderr);
#endif
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
end_routine();
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,824 | 926,825 | u345794450 | cpp |
p03125 | #include <bits/stdc++.h>
#define FLASH \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define pb push_back
#define int long long
#define fr(i, a, b) for (int i = a; i < b; i++)
#define mod 1000000007
#define FILEIO \
freopen("/home/aman/Desktop/Kachda/input.txt", "r", stdin); \
freopen("/home/aman/Desktop/Kachda/output.txt", "w", stdout);
using namespace std;
signed main() {
FLASH
int a, b;
cin >> a >> b;
if (b % a)
cout << a + b;
else
cout << b - a;
} | #include <bits/stdc++.h>
#define FLASH \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define pb push_back
#define int long long
#define fr(i, a, b) for (int i = a; i < b; i++)
#define mod 1000000007
#define FILEIO \
freopen("/home/aman/Desktop/Kachda/input.txt", "r", stdin); \
freopen("/home/aman/Desktop/Kachda/output.txt", "w", stdout);
using namespace std;
signed main() {
FLASH
int a, b;
cin >> a >> b;
if (b % a)
cout << b - a;
else
cout << b + a;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 926,826 | 926,827 | u955177919 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
int a, b;
cin >> a >> b;
cout << (a % b == 0 ? a + b : b - a);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a);
} | [
"expression.operation.binary.remove"
] | 926,830 | 926,831 | u987476436 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
int a, b;
cin >> a >> b;
cout << (a % b == 0 ? a - b : b - a);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a);
} | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 926,832 | 926,831 | u987476436 | 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"
] | 926,835 | 926,836 | u374929478 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int N;
int a, b;
Scd2(a, b);
if (b % a)
printf("%d\n", a + b);
else
printf("%d\n", b - a);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int N;
int a, b;
Scd2(a, b);
if (b % a == 0)
printf("%d\n", a + b);
else
printf("%d\n", b - a);
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 926,841 | 926,842 | u550398291 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << a - b;
cout << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
cout << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,845 | 926,846 | u806661586 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
#define PB push_back
#define EB emplace_back
#ifdef LOCAL_DEBUG
#define DEBUG(...) printf(__VA_ARGS__)
#else
#define DEBUG(...)
#endif
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a % b == 0)
printf("%d\n", a + b);
else
printf("%d\n", b - a);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
#define PB push_back
#define EB emplace_back
#ifdef LOCAL_DEBUG
#define DEBUG(...) printf(__VA_ARGS__)
#else
#define DEBUG(...)
#endif
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (b % a == 0)
printf("%d\n", a + b);
else
printf("%d\n", b - a);
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,847 | 926,848 | u483277935 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
signed main() {
int A, B, C;
string S;
int N;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << A - B;
}
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
signed main() {
int A, B, C;
string S;
int N;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
}
| [
"expression.operation.binary.remove"
] | 926,849 | 926,850 | u118951811 | 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"
] | 926,853 | 926,854 | u673058289 | cpp |
p03125 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); (b) <= i; i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n; n <= i; i--)
#define ABS(a) ((a < 0) ? ((-1) * (a)) : (a))
#define elif else if
#define MOD 1000000007
#define INF (1 << 30)
using namespace std;
#define ld long double
#define ll long long
map<int, int> mpa, mpb;
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> pque;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll ans;
ll x, y;
ll A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << A - B << endl;
}
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); (b) <= i; i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n; n <= i; i--)
#define ABS(a) ((a < 0) ? ((-1) * (a)) : (a))
#define elif else if
#define MOD 1000000007
#define INF (1 << 30)
using namespace std;
#define ld long double
#define ll long long
map<int, int> mpa, mpb;
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> pque;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll ans;
ll x, y;
ll A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,859 | 926,860 | u789417951 | cpp |
p03125 | // header {{{
#include <bits/stdc++.h>
using namespace std;
// {U}{INT,LONG,LLONG}_{MAX,MIN}
#define INF INT_MAX / 3
#define LLINF LLONG_MAX / 3
#define MOD (1000000007LL)
#define MODA(a, b) a = ((a) + (b)) % MOD
#define MODP(a, b) a = ((a) * (b)) % MOD
#define inc(i, l, r) for (int i = (l); i < (r); i++)
#define dec(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define pb push_back
#define se second
#define fi first
#define mset(a, b) memset(a, b, sizeof(a))
using LL = long long;
using G = vector<vector<int>>;
int di[] = {0, -1, 0, 1};
int dj[] = {1, 0, -1, 0};
// }}}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << (a % b == 0 ? a + b : b - a) << endl;
return 0;
}
| // header {{{
#include <bits/stdc++.h>
using namespace std;
// {U}{INT,LONG,LLONG}_{MAX,MIN}
#define INF INT_MAX / 3
#define LLINF LLONG_MAX / 3
#define MOD (1000000007LL)
#define MODA(a, b) a = ((a) + (b)) % MOD
#define MODP(a, b) a = ((a) * (b)) % MOD
#define inc(i, l, r) for (int i = (l); i < (r); i++)
#define dec(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define pb push_back
#define se second
#define fi first
#define mset(a, b) memset(a, b, sizeof(a))
using LL = long long;
using G = vector<vector<int>>;
int di[] = {0, -1, 0, 1};
int dj[] = {1, 0, -1, 0};
// }}}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,866 | 926,867 | u857259336 | cpp |
p03125 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
#define P pair
// stoi(s): string to int
// stod(s): string to double
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
// DBL_MIN
// DBL_MAX
// LDBL_MIN
// LDBL_MAX
// A-Z: 65~90
// a-z: 97~122
// |a-z| = 26
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int a, b;
cin >> a >> b;
if (a % b == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
#define P pair
// stoi(s): string to int
// stod(s): string to double
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
// DBL_MIN
// DBL_MAX
// LDBL_MIN
// LDBL_MAX
// A-Z: 65~90
// a-z: 97~122
// |a-z| = 26
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
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"
] | 926,872 | 926,873 | u493080913 | 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"
] | 926,874 | 926,875 | u935723832 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<llint, llint> pll;
typedef vector<int> vi;
typedef vector<llint> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define ci cin
#define co cout
#define en endl
#define ln cout << '\n'
#define rep(i, n) for (int i = 0; i < n; i++)
#define outl(x) cout << (x) << '\n'
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
template <typename Tn> Tn gcd(Tn a, Tn b) { return (b ? gcd(b, a % b) : a); }
template <typename Tn> Tn lcm(Tn a, Tn b) { return a / gcd(a, b) * b; }
string IntToString(int number) {
stringstream ss;
ss << number;
return ss.str();
}
llint cnt = 0;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int a, b;
ci >> a >> b;
if (b % a == 0)
co << a + b << en;
else
co << a - b << en;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<llint, llint> pll;
typedef vector<int> vi;
typedef vector<llint> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define ci cin
#define co cout
#define en endl
#define ln cout << '\n'
#define rep(i, n) for (int i = 0; i < n; i++)
#define outl(x) cout << (x) << '\n'
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
template <typename Tn> Tn gcd(Tn a, Tn b) { return (b ? gcd(b, a % b) : a); }
template <typename Tn> Tn lcm(Tn a, Tn b) { return a / gcd(a, b) * b; }
string IntToString(int number) {
stringstream ss;
ss << number;
return ss.str();
}
llint cnt = 0;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int a, b;
ci >> a >> b;
if (b % a == 0)
co << a + b << en;
else
co << b - a << en;
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,887 | 926,888 | u966921248 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b / a != 0) {
cout << a + b;
} else {
cout << b - a;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 926,889 | 926,890 | u352238438 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << a - b;
return 0;
} | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
return 0;
} | [
"expression.operation.binary.remove"
] | 926,901 | 926,902 | u535773602 | cpp |
p03125 | /*
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#define ll long long
#define M
#define mmp make_pair
using namespace std;
int read() {
int nm = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); c = getchar())
nm = nm * 10 + c - '0';
return nm * f;
}
int main() {
int a = read(), b = read();
if (b % a)
cout << a - b;
else
cout << a + b;
return 0;
}
| /*
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#define ll long long
#define M
#define mmp make_pair
using namespace std;
int read() {
int nm = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); c = getchar())
nm = nm * 10 + c - '0';
return nm * f;
}
int main() {
int a = read(), b = read();
if (b % a)
cout << b - a;
else
cout << a + b;
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,915 | 926,916 | u885902011 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : A - B);
return 0;
}
| #include <iostream>
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"
] | 926,921 | 926,922 | u927253988 | cpp |
p03125 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cout << #x << " = " << (x) << endl;
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cout << #x << " = " << (x) << endl;
using namespace std;
using ll = long long;
using pii = pair<int, int>;
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"
] | 926,933 | 926,934 | u628047647 | cpp |
p03125 | #include <iostream>
int a, b;
int main() {
std::cin >> a >> b;
if (a % b == 0)
std::cout << a + b << std::endl;
else
std::cout << b - a << std::endl;
return 0;
} | #include <iostream>
int a, b;
int main() {
std::cin >> a >> b;
if (b % a == 0)
std::cout << a + b << std::endl;
else
std::cout << b - a << std::endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,935 | 926,936 | u332570575 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? B - A : B + A) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (B % A != 0 ? B - A : B + A) << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 926,950 | 926,951 | u216962796 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
// 整数の入力
int a, b;
cin >> a >> b;
int c;
if (a % b == 0) {
c = a + b;
} else {
c = b - a;
}
cout << c << endl;
return 0;
} | #include <iostream>
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;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,955 | 926,956 | u934405210 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
using tpl = tuple<char, int>;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
int A, B;
int main() {
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;
using tpl = tuple<char, int>;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
int A, B;
int main() {
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << -A + B << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 926,961 | 926,962 | u489053642 | cpp |
p03125 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100][2];
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b) << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100][2];
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
} | [
"expression.operation.binary.remove"
] | 926,977 | 926,978 | u387055019 | cpp |
p03125 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A;
cin >> B;
if (A % B == 0) {
cout << A + B;
} else {
cout << B - A;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A;
cin >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,979 | 926,980 | u513362603 | cpp |
p03125 | #include <iostream>
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 <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"
] | 926,981 | 926,982 | u391202061 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0) {
cout << a + b;
} else {
cout << b - a;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,985 | 926,986 | u583560632 | 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;
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.arithmetic.change",
"io.output.change"
] | 926,995 | 926,996 | u522548464 | 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"
] | 926,997 | 926,996 | u522548464 | 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",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 926,998 | 926,996 | u522548464 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.