problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b / a == 0 ? a + b : b - a) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 925,934 | 925,935 | u948459352 | cpp |
p03125 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int a, b;
cin >> a >> b;
if (b... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int a, b;
cin >> a >> b;
if (b... | [
"expression.operation.binary.remove"
] | 925,938 | 925,939 | u373164102 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << a - b;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
} | [
"expression.operation.binary.remove"
] | 925,940 | 925,941 | u595786324 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (b & a == 0) {
ans = a + b;
}
else {
ans = b - a;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (b % a == 0) {
ans = a + b;
}
else {
ans = b - a;
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 925,942 | 925,943 | u098026368 | cpp |
p03125 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : A - B) << endl;
return 0;
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : B - A) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 925,944 | 925,945 | u221769213 | cpp |
p03125 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << A - B;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
} | [
"expression.operation.binary.remove"
] | 925,948 | 925,949 | u077051605 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A % B == 0) {
cout << A + B << endl;
}
else {
cout << B - A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
}
else {
cout << B - A << endl;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,954 | 925,955 | u615258936 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> 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;
cin >> B;
if (B % A == 0) {
cout << A + B << endl;
}
else {
cout << B - A << endl;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,956 | 925,957 | u585079047 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : A - B);
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : B - A);
return 0;
} | [
"expression.operation.binary.remove"
] | 925,962 | 925,963 | u174509352 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 925,980 | 925,981 | u756388720 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a % b == 0)
cout << b + a << endl;
else
cout << b - a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << b + a << endl;
else
cout << b - a << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 925,988 | 925,989 | u079470909 | cpp |
p03125 | #include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) ... | #include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) ... | [
"io.output.change"
] | 925,990 | 925,991 | u131020584 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a % b ? b - a : a + b);
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a ? b - a : a + b);
} | [
"expression.operation.binary.remove"
] | 925,992 | 925,993 | u130834452 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << A - B << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 925,994 | 925,995 | u247679666 | cpp |
p03125 | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << A - B << endl;
}
}
... | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
}
... | [
"expression.operation.binary.remove"
] | 925,996 | 925,997 | u310228685 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << B + A << endl;
} else {
cout << A - B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << B + A << endl;
} else {
cout << B - A << endl;
}
} | [
"expression.operation.binary.remove"
] | 926,003 | 926,004 | u824756230 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << B - A << endl;
} else {
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << B + A << endl;
} else {
cout << B - A << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 926,005 | 926,004 | u824756230 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << a - b;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b;
else
cout << b - a;
}
| [
"expression.operation.binary.remove"
] | 926,012 | 926,013 | u745901211 | cpp |
p03125 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define ... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
#define ff first
#define ss second
#define ... | [
"expression.operation.binary.remove"
] | 926,018 | 926,019 | u572138437 | cpp |
p03125 | #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
std::cout << ((B % A) == 0 ? A + B : A - B) << std::endl;
return 0;
}
| #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
std::cout << ((B % A) == 0 ? A + B : B - A) << std::endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 926,026 | 926,027 | u896932701 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
if (B % 2 == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 926,028 | 926,029 | u947375463 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
if (B % 2 == 0) {
cout << A + B << endl;
} else {
cout << A - B << endl;
}
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 926,030 | 926,029 | u947375463 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(), a.rend())
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#defi... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(), a.rend())
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#def... | [
"expression.operation.binary.remove",
"assignment.change"
] | 926,035 | 926,036 | u335104842 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << (a += b);
} else {
cout << (a -= b);
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << (b += a);
} else {
cout << (b -= a);
}
} | [
"assignment.change"
] | 926,037 | 926,038 | u103305058 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
}
else if (B % A != 0) {
cout << 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 if (B % A != 0) {
cout << B - A << endl;
}
}
| [
"expression.operation.binary.remove"
] | 926,040 | 926,041 | u096717230 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : a - b) << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a + b : b - a) << endl;
} | [
"expression.operation.binary.remove"
] | 926,043 | 926,044 | u207460172 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << ((b * 10 / a) % 10 == 0 ? a + b : b - a) << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << ((b * 100 / a) % 100 == 0 ? a + b : b - a) << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 926,045 | 926,046 | u527806673 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define otp(n) cout << n;
#define ct(n) cout << n << endl;
#define cts(n) cout << n << " ";
#define cte cout << endl;
#define ctv(v) rep(i, (v).size()) ct(v[i])
#define rep(i, n) for (int i = 0; i < n; i++)
#define r... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define otp(n) cout << n;
#define ct(n) cout << n << endl;
#define cts(n) cout << n << " ";
#define cte cout << endl;
#define ctv(v) rep(i, (v).size()) ct(v[i])
#define rep(i, n) for (int i = 0; i < n; i++)
#define r... | [
"expression.operation.binary.remove"
] | 926,049 | 926,050 | u721367699 | cpp |
p03125 | #include <iostream>
#include <string>
using namespace std;
int main() {
int i, j, a, b;
cin >> a >> b;
if (a % b == 0) {
cout << a + b;
} else {
cout << b - a;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int i, j, 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,051 | 926,052 | u942591696 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,055 | 926,056 | u116670634 | cpp |
p03125 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | [
"expression.operation.binary.remove"
] | 926,057 | 926,058 | u906208439 | cpp |
p03125 | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (b % a == 0) {
std::cout << a + b;
} else {
std::cout << a - b;
}
} | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (b % a == 0) {
std::cout << a + b;
} else {
std::cout << b - a;
}
} | [
"expression.operation.binary.remove"
] | 926,062 | 926,063 | u592236625 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : A - B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << (B % A == 0 ? A + B : B - A) << endl;
} | [
"expression.operation.binary.remove"
] | 926,064 | 926,065 | u826764011 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <numeric>
#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 <iostream>
#include <numeric>
#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,066 | 926,067 | u412550879 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
double K = B % A;
if (K != 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;
double K = B % A;
if (K != 0) {
cout << B - A << endl;
} else {
cout << B + A << endl;
}
} | [
"expression.operation.binary.remove"
] | 926,090 | 926,091 | u363743459 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a;
int 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;
int b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 926,116 | 926,117 | u681358160 | cpp |
p03125 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << (a + b) << endl;
} else {
cout << a - b << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << (a + b) << endl;
} else {
cout << b - a << endl;
}
} | [
"expression.operation.binary.remove"
] | 926,124 | 926,125 | u160754729 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (b % a == 0)
printf("%d\n", a + b);
else
printf("%d\n", a - b);
}
| #include <bits/stdc++.h>
using namespace std;
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"
] | 926,126 | 926,127 | u969248530 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = (A % B == 0) ? (A + B) : (B - A);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = (B % A == 0) ? (A + B) : (B - A);
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 926,136 | 926,137 | u681440564 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <map>
#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 <iostream>
#include <map>
#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,140 | 926,141 | u974285535 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A % B)
cout << B + A << endl;
else
cout << B - A << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (!(B % A))
cout << B + A << endl;
else
cout << B - A << endl;
} | [
"control_flow.branch.if.condition.change"
] | 926,142 | 926,143 | u223504018 | 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,146 | 926,147 | u167755809 | cpp |
p03125 | #include <iostream>
#include <math.h>
#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;
}
return 0;
} | #include <iostream>
#include <math.h>
#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"
] | 926,152 | 926,153 | u899108527 | cpp |
p03125 | // Robs Code
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long ... | // Robs Code
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,156 | 926,157 | u912294434 | cpp |
p03125 | // Robs Code
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long ... | // Robs Code
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 926,158 | 926,157 | u912294434 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"expression.operation.binary.remove"
] | 926,161 | 926,162 | u155416173 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A % B) == 0) {
cout << A + B << endl;
}
else
cout << B - A << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((B % A) == 0) {
cout << A + B << endl;
}
else
cout << B - A << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,178 | 926,179 | u126508424 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
// #include <numeric> // gcdとかlcmとか C++17から
#include <time.h> // time_t timer; time(&timer); でtimerに現在時刻が代入される．
#include <unistd.h> // sleep関数．引数は秒単位．
using namespace std;
typedef long long ll;
// sortの仕方
// ■ string s の場合
// 昇順: sort(s.begin... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
// #include <numeric> // gcdとかlcmとか C++17から
#include <time.h> // time_t timer; time(&timer); でtimerに現在時刻が代入される．
#include <unistd.h> // sleep関数．引数は秒単位．
using namespace std;
typedef long long ll;
// sortの仕方
// ■ string s の場合
// 昇順: sort(s.begin... | [
"expression.operation.binary.remove"
] | 926,184 | 926,185 | u867763103 | cpp |
p03125 | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define LL long long... | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define LL long long... | [
"expression.operation.binary.remove"
] | 926,194 | 926,195 | u393086221 | cpp |
p03125 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"expression.operation.binary.remove"
] | 926,196 | 926,197 | u093922224 | 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,203 | 926,204 | u051493691 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B / A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 926,209 | 926,210 | u274317341 | cpp |
p03125 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "... | [
"expression.operation.binary.remove"
] | 926,223 | 926,224 | u297203024 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a % b == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << b - a << endl;
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,227 | 926,228 | u114838227 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 926,229 | 926,230 | u787972656 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef std::pair<int, int> int_pair;
using namespace std;
in... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef std::pair<int, int> int_pair;
using namespace std;
in... | [
"expression.operation.binary.remove"
] | 926,237 | 926,238 | u345965293 | cpp |
p03125 | #include <stdio.h>
int main() {
int input1, input2;
// 入力
scanf("%d %d", &input1, &input2);
// 約数かチェック
if ((input1 % input2) == 0) {
// 割り切れるので約数
printf("%d\n", (input1 + input2));
} else {
// 割り切れないので約数ではない
printf("%d\n", (input2 - input1));
}
return 0;
}
| #include <stdio.h>
int main() {
int input1, input2;
// 入力
scanf("%d %d", &input1, &input2);
// 約数かチェック
if ((input2 % input1) == 0) {
// 割り切れるので約数
printf("%d\n", (input1 + input2));
} else {
// 割り切れないので約数ではない
printf("%d\n", (input2 - input1));
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,239 | 926,240 | u170115654 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
// min(a,b)...a,bの小さいほう
// max(a,b)... 大きいほう
int a;
int b;
int c;
int d;
int e;
std::cin >> a >> b;
if (b / a == 0) {
cout << a + b << "\n";
} else {
cout << b - a << "\n";
}
std::cin >> e;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
// min(a,b)...a,bの小さいほう
// max(a,b)... 大きいほう
int a;
int b;
int c;
int d;
int e;
std::cin >> a >> b;
if (b % a == 0) {
cout << a + b << "\n";
} else {
cout << b - a << "\n";
}
std::cin >> e;
... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 926,245 | 926,246 | u986568278 | cpp |
p03125 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int A, B;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A >> B;
if (A % B == 0)
cout << A + B << '\n';
else
cout << B - A << '\n';
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int A, B;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A >> B;
if (B % A == 0)
cout << A + B << '\n';
else
cout << B - A << '\n';
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,247 | 926,248 | u239375815 | 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,251 | 926,252 | u938317342 | cpp |
p03125 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
int main() {
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (B % A == 0) {
return A + B;
} else {
return B - A;
}
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
int main() {
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
} | [
"io.output.change"
] | 926,255 | 926,256 | u477204532 | cpp |
p03125 | #include <fstream>
#include <iomanip>
#include <iostream>
#include <array>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#inc... | #include <fstream>
#include <iomanip>
#include <iostream>
#include <array>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#inc... | [
"control_flow.branch.if.condition.change"
] | 926,266 | 926,267 | u896838289 | cpp |
p03125 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main(void) {
ll a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main(void) {
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,270 | 926,271 | u682686221 | cpp |
p03125 | #include <iostream>
using namespace std;
//-------------------------------
int mod(int a, int b) {
int z;
z = a % b;
return z;
}
int main() {
int A, B;
int f_mod;
int out;
cin >> A >> B;
f_mod = mod(B, A);
if (f_mod == 0) {
out = A + B;
} else {
out = A - B;
}
cout << out << endl;... | #include <iostream>
using namespace std;
//-------------------------------
int mod(int a, int b) {
int z;
z = a % b;
return z;
}
int main() {
int A, B;
int f_mod;
int out;
cin >> A >> B;
f_mod = mod(B, A);
if (f_mod == 0) {
out = A + B;
} else {
out = B - A;
}
cout << out << endl;
... | [
"expression.operation.binary.remove",
"assignment.change"
] | 926,272 | 926,273 | u304181036 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (b % a == 0 ? a = b : b - a);
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;
}
| [
"io.output.change"
] | 926,289 | 926,290 | u202299555 | cpp |
p03125 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <utility> // pair
#include <vector>
#define MAX_N 100001
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rer(i, a, b) for (ll i = a - 1; i >= b; i--)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <utility> // pair
#include <vector>
#define MAX_N 100001
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rer(i, a, b) for (ll i = a - 1; i >= b; i--)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,293 | 926,294 | u876442898 | 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,299 | 926,300 | u689011083 | 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,301 | 926,300 | u689011083 | 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,302 | 926,300 | u689011083 | 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;
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;
}
}
| [
"control_flow.branch.else.add"
] | 926,303 | 926,304 | u685726857 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == a)
cout << a + b << endl;
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;
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.add"
] | 926,305 | 926,304 | u685726857 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#... | [
"expression.operation.binary.remove"
] | 926,314 | 926,315 | u344425917 | cpp |
p03125 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,324 | 926,325 | u380908793 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b << endl;
} else
cout << a - b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
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,326 | 926,327 | u498834139 | cpp |
p03125 | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
type... | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
type... | [
"expression.operation.binary.remove"
] | 926,332 | 926,333 | u746560455 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793238462643383279
typedef long long ll;
const long double EPS = 1e-9;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(20);
mt19937 rng(chrono::steady_clock::now().time_si... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793238462643383279
typedef long long ll;
const long double EPS = 1e-9;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(20);
mt19937 rng(chrono::steady_clock::now().time_si... | [
"expression.operation.binary.remove"
] | 926,362 | 926,363 | u212826429 | 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", b - a);
}
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b;
scanf("%d %d", &a, &b);
if (b % a == 0) {
printf("%d", a + b);
} else {
printf("%d", b - a);
}
return 0;
} | [
"expression.operation.unary.reference.add",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.remove"
] | 926,367 | 926,368 | u129632905 | 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", b - a);
}
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.unary.reference.add"
] | 926,367 | 926,369 | u129632905 | cpp |
p03125 | #include <bits/stdc++.h>
#define Max 100000
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define IN(x) cin >> x
#define DEBUG(x) cerr << (x) << " "
#define PRINT(x) cout << (x) << endl
#define BR cout << endl
ll N = 0;
l... | #include <bits/stdc++.h>
#define Max 100000
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define IN(x) cin >> x
#define DEBUG(x) cerr << (x) << " "
#define PRINT(x) cout << (x) << endl
#define BR cout << endl
ll N = 0;
l... | [
"expression.operation.binary.remove"
] | 926,370 | 926,371 | u790171360 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll A, B;
void input() { cin >> A >> B; }
void solve() {}
int main(void) {
input();
solve();
cout << (B % A == 0) ? (A + B) : (B - A);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll A, B;
void input() { cin >> A >> B; }
void solve() {}
int main(void) {
input();
solve();
cout << ((B % A == 0) ? (A + B) : (B - A)) << endl;
}
| [
"io.output.change"
] | 926,372 | 926,373 | u790171360 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << b - a << 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 << b - a << endl;
else
cout << b + a << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 926,374 | 926,375 | u676578971 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << b - a << endl;
} else {
cout << a + b << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << b + a << endl;
} else {
cout << b - a << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 926,376 | 926,377 | u789199225 | cpp |
p03125 | #include <iostream>
int main(void) {
int A, B;
std::cin >> A >> B;
if (B % A == 0) {
std::cout << A + B;
} else {
std::cout << A - B;
}
return 0;
} | #include <iostream>
int main(void) {
int A, B;
std::cin >> A >> B;
if (B % A == 0) {
std::cout << A + B;
} else {
std::cout << B - A;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 926,378 | 926,379 | u562333532 | cpp |
p03125 | #include <iostream>
int main(void) {
int A, B;
std::cin >> A, B;
if (B % A == 0) {
std::cout << A + B;
} else {
std::cout << A - B;
}
return 0;
} | #include <iostream>
int main(void) {
int A, B;
std::cin >> A >> B;
if (B % A == 0) {
std::cout << A + B;
} else {
std::cout << B - A;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 926,380 | 926,379 | u562333532 | cpp |
p03125 | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
} | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
}
| [
"expression.operation.binary.remove"
] | 926,383 | 926,384 | u807998890 | cpp |
p03125 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(a, b) for (ll a = 0; a < b; ++a)
#define REP(a, b, c... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(a, b) for (ll a = 0; a < b; ++a)
#define REP(a, b, c... | [
"expression.operation.binary.remove"
] | 926,395 | 926,396 | u220562677 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << a - b;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0) {
cout << a + b;
} else {
cout << b - a;
}
} | [
"expression.operation.binary.remove"
] | 926,406 | 926,407 | u205700197 | cpp |
p03125 | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <ve... | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <ve... | [
"expression.operation.binary.remove"
] | 926,412 | 926,413 | u226951654 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
} | [
"expression.operation.binary.remove"
] | 926,416 | 926,417 | u314988220 | cpp |
p03125 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define sz size
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define FORRN(i, a, b) for (int i = (a); i >= (b); i--)
#define FORR(i, a, b) fo... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define sz size
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define FORRN(i, a, b) for (int i = (a); i >= (b); i--)
#define FORR(i, a, b) fo... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,428 | 926,429 | u921592714 | cpp |
p03125 | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | [
"expression.operation.binary.remove"
] | 926,434 | 926,435 | u054475353 | cpp |
p03125 | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,436 | 926,435 | u054475353 | cpp |
p03125 | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | [
"expression.operation.binary.remove"
] | 926,434 | 926,437 | u054475353 | cpp |
p03125 | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 926,436 | 926,437 | u054475353 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define int long long
#define fr(s, n, i) for (int i = s; i < n; i++)
#define fr_(s, n, i) for (int i = s; i >= n; i--)
int MOD = 1000000007;
void solve();
signed main()... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define int long long
#define fr(s, n, i) for (int i = s; i < n; i++)
#define fr_(s, n, i) for (int i = s; i >= n; i--)
int MOD = 1000000007;
void solve();
signed main()... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 926,442 | 926,443 | u847307807 | 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,460 | 926,461 | u224126528 | 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,468 | 926,469 | u090436701 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % 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;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 926,470 | 926,469 | u090436701 | cpp |
p03125 | #include <stdio.h>
int main(void) {
int A, B;
scanf("%d %d", &A, &B);
if (B % A == 0) {
printf("%d", A + B);
} else {
printf("%d", A - B);
}
return 0;
} | #include <stdio.h>
int main(void) {
int A, B;
scanf("%d %d", &A, &B);
if (B % A == 0) {
printf("%d", A + B);
} else {
printf("%d", B - A);
}
return 0;
} | [
"expression.operation.binary.remove"
] | 926,473 | 926,474 | u142698788 | cpp |
p03125 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << A + B;
}
} | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B;
} else {
cout << B - A;
}
} | [
"expression.operation.binary.remove"
] | 926,479 | 926,480 | u953020348 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.