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 unsigned long long ull;
constexpr long long MOD = 1e9 + 7;
constexpr long long MAX = 1000000;
// long long MOD = 998244353;
constexpr ll INF = 1e17;
constexpr double PI = 3.141592653589793;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
if ((b - a) % 2ll == 1) {
cout << "IMPOSSIBLE"
<< "\n";
return 0;
}
if ((a - b) > 0) {
swap(a, b);
}
ll ans = (b - a) / 2ll + a;
cout << ans << "\n";
return 0;
}
| #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 unsigned long long ull;
constexpr long long MOD = 1e9 + 7;
constexpr long long MAX = 1000000;
// long long MOD = 998244353;
constexpr ll INF = 1e17;
constexpr double PI = 3.141592653589793;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
if (abs(b - a) % 2ll == 1) {
cout << "IMPOSSIBLE"
<< "\n";
return 0;
}
if ((a - b) > 0) {
swap(a, b);
}
ll ans = (b - a) / 2ll + a;
cout << ans << "\n";
return 0;
}
| [
"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
const ll INF = 1e18;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
ll 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;
#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
const ll INF = 1e18;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
ll 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",
"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
const ll INF = 1e18;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
ll 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;
#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
const ll INF = 1e18;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
ll 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",
"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 << "IMPOSSIBLE\n";
} else {
cout << (a + b) / 2 << endl;
}
return 0;
} | #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 << "IMPOSSIBLE\n";
} else {
cout << (a + b) / 2 << endl;
}
return 0;
} | [
"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 << "IMPOSSIBLE\n";
} else {
cout << (a + b) / 2 << endl;
}
return 0;
} | #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 << "IMPOSSIBLE\n";
} else {
cout << (a + b) / 2 << endl;
}
return 0;
} | [
"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 << ll(tmp_K) << endl;
else
cout << "IMPOSSIBLE" << endl;
// system("pause");
return 0;
} | #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 << ll(tmp_K) << endl;
else
cout << "IMPOSSIBLE" << endl;
// system("pause");
return 0;
} | [
"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/ajinkya/Desktop/input.txt", "r", stdin); \
freopen("/home/ajinkya/Desktop/output.txt", "w", stdout);
#define ll long long
#define ull unsigned long long
#define FI(i, a, n) for (int i = a; i <= n; i++)
#define RFI(i, n, a) for (int i = n; i >= a; i--)
#define FLL(i, a, n) for (ll i = a; i <= n; i++)
#define RFLL(i, n, a) for (ll i = n; i >= a; i--)
#define vi vector<int>
#define vll vector<ll>
#define all(v) v.begin(), v.end()
#define pll pair<ll, ll>
#define pi pair<int, int>
#define GCD(a, b) __gcd(a, b)
#define MP make_pair
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define debug(x) cout << x << endl
#define MOD 1000000007
#define INF LLONG_MAX
#define PI 3.14159265359
using namespace std;
int main() {
fastio
// SUBL
ll a,
b;
cin >> a >> b;
if ((a + b) >> 1)
cout << "IMPOSSIBLE";
else
cout << (a + b) / 2;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/ajinkya/Desktop/input.txt", "r", stdin); \
freopen("/home/ajinkya/Desktop/output.txt", "w", stdout);
#define ll long long
#define ull unsigned long long
#define FI(i, a, n) for (int i = a; i <= n; i++)
#define RFI(i, n, a) for (int i = n; i >= a; i--)
#define FLL(i, a, n) for (ll i = a; i <= n; i++)
#define RFLL(i, n, a) for (ll i = n; i >= a; i--)
#define vi vector<int>
#define vll vector<ll>
#define all(v) v.begin(), v.end()
#define pll pair<ll, ll>
#define pi pair<int, int>
#define GCD(a, b) __gcd(a, b)
#define MP make_pair
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define debug(x) cout << x << endl
#define MOD 1000000007
#define INF LLONG_MAX
#define PI 3.14159265359
using namespace std;
int main() {
fastio
// SUBL
ll a,
b;
cin >> a >> b;
if ((a + b) & 1)
cout << "IMPOSSIBLE";
else
cout << (a + b) / 2;
return 0;
} | [
"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 mx = 0;
ll cur = 0;
for (int i = mid + 1; i <= r; i++) {
cur += cost[i];
if (abs(d[i] - d[i - 1]) > mx)
mx = abs(d[i] - d[i - 1]), V.push_back(mp(mx, cur));
else
V[V.size() - 1].S = min(V.back().S, cur);
}
for (int i = 1; i < V.size(); i++)
V[i].S = min(V[i].S, V[i - 1].S);
mx = 0, cur = cost[mid];
W.push_back(mp(0, cur));
for (int i = mid - 1; i >= l; i--) {
cur += cost[i];
if (abs(d[i + 1] - d[i]) > mx)
mx = abs(d[i + 1] - d[i]), W.push_back(mp(mx, cur));
else
W[W.size() - 1].S = min(W.back().S, cur);
int ind = upper_bound(V.begin(), V.end(), mp(mx, 0ll)) - V.begin();
ind--;
if (ind < 0)
continue;
Ans = min(Ans, cur + 1ll * mx * mx + V[ind].S);
}
for (int i = 1; i < W.size(); i++)
W[i].S = min(W[i].S, W[i - 1].S);
mx = 0, cur = 0;
for (int i = mid + 1; i <= r; i++) {
cur += cost[i];
mx = max(mx, abs(d[i] - d[i - 1]));
int ind = upper_bound(W.begin(), W.end(), mp(mx, 0ll)) - W.begin();
ind--;
if (ind < 0)
continue;
Ans = min(Ans, cur + 1ll * mx * mx + W[ind].S);
}
solve(l, mid);
solve(mid + 1, r);
}
int main() {
long long a, b;
cin >> a >> b;
double mid = (a + b) / 2.0;
if (int(mid) == mid)
cout << mid << endl;
else
puts("IMPOSSIBLE");
} | #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 mx = 0;
ll cur = 0;
for (int i = mid + 1; i <= r; i++) {
cur += cost[i];
if (abs(d[i] - d[i - 1]) > mx)
mx = abs(d[i] - d[i - 1]), V.push_back(mp(mx, cur));
else
V[V.size() - 1].S = min(V.back().S, cur);
}
for (int i = 1; i < V.size(); i++)
V[i].S = min(V[i].S, V[i - 1].S);
mx = 0, cur = cost[mid];
W.push_back(mp(0, cur));
for (int i = mid - 1; i >= l; i--) {
cur += cost[i];
if (abs(d[i + 1] - d[i]) > mx)
mx = abs(d[i + 1] - d[i]), W.push_back(mp(mx, cur));
else
W[W.size() - 1].S = min(W.back().S, cur);
int ind = upper_bound(V.begin(), V.end(), mp(mx, 0ll)) - V.begin();
ind--;
if (ind < 0)
continue;
Ans = min(Ans, cur + 1ll * mx * mx + V[ind].S);
}
for (int i = 1; i < W.size(); i++)
W[i].S = min(W[i].S, W[i - 1].S);
mx = 0, cur = 0;
for (int i = mid + 1; i <= r; i++) {
cur += cost[i];
mx = max(mx, abs(d[i] - d[i - 1]));
int ind = upper_bound(W.begin(), W.end(), mp(mx, 0ll)) - W.begin();
ind--;
if (ind < 0)
continue;
Ans = min(Ans, cur + 1ll * mx * mx + W[ind].S);
}
solve(l, mid);
solve(mid + 1, r);
}
int main() {
long long a, b;
cin >> a >> b;
double mid = (a + b) / 2.0;
if (int(mid) == mid)
cout << fixed << (int)mid << endl;
else
puts("IMPOSSIBLE");
} | [
"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 \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef pair<pll, lli> p3l;
typedef vector<int> vcI;
typedef vector<lli> vcL;
typedef vector<pii> vPI;
typedef vector<pll> vPL;
typedef vector<p3l> v3L;
typedef vector<vcL> vvL;
// typedef priority_queue<T> prior_S<T>;
// typedef priority_queue< T, vector<T>, greater<T> > prior_B<T>;
const double PI = 3.141592653589793;
const lli I_MAX = 1LL << 60;
lli mod = 1000000007;
/// templates ///
const lli maxN = 2E5;
vcL inv(maxN + 5, 1);
vcL fac(maxN + 5, 1);
void ADD(lli &x, lli y) {
x += y;
if (x >= mod)
x -= mod;
if (x < 0)
x += mod;
}
void MUL(lli &x, lli y) {
x *= y;
x = (x % mod + mod) % mod;
}
lli mypow(lli b, lli e) {
lli ans = 1;
while (e) {
if (e & 1)
MUL(ans, b);
MUL(b, b);
e >>= 1;
}
return ans;
}
lli modinv(lli n) { return mypow(n, mod - 2); }
void calcInv(lli n) {
for (int i = 2; i <= n; ++i) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
}
}
void calcFac(lli n) {
for (int i = 2; i <= n; ++i) {
fac[i] = fac[i - 1] * i % mod;
}
}
lli cm(lli a, lli b) {
lli ans = 1;
if (a < b)
return 0;
MUL(ans, inv[fac[a - b]]);
MUL(ans, inv[fac[b]]);
MUL(ans, fac[a]);
return ans;
}
lli Lucas(lli n, lli m) {
if (m == 0)
return 1;
return cm(n % mod, m % mod) * Lucas(n / mod, m / mod) % mod;
}
lli doLucas(lli n, lli m) {
calcInv(mod);
calcFac(mod);
return Lucas(n, m);
}
/// coding area ///
const lli maxn = 1E5;
void precal() { return; }
void solve() {
lli a, b;
cin >> a >> b;
if (a + b % 2 == 1)
cout << "IMPOSSIBLE\n";
else
cout << (a + b) / 2 << '\n';
}
int main() {
precal();
int t = 1;
#ifdef LOCAL
t = INT_MAX;
#else
ACCEL;
#endif
// cin >> t;
for (int i = 1; i <= t; ++i) {
// printf("Case #%d: ", i );
solve();
}
return 0;
}
| #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 \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef pair<pll, lli> p3l;
typedef vector<int> vcI;
typedef vector<lli> vcL;
typedef vector<pii> vPI;
typedef vector<pll> vPL;
typedef vector<p3l> v3L;
typedef vector<vcL> vvL;
// typedef priority_queue<T> prior_S<T>;
// typedef priority_queue< T, vector<T>, greater<T> > prior_B<T>;
const double PI = 3.141592653589793;
const lli I_MAX = 1LL << 60;
lli mod = 1000000007;
/// templates ///
const lli maxN = 2E5;
vcL inv(maxN + 5, 1);
vcL fac(maxN + 5, 1);
void ADD(lli &x, lli y) {
x += y;
if (x >= mod)
x -= mod;
if (x < 0)
x += mod;
}
void MUL(lli &x, lli y) {
x *= y;
x = (x % mod + mod) % mod;
}
lli mypow(lli b, lli e) {
lli ans = 1;
while (e) {
if (e & 1)
MUL(ans, b);
MUL(b, b);
e >>= 1;
}
return ans;
}
lli modinv(lli n) { return mypow(n, mod - 2); }
void calcInv(lli n) {
for (int i = 2; i <= n; ++i) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
}
}
void calcFac(lli n) {
for (int i = 2; i <= n; ++i) {
fac[i] = fac[i - 1] * i % mod;
}
}
lli cm(lli a, lli b) {
lli ans = 1;
if (a < b)
return 0;
MUL(ans, inv[fac[a - b]]);
MUL(ans, inv[fac[b]]);
MUL(ans, fac[a]);
return ans;
}
lli Lucas(lli n, lli m) {
if (m == 0)
return 1;
return cm(n % mod, m % mod) * Lucas(n / mod, m / mod) % mod;
}
lli doLucas(lli n, lli m) {
calcInv(mod);
calcFac(mod);
return Lucas(n, m);
}
/// coding area ///
const lli maxn = 1E5;
void precal() { return; }
void solve() {
lli a, b;
cin >> a >> b;
if ((a + b) % 2 == 1)
cout << "IMPOSSIBLE\n";
else
cout << (a + b) / 2 << '\n';
}
int main() {
precal();
int t = 1;
#ifdef LOCAL
t = INT_MAX;
#else
ACCEL;
#endif
// cin >> t;
for (int i = 1; i <= t; ++i) {
// printf("Case #%d: ", i );
solve();
}
return 0;
}
| [
"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 << "IMPOSSIBLEW" << endl;
} else {
cout << (A + B) / 2 << endl;
}
} | #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 << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
} | [
"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;
// cout << fixed << setprecision(10);
int main() {
ll A, B;
cin >> A >> B;
cout << ((A + B) % 2 == 0 ? to_string((A + B) / 2) : "IMPPOSIBLE") << endl;
return 0;
} | #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;
// cout << fixed << setprecision(10);
int main() {
ll A, B;
cin >> A >> B;
cout << ((A + B) % 2 == 0 ? to_string((A + B) / 2) : "IMPOSSIBLE") << endl;
return 0;
} | [
"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 namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
const ll INF = 1e9;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const ll MAX_N = 3000010;
int main(void) {
ll A, B;
cin >> A >> B;
if (A + B % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
return 0;
} | #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 namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
const ll INF = 1e9;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const ll MAX_N = 3000010;
int main(void) {
ll A, B;
cin >> A >> B;
if ((A + B) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
return 0;
} | [
"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 namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
const ll INF = 1e9;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const ll MAX_N = 3000010;
int main(void) {
ll A, B;
cin >> A >> B;
if (A + B % 2 != 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
return 0;
} | #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 namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
const ll INF = 1e9;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const ll MAX_N = 3000010;
int main(void) {
ll A, B;
cin >> A >> B;
if ((A + B) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
return 0;
} | [
"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, T, a, b) vector<vector<T>> V(a, vector<T>(b))
#define MAT3D(V, T, a, b, c) \
vector<vector<vector<T>>> V(a, vector<vector<T>>(b, vector<T>(c)))
// http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool>::reference b) { return to_string(bool(b)); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A> string to_string(vector<vector<A>> v) {
string res;
for (const auto &x : v) {
res += "\n ";
res += to_string(x);
}
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) \
cerr << "[L" << to_string(__LINE__) << ":" << #__VA_ARGS__ << "]:", \
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll a, b;
cin >> a >> b;
if (abs(a - b) % 2 == 0) {
cout << (a - b) / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
}
| // 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, T, a, b) vector<vector<T>> V(a, vector<T>(b))
#define MAT3D(V, T, a, b, c) \
vector<vector<vector<T>>> V(a, vector<vector<T>>(b, vector<T>(c)))
// http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool>::reference b) { return to_string(bool(b)); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A> string to_string(vector<vector<A>> v) {
string res;
for (const auto &x : v) {
res += "\n ";
res += to_string(x);
}
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) \
cerr << "[L" << to_string(__LINE__) << ":" << #__VA_ARGS__ << "]:", \
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll 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",
"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++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define repb(i, n) for (ll i = 1; i < n - 1; i++)
void fastIO(void);
void decimal(int);
ll modmulti(ll, ll, ll);
ll modadd(ll, ll, ll);
ll modpower(ll, ll, ll);
ll gcd(ll, ll);
ll modinv(ll, ll);
int sum(int, int);
int main() {
fastIO();
ll a, b;
cin >> a >> b;
if ((a - b) % 2 == 1)
cout << "IMPOSSIBLE\n";
else
cout << (a + b) / 2 << endl;
}
void fastIO(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void decimal(int n) {
cout << fixed;
cout << setprecision(n);
}
ll modmulti(ll a, ll b, ll m) { return ((a % m) * (b % m)) % m; }
ll modadd(ll a, ll b, ll m) { return ((a % m) + (b % m)) % m; }
ll modpower(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = modmulti(result, a, m);
a = modmulti(a, a, m);
n = n / 2;
}
return result;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll modinv(ll a, ll m) { return modpower(a, m - 2, m); }
| #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++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define repb(i, n) for (ll i = 1; i < n - 1; i++)
void fastIO(void);
void decimal(int);
ll modmulti(ll, ll, ll);
ll modadd(ll, ll, ll);
ll modpower(ll, ll, ll);
ll gcd(ll, ll);
ll modinv(ll, ll);
int sum(int, int);
int main() {
fastIO();
ll a, b;
cin >> a >> b;
if ((abs(a - b)) % 2 == 1)
cout << "IMPOSSIBLE\n";
else
cout << (a + b) / 2 << endl;
}
void fastIO(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void decimal(int n) {
cout << fixed;
cout << setprecision(n);
}
ll modmulti(ll a, ll b, ll m) { return ((a % m) * (b % m)) % m; }
ll modadd(ll a, ll b, ll m) { return ((a % m) + (b % m)) % m; }
ll modpower(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = modmulti(result, a, m);
a = modmulti(a, a, m);
n = n / 2;
}
return result;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll modinv(ll a, ll m) { return modpower(a, m - 2, m); }
| [
"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);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x, y;
cin >> x >> y;
if (x > y && (x - y) % 2 == 0)
cout << (x - y) / 2 << "\n";
if (y >= x && (y - x) % 2 == 0)
cout << (y - x) / 2 << "\n";
if (abs(x - y) % 2 != 0)
cout << "IMPOSSIBLE"
<< "\n";
}
| #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);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x, y;
cin >> x >> y;
if (x > y && (x - y) % 2 == 0)
cout << (x + y) / 2 << "\n";
if (y >= x && (y - x) % 2 == 0)
cout << (y + x) / 2 << "\n";
if (abs(x - y) % 2 != 0)
cout << "IMPOSSIBLE"
<< "\n";
}
| [
"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 <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
const ll INF = 100000000000000000LL;
signed main() {
ll a, b;
cin >> a >> b;
if (a & 1 != b & 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
} | #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 <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
const ll INF = 100000000000000000LL;
signed main() {
ll a, b;
cin >> a >> b;
if ((a + b) & 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
} | [
"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())
#define Sum(a) accumulate(a.begin(), a.end(), 0)
#define REP(i, n) for (UI i = 0; i < n; i++)
#define REPR(i, n) for (UI i = n; i >= 0; i--)
#define FOR(i, m, n) for (UI i = m; i < n; i++)
#define pb(i) push_back(i)
#define SWAP(x, y) ((x != y) && (x ^= y, y ^= x, x ^= y))
#define MOD (LL)1e9 + 7;
#define INF (LL)1 << 62;
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
LL A, B;
cin >> A >> B;
if (fabs((float)A - B) / 2 - llabs(A - B) / 2 > 0) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
return 0;
}
|
#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())
#define Sum(a) accumulate(a.begin(), a.end(), 0)
#define REP(i, n) for (UI i = 0; i < n; i++)
#define REPR(i, n) for (UI i = n; i >= 0; i--)
#define FOR(i, m, n) for (UI i = m; i < n; i++)
#define pb(i) push_back(i)
#define SWAP(x, y) ((x != y) && (x ^= y, y ^= x, x ^= y))
#define MOD (LL)1e9 + 7;
#define INF (LL)1 << 62;
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
LL A, B;
cin >> A >> B;
if (fabs((long double)A - B) / 2 - llabs(A - B) / 2 > 0) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
return 0;
}
| [
"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 << ' '; \
} \
cout << endl;
#define PAIRCOMP(c, comp) \
[](const pair<ll, ll> &lhs, const pair<ll, ll> &rhs) { \
return lhs.c comp rhs.c; \
}
constexpr int atcoder_mod = 1e9 + 7;
using namespace std;
using ll = long long;
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A = in<ll>(), B = in<ll>();
ll C = (A + B) / 2;
cout << (C % 2 ? "IMPOSSIBLE" : to_string(C)) << endl;
return 0;
}
| #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 << ' '; \
} \
cout << endl;
#define PAIRCOMP(c, comp) \
[](const pair<ll, ll> &lhs, const pair<ll, ll> &rhs) { \
return lhs.c comp rhs.c; \
}
constexpr int atcoder_mod = 1e9 + 7;
using namespace std;
using ll = long long;
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A = in<ll>(), B = in<ll>();
ll C = (A + B);
cout << (C % 2 ? "IMPOSSIBLE" : to_string(C / 2)) << endl;
return 0;
}
| [
"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() {
ll A, B;
cin >> A >> B;
ll res;
if ((A + B % 2) == 1) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
res = (A + B) / 2;
cout << res << endl;
return 0;
}
| #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() {
ll A, B;
cin >> A >> B;
ll res;
if ((A + B) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
res = (A + B) / 2;
cout << res << endl;
return 0;
}
| [
"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 ll = long long;
signed main() {
int n;
cin >> n;
int m;
cin >> m;
if ((n + m) / 2 % 2 == 0)
cout << (n + m) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| #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 ll = long long;
signed main() {
int n;
cin >> n;
int m;
cin >> m;
if ((n + m) % 2 == 0)
cout << (n + m) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| [
"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;
if (d % 2)
cout << "impossible\n";
else
cout << (d / 2) << '\n';
return 0;
}
| #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;
if (d % 2)
cout << "IMPOSSIBLE\n";
else
cout << (d / 2) << '\n';
return 0;
}
| [
"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 vector<long long> Vl;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef long long ll;
int main() {
ll a = 0, b = 0, d = 0, n = 0, y = 0;
// VI a(N);
string s, s1, s2;
cin >> a >> b;
if ((a + b / 2) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| #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 vector<long long> Vl;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef long long ll;
int main() {
ll a = 0, b = 0, d = 0, n = 0, y = 0;
// VI a(N);
string s, s1, s2;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| [
"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)
\*===============================================*/
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including
//tree_order_statistics_node_update using namespace __gnu_pbds;
using namespace std;
// typedef
// tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
// ordered_set;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz size()
#define all(a) a.begin(), a.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i, b) for (int i = 0; i < (b); i++)
#define f1(i, b) for (int i = 1; i <= (b); i++)
#define f2(i, a, b) for (int i = (a); i <= (b); i++)
#define fr(i, b, a) for (int i = (b); i >= (a); i--)
#define rep(i, a, b, c) for (int i = (a); i != (b); i += (c))
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const double pi = acos(-1.0);
const double eps = 1e-6;
const int mod = (int)1e9 + 7;
const int maxn = (int)2e5 + 5;
const int logn = 20;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt", "r", stdin);
ll a, b;
cin >> a >> b;
ll k = (a + b) / 2;
if (abs(a - k) == abs(b - k) /*|| a+k==b-k || a-k==b+k || a-k==b-k*/)
cout << k << "\n";
else
cout << "Impossible\n";
return 0;
}
| /*==============================================*\
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)
\*===============================================*/
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including
//tree_order_statistics_node_update using namespace __gnu_pbds;
using namespace std;
// typedef
// tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
// ordered_set;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz size()
#define all(a) a.begin(), a.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i, b) for (int i = 0; i < (b); i++)
#define f1(i, b) for (int i = 1; i <= (b); i++)
#define f2(i, a, b) for (int i = (a); i <= (b); i++)
#define fr(i, b, a) for (int i = (b); i >= (a); i--)
#define rep(i, a, b, c) for (int i = (a); i != (b); i += (c))
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const double pi = acos(-1.0);
const double eps = 1e-6;
const int mod = (int)1e9 + 7;
const int maxn = (int)2e5 + 5;
const int logn = 20;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt", "r", stdin);
ll a, b;
cin >> a >> b;
ll k = (a + b) / 2;
if (abs(a - k) == abs(b - k) /*|| a+k==b-k || a-k==b+k || a-k==b-k*/)
cout << k << "\n";
else
cout << "IMPOSSIBLE\n";
return 0;
}
| [
"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, ar) \
for (i = a; i < b; ++i) \
cin >> ar[i];
#define rept(i, a, b) for (i = a; i < b; ++i)
#define all(a) a.begin(), a.end()
#define maX(a, b) ((a) > (b) ? (a) : (b))
#define miN(a, b) ((a) < (b) ? (a) : (b))
#define sz(a) ((int)(a.size()))
#define pb(a) push_back(a)
#define ins(a) insert(a)
#define mkpr make_pair
#define fi first
#define se second
#define newln cout << "\n"
#define bigPrime 1000000007
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// continue // break // greater // string // length // while
int main() {
fip;
ll a, b, res;
cin >> a >> b;
res = (a + b) / 2;
if ((res)&1)
cout << "IMPOSSIBLE";
else
cout << res;
return 0;
} | #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, ar) \
for (i = a; i < b; ++i) \
cin >> ar[i];
#define rept(i, a, b) for (i = a; i < b; ++i)
#define all(a) a.begin(), a.end()
#define maX(a, b) ((a) > (b) ? (a) : (b))
#define miN(a, b) ((a) < (b) ? (a) : (b))
#define sz(a) ((int)(a.size()))
#define pb(a) push_back(a)
#define ins(a) insert(a)
#define mkpr make_pair
#define fi first
#define se second
#define newln cout << "\n"
#define bigPrime 1000000007
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// continue // break // greater // string // length // while
int main() {
fip;
ll a, b, res;
cin >> a >> b;
res = (a + b);
if ((res)&1)
cout << "IMPOSSIBLE";
else
cout << res / 2;
return 0;
}
| [
"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 << "IMPOSSIBLE";
}
| #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 << "IMPOSSIBLE";
}
| [
"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 all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T gcd(T a, T b) {
if (a < b)
gcd(b, a);
if (b == 1)
return 1;
T r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
#define MOD (1'000'000'000 + 7)
bool _less(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
ll A, B;
cin >> A >> B;
if (A > B) {
ll t = A;
A = B;
A = t;
}
if ((B - A) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
}
| #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 all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T gcd(T a, T b) {
if (a < b)
gcd(b, a);
if (b == 1)
return 1;
T r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
#define MOD (1'000'000'000 + 7)
bool _less(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
ll A, B;
cin >> A >> B;
if (A > B) {
ll t = A;
A = B;
A = t;
}
if ((A + B) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
}
| [
"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 all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T gcd(T a, T b) {
if (a < b)
gcd(b, a);
if (b == 1)
return 1;
T r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
#define MOD (1'000'000'000 + 7)
bool _less(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
int t = A;
A = B;
A = t;
}
if ((B - A) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
}
| #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 all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T gcd(T a, T b) {
if (a < b)
gcd(b, a);
if (b == 1)
return 1;
T r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
#define MOD (1'000'000'000 + 7)
bool _less(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
ll A, B;
cin >> A >> B;
if (A > B) {
ll t = A;
A = B;
A = t;
}
if ((A + B) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
}
| [
"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 < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll a, b;
cin >> a >> b;
if ((b - a) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (b + a) / 2 << endl;
}
} | #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 < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll a, b;
cin >> a >> b;
if (abs(b - a) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (b + a) / 2 << endl;
}
} | [
"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", "r", stdin)
#define int long long
#define f first
#define s second
#define endl '\n'
#define all(c) c.begin(), c.end()
#define bp __builtin_popcount
#define debug(x) cerr << #x << " = " << x << endl;
const int MOD = 1e9 + 7;
const int INF = 1e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> void print(T t) {
for (auto &it : t)
cout << it << " ";
}
inline int powerexp(int a, int b, int m = MOD) {
int res = 1;
while (b) {
if (b & 1)
res = res * a % m;
a = a * a % m, b >>= 1;
}
return res % m;
}
inline int modinv(int a) { return powerexp(a, MOD - 2, MOD); }
inline int lcm(int a, int b) {
int g = __gcd(a, b);
return a / g * b;
}
inline int add(int x, int y) {
x += y;
if (x >= MOD)
x -= MOD;
return x;
}
inline int mul(int x, int y) { return (x * 1ll * y) % MOD; }
inline int sub(int x, int y) {
x -= y;
if (x < 0)
x += MOD;
return x;
}
//-------------------< start here >-------------------------//
void solve() {
int a, b;
cin >> a >> b;
int ret = (a + b) / 2;
if ((a + b) % 2 == 0)
cout << "IMPOSSIBLE" << endl;
else
cout << ret << endl;
}
//-----------------------------
// comment from here for TOPCODER
int32_t main() {
IOS;
solve();
// find();
#ifdef LOCAL_DEFINE
cerr << "time elapsed " << (double)clock() / CLOCKS_PER_SEC << endl;
#endif
}
| #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", "r", stdin)
#define int long long
#define f first
#define s second
#define endl '\n'
#define all(c) c.begin(), c.end()
#define bp __builtin_popcount
#define debug(x) cerr << #x << " = " << x << endl;
const int MOD = 1e9 + 7;
const int INF = 1e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> void print(T t) {
for (auto &it : t)
cout << it << " ";
}
inline int powerexp(int a, int b, int m = MOD) {
int res = 1;
while (b) {
if (b & 1)
res = res * a % m;
a = a * a % m, b >>= 1;
}
return res % m;
}
inline int modinv(int a) { return powerexp(a, MOD - 2, MOD); }
inline int lcm(int a, int b) {
int g = __gcd(a, b);
return a / g * b;
}
inline int add(int x, int y) {
x += y;
if (x >= MOD)
x -= MOD;
return x;
}
inline int mul(int x, int y) { return (x * 1ll * y) % MOD; }
inline int sub(int x, int y) {
x -= y;
if (x < 0)
x += MOD;
return x;
}
//-------------------< start here >-------------------------//
void solve() {
int a, b;
cin >> a >> b;
int ret = (a + b) / 2;
if ((a + b) % 2 == 1)
cout << "IMPOSSIBLE" << endl;
else
cout << ret << endl;
}
//-----------------------------
// comment from here for TOPCODER
int32_t main() {
IOS;
solve();
// find();
#ifdef LOCAL_DEFINE
cerr << "time elapsed " << (double)clock() / CLOCKS_PER_SEC << endl;
#endif
}
| [
"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, begin, end) for (ll i = begin; end < i; i--) // repeat reverse
#endif
int main(void) {
double a, b;
cin >> a >> b;
double ans = (a + b) / 2;
if (ceil(ans) == floor(ans))
cout << ans;
else
cout << "IMPOSSIBLE";
return 0;
} |
#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, begin, end) for (ll i = begin; end < i; i--) // repeat reverse
#endif
int main(void) {
double a, b;
cin >> a >> b;
double ans = (a + b) / 2;
if (ceil(ans) == floor(ans))
cout << (ll)ans;
else
cout << "IMPOSSIBLE";
return 0;
} | [
"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) + abs(a - b) / 2;
printf("%lld\n", ans);
return 0;
}
| #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) + (abs(a - b) / 2);
printf("%lld\n", ans);
return 0;
}
| [
"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) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lli A, B;
cin >> A >> B;
if (A + B % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
}
| #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) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lli A, B;
cin >> A >> B;
// cout << (A - B) % 2 <<endl;
if ((A - B) % 2 != 0) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (A + B) / 2 << endl;
}
}
| [
"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, b) for (int i = a; i > b; i--)
#define vint vector<int>
#define vvint vector<vint>
#define ct(a) cout << a << endl
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll mod = 1e9 + 7;
string S;
ll A, B;
;
int main() {
cin >> A >> B;
if ((A - B) % 2 == 1)
cout << "IMPOSSIBLE" << endl;
else {
cout << (A + B) / 2 << endl;
}
return 0;
}
| #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, b) for (int i = a; i > b; i--)
#define vint vector<int>
#define vvint vector<vint>
#define ct(a) cout << a << endl
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll mod = 1e9 + 7;
string S;
ll A, B;
;
int main() {
cin >> A >> B;
if ((A + B) % 2 == 1)
cout << "IMPOSSIBLE" << endl;
else {
cout << (A + B) / 2 << endl;
}
return 0;
} | [
"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) \
cout << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
ll i, j, n, m;
cin >> n >> m;
if ((max(n, m) - min(n, m)) % 2 != 0)
cout << "IMPOSSIBLE";
else
cout << (max(n, m) - min(n, m)) / 2;
return 0;
}
| #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) \
cout << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
ll i, j, n, m;
cin >> n >> m;
if ((max(n, m) - min(n, m)) % 2 != 0)
cout << "IMPOSSIBLE";
else
cout << (max(n, m) + min(n, m)) / 2;
return 0;
}
| [
"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; i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h, w, n, m, k;
string s, t;
char maze[60][60];
int dis[101][101];
int graph[52][52];
bool vis[52];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector<ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]) % ma;
}
}
}
int main() {
ll a, b;
cin >> a >> b;
if (a + b % 2 == 0) {
cout << (a + b) / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
}
| #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; i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h, w, n, m, k;
string s, t;
char maze[60][60];
int dis[101][101];
int graph[52][52];
bool vis[52];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector<ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]) % ma;
}
}
}
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,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) for (int i = 1; i <= n; i++)
#define ll long long
#define pb push_back
#define pi acos(-1)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//(only in c)char[33];itoa(n,buffer,base);printf("%s",buffer);
#define dec_to_bin(n) std::string binary = std::bitset<64>(n).to_string();
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL)
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
int main() {
fast;
ll a, b;
cin >> a >> b;
if ((a + b / 2) % 2 == 0) {
cout << (a + b) / 2 << endl;
} else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| #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) for (int i = 1; i <= n; i++)
#define ll long long
#define pb push_back
#define pi acos(-1)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//(only in c)char[33];itoa(n,buffer,base);printf("%s",buffer);
#define dec_to_bin(n) std::string binary = std::bitset<64>(n).to_string();
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL)
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
int main() {
fast;
ll a, b;
cin >> a >> b;
if ((a + b) % 2 == 0) {
cout << (a + b) / 2 << endl;
} else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| [
"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 > b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline T GCD(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T LCM(T a, T b) { return a * b / GCD(a, b); }
int main() {
int n, a, b, c;
cin >> a >> b;
if ((a + b) % 2 == 1) {
cout << (a + b) / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | #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 > b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline T GCD(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T LCM(T a, T b) { return a * b / GCD(a, b); }
int main() {
ll n, a, b, c;
cin >> a >> b;
if ((a + b) % 2 == 0) {
cout << (a + b) / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | [
"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)
cout << "IMPOSSIBLE" << endl;
else
cout << (a + b) / 2 << endl;
return 0;
}
| #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)
cout << "IMPOSSIBLE" << endl;
else
cout << (a + b) / 2 << endl;
return 0;
}
| [
"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 - d) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
cout << (c - d) / 2 << endl;
return 0;
}
| #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 - d) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
cout << d + ((c - d) / 2) << endl;
return 0;
}
| [
"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 long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
// int in() { int x; scanf("%d", &x); return x; }
// ll lin() { ll x; scanf("%lld", &x); return x; }
void printfv(VI a) {
int n = a.size();
FOR(i, n) cout << a[i] << " ";
}
int main(void) {
ll a, b;
cin >> a >> b;
if (abs(b - a) % 2 == 0) {
cout << (b - a) / 2;
} else {
cout << "IMPOSSIBLE";
}
return 0;
}
| #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 long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
// int in() { int x; scanf("%d", &x); return x; }
// ll lin() { ll x; scanf("%lld", &x); return x; }
void printfv(VI a) {
int n = a.size();
FOR(i, n) cout << a[i] << " ";
}
int main(void) {
ll a, b;
cin >> a >> b;
if (abs(b - a) % 2 == 0) {
cout << (b + a) / 2;
} else {
cout << "IMPOSSIBLE";
}
return 0;
}
| [
"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 = i / 2 + a;
} else {
cout << "IMPOSSIBLE";
}
}
return 0;
} | #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 = i / 2 + a;
cout << ans;
} else {
cout << "IMPOSSIBLE";
}
}
return 0;
} | [] | 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++)
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
const ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
signed main() {
ll 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;
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++)
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
const ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
signed main() {
ll a, b;
cin >> a >> b;
if ((a + b) % 2 == 1)
cout << "IMPOSSIBLE" << endl;
else
cout << (a + b) / 2 << endl;
}
| [
"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 + 7;
const ll mod2 = 228661337;
const ll N = (1 << 12) + 2;
#define int long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define F first
#define S second
void shift() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
}
void include_file(bool a) {
if (!a)
return;
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int32_t main() {
shift();
srand(time(0));
include_file(false);
int a, b;
cin >> a >> b;
int c = (a + b) / 2;
if (abs(a - c) == abs(b - c))
cout << c;
else
cout << "Impossible";
return 0;
}
| //#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 + 7;
const ll mod2 = 228661337;
const ll N = (1 << 12) + 2;
#define int long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define F first
#define S second
void shift() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
}
void include_file(bool a) {
if (!a)
return;
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int32_t main() {
shift();
srand(time(0));
include_file(false);
int a, b;
cin >> a >> b;
int c = (a + b) / 2;
if (abs(a - c) == abs(b - c))
cout << c;
else
cout << "IMPOSSIBLE";
return 0;
}
| [
"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>;
#define rep(i, a, b) for (ll(i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cout << i << "\n"
const int INF = 100000000;
const ll MOD = 1000000007;
ll pow_mod(ll x, ll y, ll mod) {
if (y == 0)
return 1;
if (y % 2) {
return (x * pow_mod(x, y - 1, mod)) % mod;
} else {
return pow_mod(x * x, y / 2, mod);
}
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
//問題文中の添え字が0-indexか1-indexか確認!
ll a, b;
std::cin >> a >> b;
if ((a - b) % 2 == 0) {
std::cout << (a + b) / 2;
} else {
std::cout << -1;
}
return 0;
} | #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>;
#define rep(i, a, b) for (ll(i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cout << i << "\n"
const int INF = 100000000;
const ll MOD = 1000000007;
ll pow_mod(ll x, ll y, ll mod) {
if (y == 0)
return 1;
if (y % 2) {
return (x * pow_mod(x, y - 1, mod)) % mod;
} else {
return pow_mod(x * x, y / 2, mod);
}
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
//問題文中の添え字が0-indexか1-indexか確認!
ll a, b;
std::cin >> a >> b;
if ((a - b) % 2 == 0) {
std::cout << (a + b) / 2;
} else {
std::cout << "IMPOSSIBLE";
}
return 0;
} | [] | 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 \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define uid uniform_int_distribution<lli>
#define lli long long int
#define ff first
#define ss second
#define pb push_back
#define popf pop_front()
#define popb pop_back()
#define all(vec) vec.begin(), vec.end()
#define fol(i, a, b) for (int i = a; i < b; i++)
#define forr(x, arr) for (auto &x : arr)
#define sz(x) (x.size())
#define mod 1000000007
#define INF 1000000000000000010
#define vi vector<int>
#define vlli vector<lli>
#define endl "\n"
#define ofk order_of_key
#define fbo find_by_order
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class my>
using indexed_set = tree<my, null_type, less<my>, rb_tree_tag,
tree_order_statistics_node_update>;
template <class my> inline my aabs(const my &a) { return (a > 0) ? a : -a; }
inline lli gcd(lli a, lli b) { return (b == 0) ? a : gcd(b, a % b); }
inline lli LSOne(lli k) { return (k & (-k)); }
inline int inv(lli o, int m = mod) {
int b = m, u = 0, v = 1, t, a = o % m;
while (a) {
t = b / a;
b -= t * a;
swap(a, b);
u -= t * v;
swap(u, v);
}
if (u < 0)
u += m;
return u;
}
inline int add(const int &a, const int &b, int m = mod) { return (a + b) % m; }
inline int sub(const int &a, const int &b, int m = mod) {
return (a - b + m) % m;
}
inline int mul(const int &a, const int &b, int m = mod) {
return int(1LL * a * b % m);
}
inline int mpow(int a, int b, int m = mod) {
int ans = 1;
a = ((a % m) + m) % m;
while (b) {
if (b & 1)
ans = mul(ans, a, m);
a = mul(a, a, m);
b >>= 1;
}
return ans;
}
void tejas_919() {
lli n, k, m, q, u = 0, v = 0, temp = 1, a, b, val = 0;
cin >> n >> m;
if (m > n)
swap(n, m);
if ((n - m) % 2) {
cout << -1 << endl;
return;
}
cout << (n + m) / 2 << endl;
}
int main() {
fastio cout << fixed << setprecision(10);
int t = 1;
// cin>>t;
while (t--)
tejas_919();
} | #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 \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define uid uniform_int_distribution<lli>
#define lli long long int
#define ff first
#define ss second
#define pb push_back
#define popf pop_front()
#define popb pop_back()
#define all(vec) vec.begin(), vec.end()
#define fol(i, a, b) for (int i = a; i < b; i++)
#define forr(x, arr) for (auto &x : arr)
#define sz(x) (x.size())
#define mod 1000000007
#define INF 1000000000000000010
#define vi vector<int>
#define vlli vector<lli>
#define endl "\n"
#define ofk order_of_key
#define fbo find_by_order
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class my>
using indexed_set = tree<my, null_type, less<my>, rb_tree_tag,
tree_order_statistics_node_update>;
template <class my> inline my aabs(const my &a) { return (a > 0) ? a : -a; }
inline lli gcd(lli a, lli b) { return (b == 0) ? a : gcd(b, a % b); }
inline lli LSOne(lli k) { return (k & (-k)); }
inline int inv(lli o, int m = mod) {
int b = m, u = 0, v = 1, t, a = o % m;
while (a) {
t = b / a;
b -= t * a;
swap(a, b);
u -= t * v;
swap(u, v);
}
if (u < 0)
u += m;
return u;
}
inline int add(const int &a, const int &b, int m = mod) { return (a + b) % m; }
inline int sub(const int &a, const int &b, int m = mod) {
return (a - b + m) % m;
}
inline int mul(const int &a, const int &b, int m = mod) {
return int(1LL * a * b % m);
}
inline int mpow(int a, int b, int m = mod) {
int ans = 1;
a = ((a % m) + m) % m;
while (b) {
if (b & 1)
ans = mul(ans, a, m);
a = mul(a, a, m);
b >>= 1;
}
return ans;
}
void tejas_919() {
lli n, k, m, q, u = 0, v = 0, temp = 1, a, b, val = 0;
cin >> n >> m;
if (m > n)
swap(n, m);
if ((n - m) % 2) {
cout << "IMPOSSIBLE" << endl;
return;
}
cout << (n + m) / 2 << endl;
}
int main() {
fastio cout << fixed << setprecision(10);
int t = 1;
// cin>>t;
while (t--)
tejas_919();
}
| [] | 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>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <string>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, nuint_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> new_data_set;
#define int long long
#define MOD 1000000007
#define what_is(x) cerr << #x << " is " << x << endl;
#define loop(i, a, n) for (int i = a; i < n; i++)
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, szof(x))
#define sortall(x) sort(aint(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef pair<int, int> pt;
// const int mod= 998244353;
signed main() {
fastio();
//#define LOCAL_DEFINE
#ifdef LOCAL_DEFINE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
if ((b - a) % 2) {
cout << "IMPOSSIBLE";
} else {
cout << (b - a) / 2;
}
return 0;
} | #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>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <string>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, nuint_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> new_data_set;
#define int long long
#define MOD 1000000007
#define what_is(x) cerr << #x << " is " << x << endl;
#define loop(i, a, n) for (int i = a; i < n; i++)
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, szof(x))
#define sortall(x) sort(aint(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef pair<int, int> pt;
// const int mod= 998244353;
signed main() {
fastio();
// #define LOCAL_DEFINE
#ifdef LOCAL_DEFINE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
if ((b - a) % 2) {
cout << "IMPOSSIBLE";
} else {
cout << (b + a) / 2;
}
return 0;
} | [
"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 walk alone
YNWA
*/
// hell_hacker
// IT TAKES EVERYTHING and IT IS NOT LUCK
// PICK ME LAST -- COME OUT OF N^WHERE
// WHY NOT?
/*
And you came my way on a winner's day
Shouted loudly come out and play
Can't you tell I got news for you
Sun is shining and so are you
*/
// author: SweetPrinces
/*
___▒▒▒▒______▒▒▒▒▒▒▒▒
__▒▒░░░░▒▒▒▒▒▒▒░░░░▒▒
_▒▒░░░░░░▒▒▒▒▒░░░__░▒▒
▒▒░___░░▒▒▒▒▒▒▒░░__░▒▒
▒▒░__░▒▒▒▒▒▒▒▒▒▒▒_░▒
_▒░░▒▒▒▒▒▒█▒▒▒▒▒█▒▒
___▒▒▒▒▒▒░██▒▒▒▒██_▒___▒▒___▒▒
___▒▒▒▒▒░░░░███░░░▒▒___▒▒__▒▒
___▒▒▒▒▒░░___███____▒▒___▒▒_▒▒
____▒▒░░__▀▄▄▄▄▄▄▀░▒_____▒▒▒▒▒
_____▒▒▒░_____▀▀_░▒▒______▒▒▒▒▒▒
___▒▒▒░▒░░░▒▒▒░_▒▒▒▒▒▒▒▒▒▒▒
__▒▒▒░▒▒▒▒▒░░░▒░▒▒▒▒▒▒▒▒▒
_▒▒▒░▒▒▒▒___▒▒__▒▒▒▒▒▒▒▒▒
_▒▒▒░▒░░_________░▒▒▒▒
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define ld long double
#define f first
#define se second
#define SpeedForce \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define sqr(x) ((x) * (x))
#define forn(i, n) for (ll i = 0; i < n; ++i)
#define forl(i, a, b) for (int i = (a); i <= (b); ++i)
#define ford(i, a, b) for (int i = (a); i >= (b); --i)
#define forg(i, a, b, c) for (ll i = (a); i <= (b); i += (c))
#define cno \
cout << "NO"; \
return 0;
#define cye \
cout << "YES"; \
return 0;
#define pb push_back
#define mp make_pair
#define fbo find_by_order
#define ofk order_of_key
#define all(a) (a).begin(), (a).end()
#define pb1 pop_back
#define sz(x) ((int)(x).size())
#define fill(a, x) memset(a, x, sizeof(a))
#define debug(v) makeDebugInfo(#v, v)
#define dbg(v) out.put(makeDebugInfo(#v, v)), cout.flush()
#define _read(x) freopen(x, "r", stdin)
#define _write(x) freopen(x, "w", stdout)
#define files(x) \
_read(x ".txt"); \
_write(x ".txt")
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef pair<pii, int> ppii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> puu;
typedef pair<int, string> pis;
typedef pair<string, int> psi;
typedef map<int, int> mii;
typedef map<int, int> mii;
typedef map<int, char> mic;
typedef map<string, int> msi;
typedef map<string, string> mss;
typedef map<char, int> mci;
typedef map<char, ll> mcl;
typedef map<ll, ll> mll;
typedef map<pii, int> mpii;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pis> vpis;
typedef set<int> si;
typedef set<pair<ull, ull>> spuu;
typedef set<pii> spii;
typedef priority_queue<ll> pqll;
const int N = 2e5 + 7;
const int M = 21;
const int MAXK = 1e5 + 3;
const int Candy = 1e6 + 3;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const ll INF = 1e18;
const double PI = 3.1415926535897932384626433;
const ld EPS = 1e-12;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class Key, class Value, class Hash = std::hash<Key>>
using unordered_map = __gnu_pbds::gp_hash_table<Key, Value, Hash>;
template <typename T> int sgn(T val) { return (T(0) < val) - (val < T(0)); }
char getChar() {
char c = 0;
while (c <= ' ')
cin >> c;
return c;
}
inline ll fast_pow(ll a, ll b) {
ll res = a, ret = 1;
while (b > 0) {
if (b % 2)
ret = (ret * res) % mod;
res = (res * res) % mod;
b /= 2;
}
return ret;
}
inline ll fact(ll n) {
int f = 1;
forl(i, 2, n) f = f * i % mod;
return f;
}
inline ll Cnk(ll n, ll r) {
r = min(r, n - r);
ll ans = 1;
ford(i, n, n - r + 1) ans = (ans * i) % mod;
forl(i, 1, r) ans = (ans * fast_pow(i, mod - 2)) % mod;
return ans;
}
ll a, b;
int main() {
SpeedForce cin >> a >> b;
if (a & 1 != b & 1) {
cout << "IMPOSSIBLE";
} else {
cout << (a + b) / 2;
}
return (!false && !true) ||
((ll)((ll)(1713 + 2377 + 1464) * (ll)(1713 + 2377 + 1464) *
(ll)(1713 + 2377 + 1464)) != (ll)(171323771464));
} | /*
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 walk alone
YNWA
*/
// hell_hacker
// IT TAKES EVERYTHING and IT IS NOT LUCK
// PICK ME LAST -- COME OUT OF N^WHERE
// WHY NOT?
/*
And you came my way on a winner's day
Shouted loudly come out and play
Can't you tell I got news for you
Sun is shining and so are you
*/
// author: SweetPrinces
/*
___▒▒▒▒______▒▒▒▒▒▒▒▒
__▒▒░░░░▒▒▒▒▒▒▒░░░░▒▒
_▒▒░░░░░░▒▒▒▒▒░░░__░▒▒
▒▒░___░░▒▒▒▒▒▒▒░░__░▒▒
▒▒░__░▒▒▒▒▒▒▒▒▒▒▒_░▒
_▒░░▒▒▒▒▒▒█▒▒▒▒▒█▒▒
___▒▒▒▒▒▒░██▒▒▒▒██_▒___▒▒___▒▒
___▒▒▒▒▒░░░░███░░░▒▒___▒▒__▒▒
___▒▒▒▒▒░░___███____▒▒___▒▒_▒▒
____▒▒░░__▀▄▄▄▄▄▄▀░▒_____▒▒▒▒▒
_____▒▒▒░_____▀▀_░▒▒______▒▒▒▒▒▒
___▒▒▒░▒░░░▒▒▒░_▒▒▒▒▒▒▒▒▒▒▒
__▒▒▒░▒▒▒▒▒░░░▒░▒▒▒▒▒▒▒▒▒
_▒▒▒░▒▒▒▒___▒▒__▒▒▒▒▒▒▒▒▒
_▒▒▒░▒░░_________░▒▒▒▒
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define ld long double
#define f first
#define se second
#define SpeedForce \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define sqr(x) ((x) * (x))
#define forn(i, n) for (ll i = 0; i < n; ++i)
#define forl(i, a, b) for (int i = (a); i <= (b); ++i)
#define ford(i, a, b) for (int i = (a); i >= (b); --i)
#define forg(i, a, b, c) for (ll i = (a); i <= (b); i += (c))
#define cno \
cout << "NO"; \
return 0;
#define cye \
cout << "YES"; \
return 0;
#define pb push_back
#define mp make_pair
#define fbo find_by_order
#define ofk order_of_key
#define all(a) (a).begin(), (a).end()
#define pb1 pop_back
#define sz(x) ((int)(x).size())
#define fill(a, x) memset(a, x, sizeof(a))
#define debug(v) makeDebugInfo(#v, v)
#define dbg(v) out.put(makeDebugInfo(#v, v)), cout.flush()
#define _read(x) freopen(x, "r", stdin)
#define _write(x) freopen(x, "w", stdout)
#define files(x) \
_read(x ".txt"); \
_write(x ".txt")
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef pair<pii, int> ppii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> puu;
typedef pair<int, string> pis;
typedef pair<string, int> psi;
typedef map<int, int> mii;
typedef map<int, int> mii;
typedef map<int, char> mic;
typedef map<string, int> msi;
typedef map<string, string> mss;
typedef map<char, int> mci;
typedef map<char, ll> mcl;
typedef map<ll, ll> mll;
typedef map<pii, int> mpii;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pis> vpis;
typedef set<int> si;
typedef set<pair<ull, ull>> spuu;
typedef set<pii> spii;
typedef priority_queue<ll> pqll;
const int N = 2e5 + 7;
const int M = 21;
const int MAXK = 1e5 + 3;
const int Candy = 1e6 + 3;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const ll INF = 1e18;
const double PI = 3.1415926535897932384626433;
const ld EPS = 1e-12;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class Key, class Value, class Hash = std::hash<Key>>
using unordered_map = __gnu_pbds::gp_hash_table<Key, Value, Hash>;
template <typename T> int sgn(T val) { return (T(0) < val) - (val < T(0)); }
char getChar() {
char c = 0;
while (c <= ' ')
cin >> c;
return c;
}
inline ll fast_pow(ll a, ll b) {
ll res = a, ret = 1;
while (b > 0) {
if (b % 2)
ret = (ret * res) % mod;
res = (res * res) % mod;
b /= 2;
}
return ret;
}
inline ll fact(ll n) {
int f = 1;
forl(i, 2, n) f = f * i % mod;
return f;
}
inline ll Cnk(ll n, ll r) {
r = min(r, n - r);
ll ans = 1;
ford(i, n, n - r + 1) ans = (ans * i) % mod;
forl(i, 1, r) ans = (ans * fast_pow(i, mod - 2)) % mod;
return ans;
}
ll a, b;
int main() {
SpeedForce cin >> a >> b;
if ((a & 1) != (b & 1)) {
cout << "IMPOSSIBLE";
} else {
cout << (a + b) / 2;
}
return (!false && !true) ||
((ll)((ll)(1713 + 2377 + 1464) * (ll)(1713 + 2377 + 1464) *
(ll)(1713 + 2377 + 1464)) != (ll)(171323771464));
} | [
"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 S second
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define G(a, b) get<a>(b)
#define VI vector<int>
#define VLL vector<long long>
#define o_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define o_setll \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// member functions :
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
ll modI(ll a, ll m);
ll gcd(ll a, ll b);
ll powM(ll x, unsigned ll y, unsigned ll m);
void pairsort(int a[], int b[], int n);
void pairsortll(ll a[], ll b[], ll n);
ll logint(ll x, ll y);
ll gcd(ll x, ll y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
ll powM(ll x, ll y, ll m) {
if (y == 0)
return 1;
ll p = powM(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
ll modI(ll a, ll m) {
ll m0 = m, y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m;
a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
void pairsort(int a[], int b[], int n) {
pair<int, int> v[n];
REP(i, 0, n) {
v[i].F = a[i];
v[i].S = b[i];
}
sort(v, v + n);
REP(i, 0, n) {
a[i] = v[i].F;
b[i] = v[i].S;
}
}
void pairsortll(ll a[], ll b[], ll n) {
pair<ll, ll> v[n];
REP(i, 0, n) {
v[i].F = a[i];
v[i].S = b[i];
}
sort(v, v + n);
REP(i, 0, n) {
a[i] = v[i].F;
b[i] = v[i].S;
}
}
ll logint(ll x, ll y) {
ll ans = 0;
ll a = 1;
for (ll i = 0; i <= x; i++) {
if (x < a) {
return ans;
}
ans++;
a *= y;
}
return -1;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/*
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
*/
ll q = 1;
// cin>>q;
while (q--) {
ll a, b;
cin >> a >> b;
if (abs(a - b) % 2)
cout << "Impossible";
else
cout << min(a, b) + abs(a - b) / 2;
}
return 0;
}
| #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 S second
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define G(a, b) get<a>(b)
#define VI vector<int>
#define VLL vector<long long>
#define o_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define o_setll \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// member functions :
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
ll modI(ll a, ll m);
ll gcd(ll a, ll b);
ll powM(ll x, unsigned ll y, unsigned ll m);
void pairsort(int a[], int b[], int n);
void pairsortll(ll a[], ll b[], ll n);
ll logint(ll x, ll y);
ll gcd(ll x, ll y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
ll powM(ll x, ll y, ll m) {
if (y == 0)
return 1;
ll p = powM(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
ll modI(ll a, ll m) {
ll m0 = m, y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m;
a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
void pairsort(int a[], int b[], int n) {
pair<int, int> v[n];
REP(i, 0, n) {
v[i].F = a[i];
v[i].S = b[i];
}
sort(v, v + n);
REP(i, 0, n) {
a[i] = v[i].F;
b[i] = v[i].S;
}
}
void pairsortll(ll a[], ll b[], ll n) {
pair<ll, ll> v[n];
REP(i, 0, n) {
v[i].F = a[i];
v[i].S = b[i];
}
sort(v, v + n);
REP(i, 0, n) {
a[i] = v[i].F;
b[i] = v[i].S;
}
}
ll logint(ll x, ll y) {
ll ans = 0;
ll a = 1;
for (ll i = 0; i <= x; i++) {
if (x < a) {
return ans;
}
ans++;
a *= y;
}
return -1;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/*
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
*/
ll q = 1;
// cin>>q;
while (q--) {
ll a, b;
cin >> a >> b;
if (abs(a - b) % 2)
cout << "IMPOSSIBLE";
else
cout << min(a, b) + abs(a - b) / 2;
}
return 0;
}
| [
"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';
return 0;
}
| #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';
return 0;
}
| [] | 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;
} else {
cout << (A + B) / 2 << endl;
}
} | #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;
} else {
cout << (A + B) / 2 << endl;
}
} | [
"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
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int MOD = 1000000007;
// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};
// debug
//--------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// IO accelerate
//--------------------------------------------
struct InitIO {
InitIO() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
} init_io;
// template
//--------------------------------------------
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : "\t");
}
return os;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
for (int i = 0; i < vv.size(); ++i) {
s << vv[i] << endl;
}
return s;
}
// main code
int main(int argc, char const *argv[]) {
LL a, b;
cin >> a >> b;
if (a + b % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
return 0;
}
| // 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
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int MOD = 1000000007;
// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};
// debug
//--------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// IO accelerate
//--------------------------------------------
struct InitIO {
InitIO() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
} init_io;
// template
//--------------------------------------------
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : "\t");
}
return os;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
for (int i = 0; i < vv.size(); ++i) {
s << vv[i] << endl;
}
return s;
}
// main code
int main(int argc, char const *argv[]) {
LL a, b;
cin >> a >> b;
if (((a + b) % 2) == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
return 0;
}
| [
"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_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline SQWORD MAX(SQWORD a, SQWORD b) { return a > b ? a : b; }
static inline SQWORD MIN(SQWORD a, SQWORD b) { return a < b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
static inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; }
static inline bool DoubleIsZero(const DOUBLE &a) { return ABS(a) < DOUBLE_EPS; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007LL)
static SQWORD addMod(SQWORD x, SQWORD y) { return (x + y) % ANS_MOD; }
static SQWORD subMod(SQWORD x, SQWORD y) { return (x - y + ANS_MOD) % ANS_MOD; }
static SQWORD mulMod(SQWORD x, SQWORD y) { return (x * y) % ANS_MOD; }
static SQWORD powMod(SQWORD x, SQWORD e) {
SQWORD v = 1;
for (; e; x = mulMod(x, x), e >>= 1) {
if (e & 1) {
v = mulMod(v, x);
}
}
return v;
}
static SQWORD divMod(SQWORD x, SQWORD y) {
return mulMod(x, powMod(y, ANS_MOD - 2));
}
static SQWORD combMod(SQWORD n, SQWORD k) {
SQWORD v = 1;
for (SQWORD i = 1; i <= k; i++) {
v = divMod(mulMod(v, n - i + 1), i);
}
return v;
}
/*----------------------------------------------*/
int main(void) {
SQWORD sqA = inputSQWORD();
SQWORD sqB = inputSQWORD();
if (0 < (sqA - sqB) % 2) {
printf("IMPOSSIBLE\n");
} else {
printf("%lld\n", (sqA + sqB) / 2);
}
return 0;
} | #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_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline SQWORD MAX(SQWORD a, SQWORD b) { return a > b ? a : b; }
static inline SQWORD MIN(SQWORD a, SQWORD b) { return a < b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
static inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; }
static inline bool DoubleIsZero(const DOUBLE &a) { return ABS(a) < DOUBLE_EPS; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007LL)
static SQWORD addMod(SQWORD x, SQWORD y) { return (x + y) % ANS_MOD; }
static SQWORD subMod(SQWORD x, SQWORD y) { return (x - y + ANS_MOD) % ANS_MOD; }
static SQWORD mulMod(SQWORD x, SQWORD y) { return (x * y) % ANS_MOD; }
static SQWORD powMod(SQWORD x, SQWORD e) {
SQWORD v = 1;
for (; e; x = mulMod(x, x), e >>= 1) {
if (e & 1) {
v = mulMod(v, x);
}
}
return v;
}
static SQWORD divMod(SQWORD x, SQWORD y) {
return mulMod(x, powMod(y, ANS_MOD - 2));
}
static SQWORD combMod(SQWORD n, SQWORD k) {
SQWORD v = 1;
for (SQWORD i = 1; i <= k; i++) {
v = divMod(mulMod(v, n - i + 1), i);
}
return v;
}
/*----------------------------------------------*/
int main(void) {
SQWORD sqA = inputSQWORD();
SQWORD sqB = inputSQWORD();
if (0 < (abs(sqA - sqB)) % 2) {
printf("IMPOSSIBLE\n");
} else {
printf("%lld\n", (sqA + sqB) / 2);
}
return 0;
} | [
"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.