problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03125 | /*
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) ... | #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) ... | [
"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 ?... | #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 ?... | [
"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; ... | #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; ... | [
"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:... | #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:... | [
"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:... | #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:... | [
"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 F... | #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 F... | [
"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;
} els... |
#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;
} els... | [
"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;
ci... | #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;
ci... | [
"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;
typ... | #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;
typ... | [
"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... | #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... | [
"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 -... | #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 -... | [
"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++);
}
Rea... | #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++);
}
Rea... | [
"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>;
usi... | #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>;
usi... | [
"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() {
l... | #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() {
l... | [
"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)... | #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)... | [
"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... | #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... | [
"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 \
... | #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 \
... | [
"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... | #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... | [
"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 <clas... | #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 <clas... | [
"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)... | #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)... | [
"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... | #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... | [
"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_ba... | /*#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_ba... | [
"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 pai... | #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 pai... | [
"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 ... | #include <bits/stdc++.h>
using namespace std;
#define start_routine() int begtime = clock();
#define end_routine() \
int endtime = clock(); \
cerr << endl ... | [
"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_... | #include <bits/stdc++.h>
#define FLASH \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define pb push_... | [
"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, &... | #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, &... | [
"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;
... | #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;
... | [
"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<... | #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<... | [
"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... | #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... | [
"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).be... | #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).be... | [
"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(... | // 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(... | [
"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): str... | #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): str... | [
"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... | #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... | [
"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;
... | /*
*/
#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;
... | [
"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>
#incl... | #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>
#incl... | [
"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;
} ... | #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;
} ... | [
"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;
... | #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;
... | [
"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.