problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k โ | fixed_code stringlengths 12 526k โ | labels listlengths 0 15 โ | buggy_submission_id int64 1 1.54M โ | fixed_submission_id int64 2 1.54M โ | user_id stringlengths 10 10 โ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02943 | #include <bits/stdc++.h>
#define dbug(x) cout << #x << "=" << x << endl
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar()... | #include <bits/stdc++.h>
#define dbug(x) cout << #x << "=" << x << endl
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar()... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 742,667 | 742,668 | u910146840 | cpp |
p02943 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define FOR(x, val, to) for (int x = (val); x < int((to)); ++x)
#define FORE(x, val, to) for (auto x = (val); x <= (to); ++x)
#define FORR(x, a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define FOR(x, val, to) for (int x = (val); x < int((to)); ++x)
#define FORE(x, val, to) for (auto x = (val); x <= (to); ++x)
#define FORR(x, a... | [
"identifier.change",
"call.function.change"
] | 742,669 | 742,670 | u761407600 | cpp |
p02943 | // warm heart, wagging tail,and a smile just for you!
//
// โโโโโโโโ
// โโโโโโโโโโโ
// โโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโ... | // warm heart, wagging tail,and a smile just for you!
//
// โโโโโโโโ
// โโโโโโโโโโโ
// โโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโ... | [
"variable_declaration.value.change",
"identifier.change"
] | 742,681 | 742,682 | u239493918 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
const int max_n = 5555, inf = 1000111222;
int n, k;
string s;
string getr(const string &s, int pos) {
return {s.rbegin() + s.length() - 1 - pos,
s.rbegin() + s.length() - 1 - pos + n};
}
string one_step(const string &s) {
string rs = s;
reverse(rs.begin... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 5555, inf = 1000111222;
int n, k;
string s;
string getr(const string &s, int pos) {
return {s.rbegin() + s.length() - 1 - pos,
s.rbegin() + s.length() - 1 - pos + n};
}
string one_step(const string &s) {
string rs = s;
reverse(rs.begin... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.add"
] | 742,687 | 742,688 | u844891589 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
const int max_n = 5555, inf = 1000111222;
int n, k;
string s;
string getr(const string &s, int pos) {
return {s.rbegin() + s.length() - 1 - pos,
s.rbegin() + s.length() - 1 - pos + n};
}
string one_step(const string &s) {
string rs = s;
reverse(rs.begin... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 5555, inf = 1000111222;
int n, k;
string s;
string getr(const string &s, int pos) {
return {s.rbegin() + s.length() - 1 - pos,
s.rbegin() + s.length() - 1 - pos + n};
}
string one_step(const string &s) {
string rs = s;
reverse(rs.begin... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.add"
] | 742,689 | 742,690 | u844891589 | cpp |
p02943 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"identifier.change",
"expression.operation.binary.change"
] | 742,694 | 742,695 | u294531924 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (in... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (in... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 742,700 | 742,701 | u554953477 | cpp |
p02943 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define fr first
#define sc second
int main() {
static int n, k;
static string s;
cin >> n >> k >> s;
char c = 'z';
for (int i = 0; i < s.size(... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define fr first
#define sc second
int main() {
static int n, k;
static string s;
cin >> n >> k >> s;
char c = 'z';
for (int i = 0; i < s.size(... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 742,723 | 742,724 | u957457849 | cpp |
p02943 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define fr first
#define sc second
int main() {
static int n, k;
static string s;
cin >> n >> k >> s;
char c = 'z';
for (int i = 0; i < s.size(... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define fr first
#define sc second
int main() {
static int n, k;
static string s;
cin >> n >> k >> s;
char c = 'z';
for (int i = 0; i < s.size(... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 742,725 | 742,724 | u957457849 | cpp |
p02943 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
int k, n;
cin >> n >> k >> s;
vector<int> cnt(n, 0);
char best = *min_element(s.begin(), s.end());
if (k > 14) {
for (int i = 0; i < n; ++i)
cout << best... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
int k, n;
cin >> n >> k >> s;
vector<int> cnt(n, 0);
char best = *min_element(s.begin(), s.end());
if (k > 15) {
for (int i = 0; i < n; ++i)
cout << best... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 742,726 | 742,727 | u295095169 | cpp |
p02943 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int N, K;
string S;
string cv;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> K >> S;
for (int i = N - 1; i >= 0; ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int N, K;
string S;
string cv;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> K >> S;
for (int i = N - 1; i >= 0; ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 742,742 | 742,743 | u409373192 | cpp |
p02944 | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | [
"assignment.variable.change",
"call.arguments.change",
"assignment.change"
] | 742,744 | 742,745 | u026342954 | cpp |
p02944 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
using namespace std;
inline char nc() {
return getchar();
static char buf[100000], *l = buf, *r = buf;
return l == r && (r = (l = buf) ... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
using namespace std;
inline char nc() {
return getchar();
static char buf[100000], *l = buf, *r = buf;
return l == r && (r = (l = buf) ... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 742,756 | 742,757 | u002951552 | cpp |
p02944 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define ll long long
using namespace std;
int n, k, tot, pre[400005], nxt[400005], a[400005], l[400005], r[400005],
sl[400005], sr[400005];
ll ans;
bool flag[400005];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, i... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define ll long long
using namespace std;
int n, k, tot, pre[400005], nxt[400005], a[400005], l[400005], r[400005],
sl[400005], sr[400005];
ll ans;
bool flag[400005];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, i... | [
"assignment.value.change",
"identifier.change"
] | 742,758 | 742,759 | u656762776 | cpp |
p02944 |
//#define USEPB_DS
#define USETR1
#define CPPELEVEN
#define GPP
/*
* temp.cpp
*
* Created on: 2012-7-18
* Author: BSBandme
*/
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <ve... |
//#define USEPB_DS
#define USETR1
#define CPPELEVEN
#define GPP
/*
* temp.cpp
*
* Created on: 2012-7-18
* Author: BSBandme
*/
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <ve... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 742,762 | 742,763 | u192548438 | cpp |
p02945 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [] | 742,766 | 742,767 | u884476319 | cpp |
p02945 | #include <algorithm>
#include <iostream>
using namespace std;
int ans[3];
int main() {
int a, b;
cin >> a >> b;
ans[0] = a + b;
ans[1] = a - b;
ans[2] = a * b;
sort(ans, ans + 3);
cout << ans[0];
}
| #include <algorithm>
#include <iostream>
using namespace std;
int ans[3];
int main() {
int a, b;
cin >> a >> b;
ans[0] = a + b;
ans[1] = a - b;
ans[2] = a * b;
sort(ans, ans + 3);
cout << ans[2];
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 742,768 | 742,769 | u700846375 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll a, b;
cin >>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll a, b;
cin >>... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 742,776 | 742,777 | u678961336 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main() {
int a, b, c;
cin >> a;
cout << max(a * b, max(a + b, a - b)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main() {
int a, b;
cin >> a >> b;
cout << max(a * b, max(a + b, a - b)) << endl;
return 0;
} | [
"variable_declaration.remove"
] | 742,786 | 742,787 | u581850493 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int A, B, SUM, DIF, MUL;
cin >> A >> B;
SUM = A + B;
DIF = A - B;
MUL = A * B;
if (SUM >= DIF) {
if (SUM >= MUL) {
cout << SUM;
}
} else if (DIF >= MUL) {
cout << DIF;
} else
cout << MUL;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, SUM, DIF, MUL;
cin >> A >> B;
SUM = A + B;
DIF = A - B;
MUL = A * B;
if (SUM >= DIF && SUM >= MUL) {
cout << SUM;
} else if (DIF >= MUL) {
cout << DIF;
} else
cout << MUL;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 742,790 | 742,791 | u863370423 | cpp |
p02945 | /*
In the name of Allah
MohammadErfan Gooneh
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl '\n'
#define all(a, n) \
for (int i = 0; i < n; i++) ... | /*
In the name of Allah
MohammadErfan Gooneh
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl '\n'
#define all(a, n) \
for (int i = 0; i < n; i++) ... | [
"call.remove",
"call.arguments.change"
] | 742,812 | 742,813 | u001975975 | cpp |
p02945 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"literal.number.change",
"variable_declaration.value.change"
] | 742,822 | 742,823 | u814715203 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= a - b || a + b >= a * b) {
cout << a + b;
} else if (a - b >= a * b) {
cout << a - b;
} else {
cout << a * b;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= a - b && a + b >= a * b) {
cout << a + b;
} else if (a - b >= a * b) {
cout << a - b;
} else {
cout << a * b;
}
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 742,824 | 742,825 | u523119383 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod = 1000000007;
const int MAX_N = 1000; // n ใฎๆๅคงๅค
// nCk ใๅๅพ
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod = 1000000007;
const int MAX_N = 1000; // n ใฎๆๅคงๅค
// nCk ใๅๅพ
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (d... | [
"call.add"
] | 742,857 | 742,858 | u722640678 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int X = A + B;
int Y = A - B;
int Z = A * B;
int ans = max(X, Y);
int C = max(ans, Z);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int X = A + B;
int Y = A - B;
int Z = A * B;
int ans = max(X, Y);
int C = max(ans, Z);
cout << C << endl;
}
| [
"identifier.change",
"io.output.change"
] | 742,861 | 742,862 | u580593895 | cpp |
p02941 | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define... | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 742,871 | 742,870 | u136342563 | cpp |
p02941 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll GCD(ll a... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll GCD(ll a... | [
"expression.operation.binary.add"
] | 742,925 | 742,926 | u822169805 | cpp |
p02941 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
signed main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
priority_queue<pair<int, int>> q;
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
signed main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
priority_queue<pair<int, int>> q;
for (int i = 0; i < n... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 742,988 | 742,989 | u344122377 | cpp |
p02941 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 742,995 | 742,996 | u379822620 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max((a + b, a - b), a * b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(max(a + b, a - b), a * b) << endl;
} | [
"call.add",
"call.arguments.change"
] | 743,028 | 743,029 | u940079168 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int z = a + b;
if (z > a - b)
z = a - b;
if (z > a * b)
z = a * b;
cout << z << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int z = a + b;
if (z < a - b)
z = a - b;
if (z < a * b)
z = a * b;
cout << z << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 743,072 | 743,073 | u107406081 | cpp |
p02945 | #include <stdio.h>
int main(void) {
int a, b, c, d, e, t;
scanf("%d%d", &a, &b);
c = a + b;
d = a - b;
e = a * b;
if (a >= b)
t = a;
else
t = b;
if (e > t)
t = e;
printf("%d", t);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c, d, e, t;
scanf("%d%d", &a, &b);
c = a + b;
d = a - b;
e = a * b;
if (c >= d)
t = c;
else
t = d;
if (e > t)
t = e;
printf("%d", t);
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 743,086 | 743,087 | u816631826 | cpp |
p02945 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int t = a + b, h = a - b, j = a * b;
if (t > h || t > j) {
cout << t << endl;
} else if (h > t || h > j) {
cout << h << endl;
} else {
cout << j << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int t = a + b, h = a - b, j = a * b;
if (t >= h && t >= j) {
cout << t << endl;
} else if (h >= t && h >= j) {
cout << h << endl;
} else {
cout << j << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 743,096 | 743,094 | u025892939 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long a, b, c, d, e, f;
cin >> a >> b;
c = a + b, d = a - b, e = a * e;
if (c > d) {
f = c;
} else {
f = d;
}
if (f > e) {
cout << f;
} else {
cout << e;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long a, b, c, d, e, f;
cin >> a >> b;
c = a + b, d = a - b, e = a * b;
if (c > d) {
f = c;
} else {
f = d;
}
if (f > e) {
cout << f;
} else {
cout << e;
}
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 743,114 | 743,115 | u768439523 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
cout << max(A + N, max(N - A, A + N)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
cout << max(A * N, max(N - A, A + N)) << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 743,128 | 743,129 | u977547071 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
cout << max(a * b, max(a - b, a * b));
} | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
cout << max(a + b, max(a - b, a * b));
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 743,163 | 743,164 | u748819456 | cpp |
p02945 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
int main() {
i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
int main() {
i... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 743,177 | 743,178 | u874815061 | cpp |
p02945 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a, b;
cin >> a >> b;
int x = a + b, y = a = b, z = a * b;
int s = max(x, y);
int t = max(s, z);
cout << t << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a, b;
cin >> a >> b;
int x = a + b, y = a - b, z = a * b;
int s = max(x, y);
int t = max(s, z);
cout << t << endl;
}
| [] | 743,183 | 743,184 | u485925545 | cpp |
p02945 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
int m = a + b;
m = min(m, a - b);
m = min(m, a * b);
cout << m << endl;
return... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
int m = a + b;
m = max(m, a - b);
m = max(m, a * b);
cout << m << endl;
return... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 743,194 | 743,195 | u607564800 | cpp |
p02945 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B;
std::cin >> A >> B;
cout << max({A + B, A * B, A = B}) << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B;
std::cin >> A >> B;
cout << max({A + B, A * B, A - B}) << endl;
}
| [
"io.output.change"
] | 743,200 | 743,201 | u672822010 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vp;
typedef pair<int, int> pii;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
#define EPS (1e-7)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vp;
typedef pair<int, int> pii;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
#define EPS (1e-7)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n)... | [
"literal.number.change"
] | 743,209 | 743,210 | u979966078 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a, b;
cout << max(a - b, max(a + b, a * b));
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(a - b, max(a + b, a * b));
} | [] | 743,211 | 743,212 | u746310630 | cpp |
p02945 | #pragma GCC optimize("O2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <que... | #pragma GCC optimize("O2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <que... | [
"call.arguments.change"
] | 743,231 | 743,232 | u168578024 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // ๆ้ ใฝใผใ
#define rall(v) (v).rbegin(), (v).rend() // ้้ ใฝใผใ
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S sec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // ๆ้ ใฝใผใ
#define rall(v) (v).rbegin(), (v).rend() // ้้ ใฝใผใ
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S sec... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 743,233 | 743,234 | u587857074 | cpp |
p02945 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(a + b, (a - b, a * b)) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max({a + b, a - b, a * b}) << endl;
} | [
"call.arguments.change",
"io.output.change"
] | 743,239 | 743,240 | u654949547 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = max(a + b, a - b);
cout << max(c, a + b);
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = max(a + b, a - b);
cout << max(c, a * b);
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 743,241 | 743,242 | u354391647 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int main() {
int a, b;
cin >> a >> b;
int maxval = 0;
maxval = max(maxval, a + b);
maxval = max(maxval, a - b);
maxval = max(maxval, a * b);
cout << maxval <... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int main() {
int a, b;
cin >> a >> b;
int maxval = -100 * 100;
maxval = max(maxval, a + b);
maxval = max(maxval, a - b);
maxval = max(maxval, a * b);
cout <<... | [
"literal.number.change"
] | 743,243 | 743,244 | u685800831 | cpp |
p02945 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int maximum = A + B;
maximum = (A - B) > maximum ? (A - B) : maximum;
maximum = (A * B) > maximum ? (A - B) : maximum;
cout << maximum << end... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int maximum = A + B;
maximum = (A - B) > maximum ? (A - B) : maximum;
maximum = (A * B) > maximum ? (A * B) : maximum;
cout << maximum << end... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 743,247 | 743,248 | u717265305 | cpp |
p02945 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
vector<int> an(3);
an[0] = a + b;
an[1] = a - b;
an[2] = a * b;
ans = an[0];
if (an[2] > an[1] && ans < an[1])
ans = an[1];
else if (an[2] < an[1] && ans < an[2])
ans = an[2];
cout <... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
vector<int> an(3);
an[0] = a + b;
an[1] = a - b;
an[2] = a * b;
ans = an[0];
if (an[2] > an[1] && ans < an[2])
ans = an[2];
else if (an[2] < an[1] && ans < an[1])
ans = an[1];
cout <... | [
"control_flow.branch.if.add",
"assignment.add"
] | 743,264 | 743,265 | u388372553 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b > a - b && a * b > a + b)
cout << a * b << endl;
else if (a + b > a - b && a + b > a * b)
cout << a + b << endl;
else
cout << a * b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b > a - b && a * b > a + b)
cout << a * b << endl;
else if (a + b > a - b && a + b > a * b)
cout << a + b << endl;
else
cout << a - b << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 743,270 | 743,271 | u613960672 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
int ans;
cin >> a >> b;
ans = max(a + b, a - b);
ans = (ans, a * b);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
int ans;
cin >> a >> b;
ans = max(a + b, a - b);
ans = max(ans, a * b);
cout << ans << endl;
return 0;
} | [
"call.add"
] | 743,283 | 743,284 | u001327021 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max({a + b, a - b, a + b}) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max({a + b, a - b, a * b}) << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 743,288 | 743,289 | u519194615 | cpp |
p02945 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 743,292 | 743,293 | u057611820 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int A, B, l;
l = 0;
cin >> A >> B;
l = A * B;
if ((A + B) > l)
l = A + B;
else if ((A - B) > l)
l = A - B;
cout << l;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, l;
l = 0;
cin >> A >> B;
l = A * B;
if ((A + B) > l)
l = A + B;
if ((A - B) > l)
l = A - B;
cout << l;
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 743,310 | 743,311 | u105724567 | cpp |
p02945 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int sum, sa, kakeru, max;
sum = a + b;
sa = a - b;
kakeru = a * b;
max = sum;
if (sa >= max)
max = sum;
if (kakeru >= max)
max = kakeru;
cout << max;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int sum, sa, kakeru, max;
sum = a + b;
sa = a - b;
kakeru = a * b;
max = sum;
if (sa > max)
max = sa;
if (kakeru > max)
max = kakeru;
cout << max;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change"
] | 743,312 | 743,313 | u280286156 | cpp |
p02945 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int sum, sa, kakeru, max;
sum = a + b;
sa = a - b;
kakeru = a * b;
max = sum;
if (sa > max)
max = sum;
if (kakeru > max)
max = kakeru;
cout << max;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int sum, sa, kakeru, max;
sum = a + b;
sa = a - b;
kakeru = a * b;
max = sum;
if (sa > max)
max = sa;
if (kakeru > max)
max = kakeru;
cout << max;
}
| [
"assignment.value.change",
"identifier.change"
] | 743,314 | 743,313 | u280286156 | cpp |
p02945 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
ans = max(ans, a * b);
ans = max(ans, a + b);
ans = max(ans, a - b);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = -100000;
ans = max(ans, a * b);
ans = max(ans, a + b);
ans = max(ans, a - b);
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 743,335 | 743,336 | u924451152 | cpp |
p02945 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b;
int sum, minus, multi;
sum = a + b;
minus = a - b;
multi = a * b;
c = max(sum, minus);
d = max(sum, multi);
cout << d << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b;
int sum, minus, multi;
sum = a + b;
minus = a - b;
multi = a * b;
c = max(sum, minus);
d = max(c, multi);
cout << d << endl;
} | [
"variable_declaration.add",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 743,337 | 743,338 | u634965946 | cpp |
p02945 | #include <stdio.h>
int main() {
int M = 0;
int A, B;
scanf("%d%d", &A, &B);
if (A + B >= M)
M = A + B;
if (A * B > M)
M = A * B;
if (A - B > M)
M = A - B;
printf("%d", M);
return 0;
}
| #include <stdio.h>
int main() {
int M = -1000;
int A, B;
scanf("%d%d", &A, &B);
if (A + B > M)
M = A + B;
if (A * B > M)
M = A * B;
if (A - B > M)
M = A - B;
printf("%d", M);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 743,349 | 743,350 | u113973663 | cpp |
p02945 | #include <stdio.h>
int main() {
int M = 0;
int A, B;
scanf("%d%d", &A, &B);
if (A + B > M)
M = A + B;
if (A * B > M)
M = A * B;
if (A - B > M)
M = A - B;
printf("%d", M);
return 0;
}
| #include <stdio.h>
int main() {
int M = -1000;
int A, B;
scanf("%d%d", &A, &B);
if (A + B > M)
M = A + B;
if (A * B > M)
M = A * B;
if (A - B > M)
M = A - B;
printf("%d", M);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 743,351 | 743,350 | u113973663 | cpp |
p02945 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
int A, B;
scanf("%d", &A, &B);
int a, b, c;
a = A + B;
b = A - B;
c = A * B;
printf("%d", max(max(a, b), c));
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
int A, B;
scanf("%d%d", &A, &B);
int a, b, c;
a = A + B;
b = A - B;
c = A * B;
printf("%d", max(max(a, b), c));
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 743,360 | 743,361 | u103357948 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 743,395 | 743,396 | u801513186 | cpp |
p02945 | // ABC137A
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
ans = max({a + b, a - b});
cout << ans << endl;
retur... | // ABC137A
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
ans = max({a + b, a - b, a * b});
cout << ans << endl;
... | [] | 743,410 | 743,411 | u733391043 | cpp |
p02945 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | [
"identifier.change",
"call.function.change"
] | 743,427 | 743,428 | u644332191 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
ans = max(ans, A * B);
ans = max(ans, A - B);
ans = max(ans, A + B);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = -1e9;
ans = max(ans, A * B);
ans = max(ans, A - B);
ans = max(ans, A + B);
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 743,441 | 743,442 | u584139221 | cpp |
p02945 | #include <iostream>
using namespace std;
int a;
int b;
int main() {
cin >> a >> b;
if (a * b > a + b) {
cout << a * b << endl;
} else if (a - b > a + b) {
cout << a + b << endl;
} else {
cout << a + b << endl;
}
} | #include <iostream>
using namespace std;
int a;
int b;
int main() {
cin >> a >> b;
if (a * b > a + b) {
cout << a * b << endl;
} else if (a - b > a + b) {
cout << a - b << endl;
} else {
cout << a + b << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 743,448 | 743,449 | u353748264 | cpp |
p02945 | #include <iostream>
using namespace std;
int a;
int b;
int main() {
cin >> a >> b;
if (a * b > a + b) {
cout << a * b << endl;
} else if (a - b > a + b) {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
} | #include <iostream>
using namespace std;
int a;
int b;
int main() {
cin >> a >> b;
if (a * b > a + b) {
cout << a * b << endl;
} else if (a - b > a + b) {
cout << a - b << endl;
} else {
cout << a + b << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 743,450 | 743,449 | u353748264 | cpp |
p02945 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A, B;
int sum, sa, mul;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A;
cin >> B;
int sum,... | [
"expression.operation.binary.add"
] | 743,478 | 743,479 | u108484707 | cpp |
p02945 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A, B;
int sum, sa, mul;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A;
cin >> B;
int sum,... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 743,480 | 743,479 | u108484707 | cpp |
p02945 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a, b;
int main() {
scanf("%d", &a, &b);
int x = a + b, y = a - b, z = a * b;
printf("%d\n", max(max(x, y), z));
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a, b;
int main() {
scanf("%d%d", &a, &b);
int x = a + b, y = a - b, z = a * b;
printf("%d\n", max(max(x, y), z));
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 743,498 | 743,499 | u635607854 | cpp |
p02945 | #include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define rep(i, a, b) for (i = a; i < b... | #include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define rep(i, a, b) for (i = a; i < b... | [] | 743,515 | 743,516 | u151006366 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b;
c = a + b;
d = a - b;
e = a * b;
f = 0;
if (c >= d) {
f = c;
} else {
f = d;
}
if (f >= d) {
cout << f << endl;
} else {
cout << d << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b;
c = a + b;
d = a - b;
e = a * b;
f = 0;
if (c >= d) {
f = c;
} else {
f = d;
}
if (f >= e) {
cout << f << endl;
} else {
cout << e << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 743,527 | 743,528 | u799521877 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, m;
cin >> a >> b;
cout << max(m, max(a + b, a - b));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, m;
cin >> a >> b;
cout << max(a * b, max(a + b, a - b));
} | [
"io.output.change"
] | 743,591 | 743,592 | u157146539 | cpp |
p02945 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int a, b;
cin >> a >> b;
if (a + b > a - b && a + b > a * b)
cout << a +... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int a, b;
cin >> a >> b;
if (a + b > a - b && a + b > a * b)
cout << a +... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 743,597 | 743,598 | u709297224 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = -100000000;
ans = max(a + b, ans);
ans = max(a - b, ans);
ans = max(a + b, ans);
cout << ans;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = -100000000;
ans = max(a + b, ans);
ans = max(a - b, ans);
ans = max(a * b, ans);
cout << ans;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 743,609 | 743,610 | u771621892 | cpp |
p02945 | #include <stdio.h>
void swap(int *a, int *b) {
int c;
if (b > a) {
c = *a;
*a = *b;
*b = *a;
}
}
int main(void) {
int A, B, C, D, E, F;
scanf("%d", &A);
scanf("%d", &B);
C = A + B;
D = A - B;
E = A * B;
if (D > C)
swap(&C, &D);
if (E > D)
swap(&C, &D);
if (C > D)
swap(&C,... | #include <stdio.h>
void swap(int *a, int *b) {
int c;
if (b > a) {
c = *a;
*a = *b;
*b = *a;
}
}
int main(void) {
int A, B, C, D, E, F;
scanf("%d", &A);
scanf("%d", &B);
C = A + B;
D = A - B;
E = A * B;
if (D > C)
swap(&C, &D);
if (E > D)
swap(&D, &E);
if (D > C)
swap(&C,... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 743,611 | 743,612 | u356314857 | cpp |
p02945 | #include <bits/stdc++.h>
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
using namespace std;
int main() {
boost int a;
int b;
cin >> a >> b;
int p, q, r;
p = a + b;
q = a -... | #include <bits/stdc++.h>
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
using namespace std;
int main() {
boost int a;
int b;
cin >> a >> b;
int p, q, r;
p = a + b;
q = a -... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 743,650 | 743,651 | u135723726 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b > a + b && a * b > a - b) {
cout << a * b;
} else if (a + b > a * b && a + b > a - b) {
cout << a + b;
} else if (a - b > a + b && a - b > a * b) {
cout << a - b;
}
cout << a * b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b > a + b && a * b > a - b) {
cout << a * b;
} else if (a + b > a * b && a + b > a - b) {
cout << a + b;
} else if (a - b > a + b && a - b > a * b) {
cout << a - b;
} else {
cout << a + b;
}
retu... | [
"control_flow.branch.else.add",
"expression.operator.arithmetic.change",
"io.output.change"
] | 743,670 | 743,669 | u484351040 | cpp |
p02945 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
int ans = max(a, b);
ans = max(ans, a * b);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
int ans = max(a + b, a - b);
ans = max(ans, a * b);
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 743,674 | 743,675 | u963215078 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A * B) > (A - B) || (A * B) > (A + B)) {
cout << A * B << endl;
}
if ((A - B) > (A * B) || (A - B) > (A + B)) {
cout << A - B << endl;
} else
cout << A + B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A * B) > (A - B) && (A * B) > (A + B)) {
cout << A * B << endl;
} else if ((A - B) > (A * B) && (A - B) > (A + B)) {
cout << A - B << endl;
} else
cout << A + B << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 743,679 | 743,680 | u126508424 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A * B) > (A - B) || (A * B) > (A + B)) {
cout << A * B << endl;
} else if ((A - B) > (A * B) || (A - B) > (A + B)) {
cout << A - B << endl;
} else
cout << A + B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A * B) > (A - B) && (A * B) > (A + B)) {
cout << A * B << endl;
} else if ((A - B) > (A * B) && (A - B) > (A + B)) {
cout << A - B << endl;
} else
cout << A + B << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 743,681 | 743,680 | u126508424 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A * B) >= (A - B) || (A * B) >= (A + B)) {
cout << A * B << endl;
} else if ((A - B) >= (A * B) || (A - B) >= (A + B)) {
cout << A - B << endl;
} else
cout << A + B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A * B) > (A - B) && (A * B) > (A + B)) {
cout << A * B << endl;
} else if ((A - B) > (A * B) && (A - B) > (A + B)) {
cout << A - B << endl;
} else
cout << A + B << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 743,682 | 743,680 | u126508424 | cpp |
p02945 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a, b;
cout << max(max(a + b, a - b), a * b) << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(max(a + b, a - b), a * b) << endl;
return 0;
}
| [] | 743,685 | 743,686 | u556273499 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A, B;
int n = max(A + B, A - B);
int answer = max(n, A * B);
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int n = max(A + B, A - B);
int answer = max(n, A * B);
cout << answer << endl;
} | [] | 743,698 | 743,699 | u564060397 | cpp |
p02945 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int A, B, sumsub, mul;
cin >> A >> B;
sumsub = (B > 0) ? (A + B) : (A - B);
cout << ((mul > sumsub) ? mul : sumsub) << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int A, B, sumsub, mul;
cin >> A >> B;
sumsub = (B > 0) ? (A + B) : (A - B);
mul = A * B;
cout << ((mul > sumsub) ? mul : sumsub) << endl;
return 0;
} | [
"assignment.add"
] | 743,700 | 743,701 | u205975249 | cpp |
p02945 | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define ALL(v) v.begin(), v... | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define ALL(v) v.begin(), v... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 743,710 | 743,711 | u703877026 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
array<int, 3> p{a + b, a - b, a * b};
cout << *max(p.begin(), p.end());
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
array<int, 3> p{a + b, a - b, a * b};
cout << *max_element(p.begin(), p.end()) << endl;
}
| [
"identifier.change",
"call.function.change",
"io.output.change",
"io.output.newline.add"
] | 743,717 | 743,718 | u918480160 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int a, b;
cout << a << b;
int max;
if (a + b > a - b)
max = a + b;
else
max = a - b;
if (max < a * b)
max = a * b;
cout << max;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int max;
if (a + b > a - b)
max = a + b;
else
max = a - b;
if (max < a * b)
max = a * b;
cout << max;
return 0;
} | [
"expression.operation.binary.change"
] | 743,739 | 743,740 | u234973476 | cpp |
p02945 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
cout << max({a + b, a - b, a * b}) << endl;
cout << ans;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
cout << max({a + b, a - b, a * b}) << endl;
return 0;
}
| [] | 743,750 | 743,751 | u443975466 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b, a * b);
ans = (ans, a - b);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b, a * b);
ans = max(ans, a - b);
cout << ans << endl;
} | [
"call.add"
] | 743,786 | 743,787 | u376859266 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
int a = A + B;
int b = A - B;
int c = A * B;
cout << max(a, b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
int a = A + B;
int b = A - B;
int c = A * B;
cout << max(max(a, b), c) << endl;
} | [
"call.add",
"call.arguments.add"
] | 743,796 | 743,797 | u610579155 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
// ในใใผในๅบๅใใฎๆดๆฐใฎๅ
ฅๅ
int a, b;
cin >> a >> b;
int x = a + b;
int y = a - b;
int z = a * b;
if (x < y) {
if (z < x) {
cout << z << endl;
} else {
cout << x << endl;
}
} else {
if (z < y) {
cout << z << endl;
} else ... | #include <iostream>
using namespace std;
int main() {
// ในใใผในๅบๅใใฎๆดๆฐใฎๅ
ฅๅ
int a, b;
cin >> a >> b;
int x = a + b;
int y = a - b;
int z = a * b;
if (x < y) {
if (z < y) {
cout << y << endl;
} else {
cout << z << endl;
}
} else {
if (z < x) {
cout << x << endl;
} else ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 743,800 | 743,801 | u188228787 | cpp |
p02945 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, s1, s2, s3;
cin >> a >> b;
s1 = a + b;
s2 = a - b;
s3 = a * b;
cout << max(max(s1, s3), s3);
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, s1, s2, s3;
cin >> a >> b;
s1 = a + b;
s2 = a - b;
s3 = a * b;
cout << max(max(s1, s2), s3);
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 743,816 | 743,817 | u818261158 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(a + b, a * b);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max({a + b, a * b, a - b});
} | [
"call.arguments.change"
] | 743,829 | 743,830 | u048764593 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int a, b, c;
a = A + B;
b = A - B;
c = A * B;
vector<int> vec(3);
vec[0] = a;
vec[1] = b;
vec[2] = c;
sort(vec.begin(), vec.end());
cout << vec[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int a, b, c;
a = A + B;
b = A - B;
c = A * B;
vector<int> vec(3);
vec[0] = a;
vec[1] = b;
vec[2] = c;
sort(vec.begin(), vec.end());
cout << vec[2] << endl;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 743,839 | 743,840 | u942085302 | cpp |
p02945 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int a, b, c;
a = A + B;
b = A - B;
c = A * B;
vector<int> vec;
vec[0] = a;
vec[1] = b;
vec[2] = c;
sort(vec.begin(), vec.end());
cout << vec[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int a, b, c;
a = A + B;
b = A - B;
c = A * B;
vector<int> vec(3);
vec[0] = a;
vec[1] = b;
vec[2] = c;
sort(vec.begin(), vec.end());
cout << vec[2] << endl;
} | [
"call.arguments.add",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 743,841 | 743,840 | u942085302 | cpp |
p02945 | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", a, b);
int c, d, e;
c = a + b;
d = a - b;
e = a * b;
if (c >= d && c >= e) {
printf("%d", c);
} else if (d > c && d >= e) {
printf("%d", d);
} else {
printf("%d", e);
}
return 0;
} | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
int c, d, e;
c = a + b;
d = a - b;
e = a * b;
if (c >= d && c >= e) {
printf("%d", c);
} else if (d > c && d >= e) {
printf("%d", d);
} else {
printf("%d", e);
}
return 0;
} | [
"expression.operation.unary.reference.add"
] | 743,846 | 743,847 | u328838382 | cpp |
p02945 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef int ll;
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define os... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef int ll;
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define os... | [] | 743,868 | 743,869 | u900937596 | cpp |
p02945 | // include
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numer... | // include
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numer... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 743,872 | 743,873 | u946378574 | cpp |
p02945 | #include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
if (a * b <= 0) {
if (0 < b) {
cout << a - b;
} else {
cout << a + b;
}
} else {
if (a == 1 || b == 1) {
cout << a + b;
} else {
cout << a * b;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
if (a * b <= 0) {
if (0 < b) {
cout << a + b;
} else {
cout << a - b;
}
} else {
if (a == 1 || b == 1) {
cout << a + b;
} else {
cout << a * b;
}
}
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 743,888 | 743,889 | u175232503 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.