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 |
|---|---|---|---|---|---|---|---|
p02957 | #include <iostream>
using namespace std;
int main() {
long int a, b;
cin >> a >> b;
long int c = a + b;
if (c % 2 == 0) {
cout << c << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
long int a, b;
cin >> a >> b;
long int c = a + b;
if (c % 2 == 0) {
cout << c / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | [
"expression.operation.binary.add"
] | 760,701 | 760,702 | u993074316 | cpp |
p02957 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsi... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsig... | [
"call.add",
"control_flow.branch.if.condition.change"
] | 760,717 | 760,718 | u868702169 | cpp |
p02957 | #include <iostream>
using namespace std;
int main() {
long long int a, b;
long long int c;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) % 2;
else
cout << "IMPOSSIBLE";
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int a, b;
long long int c;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2;
else
cout << "IMPOSSIBLE";
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 760,765 | 760,766 | u185011403 | cpp |
p02957 | #include <iostream>
using namespace std;
int main() {
long int a, b;
long long int c;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) % 2;
else
cout << "IMPOSSIBLE";
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int a, b;
long long int c;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2;
else
cout << "IMPOSSIBLE";
return 0;
} | [
"variable_declaration.type.widen.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 760,767 | 760,766 | u185011403 | cpp |
p02957 | #include <iostream>
int main() {
long A, B, temp;
std::cin >> A >> B;
if (A < B) {
temp = B;
B = A;
A = temp;
}
if ((A - B) % 2 == 1) {
std::cout << "IMPOSSIBLE" << std::endl;
} else {
long ans = (A - B) / 2;
std::cout << ans << std::endl;
}
}
| #include <iostream>
int main() {
long A, B, temp;
std::cin >> A >> B;
if (A < B) {
temp = B;
B = A;
A = temp;
}
if ((A - B) % 2 == 1) {
std::cout << "IMPOSSIBLE" << std::endl;
} else {
long ans = (A + B) / 2;
std::cout << ans << std::endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 760,971 | 760,972 | u425830382 | cpp |
p02957 | #include <iostream>
int main() {
long A, B, temp;
std::cin >> A >> B;
if (A < B) {
temp = B;
B = A;
A = temp;
}
if ((A - B) % 2 == 1) {
std::cout << "IMPOSSIBLE" << std::endl;
} else {
long ans = A - B;
std::cout << ans << std::endl;
}
}
| #include <iostream>
int main() {
long A, B, temp;
std::cin >> A >> B;
if (A < B) {
temp = B;
B = A;
A = temp;
}
if ((A - B) % 2 == 1) {
std::cout << "IMPOSSIBLE" << std::endl;
} else {
long ans = (A + B) / 2;
std::cout << ans << std::endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 760,973 | 760,972 | u425830382 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change"
] | 760,995 | 760,996 | u863279562 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change"
] | 760,997 | 760,996 | u863279562 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
double avg, flr;
cin >> a >> b;
avg = (a + (double)b) / 2;
flr = floor(avg);
// cout<<avg<<" "<<flr;
if (avg > flr)
cout << "IMPOSSIBLE";
else
cout << avg;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
double avg, flr;
cin >> a >> b;
avg = (a + (double)b) / 2;
flr = floor(avg);
// cout<<avg<<" "<<flr;
if (avg > flr)
cout << "IMPOSSIBLE";
else
cout << (long long int)avg;
return 0;
} | [
"type_conversion.add"
] | 761,002 | 761,003 | u805562306 | cpp |
p02957 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
long long int a, b;
cin >> a >> b;
if (a + b % 2 == 1) {
cout ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
long long int a, b;
cin >> a >> b;
if ((a + b) % 2 == 1) {
cou... | [
"control_flow.branch.if.condition.change"
] | 761,143 | 761,144 | u732502311 | cpp |
p02957 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a + b % 2 == 1) {
cout << "IMPOSS... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
long long int a, b;
cin >> a >> b;
if ((a + b) % 2 == 1) {
cou... | [
"control_flow.branch.if.condition.change"
] | 761,145 | 761,144 | u732502311 | cpp |
p02957 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
float tmp_K = (A + B) / 2.0;
if (tmp_K - ll(tmp_K) == 0)
cout <... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
double tmp_K = (A + B) / 2.0;
if (tmp_K - ll(tmp_K) == 0)
cout ... | [
"variable_declaration.type.primitive.change"
] | 761,276 | 761,277 | u438265890 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << a + b / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| [] | 761,293 | 761,294 | u044790318 | cpp |
p02957 | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | [
"control_flow.branch.if.condition.change"
] | 761,457 | 761,458 | u851831516 | cpp |
p02957 | #include <iostream>
using namespace std;
typedef long long ll;
ll a, b;
void solve() {
if (a & 1 == b & 1) {
cout << (a + b) / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
}
int main() {
cin >> a >> b;
solve();
} | #include <iostream>
using namespace std;
typedef long long ll;
ll a, b;
void solve() {
if ((a & 1) == (b & 1)) {
cout << (a + b) / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
}
int main() {
cin >> a >> b;
solve();
} | [
"control_flow.branch.if.condition.change"
] | 761,465 | 761,466 | u550178285 | cpp |
p02957 | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 3e5 + 3;
int cost[LIM + 3], d[LIM + 3];
ll INF = 1e18;
ll Ans = 0;
void solve(int l, int r) {
if (l >= r)
return;
int mid = (l + r) / 2;
vector<pair<int, ll>> V, W;
int m... | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 3e5 + 3;
int cost[LIM + 3], d[LIM + 3];
ll INF = 1e18;
ll Ans = 0;
void solve(int l, int r) {
if (l >= r)
return;
int mid = (l + r) / 2;
vector<pair<int, ll>> V, W;
int m... | [
"io.output.change"
] | 761,494 | 761,495 | u540045035 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
#define ALL(x) x.begin(), x.end()
#define X first
#define Y second
#define ACCEL ... | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
#define ALL(x) x.begin(), x.end()
#define X first
#define Y second
#define ACCEL ... | [
"control_flow.branch.if.condition.change"
] | 761,500 | 761,501 | u516708338 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (abs(a - b) % 2)
cout << -1;
else
cout << (a + b) / 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (abs(a - b) % 2)
cout << "IMPOSSIBLE";
else
cout << (a + b) / 2;
return 0;
} | [] | 761,644 | 761,645 | u122694091 | cpp |
p02957 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef pair<ul, ul> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
long A, B;
cin >> A >> B;
if (abs(A - B) % 2) {
cout << "IMPO... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef pair<ul, ul> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
long A, B;
cin >> A >> B;
if (abs(A - B) % 2) {
cout << "IMPO... | [
"literal.string.change",
"io.output.change"
] | 761,669 | 761,670 | u283779141 | cpp |
p02957 |
#include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if ((a - b) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
return 0;
} |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (abs(a - b) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
return 0;
} | [
"import.add",
"call.add",
"control_flow.branch.if.condition.change"
] | 761,687 | 761,688 | u289709148 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
if (abs(n - k) % 2 == 0) {
ll h = (abs(n - k)) / 2;
cout << abs(n - h) << "\n";
return 0;
} else {
cout << "IMPOSSIBLE"
<< "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
if (abs(n - k) % 2 == 0) {
ll h = (abs(n - k)) / 2;
cout << max(n, k) - h << "\n";
return 0;
} else {
cout << "IMPOSSIBLE"
<< "\n";
}
} | [
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.add",
"call.arguments.change"
] | 761,689 | 761,690 | u944168616 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
a += b;
if (a % 2)
cout << "IMPOSSIBLE" << endl;
else
cout << a + b / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
a += b;
if (a % 2)
cout << "IMPOSSIBLE" << endl;
else
cout << a / 2 << endl;
}
| [
"expression.operation.binary.remove"
] | 761,772 | 761,773 | u365625707 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
a += b;
if (a % 2)
cout << "IMPOSSIBLE" << endl;
else
cout << a + b / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
a += b;
if (a % 2)
cout << "IMPOSSIBLE" << endl;
else
cout << a / 2 << endl;
} | [
"expression.operation.binary.remove"
] | 761,772 | 761,774 | u365625707 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int a, b;
cin >> a >> b;
if (a + b % 2 == 0) {
cout << (a + b) / 2;
} else {
cout << "IMPOSSIBLE";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int a, b;
cin >> a >> b;
if ((a + b) % 2 == 0) {
cout << (a + b) / 2;
} else {
cout << "IMPOSSIBLE";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 761,784 | 761,785 | u832801719 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b;
cin >> a >> b;
if (a + b % 2 == 0) {
cout << (a + b) / 2;
} else {
cout << "IMPOSSIBLE";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int a, b;
cin >> a >> b;
if ((a + b) % 2 == 0) {
cout << (a + b) / 2;
} else {
cout << "IMPOSSIBLE";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 761,786 | 761,785 | u832801719 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
//... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
//... | [
"literal.string.change",
"io.output.change"
] | 761,803 | 761,804 | u711340028 | cpp |
p02957 | #include <iostream>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
long long int ans = (a + b) / 2;
if ((a + b) / 2 & 1 == 0) {
cout << "IMPOSSIBLE\n";
} else
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
long long int ans = (a + b) / 2;
if ((a + b) & 1 == 1) {
cout << "IMPOSSIBLE\n";
} else
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 761,807 | 761,808 | u812922761 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if ((a + b) / 2 == 1)
cout << "IMPOSSIBLE" << endl;
else
cout << (a + b) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if ((a + b) % 2 == 1)
cout << "IMPOSSIBLE" << endl;
else
cout << (a + b) / 2 << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 761,811 | 761,812 | u403798114 | cpp |
p02957 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | [
"control_flow.branch.if.condition.change"
] | 761,867 | 761,868 | u767543103 | cpp |
p02957 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 761,869 | 761,868 | u767543103 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll a, b;
cin >> a >> b;
if (a + b % 2 == 0) {
cout << a + b / 2;
} else
cout << "IMPOSSIBLE";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll a, b;
cin >> a >> b;
if ((a + b) % 2 == 0) {
cout << (a + b) / 2;
} else
cout << "IMPOSSIBLE";
} | [
"control_flow.branch.if.condition.change"
] | 761,872 | 761,873 | u687942248 | cpp |
p02957 | // OURL: https://atcoder.jp/contests/abc135/tasks/abc135_a
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define MAT1D(V, T, a) vector<T> V(a)
#define MAT2D(V... | // OURL: https://atcoder.jp/contests/abc135/tasks/abc135_a
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define MAT1D(V, T, a) vector<T> V(a)
#define MAT2D(V... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 761,936 | 761,937 | u259335077 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define N 400001
#define mod 1000000007
#define inf 1000000000
#define pp pair<ll, ll>
typedef long long int ll;
typedef long double ld;
#define MP make_pair
#define endl "\n"
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define N 400001
#define mod 1000000007
#define inf 1000000000
#define pp pair<ll, ll>
typedef long long int ll;
typedef long double ld;
#define MP make_pair
#define endl "\n"
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
#defin... | [
"control_flow.branch.if.condition.change"
] | 761,963 | 761,964 | u377572376 | cpp |
p02957 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a, b, ans2;
double ans1;
cin >> a >> b;
ans1 = (float)(a + b) / 2;
ans2 = (a + b) / 2;
if (ans1 == ans2)
cout << ans2;
else
cout << "IMPOSSIBLE" << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a, b, ans2;
double ans1;
cin >> a >> b;
ans1 = (double)(a + b) / 2;
ans2 = (a + b) / 2;
if (ans1 == ans2)
cout << ans2;
else
cout << "IMPOSSIBLE" << endl;
return 0;
} | [
"assignment.value.change",
"variable_declaration.type.primitive.change"
] | 761,972 | 761,973 | u887433623 | cpp |
p02957 | #include <bits/stdc++.h>
#define ll long int
using namespace std;
int main() {
ll a, b, ans2;
float ans1;
cin >> a >> b;
ans1 = (float)(a + b) / 2;
ans2 = (a + b) / 2;
if (ans1 == ans2)
cout << ans2;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a, b, ans2;
double ans1;
cin >> a >> b;
ans1 = (double)(a + b) / 2;
ans2 = (a + b) / 2;
if (ans1 == ans2)
cout << ans2;
else
cout << "IMPOSSIBLE" << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"assignment.value.change"
] | 761,974 | 761,973 | u887433623 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if ((a - b) % 2 == 1)
cout << "IMPOSSIBLE" << endl;
else {
cout << (a + b) / 2 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if ((abs(a - b)) % 2 == 1)
cout << "IMPOSSIBLE" << endl;
else {
cout << (a + b) / 2 << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 762,004 | 762,005 | u280114218 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define se set<ll>
#define vec vector<ll>
#define inf 10000000000000000
bool mark[100005];
vec adj[100005];
ll counter;
int main() {
#ifdef APNA_IO
freopen("input.txt", "r", stdin);
freop... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define se set<ll>
#define vec vector<ll>
#define inf 10000000000000000
bool mark[100005];
vec adj[100005];
ll counter;
int main() {
#ifdef APNA_IO
freopen("input.txt", "r", stdin);
freop... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 762,038 | 762,039 | u511137896 | cpp |
p02957 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 762,067 | 762,068 | u282228874 | cpp |
p02957 | #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... | [
"control_flow.branch.if.condition.change"
] | 762,122 | 762,123 | u335104842 | cpp |
p02957 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | [
"expression.operation.binary.remove"
] | 762,169 | 762,170 | u135248164 | cpp |
p02957 | #include <iostream>
using namespace std;
long long A, B;
int main() {
cin >> A >> B;
if ((A - B) % 2 == 1) {
cout << "IMPOSSIBLE";
} else {
cout << (A + B) / 2;
}
return 0;
}
| #include <iostream>
using namespace std;
long long A, B;
int main() {
cin >> A >> B;
if ((A + B) % 2 == 1) {
cout << "IMPOSSIBLE";
} else {
cout << (A + B) / 2;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 762,173 | 762,174 | u428229036 | cpp |
p02957 | #include <algorithm> // sort
#include <cstring>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
using Graph = vector<vector<ll>>; // グラフ型
int main() {
... | #include <algorithm> // sort
#include <cstring>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
using Graph = vector<vector<ll>>; // グラフ型
int main() {
... | [
"control_flow.branch.if.condition.change"
] | 762,179 | 762,180 | u485731913 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000007
#define int long long
using namespace std;
using P = pair<int, int>;
using ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000007
#define int long long
using namespace std;
using P = pair<int, int>;
using ... | [
"expression.operation.binary.remove"
] | 762,188 | 762,189 | u033620890 | cpp |
p02957 | #include <bits/stdc++.h>
#define filein freopen("in.txt", "r", stdin)
#define fileout freopen("out.txt", "w", stdout)
#define dbg(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
const int maxn = 0;
int main() {
ll a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
ll d = a + b;
... | #include <bits/stdc++.h>
#define filein freopen("in.txt", "r", stdin)
#define fileout freopen("out.txt", "w", stdout)
#define dbg(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
const int maxn = 0;
int main() {
ll a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
ll d = a + b;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,215 | 762,216 | u763749071 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b;
int main() {
cin >> a >> b;
ll min = (a < b) ? a : b;
ll max = (a < b) ? b : a;
ll dif = max - min;
if (dif % 2) {
cout << min + dif / 2 << endl;
return 0;
} else {
cout << "impossible" << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b;
int main() {
cin >> a >> b;
ll min = (a < b) ? a : b;
ll max = (a < b) ? b : a;
ll dif = max - min;
if (!(dif % 2)) {
cout << min + dif / 2 << endl;
return 0;
} else {
cout << "IMPOSSIBLE" << endl;
return 0;
}
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,217 | 762,218 | u877476774 | cpp |
p02957 | #include <iostream>
using namespace std;
#define ll long long int
int main() {
ll a, b;
cin >> a >> b;
ll sum = a + b;
if (sum % 2 == 0)
cout << "IMPOSSIBLE";
else
cout << sum / 2;
} | #include <iostream>
using namespace std;
#define ll long long int
int main() {
ll a, b;
cin >> a >> b;
ll sum = a + b;
if (sum % 2 == 1)
cout << "IMPOSSIBLE";
else
cout << sum / 2;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 762,219 | 762,220 | u131565555 | cpp |
p02957 | #include "bits/stdc++.h"
using namespace std;
#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 ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size)
#define MOD 1000000007
const long long mod = 1e9 + 7;
typedef v... | #include "bits/stdc++.h"
using namespace std;
#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 ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size)
#define MOD 1000000007
const long long mod = 1e9 + 7;
typedef v... | [
"expression.operation.binary.remove"
] | 762,225 | 762,226 | u718774863 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
double c;
c = (a + b) / 2;
if (c == floor(c))
cout << c << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double c;
c = (a + b) / 2;
if (c == floor(c))
cout << int(c) << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 762,243 | 762,244 | u848783748 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c;
c = (a + b) / 2;
if (c == floor(c))
cout << c << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double c;
c = (a + b) / 2;
if (c == floor(c))
cout << int(c) << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 762,245 | 762,244 | u848783748 | cpp |
p02957 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a - b) % 2 != 0)
cout << "IMPOSSIBLE" << endl;
else
cout << abs(a - b) / 2 << endl;
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if ((a - b) % 2 != 0)
cout << "IMPOSSIBLE" << endl;
else
cout << (a + b) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 762,253 | 762,254 | u937545465 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long double a, b;
cin >> a >> b;
if (((a + b) / 2) == (floor((a + b) / 2)))
cout << (long long)((a + b) / 2);
else
cout << "Impossible";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long double a, b;
cin >> a >> b;
if (((a + b) / 2) == (floor((a + b) / 2)))
cout << (long long)((a + b) / 2);
else
cout << "IMPOSSIBLE";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,259 | 762,260 | u049931175 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
if (((a + b) / 2) == (floor((a + b) / 2)))
cout << (int)((a + b) / 2);
else
cout << "Impossible";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long double a, b;
cin >> a >> b;
if (((a + b) / 2) == (floor((a + b) / 2)))
cout << (long long)((a + b) / 2);
else
cout << "IMPOSSIBLE";
return 0;
}
| [
"variable_declaration.type.widen.change",
"io.output.change",
"literal.string.change",
"literal.string.case.change"
] | 762,261 | 762,260 | u049931175 | cpp |
p02957 | /*==============================================*\
ID: shahidul_brur
Name: Md. Shahidul Islam
Study: CSE, BRUR
Address: Rangpur, Bangladesh
mail: shahidul.cse.brur@gmail.com
FB : fb.com/shahidul.brur
Blog: shahidul-brur.blogspot.com(in Bengali),
shahidul-brur-en.blogspot.com(in English)
... | /*==============================================*\
ID: shahidul_brur
Name: Md. Shahidul Islam
Study: CSE, BRUR
Address: Rangpur, Bangladesh
mail: shahidul.cse.brur@gmail.com
FB : fb.com/shahidul.brur
Blog: shahidul-brur.blogspot.com(in Bengali),
shahidul-brur-en.blogspot.com(in English)
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,270 | 762,271 | u094186324 | cpp |
p02957 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll a, b, ans;
cin >> a >> b;
ans = (a + b) / 2;
if ((a + b) % 2 == 0)
cout << ans;
else
cout << "-1";
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll a, b, ans;
cin >> a >> b;
ans = (a + b) / 2;
if ((a + b) % 2 == 0)
cout << ans;
else
cout << "IMPOSSIBLE";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 762,274 | 762,275 | u853929315 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fip \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define reptUsual(b) for (i = 0; i < b; ++i)
#define reptArIn(i, a, b, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fip \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define reptUsual(b) for (i = 0; i < b; ++i)
#define reptArIn(i, a, b, ... | [
"expression.operation.binary.remove"
] | 762,276 | 762,277 | u337165128 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
float k = (a + b) / float(2);
if (ceil(k) == floor(k)) {
cout << int(k) << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
double k = (a + b) / double(2);
if (ceil(k) == floor(k)) {
cout << int(k) << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"call.function.change"
] | 762,282 | 762,283 | u679245300 | cpp |
p02957 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, A;
cin >> N >> A;
if ((A + N) % 2 == 0)
cout << (A * N) / 2;
else
cout ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, A;
cin >> N >> A;
if ((A + N) % 2 == 0)
cout << (A + N) / 2;
else
cout ... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 762,286 | 762,287 | u444349080 | cpp |
p02957 | #include <algorithm>
#include <assert.h>
#include <climits>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, s, n) for (int i = s, i##_len = (n); i < i##_len; ++i)
#define al... | #include <algorithm>
#include <assert.h>
#include <climits>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, s, n) for (int i = s, i##_len = (n); i < i##_len; ++i)
#define al... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 762,288 | 762,289 | u535347736 | cpp |
p02957 | #include <algorithm>
#include <assert.h>
#include <climits>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, s, n) for (int i = s, i##_len = (n); i < i##_len; ++i)
#define al... | #include <algorithm>
#include <assert.h>
#include <climits>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, s, n) for (int i = s, i##_len = (n); i < i##_len; ++i)
#define al... | [
"variable_declaration.type.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 762,290 | 762,289 | u535347736 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (... | [
"call.add",
"control_flow.branch.if.condition.change"
] | 762,293 | 762,294 | u242679311 | cpp |
p02957 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#endif
#define FILE_IO freopen("input.txt",... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#endif
#define FILE_IO freopen("input.txt",... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 762,297 | 762,298 | u572138437 | cpp |
p02957 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begi... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end() // begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++) // repeat
#define repr(i, begi... | [
"type_conversion.add"
] | 762,308 | 762,309 | u153390822 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
ll a, b;
ll ans;
int main(void) {
// Here your code !
scanf("%lld %lld", &a, &b);
if ((a - b) % 2 == 1) {
printf("IMPOSSIBLE\n");
return 0;
}
ans = min(a, b) + ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
ll a, b;
ll ans;
int main(void) {
// Here your code !
scanf("%lld %lld", &a, &b);
if (abs(a - b) % 2 == 1) {
printf("IMPOSSIBLE\n");
return 0;
}
ans = min(a, b)... | [
"call.add",
"control_flow.branch.if.condition.change"
] | 762,341 | 762,342 | u497422208 | cpp |
p02957 | #include <iostream>
using namespace std;
int main() {
long int a, b;
cin >> a >> b;
if (a == b)
cout << a;
else {
int s = (a + b) / 2;
if (abs(a - s) == abs(b - s))
cout << abs(a - s);
else
cout << "IMPOSSIBLE";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
long int a, b;
cin >> a >> b;
if (a == b)
cout << a;
else {
int s = (a + b) / 2;
if (abs(a - s) == abs(b - s))
cout << s;
else
cout << "IMPOSSIBLE";
}
return 0;
} | [
"call.remove",
"call.arguments.change"
] | 762,345 | 762,346 | u964142402 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
long long a, b;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBL" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
long long a, b;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 762,387 | 762,388 | u697325966 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int a, b;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBL" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
long long a, b;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"io.output.change"
] | 762,389 | 762,388 | u697325966 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
if (A + B % 2 == 0) {
cout << ((A + B) / 2) << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
if ((A + B) % 2 == 0) {
cout << ((A + B) / 2) << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 762,398 | 762,399 | u016092854 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
long long a, b;
int main() {
cin >> a >> b;
if (a + b % 2 == 1)
cout << "IMPOSSIBLE";
else
cout << (a + b) / 2;
} | #include <bits/stdc++.h>
using namespace std;
long long a, b;
int main() {
cin >> a >> b;
if ((a + b) % 2 == 1)
cout << "IMPOSSIBLE";
else
cout << (a + b) / 2;
} | [
"control_flow.branch.if.condition.change"
] | 762,409 | 762,410 | u574365411 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a + b % 2 == 1)
cout << "IMPOSSIBLE";
else
cout << (a + b) / 2;
} | #include <bits/stdc++.h>
using namespace std;
long long a, b;
int main() {
cin >> a >> b;
if ((a + b) % 2 == 1)
cout << "IMPOSSIBLE";
else
cout << (a + b) / 2;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 762,411 | 762,410 | u574365411 | cpp |
p02957 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
if (abs(A + B) % 2 == 0) {
cout << abs(A + B);
} else {
cout << "IMPOSSIBLE";
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
if ((A + B) % 2 == 0) {
cout << (A + B) / 2;
} else {
cout << "IMPOSSIBLE";
}
} | [
"control_flow.branch.if.condition.change"
] | 762,429 | 762,430 | u317806971 | cpp |
p02957 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (abs(A + B) % 2 == 0) {
cout << abs(A - B);
} else {
cout << "IMPOSSIBLE";
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
if ((A + B) % 2 == 0) {
cout << (A + B) / 2;
} else {
cout << "IMPOSSIBLE";
}
} | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 762,431 | 762,430 | u317806971 | cpp |
p02957 | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 762,439 | 762,440 | u468262978 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 762,446 | 762,447 | u243196226 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
float a, b;
cin >> a >> b;
float x = (a + b) / 2;
int y = x;
if (y == x) {
cout << y << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double x = (a + b) / 2;
int y = x;
if (y == x) {
cout << y << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | [
"variable_declaration.type.primitive.change"
] | 762,448 | 762,449 | u197699574 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
float a, b;
cin >> a >> b;
float x = (a + b) / 2;
int y = x;
if (y == x) {
cout << x << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double x = (a + b) / 2;
int y = x;
if (y == x) {
cout << y << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | [
"variable_declaration.type.primitive.change",
"identifier.change",
"io.output.change"
] | 762,450 | 762,449 | u197699574 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define MOD 1000000007
#define trace1(x) cout << #x << ": " << x << endl;
#define trace2(x, y) ... | #include <bits/stdc++.h>
using namespace std;
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define MOD 1000000007
#define trace1(x) cout << #x << ": " << x << endl;
#define trace2(x, y) ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 762,453 | 762,454 | u249508455 | cpp |
p02957 | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n... | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n... | [
"control_flow.branch.if.condition.change"
] | 762,470 | 762,471 | u240031669 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define gt(n) scanf("%d", &n)
#define gtll(n) scanf("%ld", &n)
#define out(n) printf("%d", n)
#define outll(n) printf("%ld", n)
#define loop(n) for (int i = 0; i < n; i++)
#define MAXX 1001
#define mem(x, y) memset(x, y, sizeof(x))
#define loop1(n) fo... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define gt(n) scanf("%d", &n)
#define gtll(n) scanf("%ld", &n)
#define out(n) printf("%d", n)
#define outll(n) printf("%ld", n)
#define loop(n) for (int i = 0; i < n; i++)
#define MAXX 1001
#define mem(x, y) memset(x, y, sizeof(x))
#define loop1(n) fo... | [
"expression.operation.binary.remove"
] | 762,476 | 762,477 | u757105418 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long a, b;
scanf("%d %d", &a, &b);
// cout<<a<<b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE\n";
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long a, b;
scanf("%lld %lld", &a, &b);
// cout<<a<<b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE\n";
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 762,503 | 762,504 | u061597928 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long a, b;
scanf("%d %d", &a, &b);
// cout<<a<<b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2;
else
cout << "IMPOSSIBLE\n";
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long a, b;
scanf("%lld %lld", &a, &b);
// cout<<a<<b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE\n";
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.newline.add"
] | 762,505 | 762,504 | u061597928 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 762,506 | 762,507 | u962104148 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
typedef long long ll;
const ll longinf = 1LL << 60;
using namespace std;
ll a, b;
int main() {
cin >> a >> b;
if ((a + b % 2) == 1)
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
typedef long long ll;
const ll longinf = 1LL << 60;
using namespace std;
ll a, b;
int main() {
cin >> a >> b;
if ((a + b) % 2 == 1)
... | [
"control_flow.branch.if.condition.change"
] | 762,508 | 762,509 | u806661586 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
int main() {
LL a, b;
cin >> a >> b;
LL c, d;
c = max(a, b);
d = min(a, b);
if ((c - ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
int main() {
LL a, b;
cin >> a >> b;
LL c, d;
c = max(a, b);
d = min(a, b);
if ((c - ... | [
"expression.operation.binary.add"
] | 762,526 | 762,527 | u400497478 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 762,534 | 762,535 | u522598953 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, ans;
cin >> a >> b;
if (a > b) {
long long i = a - b;
if (i % 2 == 0) {
ans = i / 2 + b;
cout << ans;
} else {
cout << "IMPOSSIBLE";
}
} else {
long long i = b - a;
if (i % 2 == 0) {
ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, ans;
cin >> a >> b;
if (a > b) {
long long i = a - b;
if (i % 2 == 0) {
ans = i / 2 + b;
cout << ans;
} else {
cout << "IMPOSSIBLE";
}
} else {
long long i = b - a;
if (i % 2 == 0) {
ans = ... | [] | 762,540 | 762,541 | u664761370 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typed... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typed... | [
"control_flow.branch.if.condition.change"
] | 762,544 | 762,545 | u317711717 | cpp |
p02957 | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize("no-stack-protector")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll inf = 1e18;
const ll mod1 = 1e9... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize("no-stack-protector")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll inf = 1e18;
const ll mod1 = 1e9... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,552 | 762,553 | u606919221 | cpp |
p02957 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
int main() {
ll a, b;
cin >> a >> b;
if (a + b % 2 == 0) {
cout << (a + b) / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
int main() {
ll a, b;
cin >> a >> b;
if ((a + b) % 2 == 0) {
cout << (a + b) / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 762,568 | 762,569 | u201316840 | cpp |
p02957 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using P = std::pair<ll, ll... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using P = std::pair<ll, ll... | [] | 762,573 | 762,574 | u080318287 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double ans = (a + b) / 2;
if (floor(ans) == ceil(ans))
cout << ans << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double ans = (a + b) / 2;
if (floor(ans) == ceil(ans))
cout << (long long)ans << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| [
"type_conversion.add"
] | 762,575 | 762,576 | u008729541 | cpp |
p02957 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#define fastio \
io... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#define fastio \
io... | [] | 762,579 | 762,580 | u423846157 | cpp |
p02957 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#in... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#in... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 762,596 | 762,597 | u600880717 | cpp |
p02957 | /*
When you walk through a storm
Hold your head up high
And don't be afraid of the dark
At the end of the storm
There's a golden sky
And the sweet silver song
of the lark
Walk on, through the wind
Walk on, through the rain
Though your dreams be tossed
and blown
Walk on, walk on
With hope in your heart
And you'll never ... | /*
When you walk through a storm
Hold your head up high
And don't be afraid of the dark
At the end of the storm
There's a golden sky
And the sweet silver song
of the lark
Walk on, through the wind
Walk on, through the rain
Though your dreams be tossed
and blown
Walk on, walk on
With hope in your heart
And you'll never ... | [
"control_flow.branch.if.condition.change"
] | 762,602 | 762,603 | u102804698 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define F first
#define ... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define F first
#define ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,608 | 762,609 | u130804410 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, e;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> a >> b;
if ((b - a) % 2 == 1) {
cout << "IMPOSSIBLE";
return 0;
}
cout << (a + b) / 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, e;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> a >> b;
if (abs(b - a) % 2 == 1) {
cout << "IMPOSSIBLE";
return 0;
}
cout << (a + b) / 2;
return 0;
} | [
"call.add",
"control_flow.branch.if.condition.change"
] | 762,610 | 762,611 | u914890086 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t, n, m, i, j, k, sum = 0;
int a, b;
cin >> a, b;
if ((a + b) % 2 == 0) {
cout << (a + b) / 2 << '\n';
} else
cout << "IMPOSSIBLE" << '\n';
retur... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t, n, m, i, j, k, sum = 0;
int a, b;
cin >> a >> b;
if ((a + b) % 2 == 0) {
cout << (a + b) / 2 << '\n';
} else
cout << "IMPOSSIBLE" << '\n';
ret... | [] | 762,618 | 762,619 | u400838283 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
signed main() {
int A, B;
cin >> A >> B;
if ((A - B) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} els... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
#define int long long
using namespace std;
signed main() {
int A, B;
cin >> A >> B;
if ((A + B) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} els... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 762,622 | 762,623 | u322714721 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
long long a, b;
cin >> a >> b;
if ((a + b) % 2 == 1)
puts("Impossible");
else
cout << (a + b) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
long long a, b;
cin >> a >> b;
if ((a + b) % 2 == 1)
puts("IMPOSSIBLE");
else
cout << (a + b) / 2 << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 762,636 | 762,637 | u365513379 | cpp |
p02957 | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | [
"control_flow.branch.if.condition.change"
] | 762,653 | 762,654 | u150376070 | cpp |
p02957 | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 762,657 | 762,658 | u487476769 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.