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 |
|---|---|---|---|---|---|---|---|
p03104 | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const ll MAX = 1e+12 + 1;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
vector<ll> cnt(41);
/* function */
void g(ll x) {
ll p = 2, tmp = x + 1;
for (int i = 0; p < 41; p *= 2, i++) {
cnt[i] += (tmp / p) * (p / 2);
if (tmp % p != 0)
cnt[i] += max(tmp % p - p / 2, 0LL);
}
}
/* main */
int main() {
ll A, B;
cin >> A >> B;
g(A - 1);
for (int i = 0; i < 41; i++)
cnt[i] = -cnt[i];
g(B);
ll ans = 0;
ll p = 1;
for (int i = 0; i < 41; i++, p *= 2) {
ans += (cnt[i] % 2) * p;
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const ll MAX = 1e+12 + 1;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
vector<ll> cnt(41);
/* function */
void g(ll x) {
ll p = 2, tmp = x + 1;
for (int i = 0; i < 41; p *= 2, i++) {
cnt[i] += (tmp / p) * (p / 2);
if (tmp % p != 0)
cnt[i] += max(tmp % p - p / 2, 0LL);
}
}
/* main */
int main() {
ll A, B;
cin >> A >> B;
g(A - 1);
for (int i = 0; i < 41; i++)
cnt[i] = -cnt[i];
g(B);
ll ans = 0;
ll p = 1;
for (int i = 0; i < 41; i++, p *= 2) {
ans += (cnt[i] % 2) * p;
}
cout << ans << '\n';
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 911,501 | 911,502 | u603234915 | cpp |
p03104 | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
/*
A ~ B => 0 ~ B - 0 ~ (A - 1)
累積和とかと同じ考え方
ex)
4 ~ 8 -> (0 ~ 8) - (0 ~ 3)
A xor B = C
=> C xor A = B
0 ~ 8 0 ~ 3 4 ~ 8
こう考えると
問題は，0 ~ A のxorの値を求める．
*/
ll calc(ll A) {
if (A <= 0)
return 0;
A++;
// 10 ^ 12 <= 2進数 40桁ぐらい
ll ans = 0;
/*
i桁目の偶奇を調べる
0000
0001
0010
0011
.
.
0桁目 -> 周期 2
1桁目 -> 周期 4
2桁目 -> 周期 8
*/
for (int i = 0; i < 50; i++) {
ll loop = (1LL << (i + 1));
ll cnt = (A / loop) * (loop / 2);
cnt += max(0LL, (A % loop) - (loop / 2));
// その桁の1の位が奇数ならans++;
if (cnt % 2 == 1) {
ans += 1LL;
}
}
return ans;
}
int main() {
ll A, B;
cin >> A >> B;
ll ans = calc(B) ^ calc(A - 1);
cout << ans << '\n';
}
| #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
/*
A ~ B => 0 ~ B - 0 ~ (A - 1)
累積和とかと同じ考え方
ex)
4 ~ 8 -> (0 ~ 8) - (0 ~ 3)
A xor B = C
=> C xor A = B
0 ~ 8 0 ~ 3 4 ~ 8
こう考えると
問題は，0 ~ A のxorの値を求める．
*/
ll calc(ll A) {
if (A <= 0)
return 0;
A++;
// 10 ^ 12 <= 2進数 40桁ぐらい
ll ans = 0;
/*
i桁目の偶奇を調べる
0000
0001
0010
0011
.
.
0桁目 -> 周期 2
1桁目 -> 周期 4
2桁目 -> 周期 8
*/
for (int i = 0; i < 50; i++) {
ll loop = (1LL << (i + 1));
ll cnt = (A / loop) * (loop / 2);
cnt += max(0LL, (A % loop) - (loop / 2));
// その桁の1の位が奇数ならans++;
if (cnt % 2 == 1) {
ans += 1LL << i;
}
}
return ans;
}
int main() {
ll A, B;
cin >> A >> B;
ll ans = calc(B) ^ calc(A - 1);
cout << ans << '\n';
}
| [
"assignment.change"
] | 911,505 | 911,506 | u603234915 | cpp |
p03104 | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll ans = 0;
if (B == A) {
ans = A;
} else if (B - A <= 1) {
ans = A ^ B;
} else {
if (A % 2 == 1) {
ans ^= A;
A++;
}
if (B % 2 == 0) {
ans ^= B;
B--;
}
if (B - A + 1 % 2 == 1)
ans ^= 1;
}
cout << ans << '\n';
}
| #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll ans = 0;
if (B == A) {
ans = A;
} else if (B - A <= 1) {
ans = A ^ B;
} else {
if (A % 2 == 1) {
ans ^= A;
A++;
}
if (B % 2 == 0) {
ans ^= B;
B--;
}
if (((B - A + 1) / 2) % 2 == 1)
ans ^= 1;
}
cout << ans << '\n';
}
| [
"control_flow.branch.if.condition.change"
] | 911,507 | 911,508 | u603234915 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL A, B;
cin >> A >> B;
if (A % 2 == 0) {
int a = (B - A) % 2;
if (B % 2 == 0) {
cout << (a ^ B) << endl;
} else {
cout << (a ^ 1) << endl;
}
} else {
int a = (B - A - 1) % 2;
if (B % 2 == 0) {
cout << (A ^ a ^ B) << endl;
} else {
cout << (A ^ a ^ 1) << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL A, B;
cin >> A >> B;
if (A % 2 == 0) {
int a = (B - A) / 2 % 2;
if (B % 2 == 0) {
cout << (a ^ B) << endl;
} else {
cout << (a ^ 1) << endl;
}
} else {
int a = (B - A - 1) / 2 % 2;
if (B % 2 == 0) {
cout << (A ^ a ^ B) << endl;
} else {
cout << (A ^ a ^ 1) << endl;
}
}
}
| [
"assignment.change"
] | 911,520 | 911,521 | u067237725 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define lli long long unsigned int
#define REP(i, n) for (lli i = 0; i < n; i++)
#define DEBUG 0
#define LIM 1000000007
lli calc(lli num, lli b) {
lli sum = 0;
lli s = 1;
for (lli i = 0; i <= b; i++) {
s *= 2;
}
lli shalf = s / 2;
sum = num / s * shalf;
if (num % s >= shalf)
sum += (num % s - shalf + 1);
return sum;
}
int main() {
lli x, y;
cin >> x >> y;
/*各桁を見る*/
lli ans = 0;
if (x == 0 && y == 0)
cout << 0 << endl;
else {
REP(i, 64) {
if (x == 0)
x = 1;
lli xbit = calc(x - 1, i);
lli ybit = calc(y, i);
lli bitDiff = ybit - xbit;
if (DEBUG)
cout << "i=" << i << "xb=" << xbit << "yb=" << ybit << endl;
if (bitDiff % 2)
ans |= ((lli)1 << i);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long unsigned int
#define REP(i, n) for (lli i = 0; i < n; i++)
#define DEBUG 0
#define LIM 1000000007
lli calc(lli num, lli b) {
lli sum = 0;
lli s = 1;
for (lli i = 0; i <= b; i++) {
s *= 2;
}
lli shalf = s / 2;
sum = num / s * shalf;
if (num % s >= shalf)
sum += (num % s - shalf + 1);
return sum;
}
int main() {
lli x, y;
cin >> x >> y;
/*各桁を見る*/
lli ans = 0;
if (x == 0 && y == 0) {
cout << 0 << endl;
return 0;
} else {
REP(i, 63) {
if (x == 0)
x = 1;
lli xbit = calc(x - 1, i);
lli ybit = calc(y, i);
lli bitDiff = ybit - xbit;
if (DEBUG)
cout << "i=" << i << "xb=" << xbit << "yb=" << ybit << endl;
if (bitDiff % 2)
ans |= ((lli)1 << i);
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.return.add",
"control_flow.return.0.add",
"literal.number.change",
"call.arguments.change"
] | 911,524 | 911,523 | u041513069 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define repi(n) rep(i, n)
#define int long long
#define str string
#define vint vector<int>
#define pint pair<int, int>
#define pb(a) push_back(a)
#define all(v) v.begin(), v.end()
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "NO") << endl
#define call(a) \
for (auto t : a) \
cout << t << " "; \
cout << endl
#define ENDL printf("\n");
#define debg(a) cout << #a << ":" << a << endl;
#define SORT(a) sort(all(a));
#define INF 1LL << 60
#define inf INF
#define out(i) cout << i << endl;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int max(int a, int b) {
if (a > b)
return a;
return b;
}
signed main() {
int a, b;
cin >> a >> b;
int c = b - a + 1;
c /= 2;
c %= 2;
int res;
if (a % 2 == 0) {
if (b % 2 == 0)
res = b ^ c;
else
res = c;
} else {
if (b % 2 == 0)
res = a ^ b;
else
res = a ^ c;
}
out(res);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define repi(n) rep(i, n)
#define int long long
#define str string
#define vint vector<int>
#define pint pair<int, int>
#define pb(a) push_back(a)
#define all(v) v.begin(), v.end()
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "NO") << endl
#define call(a) \
for (auto t : a) \
cout << t << " "; \
cout << endl
#define ENDL printf("\n");
#define debg(a) cout << #a << ":" << a << endl;
#define SORT(a) sort(all(a));
#define INF 1LL << 60
#define inf INF
#define out(i) cout << i << endl;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int max(int a, int b) {
if (a > b)
return a;
return b;
}
signed main() {
int a, b;
cin >> a >> b;
int c = b - a + 1;
c /= 2;
c %= 2;
int res;
if (a % 2 == 0) {
if (b % 2 == 0)
res = b ^ c;
else
res = c;
} else {
if (b % 2 == 0)
res = a ^ b ^ (c ^ 1);
else
res = a ^ c;
}
out(res);
return 0;
}
| [
"assignment.change"
] | 911,526 | 911,527 | u423624748 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define repi(n) rep(i, n)
#define int long long
#define str string
#define vint vector<int>
#define pint pair<int, int>
#define pb(a) push_back(a)
#define all(v) v.begin(), v.end()
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "NO") << endl
#define call(a) \
for (auto t : a) \
cout << t << " "; \
cout << endl
#define ENDL printf("\n");
#define debg(a) cout << #a << ":" << a << endl;
#define SORT(a) sort(all(a));
#define INF 1LL << 60
#define inf INF
#define out(i) cout << i << endl;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int max(int a, int b) {
if (a > b)
return a;
return b;
}
signed main() {
int a, b;
cin >> a >> b;
int c = b - a + 1;
c /= 2;
c %= 2;
int res;
if (a % 2 == 0) {
if (b % 2 == 0)
res = b ^ c;
else
res = c;
} else {
if (b % 2 == 0)
res = a ^ b ^ c;
else
res = a ^ c;
}
out(res);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define repi(n) rep(i, n)
#define int long long
#define str string
#define vint vector<int>
#define pint pair<int, int>
#define pb(a) push_back(a)
#define all(v) v.begin(), v.end()
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "NO") << endl
#define call(a) \
for (auto t : a) \
cout << t << " "; \
cout << endl
#define ENDL printf("\n");
#define debg(a) cout << #a << ":" << a << endl;
#define SORT(a) sort(all(a));
#define INF 1LL << 60
#define inf INF
#define out(i) cout << i << endl;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int max(int a, int b) {
if (a > b)
return a;
return b;
}
signed main() {
int a, b;
cin >> a >> b;
int c = b - a + 1;
c /= 2;
c %= 2;
int res;
if (a % 2 == 0) {
if (b % 2 == 0)
res = b ^ c;
else
res = c;
} else {
if (b % 2 == 0)
res = a ^ b ^ (c ^ 1);
else
res = a ^ c;
}
out(res);
return 0;
}
| [] | 911,529 | 911,527 | u423624748 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll calc(ll a) {
if (a <= 0) {
return 0;
}
a++;
ll ans = 0;
rep(i, 50) {
ll loop = (1LL << (i + 1));
ll cnt = (a / loop) * (loop / 2);
cnt += max(0LL, (a % loop) - (loop / 2) + 1);
if (cnt % 2 == 1) {
ans += (1LL << i);
}
}
return ans;
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = calc(b) ^ calc(a - 1);
cout << ans;
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll calc(ll a) {
if (a <= 0) {
return 0;
}
a++;
ll ans = 0;
rep(i, 50) {
ll loop = (1LL << (i + 1));
ll cnt = (a / loop) * (loop / 2);
cnt += max(0LL, (a % loop) - (loop / 2));
if (cnt % 2 == 1) {
ans += (1LL << i);
}
}
return ans;
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = calc(b) ^ calc(a - 1);
cout << ans;
cout << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 911,530 | 911,531 | u828388155 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll calc(ll a) {
if (a <= 0) {
return 0;
}
ll ans = 0;
rep(i, 50) {
ll loop = (1LL << (i + 1));
ll cnt = (a / loop) * (loop / 2);
cnt += max(0LL, (a % loop) - (loop / 2));
if (cnt % 2 == 1) {
ans += (1LL << i);
}
}
return ans;
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = calc(b) ^ calc(a - 1);
cout << ans;
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll calc(ll a) {
if (a <= 0) {
return 0;
}
a++;
ll ans = 0;
rep(i, 50) {
ll loop = (1LL << (i + 1));
ll cnt = (a / loop) * (loop / 2);
cnt += max(0LL, (a % loop) - (loop / 2));
if (cnt % 2 == 1) {
ans += (1LL << i);
}
}
return ans;
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = calc(b) ^ calc(a - 1);
cout << ans;
cout << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 911,532 | 911,531 | u828388155 | cpp |
p03104 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define rsort(v) \
sort(all(v)); \
reverse(all(v))
using namespace std;
using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() {
cout << "Yes" << '\n';
exit(0);
}
inline void no() {
cout << "No" << '\n';
exit(0);
}
inline i64 gcd(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(16);
solve();
return 0;
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) {
if (x < y)
x = y;
}
template <typename T> inline void amin(T &x, T y) {
if (x > y)
x = y;
}
template <typename T> inline T power(T x, i64 n) {
T r = 1;
while (n > 0) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
rep(i, v.size()) {
if (i)
os << ' ';
os << v[i];
}
return os;
}
void solve() {
function<i64(i64, i64)> count = [&](i64 N, i64 A) {
i64 h = N / (2 * A);
i64 t = N - 2 * A * h;
return A * h + max(t - A, 0ll);
};
i64 A, B;
cin >> A >> B;
B++;
vi64 cnt(60, 0);
rep(i, 60) cnt[i] += count(B, power(2ll, i));
rep(i, 60) cnt[i] -= count(A, power(2ll, i));
i64 ans = 0;
rep(i, 64) ans += bit(i) * (cnt[i] % 2 ? 1 : 0);
cout << ans << '\n';
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define rsort(v) \
sort(all(v)); \
reverse(all(v))
using namespace std;
using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() {
cout << "Yes" << '\n';
exit(0);
}
inline void no() {
cout << "No" << '\n';
exit(0);
}
inline i64 gcd(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(16);
solve();
return 0;
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) {
if (x < y)
x = y;
}
template <typename T> inline void amin(T &x, T y) {
if (x > y)
x = y;
}
template <typename T> inline T power(T x, i64 n) {
T r = 1;
while (n > 0) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
rep(i, v.size()) {
if (i)
os << ' ';
os << v[i];
}
return os;
}
void solve() {
function<i64(i64, i64)> count = [&](i64 N, i64 P) {
i64 h = N / (2 * P);
i64 t = N - 2 * P * h;
return P * h + max(t - P, 0ll);
};
i64 A, B;
cin >> A >> B;
B++;
vi64 cnt(60, 0);
rep(i, 60) cnt[i] += count(B, power(2ll, i));
rep(i, 60) cnt[i] -= count(A, power(2ll, i));
i64 ans = 0;
rep(i, 60) ans += bit(i) * (cnt[i] % 2 ? 1 : 0);
cout << ans << '\n';
}
| [
"identifier.change",
"expression.operation.binary.change",
"function.return_value.change",
"call.arguments.change",
"literal.number.change",
"assignment.variable.change"
] | 911,537 | 911,538 | u908318580 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint A, B;
cin >> A >> B;
lint ans;
if (A % 2 == 0 && B % 2 == 0) {
if ((B - A) % 4 == 0)
ans = B;
else
ans = (1 ^ B);
}
if (A % 2 == 1 && B % 2 == 0) {
if ((B - A + 1) % 4 == 0)
ans = (A ^ 1 ^ B);
else
ans = (A ^ B);
}
if (A % 2 == 0 && B % 2 == 1) {
if ((B - A + 1) % 4 == 0)
ans = 0;
else
ans = 0;
}
if (A % 2 == 1 && B % 2 == 1) {
if ((B - A) % 4 == 0)
ans = A;
else
ans = (A ^ 1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint A, B;
cin >> A >> B;
lint ans;
if (A % 2 == 0 && B % 2 == 0) {
if ((B - A) % 4 == 0)
ans = B;
else
ans = (1 ^ B);
}
if (A % 2 == 1 && B % 2 == 0) {
if ((B - A + 1) % 4 == 0)
ans = (A ^ 1 ^ B);
else
ans = (A ^ B);
}
if (A % 2 == 0 && B % 2 == 1) {
if ((B - A + 1) % 4 == 0)
ans = 0;
else
ans = 1;
}
if (A % 2 == 1 && B % 2 == 1) {
if ((B - A) % 4 == 0)
ans = A;
else
ans = (A ^ 1);
}
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 911,549 | 911,550 | u265359795 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
ll calc(ll a) {
if (a <= 0)
return 0;
++a;
ll ans = 0;
rep(i, 50) {
ll loop = (1LL << (i + 1));
ll cnt = (a / loop) * (loop / 2);
cnt += max(0LL, (a % loop) * (loop / 2));
if (cnt % 2 == 1) {
ans += 1LL << i;
}
}
return ans;
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = calc(b) ^ calc(a - 1);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
ll calc(ll a) {
if (a <= 0)
return 0;
++a;
ll ans = 0;
rep(i, 50) {
ll loop = (1LL << (i + 1));
ll cnt = (a / loop) * (loop / 2);
cnt += max(0LL, (a % loop) - (loop / 2));
if (cnt % 2 == 1) {
ans += 1LL << i;
}
}
return ans;
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = calc(b) ^ calc(a - 1);
cout << ans << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 911,557 | 911,558 | u596311864 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep_(i, a_, b_, a, b, ...) \
for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) \
for (int i = (b - 1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (x).end()
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;
}
// template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef long double ld;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll k = ((b - (a + a % 2)) / 2) % 2;
cout << ((a % 2 ? a : 0) ^ k ^ (b % 2 ? 0 : b)) << "\n";
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep_(i, a_, b_, a, b, ...) \
for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) \
for (int i = (b - 1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (x).end()
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;
}
// template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef long double ld;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll k = (((b + b % 2) - (a + a % 2)) / 2) % 2;
cout << ((a % 2 ? a : 0) ^ k ^ (b % 2 ? 0 : b)) << "\n";
return 0;
} | [] | 911,569 | 911,570 | u617380180 | cpp |
p03104 | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm(a, b) (a) / __gcd((a), (b)) * (b)
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
static const int INF = INT_MAX;
static const ll LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const ll LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<int> Div(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ull a, b;
cin >> a >> b;
if (a == b) {
cout << a << endl;
} else if ((a & 1) && (b & 1)) {
ull d = (b - a) / 2;
if (d & 1) {
cout << (a ^ 1) << endl;
} else {
cout << a << endl;
}
} else if ((a & 1) && !(b & 1)) {
ull d = (b - 1 - a) / 2;
if (d & 1) {
cout << ((a ^ 1) ^ b) << endl;
} else {
cout << (a ^ b) << endl;
}
} else if (!(a & 1) && (b & 1)) {
ull d = (b - a + 1) / 2;
cout << (d ^ 1) << endl;
} else {
ull d = (b - a) / 2;
if (d & 1) {
cout << (b ^ 1) << endl;
} else {
cout << b << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm(a, b) (a) / __gcd((a), (b)) * (b)
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
static const int INF = INT_MAX;
static const ll LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const ll LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<int> Div(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ull a, b;
cin >> a >> b;
if (a == b) {
cout << a << endl;
} else if ((a & 1) && (b & 1)) {
ull d = (b - a) / 2;
if (d & 1) {
cout << (a ^ 1) << endl;
} else {
cout << a << endl;
}
} else if ((a & 1) && !(b & 1)) {
ull d = (b - 1 - a) / 2;
if (d & 1) {
cout << ((a ^ 1) ^ b) << endl;
} else {
cout << (a ^ b) << endl;
}
} else if (!(a & 1) && (b & 1)) {
ull d = (b - a + 1) / 2;
cout << (d & 1) << endl;
} else {
ull d = (b - a) / 2;
if (d & 1) {
cout << (b ^ 1) << endl;
} else {
cout << b << endl;
}
}
return 0;
}
| [
"io.output.change"
] | 911,581 | 911,582 | u254187258 | cpp |
p03104 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define pb(b) push_back(b)
#define all(a) a.begin(), a.end()
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define llpvec vector<pair<ll, ll>>
#define size_(a, b) (a, vector<ll>(b))
#define S 21
/*
UnionFind：素集合系管理の構造体
issame(x,y): x と y が同じ集合にいるか
treesize(x): x を含む集合の要素数
weight(x): xでの重みの累積和
diff(x,y): x,yの重みの差
unite(x,y): wの重みを考慮しx と y を同じ集合にする
*/
template <class Abel> struct UnionFind {
vector<ll> par;
vector<ll> rank;
vector<Abel> diff_weight;
UnionFind(ll n = 1, Abel SUM_UNITY = 0) { init(n, SUM_UNITY); }
void init(ll n = 1, Abel SUM_UNITY = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
for (ll i = 0; i < n; ++i)
par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
ll root(ll x) {
if (par[x] == x)
return x;
else {
ll r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(ll x) {
root(x);
return diff_weight[x];
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool unite(ll x, ll y, Abel w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y), w = -w;
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
ll treecnt(ll n) {
map<ll, bool> used;
ll ans = 0, i;
rep(i, 0, n) {
ll p = root(par[i]);
if (used[p])
continue;
used[p] = true;
ans++;
}
return ans;
}
Abel diff(ll x, ll y) { return weight(y) - weight(x); }
};
/*mod*/ const int mod = 1e9 + 7;
/*pi*/ const double pi = acos(-1);
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗 1*/ ll llpow(ll x, ll n) {
ll ans = 1, i;
rep(i, 0, n) {
ans *= x;
ans %= mod;
}
return ans;
}
/*n乗 2*/ ll modpow(ll x, ll n) {
ll ans = x, i, tmp = x, t1 = 1;
i = 1;
while (i < n) {
if (i * 2 < n) {
ans *= ans;
ans %= mod;
i *= 2;
} else {
t1 = 1;
tmp = x;
while (t1 * 2 < n - i) {
tmp *= tmp;
tmp %= mod;
t1 *= 2;
}
ans *= tmp;
ans %= mod;
i += t1;
}
}
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) {
ans *= (x - i);
ans %= mod;
}
return ans;
}
/*逆元*/ ll inv(ll x) { return modpow(x, mod - 2); }
/*nCr*/ ll ncr(ll n, ll r) {
ll a = fact(n), b = inv(fact(n - r)), c = inv(fact(r));
if (n - r < 0)
return 0;
else
return (((a * b) % mod) * c) % mod;
}
/*nPr*/ ll npr(ll n, ll r) {
ll a = fact(n), b = inv(fact(n - r));
return (a * b) % mod;
}
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
/*Fibonacci数列*/ ll fib(ll x) {
ll i, fibo[x + 10];
fibo[0] = 1;
fibo[1] = 1;
fibo[2] = 1;
rep(i, 3, x + 1) fibo[i] = fibo[i - 1] + fibo[i - 2];
return fibo[x];
}
/*桁数*/ ll dig(ll n) {
ll d = 0, tmp = n;
while (tmp / 10 > 0) {
tmp /= 10;
d++;
}
return d;
}
/*行列のコピー*/ void matcpy(ll a[S][S], ll b[S][S]) {
ll i, j;
rep(i, 0, S) rep(j, 0, S) b[i][j] = a[i][j]; /*(aをbに)*/
}
/*行列のリセット*/ void matrst(ll a[S][S]) {
ll i, j;
rep(i, 0, S) rep(j, 0, S) a[i][j] = 0;
}
/*行列の2乗*/ void matpow(ll a[S][S]) {
ll ans[S][S];
matrst(ans);
ll i, j, k;
rep(i, 0, S) rep(j, 0, S) rep(k, 0, S) {
ans[i][j] += a[i][k] * a[k][j];
ans[i][j] %= mod;
}
matcpy(ans, a);
}
/*行列の乗算*/ void matmul(ll a[S][S], ll b[S][S], ll as[S][S]) {
ll i, j, k;
matrst(as);
rep(i, 0, S) rep(j, 0, S) rep(k, 0, S) {
as[i][j] += a[i][k] * b[k][j];
as[i][j] %= mod;
}
}
/*迷路移動*/ const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
llfor; ////////////////////////////////////////////////////////////
int main() {
ll a, b;
cin >> a >> b;
bool flag = false;
if (a % 2 == 1)
flag = true, a++;
ll div = b - a, ans;
if (div % 4 == 0)
ans = b;
else if (div % 4 == 1)
ans = 1;
else if (div % 4 == 2)
ans = b + 1;
else
ans = b;
if (flag)
ans ^= a - 1;
pr(ans);
return 0;
}
/*
4k+1のとき1
4k+3のとき0
*/
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define pb(b) push_back(b)
#define all(a) a.begin(), a.end()
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define llpvec vector<pair<ll, ll>>
#define size_(a, b) (a, vector<ll>(b))
#define S 21
/*
UnionFind：素集合系管理の構造体
issame(x,y): x と y が同じ集合にいるか
treesize(x): x を含む集合の要素数
weight(x): xでの重みの累積和
diff(x,y): x,yの重みの差
unite(x,y): wの重みを考慮しx と y を同じ集合にする
*/
template <class Abel> struct UnionFind {
vector<ll> par;
vector<ll> rank;
vector<Abel> diff_weight;
UnionFind(ll n = 1, Abel SUM_UNITY = 0) { init(n, SUM_UNITY); }
void init(ll n = 1, Abel SUM_UNITY = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
for (ll i = 0; i < n; ++i)
par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
ll root(ll x) {
if (par[x] == x)
return x;
else {
ll r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(ll x) {
root(x);
return diff_weight[x];
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool unite(ll x, ll y, Abel w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y), w = -w;
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
ll treecnt(ll n) {
map<ll, bool> used;
ll ans = 0, i;
rep(i, 0, n) {
ll p = root(par[i]);
if (used[p])
continue;
used[p] = true;
ans++;
}
return ans;
}
Abel diff(ll x, ll y) { return weight(y) - weight(x); }
};
/*mod*/ const int mod = 1e9 + 7;
/*pi*/ const double pi = acos(-1);
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗 1*/ ll llpow(ll x, ll n) {
ll ans = 1, i;
rep(i, 0, n) {
ans *= x;
ans %= mod;
}
return ans;
}
/*n乗 2*/ ll modpow(ll x, ll n) {
ll ans = x, i, tmp = x, t1 = 1;
i = 1;
while (i < n) {
if (i * 2 < n) {
ans *= ans;
ans %= mod;
i *= 2;
} else {
t1 = 1;
tmp = x;
while (t1 * 2 < n - i) {
tmp *= tmp;
tmp %= mod;
t1 *= 2;
}
ans *= tmp;
ans %= mod;
i += t1;
}
}
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) {
ans *= (x - i);
ans %= mod;
}
return ans;
}
/*逆元*/ ll inv(ll x) { return modpow(x, mod - 2); }
/*nCr*/ ll ncr(ll n, ll r) {
ll a = fact(n), b = inv(fact(n - r)), c = inv(fact(r));
if (n - r < 0)
return 0;
else
return (((a * b) % mod) * c) % mod;
}
/*nPr*/ ll npr(ll n, ll r) {
ll a = fact(n), b = inv(fact(n - r));
return (a * b) % mod;
}
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
/*Fibonacci数列*/ ll fib(ll x) {
ll i, fibo[x + 10];
fibo[0] = 1;
fibo[1] = 1;
fibo[2] = 1;
rep(i, 3, x + 1) fibo[i] = fibo[i - 1] + fibo[i - 2];
return fibo[x];
}
/*桁数*/ ll dig(ll n) {
ll d = 0, tmp = n;
while (tmp / 10 > 0) {
tmp /= 10;
d++;
}
return d;
}
/*行列のコピー*/ void matcpy(ll a[S][S], ll b[S][S]) {
ll i, j;
rep(i, 0, S) rep(j, 0, S) b[i][j] = a[i][j]; /*(aをbに)*/
}
/*行列のリセット*/ void matrst(ll a[S][S]) {
ll i, j;
rep(i, 0, S) rep(j, 0, S) a[i][j] = 0;
}
/*行列の2乗*/ void matpow(ll a[S][S]) {
ll ans[S][S];
matrst(ans);
ll i, j, k;
rep(i, 0, S) rep(j, 0, S) rep(k, 0, S) {
ans[i][j] += a[i][k] * a[k][j];
ans[i][j] %= mod;
}
matcpy(ans, a);
}
/*行列の乗算*/ void matmul(ll a[S][S], ll b[S][S], ll as[S][S]) {
ll i, j, k;
matrst(as);
rep(i, 0, S) rep(j, 0, S) rep(k, 0, S) {
as[i][j] += a[i][k] * b[k][j];
as[i][j] %= mod;
}
}
/*迷路移動*/ const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
llfor; ////////////////////////////////////////////////////////////
int main() {
ll a, b;
cin >> a >> b;
bool flag = false;
if (a % 2 == 1)
flag = true, a++;
ll div = b - a, ans;
if (div % 4 == 0)
ans = b;
else if (div % 4 == 1)
ans = 1;
else if (div % 4 == 2)
ans = b + 1;
else
ans = 0;
if (flag)
ans ^= a - 1;
pr(ans);
return 0;
}
/*
4k+1のとき1
4k+3のとき0
*/
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 911,588 | 911,589 | u006717664 | cpp |
p03104 | #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a == 0) {
b = ((b + 1) / 2 % 2) ^ ((b % 2) ? 0 : b);
cout << b << endl;
}
a = ((a) / 2 % 2) ^ (((a - 1) % 2) ? 0 : a);
b = ((b + 1) / 2 % 2) ^ ((b % 2) ? 0 : b);
cout << (a ^ b) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a == 0) {
b = ((b + 1) / 2 % 2) ^ ((b % 2) ? 0 : b);
cout << b << endl;
return 0;
}
a = ((a) / 2 % 2) ^ (((a - 1) % 2) ? 0 : a - 1);
b = ((b + 1) / 2 % 2) ^ ((b % 2) ? 0 : b);
cout << (a ^ b) << endl;
return 0;
} | [
"control_flow.return.add",
"control_flow.return.0.add",
"assignment.change"
] | 911,592 | 911,591 | u110383054 | cpp |
p03104 | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//---------------------------------------------------------------
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1e18
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define vec vector
using pint = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
//---------------------------------------------------------------
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const double pi = acos(-1);
const int mod = 1000000007;
struct mint {
int64_t x;
mint(int64_t x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(int64_t t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
//---------------------------------------------------------------
//↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓
// numbers of odd is even num -> 0
ll odd(ll a) { return (a + 1) / 2 % 2; }
ll solve(ll num) {
// if num is even
if (num % 2 == 0) {
return odd(num);
} else {
return odd(num + 1) ^ (num + 1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll a, b;
cin >> a >> b;
ll cnt = solve(a - 1) ^ solve(b);
cout << cnt << endl;
} | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//---------------------------------------------------------------
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1e18
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define vec vector
using pint = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
//---------------------------------------------------------------
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const double pi = acos(-1);
const int mod = 1000000007;
struct mint {
int64_t x;
mint(int64_t x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(int64_t t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
//---------------------------------------------------------------
//↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓
// numbers of odd is even num -> 0
ll odd(ll a) { return (a + 1) / 2 % 2; }
ll solve(ll num) {
// if num is even
if (num % 2 == 1) {
return odd(num);
} else {
return odd(num + 1) ^ (num + 1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll a, b;
cin >> a >> b;
ll cnt = solve(a - 1) ^ solve(b);
cout << cnt << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 911,606 | 911,607 | u825601908 | cpp |
p03104 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define IO \
ios::sync_with_stdio(false); \
cin.tie(); \
cout.tie(0)
#define inf 0x3f3f3f
#define pi 3.1415926535898
using namespace std;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
ll f(ll x) // f(0,x)的异或和
{
if (x % 4 == 0) {
return x;
}
if (x % 4 == 1) {
return 1;
}
if (x % 4 == 2) {
return x + 1;
}
if (x % 4 == 3) {
return 0;
}
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = f(a) ^ f(b - 1);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define IO \
ios::sync_with_stdio(false); \
cin.tie(); \
cout.tie(0)
#define inf 0x3f3f3f
#define pi 3.1415926535898
using namespace std;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
ll f(ll x) // f(0,x)的异或和
{
if (x % 4 == 0) {
return x;
}
if (x % 4 == 1) {
return 1;
}
if (x % 4 == 2) {
return x + 1;
}
if (x % 4 == 3) {
return 0;
}
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = f(a - 1) ^ f(b);
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 911,610 | 911,611 | u915401678 | cpp |
p03104 | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using P = pair<long long, long long>;
#define rep(i, n) for (long long i = 0; i < (long long)n; i++)
#define req(i, n) for (long long i = n - 1; i >= 0; i--)
#define range(i, a, b) for (long long i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((long long)(x).size())
#define COUT(x) cout << x << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define onBoard(y, x) (y >= 0 && y < h && x >= 0 && x < w)
#define pri_que priority_queue
#define vint vector<int>
#define vvint vector<vector<int>>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define vvc vector<vector<char>>
#define vc vector<char>
#define vp vector<pair<int, int>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define show(x) cout << #x << "=" << x << endl;
#define SUM(x) accumulate(x.begin(), x.end(), 0)
#define MAX(x) *max_element(x.begin(), x.end())
#define MIN(x) *min_element(x.begin(), x.end())
#define couty cout << "Yes" << endl
#define coutn cout << "No" << endl
#define coutY cout << "YES" << endl
#define coutN cout << "NO" << endl
#define yn(x) cout << (x ? "Yes" : "No") << endl
#define YN(x) cout << (x ? "YES" : "NO") << endl
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const long long dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const long long dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const long long INF = 1e15;
const long long MOD = 1e9 + 7;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int a, b;
cin >> a >> b;
int s1 = 0, s2 = 0;
// s1
if (a / 2 % 2 == 0)
s1 = 0;
else
s1 = 1;
if ((a - 1) % 2 == 0)
s1 = s1 ^ (a - 1);
// if((a-1)%2==0){
// if(a/2%2==0) s1=0;
// else s1=1;
// }else{
// }
// s2
if (b / 2 % 2 == 0)
s2 = 0;
else
s2 = 1;
if (b % 2 == 0)
s2 = s2 ^ b;
// show(s1);show(s2);
cout << (s1 ^ s2) << endl;
} | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using P = pair<long long, long long>;
#define rep(i, n) for (long long i = 0; i < (long long)n; i++)
#define req(i, n) for (long long i = n - 1; i >= 0; i--)
#define range(i, a, b) for (long long i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((long long)(x).size())
#define COUT(x) cout << x << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define onBoard(y, x) (y >= 0 && y < h && x >= 0 && x < w)
#define pri_que priority_queue
#define vint vector<int>
#define vvint vector<vector<int>>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define vvc vector<vector<char>>
#define vc vector<char>
#define vp vector<pair<int, int>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define show(x) cout << #x << "=" << x << endl;
#define SUM(x) accumulate(x.begin(), x.end(), 0)
#define MAX(x) *max_element(x.begin(), x.end())
#define MIN(x) *min_element(x.begin(), x.end())
#define couty cout << "Yes" << endl
#define coutn cout << "No" << endl
#define coutY cout << "YES" << endl
#define coutN cout << "NO" << endl
#define yn(x) cout << (x ? "Yes" : "No") << endl
#define YN(x) cout << (x ? "YES" : "NO") << endl
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const long long dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const long long dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const long long INF = 1e15;
const long long MOD = 1e9 + 7;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int a, b;
cin >> a >> b;
int s1 = 0, s2 = 0;
// s1
if (a / 2 % 2 == 0)
s1 = 0;
else
s1 = 1;
if ((a - 1) % 2 == 0)
s1 = s1 ^ (a - 1);
// s2
if ((b + 1) / 2 % 2 == 0)
s2 = 0;
else
s2 = 1;
if (b % 2 == 0)
s2 = s2 ^ b;
// show(s1);show(s2);
cout << (s1 ^ s2) << endl;
} | [
"control_flow.branch.if.condition.change"
] | 911,618 | 911,619 | u876953939 | cpp |
p03104 | #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(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll A_sum = 0, B_sum = 0;
REPR(digit, 45) {
ll beki_low = 1LL << digit;
ll beki_high = 1LL << (digit + 1);
if (digit != 0) {
A_sum += (max(0LL, A % beki_high - beki_low) % 2) << digit;
B_sum += (max(0LL, (B + 1) % beki_high - beki_low) % 2) << digit;
} else {
A_sum += (A / 2) % 2;
B_sum += (B / 2) % 2;
}
}
cout << (A_sum ^ B_sum) << 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(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll A_sum = 0, B_sum = 0;
REPR(digit, 45) {
ll beki_low = 1LL << digit;
ll beki_high = 1LL << (digit + 1);
if (digit != 0) {
A_sum += (max(0LL, A % beki_high - beki_low) % 2) << digit;
B_sum += (max(0LL, (B + 1) % beki_high - beki_low) % 2) << digit;
} else {
A_sum += (A / 2) % 2;
B_sum += ((B + 1) / 2) % 2;
}
}
cout << (A_sum ^ B_sum) << endl;
return 0;
} | [] | 911,632 | 911,633 | u116774833 | cpp |
p03104 | #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(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
if (A % 2 == 0 && B % 2 != 0) {
if ((B - A + 1) % 4 == 0) {
cout << 0 << endl;
} else {
cout << B << endl;
}
} else if (A % 2 == 0 && B % 2 == 0) {
if ((B - A) % 4 == 0) {
cout << B << endl;
} else {
cout << (B ^ 1) << endl;
}
} else if (A % 2 != 0 && B % 2 != 0) {
if ((B - A) % 4 == 0) {
cout << A << endl;
} else {
cout << (A ^ 1) << endl;
}
} else if (A % 2 != 0 && B % 2 == 0) {
if ((B - A - 1) % 4 == 0) {
cout << (A ^ B) << endl;
} else {
cout << ((A ^ B) ^ 1) << 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(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
if (A % 2 == 0 && B % 2 != 0) {
if ((B - A + 1) % 4 == 0) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
} else if (A % 2 == 0 && B % 2 == 0) {
if ((B - A) % 4 == 0) {
cout << B << endl;
} else {
cout << (B ^ 1) << endl;
}
} else if (A % 2 != 0 && B % 2 != 0) {
if ((B - A) % 4 == 0) {
cout << A << endl;
} else {
cout << (A ^ 1) << endl;
}
} else if (A % 2 != 0 && B % 2 == 0) {
if ((B - A - 1) % 4 == 0) {
cout << (A ^ B) << endl;
} else {
cout << ((A ^ B) ^ 1) << endl;
}
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 911,634 | 911,635 | u116774833 | cpp |
p03104 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
ll sol(ll n) {
if (n < 0)
return 0;
int r = n % 4;
if (r == 0)
return n;
if (r == 1)
return 1;
if (r == 2)
return +1;
if (r == 3)
return 0;
return -1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
cout << (sol(a - 1) ^ sol(b)) << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
ll sol(ll n) {
if (n < 0)
return 0;
int r = n % 4;
if (r == 0)
return n;
if (r == 1)
return 1;
if (r == 2)
return n + 1;
if (r == 3)
return 0;
return -1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
cout << (sol(a - 1) ^ sol(b)) << endl;
}
| [
"function.return_value.change"
] | 911,636 | 911,637 | u688789047 | cpp |
p03104 | // C++ 14
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (ll __x = __start; __x < __end; __x++)
int main() {
ll a, b;
cin >> a >> b;
if (a == b) {
cout << a << endl;
return 0;
}
if (b - a == 1) {
cout << 1 << endl;
return 0;
}
ll l = (a & 1) ? a + 1 : a; // lは偶数
ll r = (b & 1) ? b : b - 1; // rは奇数
ll C = (r - l + 1) & 1;
if (a & 1)
C ^= a;
if ((b & 1) == 0)
C ^= b;
cout << C << endl;
return 0;
}
| // C++ 14
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (ll __x = __start; __x < __end; __x++)
int main() {
ll a, b;
cin >> a >> b;
if (a == b) {
cout << a << endl;
return 0;
}
if (b - a == 1) {
cout << 1 << endl;
return 0;
}
ll l = (a & 1) ? a + 1 : a; // lは偶数
ll r = (b & 1) ? b : b - 1; // rは奇数
ll C = ((r - l + 1) / 2) & 1;
if (a & 1)
C ^= a;
if ((b & 1) == 0)
C ^= b;
cout << C << endl;
return 0;
}
| [] | 911,638 | 911,639 | u823862638 | cpp |
p03104 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define moder 1000000007
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
using namespace std;
int a, b;
signed main() {
cin >> a >> b;
if (a % 2 && b % 2)
cout << ((ll)((b - a) / 2 % 2 ? 1 : 0) ^ a) << endl;
else if (a % 2 && !(b % 2))
cout << ((ll)((b - a) / 2 % 2 ? 1 : 0) ^ a ^ b) << endl;
else if (!(a % 2) && b % 2)
cout << (ll)((b - a) / 2 % 2 ? 1 : 0) << endl;
else
cout << ((ll)((b - a) / 2 % 2 ? 1 : 0) ^ b) << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define moder 1000000007
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
using namespace std;
int a, b;
signed main() {
cin >> a >> b;
if (a % 2 && b % 2)
cout << ((ll)((b - a) / 2 % 2 ? 1 : 0) ^ a) << endl;
else if (a % 2 && !(b % 2))
cout << ((ll)((b - a) / 2 % 2 ? 1 : 0) ^ a ^ b) << endl;
else if (!(a % 2) && b % 2)
cout << (ll)((b - a + 1) / 2 % 2 ? 1 : 0) << endl;
else
cout << ((ll)((b - a) / 2 % 2 ? 1 : 0) ^ b) << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 911,642 | 911,643 | u379822620 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int A, B;
cin >> A >> B;
// 2 3 4 5 6 7
if (A % 2 == 0 && B % 2 == 0) {
int cnt = B - A;
cnt /= 2;
if (cnt % 2 == 0) {
cout << B << endl;
} else {
int ans = 1;
ans ^= B;
cout << ans << endl;
}
}
// 2 3 4 5
else if (A % 2 == 0 && B % 2 == 1) {
int cnt = B - A + 1;
cnt /= 2;
if (cnt % 2 == 0) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
}
// 3 4 5 6
else if (A % 2 == 1 && B % 2 == 0) {
int cnt = B - A - 1;
cnt /= 2;
if (cnt % 2 == 0) {
int ans = A ^ B;
cout << ans << endl;
} else {
int ans = 1;
ans ^= A;
ans ^= B;
cout << ans << endl;
}
}
// 3 4 5 6 7
else {
int cnt = B - A;
cnt /= 2;
if (cnt % 2 == 0) {
cout << B << endl;
} else {
int ans = 1;
ans ^= B;
cout << ans << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int A, B;
cin >> A >> B;
// 2 3 4 5 6 7
if (A % 2 == 0 && B % 2 == 0) {
int cnt = B - A;
cnt /= 2;
if (cnt % 2 == 0) {
cout << B << endl;
} else {
int ans = 1;
ans ^= B;
cout << ans << endl;
}
}
// 2 3 4 5
else if (A % 2 == 0 && B % 2 == 1) {
int cnt = B - A + 1;
cnt /= 2;
if (cnt % 2 == 0) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
}
// 3 4 5 6
else if (A % 2 == 1 && B % 2 == 0) {
int cnt = B - A - 1;
cnt /= 2;
if (cnt % 2 == 0) {
int ans = A ^ B;
cout << ans << endl;
} else {
int ans = 1;
ans ^= A;
ans ^= B;
cout << ans << endl;
}
}
// 3 4 5 6 7
else {
int cnt = B - A;
cnt /= 2;
if (cnt % 2 == 0) {
cout << A << endl;
} else {
int ans = 1;
ans ^= A;
cout << ans << endl;
}
}
}
| [
"identifier.change",
"io.output.change",
"assignment.value.change"
] | 911,644 | 911,645 | u237390401 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int A, B;
cin >> A >> B;
// 2 3 4 5 6 7
if (A % 2 == 0 && B % 2 == 0) {
int cnt = B - A;
cnt /= 2;
if (cnt % 2 == 0) {
cout << B << endl;
} else {
int ans = 1;
ans ^= B;
cout << ans << endl;
}
}
// 2 3 4 5
else if (A % 2 == 0 && B % 2 == 1) {
int cnt = B - A + 1;
cnt /= 2;
if (cnt % 2 == 0) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
} else if (A % 2 == 1 && B % 2 == 0) {
int cnt = B - A - 1;
cnt /= 2;
if (cnt % 2 == 0) {
int ans = A ^ B;
cout << ans << endl;
} else {
int ans = 1;
ans ^= A;
ans ^= B;
cout << ans << endl;
}
} else {
int cnt = B - A - 1;
cnt /= 2;
if (cnt % 2 == 0) {
cout << B << endl;
} else {
int ans = 1;
ans ^= B;
cout << ans << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int A, B;
cin >> A >> B;
// 2 3 4 5 6 7
if (A % 2 == 0 && B % 2 == 0) {
int cnt = B - A;
cnt /= 2;
if (cnt % 2 == 0) {
cout << B << endl;
} else {
int ans = 1;
ans ^= B;
cout << ans << endl;
}
}
// 2 3 4 5
else if (A % 2 == 0 && B % 2 == 1) {
int cnt = B - A + 1;
cnt /= 2;
if (cnt % 2 == 0) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
}
// 3 4 5 6
else if (A % 2 == 1 && B % 2 == 0) {
int cnt = B - A - 1;
cnt /= 2;
if (cnt % 2 == 0) {
int ans = A ^ B;
cout << ans << endl;
} else {
int ans = 1;
ans ^= A;
ans ^= B;
cout << ans << endl;
}
}
// 3 4 5 6 7
else {
int cnt = B - A;
cnt /= 2;
if (cnt % 2 == 0) {
cout << A << endl;
} else {
int ans = 1;
ans ^= A;
cout << ans << endl;
}
}
}
| [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change",
"assignment.value.change"
] | 911,646 | 911,645 | u237390401 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B;
cin >> A >> B;
int64_t num;
int64_t ans = 0;
if (A % 2 == 0) {
if (B % 2 == 0) {
num = B - A;
ans = num / 2;
ans = ans % 2;
ans = ans ^ B;
} else {
num = B - A + 1;
ans = num / 2;
ans = ans % 2;
}
} else {
if (B % 2 == 0) {
num = B - A - 1;
ans = num / 2;
ans = num % 2;
ans = ans ^ A ^ B;
} else {
num = B - A;
ans = num / 2;
ans = ans % 2;
ans = ans ^ A;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B;
cin >> A >> B;
int64_t num;
int64_t ans = 0;
if (A % 2 == 0) {
if (B % 2 == 0) {
num = B - A;
ans = num / 2;
ans = ans % 2;
ans = ans ^ B;
} else {
num = B - A + 1;
ans = num / 2;
ans = ans % 2;
}
} else {
if (B % 2 == 0) {
num = B - A - 1;
ans = num / 2;
ans = ans % 2;
ans = ans ^ A;
ans = ans ^ B;
} else {
num = B - A;
ans = num / 2;
ans = ans % 2;
ans = ans ^ A;
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"assignment.change"
] | 911,657 | 911,658 | u124187388 | cpp |
p03104 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using Graph = vector<vector<edge>>;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
// const ll mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto &i : container)
#define irep(i, n) for (ll i = n - 1; i >= (ll)0ll; i--)
#define rrep(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query \
int qq; \
std::cin >> qq; \
rep(qqq, qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a), 0ll)
#define keta fixed << setprecision
#define vout(a) \
erep(qxqxqx, a) std::cout << qxqxqx << ' '; \
std::cout << std::endl;
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
#define case std::cout << "Case #" << qqq + 1 << ": "
#define res resize
#define as assign
#define ffor for (;;)
#define ppri(a, b) std::cout << a << " " << b << std::endl
#define pppri(a, b, c) std::cout << a << " " << b << " " << c << std::endl
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define ssum(a) accumulate(a, 0ll)
// typedef long long T;
ll ceil(ll a, ll b) { return ((a + b - 1) / b); }
const int INF = 2000000000;
const ll INF64 = 3223372036854775807ll;
// const ll INF64 = 9223372036854775807ll;
// const ll INF64 = 9223372036854775ll;
const ll MOD = 1000000007ll;
const dou pi = 3.141592653589793;
// tuple<hoge,huga,foo> tのget関数はget<i>(t)
// resizeはメンバ関数
int main() {
ll a, b;
std::cin >> a >> b;
ll ans = 0;
if (b - a <= 10) {
rrep(i, a, b + 1) { ans ^= i; }
} else {
rrep(i, a, b + 1) {
if (i % 4 == 0)
break;
ans ^= i;
}
irep(i, b) {
if (i % 4 == 3)
break;
ans ^= i;
}
}
std::cout << ans << std::endl;
} | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using Graph = vector<vector<edge>>;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
// const ll mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto &i : container)
#define irep(i, n) for (ll i = n - 1; i >= (ll)0ll; i--)
#define rrep(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query \
int qq; \
std::cin >> qq; \
rep(qqq, qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a), 0ll)
#define keta fixed << setprecision
#define vout(a) \
erep(qxqxqx, a) std::cout << qxqxqx << ' '; \
std::cout << std::endl;
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
#define case std::cout << "Case #" << qqq + 1 << ": "
#define res resize
#define as assign
#define ffor for (;;)
#define ppri(a, b) std::cout << a << " " << b << std::endl
#define pppri(a, b, c) std::cout << a << " " << b << " " << c << std::endl
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define ssum(a) accumulate(a, 0ll)
// typedef long long T;
ll ceil(ll a, ll b) { return ((a + b - 1) / b); }
const int INF = 2000000000;
const ll INF64 = 3223372036854775807ll;
// const ll INF64 = 9223372036854775807ll;
// const ll INF64 = 9223372036854775ll;
const ll MOD = 1000000007ll;
const dou pi = 3.141592653589793;
// tuple<hoge,huga,foo> tのget関数はget<i>(t)
// resizeはメンバ関数
int main() {
ll a, b;
std::cin >> a >> b;
ll ans = 0;
if (b - a <= 100) {
rrep(i, a, b + 1) ans ^= i;
} else {
rrep(i, a, b + 1) {
if (i % 4 == 0)
break;
ans ^= i;
}
irep(i, b + 1) {
if (i % 4 == 3)
break;
ans ^= i;
}
}
std::cout << ans << std::endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 911,659 | 911,660 | u539011156 | cpp |
p03104 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using Graph = vector<vector<edge>>;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
// const ll mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto &i : container)
#define irep(i, n) for (ll i = n - 1; i >= (ll)0ll; i--)
#define rrep(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query \
int qq; \
std::cin >> qq; \
rep(qqq, qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a), 0ll)
#define keta fixed << setprecision
#define vout(a) \
erep(qxqxqx, a) std::cout << qxqxqx << ' '; \
std::cout << std::endl;
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
#define case std::cout << "Case #" << qqq + 1 << ": "
#define res resize
#define as assign
#define ffor for (;;)
#define ppri(a, b) std::cout << a << " " << b << std::endl
#define pppri(a, b, c) std::cout << a << " " << b << " " << c << std::endl
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define ssum(a) accumulate(a, 0ll)
// typedef long long T;
ll ceil(ll a, ll b) { return ((a + b - 1) / b); }
const int INF = 2000000000;
const ll INF64 = 3223372036854775807ll;
// const ll INF64 = 9223372036854775807ll;
// const ll INF64 = 9223372036854775ll;
const ll MOD = 1000000007ll;
const dou pi = 3.141592653589793;
// tuple<hoge,huga,foo> tのget関数はget<i>(t)
// resizeはメンバ関数
int main() {
ll a, b;
std::cin >> a >> b;
ll ans = 0;
if (b - a <= 10) {
rrep(i, a, b + 1) { ans ^= i; }
} else {
rrep(i, a, b + 1) {
if (i % 4 == 0)
break;
ans ^= i;
}
irep(i, b) {
if (i % 4 == 3)
break;
ans ^= i;
}
}
std::cout << ans << std::endl;
} | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using Graph = vector<vector<edge>>;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
// const ll mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto &i : container)
#define irep(i, n) for (ll i = n - 1; i >= (ll)0ll; i--)
#define rrep(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define all(x) (x).begin(), (x).end()
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query \
int qq; \
std::cin >> qq; \
rep(qqq, qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a), 0ll)
#define keta fixed << setprecision
#define vout(a) \
erep(qxqxqx, a) std::cout << qxqxqx << ' '; \
std::cout << std::endl;
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
#define case std::cout << "Case #" << qqq + 1 << ": "
#define res resize
#define as assign
#define ffor for (;;)
#define ppri(a, b) std::cout << a << " " << b << std::endl
#define pppri(a, b, c) std::cout << a << " " << b << " " << c << std::endl
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define ssum(a) accumulate(a, 0ll)
// typedef long long T;
ll ceil(ll a, ll b) { return ((a + b - 1) / b); }
const int INF = 2000000000;
const ll INF64 = 3223372036854775807ll;
// const ll INF64 = 9223372036854775807ll;
// const ll INF64 = 9223372036854775ll;
const ll MOD = 1000000007ll;
const dou pi = 3.141592653589793;
// tuple<hoge,huga,foo> tのget関数はget<i>(t)
// resizeはメンバ関数
int main() {
ll a, b;
std::cin >> a >> b;
ll ans = 0;
if (b - a <= 10) {
rrep(i, a, b + 1) { ans ^= i; }
} else {
rrep(i, a, b + 1) {
if (i % 4 == 0)
break;
ans ^= i;
}
irep(i, b + 1) {
if (i % 4 == 3)
break;
ans ^= i;
}
}
std::cout << ans << std::endl;
} | [
"expression.operation.binary.add"
] | 911,659 | 911,661 | u539011156 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(20);
// combination com(200010);
int a, b;
cin >> a >> b;
int now = 0;
if ((a + 1) / 2 % 2)
now++;
int now2 = 0;
if ((b + 1) / 2 % 2)
now2 = 1;
if (a % 2 == 0)
now ^= a;
if (b % 2 == 0)
now2 ^= b;
cout << (now ^ now2) << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(20);
// combination com(200010);
int a, b;
cin >> a >> b;
a--;
int now = 0;
if ((a + 1) / 2 % 2)
now++;
int now2 = 0;
if ((b + 1) / 2 % 2)
now2 = 1;
if (a % 2 == 0)
now ^= a;
if (b % 2 == 0)
now2 ^= b;
cout << (now ^ now2) << endl;
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 911,665 | 911,666 | u809967037 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
if (a == b + 1) {
ll ans = a ^ b;
cout << ans << endl;
return 0;
}
if (a == b) {
cout << a << endl;
return 0;
}
ll ans;
if (a % 2 == 0) {
ll cnt = 0;
if (b % 2 == 0) {
ll tmp = b - a;
cnt = tmp / 2;
cnt = cnt % 2;
ans = cnt ^ b;
cout << ans << endl;
} else {
ll tmp = b + 1 - a;
cnt = tmp / 2;
cnt = cnt % 2;
cout << cnt << endl;
}
} else {
ll cnt = 0;
ll tmp = 0;
if (b % 2 == 0) {
tmp = b - a - 1;
cnt = tmp / 2;
cnt %= 2;
ans = a ^ b ^ cnt;
cout << ans << endl;
} else {
tmp = b - a;
cnt = tmp / 2;
cnt %= 2;
ans = b ^ 3;
cout << ans << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
if (a == b + 1) {
ll ans = a ^ b;
cout << ans << endl;
return 0;
}
if (a == b) {
cout << a << endl;
return 0;
}
ll ans;
if (a % 2 == 0) {
ll cnt = 0;
if (b % 2 == 0) {
ll tmp = b - a;
cnt = tmp / 2;
cnt = cnt % 2;
ans = cnt ^ b;
cout << ans << endl;
} else {
ll tmp = b + 1 - a;
cnt = tmp / 2;
cnt = cnt % 2;
cout << cnt << endl;
}
} else {
ll cnt = 0;
ll tmp = 0;
if (b % 2 == 0) {
tmp = b - a - 1;
cnt = tmp / 2;
cnt %= 2;
ans = a ^ b ^ cnt;
cout << ans << endl;
} else {
tmp = b - a;
cnt = tmp / 2;
cnt %= 2;
ans = a ^ cnt;
cout << ans << endl;
}
}
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 911,667 | 911,668 | u144029820 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int64_t XORsum(int64_t n) {
int64_t v;
if (n % 2 == 0) {
v = (n % 4 > 0);
v += n;
} else {
v = !((n - 1) % 4);
}
cout << v << endl;
return v;
}
int main() {
int64_t A, B;
cin >> A >> B;
int64_t ans = XORsum(B);
ans ^= XORsum(max((int64_t)0, A - 1));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int64_t XORsum(int64_t n) {
int64_t v;
if (n % 2 == 0) {
v = (n % 4 > 0);
v += n;
} else {
v = !((n - 1) % 4);
}
cerr << v << endl;
return v;
}
int main() {
int64_t A, B;
cin >> A >> B;
int64_t ans = XORsum(B);
ans ^= XORsum(max((int64_t)0, A - 1));
cout << ans << endl;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 911,669 | 911,670 | u190679129 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, int> pli;
typedef pair<int, int> pii;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define qrep(que, ite) for (auto ite = begin(que); ite != end(que); ite++)
const int max_n = 1e5;
const ll mod = 1e9 + 7;
const ll INF = 1e17;
const int inf = 1e5;
typedef long double ld;
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;
}
ll gcd(ll a, ll b) { return a ? gcd(b % a, a) : b; }
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
ll mo = 998244353;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
struct SegmentTree {
int N;
vector<int> node;
public:
void intit(vector<int> v) {
int sz = v.size();
N = 1;
while (N < sz)
N *= 2;
node.resize(N);
for (int i = 0; i < sz; i++)
node[i + N - 1] = v[i];
for (int i = N - 2; i >= 0; i--)
node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
}
void update(int x, int val) {
x += N - 1;
node[x + N - 1] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[x * 2 + 1], node[x * 2 + 2]);
}
}
int getmin(int a, int b, int k, int l, int r) {
if (b <= l || r <= a)
return inf;
else if (a <= l && r <= b)
return node[k];
else {
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
}
};
ll func(ll k) {
ll res = 0;
switch (k % 4) {
case 0:
res = k;
break;
case 1:
res = 0;
break;
case 2:
res = k + 1;
break;
case 3:
res = 0;
break;
}
return res;
}
int main() {
ll a, b;
cin >> a >> b;
if (a != 0)
a--;
ll ans = func(a) ^ func(b);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, int> pli;
typedef pair<int, int> pii;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define qrep(que, ite) for (auto ite = begin(que); ite != end(que); ite++)
const int max_n = 1e5;
const ll mod = 1e9 + 7;
const ll INF = 1e17;
const int inf = 1e5;
typedef long double ld;
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;
}
ll gcd(ll a, ll b) { return a ? gcd(b % a, a) : b; }
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
ll mo = 998244353;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
struct SegmentTree {
int N;
vector<int> node;
public:
void intit(vector<int> v) {
int sz = v.size();
N = 1;
while (N < sz)
N *= 2;
node.resize(N);
for (int i = 0; i < sz; i++)
node[i + N - 1] = v[i];
for (int i = N - 2; i >= 0; i--)
node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
}
void update(int x, int val) {
x += N - 1;
node[x + N - 1] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[x * 2 + 1], node[x * 2 + 2]);
}
}
int getmin(int a, int b, int k, int l, int r) {
if (b <= l || r <= a)
return inf;
else if (a <= l && r <= b)
return node[k];
else {
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
}
};
ll func(ll k) {
ll res = 0;
switch (k % 4) {
case 0:
res = k;
break;
case 1:
res = 1LL;
break;
case 2:
res = k + 1;
break;
case 3:
res = 0;
break;
}
return res;
}
int main() {
ll a, b;
cin >> a >> b;
if (a != 0)
a--;
ll ans = func(a) ^ func(b);
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"literal.number.type.widen.change"
] | 911,675 | 911,676 | u363005934 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
typedef long long LL;
constexpr long long INFLL = 1e18;
using namespace std;
LL solve(LL temp) {
LL ans;
LL count;
LL x = 0;
count = temp / 2 + 1;
if (temp % 2) {
if (count % 2) {
ans = 1;
} else {
ans = 0;
}
} else {
count--;
ans = temp;
if (count % 2) {
ans++;
} else {
//処理なし
}
}
return ans;
}
int main() {
LL A, B;
cin >> A >> B;
if (A > 0) {
A = solve(A - 1);
}
bitset<64> bsA(solve(A));
bitset<64> bsB(solve(B));
cout << (bsA ^ bsB).to_ullong() << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
typedef long long LL;
constexpr long long INFLL = 1e18;
using namespace std;
LL solve(LL temp) {
LL ans;
LL count;
LL x = 0;
count = temp / 2 + 1;
if (temp % 2) {
if (count % 2) {
ans = 1;
} else {
ans = 0;
}
} else {
count--;
ans = temp;
if (count % 2) {
ans++;
} else {
//処理なし
}
}
return ans;
}
int main() {
LL A, B;
cin >> A >> B;
if (A > 0) {
A = solve(A - 1);
}
bitset<64> bsA(A);
bitset<64> bsB(solve(B));
// cout << bsA.to_ullong() << endl;
// cout << bsB.to_ullong() << endl;
cout << (bsA ^ bsB).to_ullong() << endl;
return 0;
} | [] | 911,679 | 911,680 | u648287428 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr long long INF = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
int ans = 0;
int bit = 0;
bit = (B + 1) / 2 - (A + 1) / 2;
if (bit % 2 == 0)
bit = 0;
else
bit == 1;
if (A % 2 == 0 && B % 2 == 1)
ans = bit;
else if (A == B)
ans = A;
else if (A % 2 == 0 && B % 2 == 0)
ans = B ^ bit;
else if (A % 2 == 1 && B % 2 == 1)
ans = A ^ bit;
else
ans = A ^ B ^ bit;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr long long INF = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
int ans = 0;
int bit = 0;
bit = (B + 1) / 2 - (A + 1) / 2;
if (bit % 2 == 0)
bit = 0;
else
bit = 1;
if (A % 2 == 0 && B % 2 == 1)
ans = bit;
else if (A == B)
ans = A;
else if (A % 2 == 0 && B % 2 == 0)
ans = B ^ bit;
else if (A % 2 == 1 && B % 2 == 1)
ans = A ^ bit;
else
ans = A ^ B ^ bit;
cout << ans << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 911,683 | 911,684 | u093973314 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
long long Asum, Bsum;
if (A % 2 == 1) {
Asum = (A / 2 + 1) % 2;
} else {
Asum = (A + 1 / 2 + 1) % 2;
Asum = Asum ^ (A + 1);
}
if (B % 2 == 1) {
Bsum = (B / 2 + 1) % 2;
} else {
Bsum = (B + 1 / 2 + 1) % 2;
Bsum = Bsum ^ (B + 1);
}
cout << ((Asum ^ Bsum) ^ A) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
long long Asum, Bsum;
if (A % 2 == 1) {
Asum = (A / 2 + 1) % 2;
} else {
Asum = ((A + 1) / 2 + 1) % 2;
Asum = Asum ^ (A + 1);
}
if (B % 2 == 1) {
Bsum = (B / 2 + 1) % 2;
} else {
Bsum = ((B + 1) / 2 + 1) % 2;
Bsum = Bsum ^ (B + 1);
}
cout << ((Asum ^ Bsum) ^ A) << endl;
} | [] | 911,697 | 911,698 | u924451152 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
ll sumXOR(ll x) {
ll n = (x + 1) / 2;
ll ans = n % 2;
if (x % 2 == 0)
ans ^= x;
return x;
}
int main() {
ll A, B;
cin >> A >> B;
ll ans = sumXOR(A - 1) ^ sumXOR(B);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
ll sumXOR(ll x) {
ll n = (x + 1) / 2;
ll ans = n % 2;
if (x % 2 == 0)
ans ^= x;
return ans;
}
int main() {
ll A, B;
cin >> A >> B;
ll ans = sumXOR(A - 1) ^ sumXOR(B);
// cout<<sumXOR(A-1)<<endl;
// cout<<sumXOR(B)<<endl;
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"function.return_value.change"
] | 911,709 | 911,710 | u591914971 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) for (long long i = 0; i < n; ++i)
#define REPP(i, m, n) for (long long i = m; i < n; ++i)
#define rep(i, n) for (long long i = n - 1; i >= 0; --i)
#define repp(i, n, m) for (long long i = n - 1; i >= m; --i)
#define ALL(N) (N.begin(), N.end())
#define de cout << "line : " << __LINE__ << " debug" << endl;
#define pb push_back
#define pq priority_queue
#define fi first
#define se second
#define Dcout(N) cout << setprecision(20) << N << endl
constexpr ll INF = 2147483647;
constexpr long long INFF = 9223372036854775807;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll ans = 0;
if (A % 2 == 1) {
A++;
ans ^= A - 1;
}
ll cnt = (B - A + 1) / 2;
if (cnt % 2 == 1)
ans = 1;
if ((B - A + 1) % 2 == 1) {
ans ^= B;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) for (long long i = 0; i < n; ++i)
#define REPP(i, m, n) for (long long i = m; i < n; ++i)
#define rep(i, n) for (long long i = n - 1; i >= 0; --i)
#define repp(i, n, m) for (long long i = n - 1; i >= m; --i)
#define ALL(N) (N.begin(), N.end())
#define de cout << "line : " << __LINE__ << " debug" << endl;
#define pb push_back
#define pq priority_queue
#define fi first
#define se second
#define Dcout(N) cout << setprecision(20) << N << endl
constexpr ll INF = 2147483647;
constexpr long long INFF = 9223372036854775807;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll ans = 0;
if (A % 2 == 1) {
A++;
ans ^= A - 1;
}
ll cnt = (B - A + 1) / 2;
if (cnt % 2 == 1)
ans ^= 1;
if ((B - A + 1) % 2 == 1) {
ans ^= B;
}
cout << ans << endl;
}
| [
"assignment.value.change"
] | 911,711 | 911,712 | u901397311 | cpp |
p03104 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
int gcd(int a, int b) {
if (!b) {
return a;
}
return gcd(b, a % b);
}
void init_comb() {
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r) {
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
int main() {
long long a, b;
std::cin >> a >> b;
if (a % 2 && b % 2) {
std::cout << (b ^ ((b - a) / 2 % 2)) << std::endl;
return 0;
}
if (a % 2) {
std::cout << (a ^ b ^ ((b - a - 1) / 2 % 2)) << std::endl;
return 0;
}
if (b % 2) {
std::cout << ((b - a + 1) / 2 % 2) << std::endl;
return 0;
}
std::cout << (b ^ ((b - a) / 2 % 2)) << std::endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
int gcd(int a, int b) {
if (!b) {
return a;
}
return gcd(b, a % b);
}
void init_comb() {
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r) {
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
int main() {
long long a, b;
std::cin >> a >> b;
if (a % 2 && b % 2) {
std::cout << (a ^ ((b - a) / 2 % 2)) << std::endl;
return 0;
}
if (a % 2) {
std::cout << (a ^ b ^ ((b - a - 1) / 2 % 2)) << std::endl;
return 0;
}
if (b % 2) {
std::cout << ((b - a + 1) / 2 % 2) << std::endl;
return 0;
}
std::cout << (b ^ ((b - a) / 2 % 2)) << std::endl;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 911,717 | 911,718 | u083910207 | cpp |
p03104 | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <bitset> // std::bitset<N>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream> // std::stringstream
#include <string>
using namespace std;
typedef long long ll;
ll solve(ll n) {
if (n % 2 == 0) {
if (n % 4 == 0)
return 0 ^ n;
else
return 1 ^ n;
} else {
if ((n + 1) % 4 == 0) {
ll a = (n - 1) ^ n;
return 0 ^ a;
} else {
ll b = (n - 1) ^ n;
return 1 ^ b;
}
}
}
int main(void) {
ll a, b;
cin >> a >> b;
ll ans = solve(b) ^ solve(a - 1);
cout << ans << endl;
} | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <bitset> // std::bitset<N>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream> // std::stringstream
#include <string>
using namespace std;
typedef long long ll;
ll solve(ll n) {
if (n % 2 == 0) {
if (n % 4 == 0)
return 0 ^ n;
else
return 1 ^ n;
} else {
if ((n - 1) % 4 == 0) {
ll a = (n - 1) ^ n;
return 0 ^ a;
} else {
ll b = (n - 1) ^ n;
return 1 ^ b;
}
}
}
int main(void) {
ll a, b;
cin >> a >> b;
ll ans = solve(b) ^ solve(a - 1);
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 911,727 | 911,728 | u247576416 | cpp |
p03104 | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <bitset> // std::bitset<N>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream> // std::stringstream
#include <string>
using namespace std;
typedef long long ll;
int solve(ll n) {
if (n % 2 == 0) {
if (n % 4 == 0)
return 0 ^ n;
else
return 1 ^ n;
} else {
if ((n + 1) % 4 == 0) {
ll a = (n - 1) ^ n;
return 0 ^ a;
} else {
ll b = (n - 1) ^ n;
return 1 ^ b;
}
}
}
int main(void) {
ll a, b;
cin >> a >> b;
int ans = solve(b) ^ solve(a - 1);
cout << ans << endl;
} | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <bitset> // std::bitset<N>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream> // std::stringstream
#include <string>
using namespace std;
typedef long long ll;
ll solve(ll n) {
if (n % 2 == 0) {
if (n % 4 == 0)
return 0 ^ n;
else
return 1 ^ n;
} else {
if ((n - 1) % 4 == 0) {
ll a = (n - 1) ^ n;
return 0 ^ a;
} else {
ll b = (n - 1) ^ n;
return 1 ^ b;
}
}
}
int main(void) {
ll a, b;
cin >> a >> b;
ll ans = solve(b) ^ solve(a - 1);
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 911,729 | 911,728 | u247576416 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <vector>
#define len(X) ((int)(X).size())
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#else
#define DBG(X)
#endif
using std::cin;
using std::cout;
using std::lower_bound;
using std::pair;
using std::sort;
using std::string;
using std::swap;
using std::unique;
using std::vector;
using int64 = long long int;
using pii = pair<int, int>;
using pii64 = pair<int64, int64>;
const int NIL = -1;
const int INF = (int)2e9;
const int64 INF64 = (int64)2e18;
void init_IO() {
std::ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
int64 get(int64 r) {
int64 rez = 0;
while ((r & 3) > 0) {
rez ^= r;
--r;
}
return rez;
}
void solve() {
int64 l, r;
cin >> l >> r;
int64 answ = get(r) ^ (l == 0 ? 0 : get(l - 1));
cout << answ << '\n';
}
int main() {
init_IO();
solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <vector>
#define len(X) ((int)(X).size())
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#else
#define DBG(X)
#endif
using std::cin;
using std::cout;
using std::lower_bound;
using std::pair;
using std::sort;
using std::string;
using std::swap;
using std::unique;
using std::vector;
using int64 = long long int;
using pii = pair<int, int>;
using pii64 = pair<int64, int64>;
const int NIL = -1;
const int INF = (int)2e9;
const int64 INF64 = (int64)2e18;
void init_IO() {
std::ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
int64 get(int64 r) {
int64 rez = 0;
while ((r & 3) != 3) {
rez ^= r;
--r;
}
return rez;
}
void solve() {
int64 l, r;
cin >> l >> r;
int64 answ = get(r) ^ (l == 0 ? 0 : get(l - 1));
cout << answ << '\n';
}
int main() {
init_IO();
solve();
return 0;
}
| [] | 911,730 | 911,731 | u146975530 | cpp |
p03104 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
lint f(lint a) {
if (a == 0)
return 0;
if (a == 1)
return 1;
if (a == 2)
return 3;
if (a == 3)
return 0;
int i;
for (i = 62; (a & (1LL << i)) == 0; i--)
;
return f(a - (1LL << i)) + (a % 2 == 0 ? (1LL << i) : 0);
}
int main() {
lint a, b;
cin >> a >> b;
cout << f(b) - (a > 0 ? f(a - 1) : 0) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
lint f(lint a) {
if (a == 0)
return 0;
if (a == 1)
return 1;
if (a == 2)
return 3;
if (a == 3)
return 0;
int i;
for (i = 62; (a & (1LL << i)) == 0; i--)
;
return f(a - (1LL << i)) + (a % 2 == 0 ? (1LL << i) : 0);
}
int main() {
lint a, b;
cin >> a >> b;
cout << (f(b) ^ (a > 0 ? f(a - 1) : 0)) << endl;
return 0;
}
| [
"io.output.change"
] | 911,732 | 911,733 | u781095600 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
constexpr double pi = 3.14159265358979;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
void solve() {
ll a, b;
cin >> a >> b;
ll x = 1, y = 1;
while (x <= a) {
x *= 2;
}
while (y * 2 <= b) {
y *= 2;
}
ll ans = x - a;
if (ans % 4 == 0)
ans = 0;
else if (ans % 4 == 1)
ans = a;
else if (ans % 4 == 2)
ans = 1;
else
ans = (x - 1) ^ 1;
ll cmp = b - y + 1;
if (cmp % 4 == 0)
cmp = 0;
else if (cmp % 4 == 1)
cmp = b;
else if (cmp % 4 == 2)
cmp = 1;
else
cmp = b ^ 1;
cout << (ans ^ cmp) << "\n";
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
constexpr double pi = 3.14159265358979;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
void solve() {
ll a, b;
cin >> a >> b;
ll x = 1, y = 1;
while (x <= a) {
x *= 2;
}
while (y * 2 <= b) {
y *= 2;
}
ll ans = x - a;
if (ans % 4 == 0)
ans = 0;
else if (ans % 4 == 1)
ans = a;
else if (ans % 4 == 2)
ans = 1;
else
ans = a ^ 1;
ll cmp = b - y + 1;
if (cmp % 4 == 0)
cmp = 0;
else if (cmp % 4 == 1)
cmp = b;
else if (cmp % 4 == 2)
cmp = 1;
else
cmp = b ^ 1;
cout << (ans ^ cmp) << "\n";
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
}
| [
"assignment.value.change",
"expression.operation.binary.change"
] | 911,739 | 911,740 | u698883164 | cpp |
p03104 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define stpr setprecision
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REP(i, a, b) for (ll i = (a); i < (b); ++i)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N) \
sort(A, A + N, \
[](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define endl '\n'
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ld EPS = 10e-8;
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &&x : v)
is >> x;
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
os << p.first << ' ' << p.second;
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = begin(v); i != end(v); ++i) {
if (i != begin(v))
os << ' ';
os << *i;
}
return os;
}
ll a, b, c = 0;
int main() {
ll A, B;
cin >> A >> B;
if (A % 4 == 0) {
a = 0;
}
if (A % 4 == 1) {
a = A - 1;
}
if (A % 4 == 2) {
a = 1;
}
if (A % 4 == 3) {
a = A;
}
if (B % 4 == 0) {
b = B;
}
if (B % 4 == 1) {
b = 1;
}
if (B % 4 == 2) {
b = B + 1;
}
if (B % 4 == 3) {
b = 0;
}
cout << c << endl;
} | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define stpr setprecision
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REP(i, a, b) for (ll i = (a); i < (b); ++i)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N) \
sort(A, A + N, \
[](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define endl '\n'
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ld EPS = 10e-8;
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &&x : v)
is >> x;
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
os << p.first << ' ' << p.second;
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = begin(v); i != end(v); ++i) {
if (i != begin(v))
os << ' ';
os << *i;
}
return os;
}
ll a, b, c = 0;
int main() {
ll A, B;
cin >> A >> B;
if (A % 4 == 0) {
a = 0;
}
if (A % 4 == 1) {
a = A - 1;
}
if (A % 4 == 2) {
a = 1;
}
if (A % 4 == 3) {
a = A;
}
if (B % 4 == 0) {
b = B;
}
if (B % 4 == 1) {
b = 1;
}
if (B % 4 == 2) {
b = B + 1;
}
if (B % 4 == 3) {
b = 0;
}
c = a ^ b;
cout << c << endl;
} | [
"assignment.add"
] | 911,741 | 911,742 | u008229752 | cpp |
p03104 | #include "stdio.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
using Pii = pair<int, int>;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const long long mod_const = 1e9 + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
using MIte = multimap<ll, ll, greater<ll>>::iterator;
// 2051
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// long long?
long long A, B;
cin >> A >> B;
if (A == B) {
cout << A << endl;
return 0;
}
const int limdigit = 50;
ll div = 1;
ll ans = 0;
for (int i = 0; i != limdigit; ++i) {
div *= 2;
ll A_sho = A / div;
ll A_ama = A % div;
ll B_sho = B / div;
ll B_ama = B % div;
if (div == 2) {
ll tmp = B_sho - A_sho;
tmp = (B_ama == 1) ? tmp + 1 : tmp;
ans = (tmp % 2 == 0) ? ans : ans + 1;
} else {
if (A_sho != B_sho) {
A_ama = (A_ama <= (div / 2)) ? div / 2 : div / 2 - A_ama;
B_ama = (B_ama < (div / 2)) ? 0 : B_ama - div / 2 + 1;
ll tmp = A_ama + B_ama;
ll add = (tmp % 2 == 0) ? 0 : 1;
ans += (add * div / 2);
} else {
ll tmp = (B_ama + 1 - div / 2 > 0) ? B_ama + 1 - div / 2 : 0;
tmp -= (A_ama + 1 - div / 2 > 0) ? A_ama + 1 - div / 2 : 0;
ll add = (tmp % 2 == 0) ? 0 : 1;
ans += (add * div / 2);
}
}
if (A_sho == 0 && B_sho == 0) {
break;
}
}
cout << ans << endl;
return 0;
} | #include "stdio.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
using Pii = pair<int, int>;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const long long mod_const = 1e9 + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
using MIte = multimap<ll, ll, greater<ll>>::iterator;
// 2051
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// long long?
long long A, B;
cin >> A >> B;
if (A == B) {
cout << A << endl;
return 0;
}
const int limdigit = 50;
ll div = 1;
ll ans = 0;
for (int i = 0; i != limdigit; ++i) {
div *= 2;
ll A_sho = A / div;
ll A_ama = A % div;
ll B_sho = B / div;
ll B_ama = B % div;
if (div == 2) {
ll tmp = B_sho - A_sho;
tmp = (B_ama == 1) ? tmp + 1 : tmp;
ans = (tmp % 2 == 0) ? ans : ans + 1;
} else {
if (A_sho != B_sho) {
A_ama = (A_ama <= (div / 2)) ? div / 2 : div / 2 - A_ama;
B_ama = (B_ama < (div / 2)) ? 0 : B_ama - div / 2 + 1;
ll tmp = A_ama + B_ama;
ll add = (tmp % 2 == 0) ? 0 : 1;
ans += (add * div / 2);
} else {
ll tmp = (B_ama + 1 - div / 2 > 0) ? B_ama + 1 - div / 2 : 0;
tmp -= (A_ama + 1 - div / 2 > 0) ? A_ama - div / 2 : 0;
ll add = (tmp % 2 == 0) ? 0 : 1;
ans += (add * div / 2);
}
}
if (A_sho == 0 && B_sho == 0) {
break;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 911,751 | 911,752 | u468440945 | cpp |
p03104 | #include "stdio.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
using Pii = pair<int, int>;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const long long mod_const = 1e9 + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
using MIte = multimap<ll, ll, greater<ll>>::iterator;
// 2051
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// long long?
long long A, B;
cin >> A >> B;
if (A == B) {
cout << A << endl;
return 0;
}
const int limdigit = 50;
ll div = 1;
ll ans = 0;
for (int i = 0; i != limdigit; ++i) {
div *= 2;
ll A_sho = A / div;
ll A_ama = A % div;
ll B_sho = B / div;
ll B_ama = B % div;
if (div == 2) {
ll tmp = B_sho - A_sho;
// tmp = (A_ama == 1) ? tmp + 1 : tmp;
tmp = (B_ama == 1) ? tmp + 1 : tmp;
ans = (tmp % 2 == 0) ? ans : ans + 1;
} else {
if (A_sho != B_sho) {
A_ama = (A_ama <= (div / 2)) ? div / 2 : div / 2 - A_ama;
B_ama = (B_ama < (div / 2)) ? 0 : B_ama - div / 2 + 1;
ll tmp = A_ama + B_ama;
int add = (tmp % 2 == 0) ? 0 : 1;
ans += (add * div / 2);
} else {
ll tmp = (B_ama + 1 - div / 2 > 0) ? B_ama + 1 - div / 2 : 0;
tmp -= (A_ama + 1 - div / 2 > 0) ? A_ama + 1 - div / 2 : 0;
int add = (tmp % 2 == 0) ? 0 : 1;
ans += (add * div / 2);
}
}
if (A_sho == 0 && B_sho == 0) {
break;
}
}
cout << ans << endl;
return 0;
} | #include "stdio.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
using Pii = pair<int, int>;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const long long mod_const = 1e9 + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
using MIte = multimap<ll, ll, greater<ll>>::iterator;
// 2051
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// long long?
long long A, B;
cin >> A >> B;
if (A == B) {
cout << A << endl;
return 0;
}
const int limdigit = 50;
ll div = 1;
ll ans = 0;
for (int i = 0; i != limdigit; ++i) {
div *= 2;
ll A_sho = A / div;
ll A_ama = A % div;
ll B_sho = B / div;
ll B_ama = B % div;
if (div == 2) {
ll tmp = B_sho - A_sho;
tmp = (B_ama == 1) ? tmp + 1 : tmp;
ans = (tmp % 2 == 0) ? ans : ans + 1;
} else {
if (A_sho != B_sho) {
A_ama = (A_ama <= (div / 2)) ? div / 2 : div / 2 - A_ama;
B_ama = (B_ama < (div / 2)) ? 0 : B_ama - div / 2 + 1;
ll tmp = A_ama + B_ama;
ll add = (tmp % 2 == 0) ? 0 : 1;
ans += (add * div / 2);
} else {
ll tmp = (B_ama + 1 - div / 2 > 0) ? B_ama + 1 - div / 2 : 0;
tmp -= (A_ama + 1 - div / 2 > 0) ? A_ama - div / 2 : 0;
ll add = (tmp % 2 == 0) ? 0 : 1;
ans += (add * div / 2);
}
}
if (A_sho == 0 && B_sho == 0) {
break;
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 911,753 | 911,752 | u468440945 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
ll a, b;
long long clcu(ll n) {
if (n % 4 == 0)
return n;
if (n % 4 == 1)
return 1;
if (n % 4 == 2)
return n + 1;
else
return 0;
}
int main() {
cin >> a >> b;
ll ans = clcu(b) - clcu(a - 1);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
ll a, b;
long long clcu(ll n) {
if (n % 4 == 0)
return n;
if (n % 4 == 1)
return 1;
if (n % 4 == 2)
return n + 1;
else
return 0;
}
int main() {
cin >> a >> b;
ll ans = clcu(b) ^ clcu(a - 1);
cout << ans << endl;
}
| [
"expression.operation.binary.change"
] | 911,754 | 911,755 | u342051078 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
int main() {
long A, B;
cin >> A >> B;
if (A == B) {
cout << B << endl;
} else if (A + 1 == B) {
cout << long(A ^ B) << endl;
} else {
if (A % 2 == 0) {
// A^(A+1)=1,(A+2)^(A+3)=1, ...
// 1^1=0,0^1=1
if (B % 2 == 0) {
if (((B - A) % 2) % 2 == 1) {
cout << long(1 ^ B) << endl;
} else {
cout << long(0 ^ B) << endl;
}
} else {
if (((B - A + 1) % 2) % 2 == 1) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
}
} else {
//(A+1)^(A+2)=1,(A+3)^(A+4)=1, ...
// 1^1=0,0^1=1
if (B % 2 == 0) {
if (((B - 1 - A) % 2) % 2 == 1) {
cout << long(A ^ 1 ^ B) << endl;
} else {
cout << long(A ^ 0 ^ B) << endl;
}
} else {
if (((B - A) % 2) % 2 == 1) {
cout << long(A ^ 1) << endl;
} else {
cout << long(A ^ 0) << endl;
}
}
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long A, B;
cin >> A >> B;
if (A == B) {
cout << B << endl;
} else if (A + 1 == B) {
cout << long(A ^ B) << endl;
} else {
if (A % 2 == 0) {
// A^(A+1)=1,(A+2)^(A+3)=1, ...
// 1^1=0,0^1=1
if (B % 2 == 0) {
if (((B - A) / 2) % 2 == 1) {
cout << long(1 ^ B) << endl;
} else {
cout << long(0 ^ B) << endl;
}
} else {
if (((B - A + 1) / 2) % 2 == 1) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
}
} else {
//(A+1)^(A+2)=1,(A+3)^(A+4)=1, ...
// 1^1=0,0^1=1
if (B % 2 == 0) {
if (((B - 1 - A) / 2) % 2 == 1) {
cout << long(A ^ 1 ^ B) << endl;
} else {
cout << long(A ^ 0 ^ B) << endl;
}
} else {
if (((B - A) / 2) % 2 == 1) {
cout << long(A ^ 1) << endl;
} else {
cout << long(A ^ 0) << endl;
}
}
}
}
return 0;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 911,772 | 911,773 | u837190376 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int a, b;
cin >> a >> b;
if (a % 2) {
if ((b - a + 1) % 4 == 0) {
cout << (a ^ b) << endl;
} else if ((b - a + 1) % 4 == 1) {
cout << a << endl;
} else if ((b - a + 1) % 4 == 2) {
cout << (a ^ b) << endl;
} else {
cout << (1 ^ a) << endl;
}
} else {
if ((b - a + 1) % 4 == 0) {
cout << 0 << endl;
} else if ((b - a + 1) % 4 == 1) {
cout << b << endl;
} else if ((b - a + 1) % 4 == 2) {
cout << 1 << endl;
} else {
cout << (1 ^ b) << endl;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll a, b;
cin >> a >> b;
if (a % 2) {
if ((b - a + 1) % 4 == 0) {
cout << (a ^ b ^ 1) << endl;
} else if ((b - a + 1) % 4 == 1) {
cout << a << endl;
} else if ((b - a + 1) % 4 == 2) {
cout << (a ^ b) << endl;
} else {
cout << (1 ^ a) << endl;
}
} else {
if ((b - a + 1) % 4 == 0) {
cout << 0 << endl;
} else if ((b - a + 1) % 4 == 1) {
cout << b << endl;
} else if ((b - a + 1) % 4 == 2) {
cout << 1 << endl;
} else {
cout << (1 ^ b) << endl;
}
}
return 0;
} | [
"variable_declaration.type.change"
] | 911,774 | 911,775 | u110336920 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll a, b;
cin >> a >> b;
if (a % 2) {
if ((b - a + 1) % 4 == 0) {
cout << (a ^ b) << endl;
} else if ((b - a + 1) % 4 == 1) {
cout << a << endl;
} else if ((b - a + 1) % 4 == 2) {
cout << (a ^ b) << endl;
} else {
cout << (1 ^ a) << endl;
}
} else {
if ((b - a + 1) % 4 == 0) {
cout << 0 << endl;
} else if ((b - a + 1) % 4 == 1) {
cout << b << endl;
} else if ((b - a + 1) % 4 == 2) {
cout << 1 << endl;
} else {
cout << (1 ^ b) << endl;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll a, b;
cin >> a >> b;
if (a % 2) {
if ((b - a + 1) % 4 == 0) {
cout << (a ^ b ^ 1) << endl;
} else if ((b - a + 1) % 4 == 1) {
cout << a << endl;
} else if ((b - a + 1) % 4 == 2) {
cout << (a ^ b) << endl;
} else {
cout << (1 ^ a) << endl;
}
} else {
if ((b - a + 1) % 4 == 0) {
cout << 0 << endl;
} else if ((b - a + 1) % 4 == 1) {
cout << b << endl;
} else if ((b - a + 1) % 4 == 2) {
cout << 1 << endl;
} else {
cout << (1 ^ b) << endl;
}
}
return 0;
} | [
"expression.operation.binary.add"
] | 911,776 | 911,775 | u110336920 | cpp |
p03104 | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long
using namespace std;
ll a, b, ans;
ll Xor(ll x) {
ll p = (x + 1) << 1, q = p & 1;
if ((x & 1) == 0)
q = q ^ x;
return q;
}
int main() {
fast;
cin >> a >> b;
ans = Xor(a - 1) ^ Xor(b);
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long
using namespace std;
ll a, b, ans;
ll Xor(ll x) {
ll p = (x + 1) >> 1, q = p & 1;
if ((x & 1) == 0)
q = q ^ x;
return q;
}
int main() {
fast;
cin >> a >> b;
ans = Xor(a - 1) ^ Xor(b);
cout << ans;
return 0;
} | [
"expression.operation.binary.change"
] | 911,779 | 911,780 | u560322763 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
*/
ll f(ll a) {
if (a % 4 == 0)
return a;
if (a % 4 == 1)
return (a ^ (a + 1));
if (a % 4 == 2)
return (a ^ (a + 1) ^ (a + 2));
if (a % 4 == 3)
return 0LL;
return 0LL;
}
int main() {
ll a, b;
cin >> a >> b;
if (a == 0)
cout << f(b) << endl;
else
cout << (f(b) ^ f(a - 1)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
*/
ll f(ll a) {
if (a % 4 == 0)
return a;
if (a % 4 == 1)
return (a ^ (a - 1));
if (a % 4 == 2)
return (a ^ (a - 1) ^ (a - 2));
if (a % 4 == 3)
return 0LL;
return 0LL;
}
int main() {
ll a, b;
cin >> a >> b;
if (a == 0)
cout << f(b) << endl;
else
cout << (f(b) ^ f(a - 1)) << endl;
// for(int i=0; i<12; i++) cout << f(i) << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 911,783 | 911,784 | u052332717 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll A, B;
cin >> A >> B;
ll ans = 0;
ll q = (B - A + 1) % 4;
if (A % 2 == 0 && B % 2 == 1) {
for (int i = 0; i < q; i++) {
ans ^= (A + i);
}
} else if (A % 2 == 0) {
if (q == 1)
ans ^= B;
else {
ans = (B - 2) ^ (B - 1) ^ B;
}
} else if (A % 2 == 1 && B % 2 == 0) {
if (q == 0)
ans = A ^ (B - 2) ^ (B - 1) ^ B;
else
ans = A ^ B;
} else {
if (q == 1)
ans = A;
else
q = A ^ (A + 1) ^ (A + 2);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll A, B;
cin >> A >> B;
ll ans = 0;
ll q = (B - A + 1) % 4;
if (A % 2 == 0 && B % 2 == 1) {
for (int i = 0; i < q; i++) {
ans ^= (A + i);
}
} else if (A % 2 == 0) {
if (q == 1)
ans ^= B;
else {
ans = (B - 2) ^ (B - 1) ^ B;
}
} else if (A % 2 == 1 && B % 2 == 0) {
if (q == 0)
ans = A ^ (B - 2) ^ (B - 1) ^ B;
else
ans = A ^ B;
} else {
if (q == 1)
ans = A;
else
ans = A ^ (A + 1) ^ (A + 2);
}
cout << ans << endl;
} | [
"assignment.variable.change",
"identifier.change"
] | 911,787 | 911,788 | u998251394 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll f(ll x) {
if (x < 0)
return 0LL;
if (x % 4 == 1)
return x;
if (x % 4 == 2)
return x + 1;
if (x % 4 == 3)
return 0;
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll a, b;
cin >> a >> b;
cout << (f(b) ^ f(a - 1));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll f(ll x) {
if (x < 0)
return 0LL;
if (x % 4 == 1)
return 1;
if (x % 4 == 2)
return x + 1;
if (x % 4 == 3)
return 0;
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll a, b;
cin >> a >> b;
cout << (f(b) ^ f(a - 1));
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 911,797 | 911,798 | u891061025 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll f(ll x) {
if (!x)
return 0LL;
if (x % 4 == 1)
return x;
if (x % 4 == 2)
return x + 1;
if (x % 4 == 3)
return 0;
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll a, b;
cin >> a >> b;
cout << (f(b) ^ f(a - 1));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll f(ll x) {
if (x < 0)
return 0LL;
if (x % 4 == 1)
return 1;
if (x % 4 == 2)
return x + 1;
if (x % 4 == 3)
return 0;
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll a, b;
cin >> a >> b;
cout << (f(b) ^ f(a - 1));
return 0;
}
| [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 911,799 | 911,798 | u891061025 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll res;
if (A % 2) {
if (B % 2) {
res = A ^ (((B - A) / 2) % 2);
} else {
res = A ^ B ^ (((B - A - 1) / 2) % 2);
}
} else {
if (B % 2) {
res = ((B - A) / 2) % 2;
} else {
res = B ^ (((B - A + 1) / 2) % 2);
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll res;
if (A % 2) {
if (B % 2) {
res = A ^ (((B - A) / 2) % 2);
} else {
res = A ^ B ^ (((B - A - 1) / 2) % 2);
}
} else {
if (B % 2) {
res = ((B - A + 1) / 2) % 2;
} else {
res = B ^ (((B - A) / 2) % 2);
}
}
cout << res << endl;
return 0;
} | [
"assignment.change",
"expression.operation.binary.remove"
] | 911,802 | 911,803 | u703503553 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int f(int n) {
n++;
switch (n % 4) {
case 0:
return 0;
case 1:
return n;
case 2:
return 1;
case 3:
return 1 ^ (n - 1);
}
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int A, B;
cin >> A >> B;
if (A == 0)
cout << f(B) << endl;
else
cout << (f(A - 1) ^ f(B)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int f(int n) {
n++;
switch (n % 4) {
case 0:
return 0;
case 1:
return (n - 1);
case 2:
return 1;
case 3:
return 1 ^ (n - 1);
}
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int A, B;
cin >> A >> B;
if (A == 0)
cout << f(B) << endl;
else
cout << (f(A - 1) ^ f(B)) << endl;
return 0;
} | [
"function.return_value.change"
] | 911,806 | 911,807 | u904833081 | cpp |
p03104 | // Created by sz
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long xor_sum(long long a) {
// xor sum: 0^1^2^...^a
if (a % 4 == 0)
return a;
if (a % 4 == 1)
return 1;
if (a % 4 == 2)
return a + 1;
return 0;
}
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << (xor_sum(a) ^ xor_sum(b - 1)) << endl;
return 0;
}
| // Created by sz
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long xor_sum(long long a) {
// xor sum: 0^1^2^...^a
if (a % 4 == 0)
return a;
if (a % 4 == 1)
return 1;
if (a % 4 == 2)
return a + 1;
return 0;
}
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
long long a, b;
cin >> a >> b;
cout << (xor_sum(a - 1) ^ xor_sum(b)) << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 911,825 | 911,824 | u041075929 | cpp |
p03104 | // Created by sz
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long xor_sum(long long a) {
// xor sum: 0^1^2^...^a
if (a % 4 == 0)
return a;
if (a % 4 == 1)
return 1;
if (a % 4 == 2)
return a + 1;
return 0;
}
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << (xor_sum(a) ^ xor_sum(b)) << endl;
return 0;
}
| // Created by sz
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long xor_sum(long long a) {
// xor sum: 0^1^2^...^a
if (a % 4 == 0)
return a;
if (a % 4 == 1)
return 1;
if (a % 4 == 2)
return a + 1;
return 0;
}
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
long long a, b;
cin >> a >> b;
cout << (xor_sum(a - 1) ^ xor_sum(b)) << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 911,826 | 911,824 | u041075929 | cpp |
p03104 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define PB push_back
#define MP make_pair
#define ff first
#define pri 1000000007
#define ss second
using namespace std;
ll f(ll a) {
if (a % 4 == 0)
return a;
if (a % 4 == 1)
return 1;
if (a % 4 == 2)
return a + 3;
if (a % 4 == 3)
return 0;
}
int main() {
ll n, m;
cin >> n >> m;
ll x = f(n - 1);
ll y = f(m);
cout << (x ^ y);
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define PB push_back
#define MP make_pair
#define ff first
#define pri 1000000007
#define ss second
using namespace std;
ll f(ll a) {
if (a % 4 == 0)
return a;
if (a % 4 == 1)
return 1;
if (a % 4 == 2)
return a + 1;
if (a % 4 == 3)
return 0;
}
int main() {
ll n, m;
cin >> n >> m;
ll x = f(n - 1);
ll y = f(m);
cout << (x ^ y);
} | [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 911,835 | 911,836 | u514586602 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
#define itn int
#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define sp system("pause")
#define queuel queue<long long>
#define matrix vector<vector<ll>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define rev(v) reverse(v.begin(), v.end());
#define mx(v) max_element(v.begin(), v.end())
#define mn(v) min_element(v.begin(), v.end())
#define dig(c) (c >= ' 0' && c <= '9') ? 1 : 0
#define sout(s, c) \
for (auto i : s) \
cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) \
for (ll i = 0; i < v.size(); i++) \
cin >> v[i];
#define vout(v, c) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << c;
#define pushi(v, a) \
for (int i = 0; i < a.size(); i++) \
v.push_back(a[i]);
#define sin(s, n) \
for (int i = 0; i < n; i++) { \
int a; \
cin >> a; \
s.insert(a); \
}
#define fastio() \
ios_base::sync_with_stdio(0); \
cout.tie(0); \
cin.tie(0);
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
/*▄███████▀▀▀▀▀▀███████▄
░▐████▀▒ЗАПУСКАЕМ▒▀██████▄
░███▀▒▒▒▒▒ДЯДЮ▒▒▒▒▒▒▀█████
░▐██▒▒▒▒▒▒БОГДАНА▒▒▒▒▒████▌
░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌
░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌
░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌
░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌
░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌
░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█
░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀
░░░░▄██████████████▒▒▐▌
░░░▀███▀▀████▀█████▀▒▌
░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐*/
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
const ll INF = 1000LL * 1000 * 1000 * 1000 * 1000 * 1000;
const int inf = 1000000000 + 228;
const ld PI = acos(-1.0);
const int mod7 = 1000000000 + 7;
const int mod9 = 1000000000 + 9;
const int MAXN = 200005;
const ld EPS = 1e-10;
const int N = 300228;
ll hp = 29;
signed main() {
fastio();
ll a, b;
cin >> a >> b;
if (a == b) {
cout << a;
return 0;
}
if (a % 2 == 0) {
cout << (b % 2 ? ((b - a) / 2 % 2) : (b ^ ((b - a) / 2 % 2)));
} else {
cout << (b % 2 ? a ^ ((b - a) / 2 % 2) : (a ^ b ^ ((b - a) / 2 % 2)));
}
// ssp;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
#define itn int
#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define sp system("pause")
#define queuel queue<long long>
#define matrix vector<vector<ll>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define rev(v) reverse(v.begin(), v.end());
#define mx(v) max_element(v.begin(), v.end())
#define mn(v) min_element(v.begin(), v.end())
#define dig(c) (c >= ' 0' && c <= '9') ? 1 : 0
#define sout(s, c) \
for (auto i : s) \
cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) \
for (ll i = 0; i < v.size(); i++) \
cin >> v[i];
#define vout(v, c) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << c;
#define pushi(v, a) \
for (int i = 0; i < a.size(); i++) \
v.push_back(a[i]);
#define sin(s, n) \
for (int i = 0; i < n; i++) { \
int a; \
cin >> a; \
s.insert(a); \
}
#define fastio() \
ios_base::sync_with_stdio(0); \
cout.tie(0); \
cin.tie(0);
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
/*▄███████▀▀▀▀▀▀███████▄
░▐████▀▒ЗАПУСКАЕМ▒▀██████▄
░███▀▒▒▒▒▒ДЯДЮ▒▒▒▒▒▒▀█████
░▐██▒▒▒▒▒▒БОГДАНА▒▒▒▒▒████▌
░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌
░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌
░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌
░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌
░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌
░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█
░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀
░░░░▄██████████████▒▒▐▌
░░░▀███▀▀████▀█████▀▒▌
░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐*/
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
const ll INF = 1000LL * 1000 * 1000 * 1000 * 1000 * 1000;
const int inf = 1000000000 + 228;
const ld PI = acos(-1.0);
const int mod7 = 1000000000 + 7;
const int mod9 = 1000000000 + 9;
const int MAXN = 200005;
const ld EPS = 1e-10;
const int N = 300228;
ll hp = 29;
signed main() {
fastio();
ll a, b;
cin >> a >> b;
if (a == b) {
cout << a;
return 0;
}
if (a % 2 == 0) {
cout << (b % 2 ? ((b - a + 1) / 2 % 2) : (b ^ ((b - a + 1) / 2 % 2)));
} else {
cout << (b % 2 ? a ^ ((b - a) / 2 % 2) : (a ^ b ^ ((b - a) / 2 % 2)));
}
// ssp;
}
| [
"expression.operation.binary.add"
] | 911,844 | 911,845 | u437722641 | cpp |
p03104 | #include <cmath>
#include <iostream>
using namespace std;
long long func(long long A, long long B) {
long long cA = A, cB = B;
int a[100], b[100];
int i = 0, j, k;
long long ans = 0;
while (cB != 0) {
i++;
b[i] = cB % 2;
cB = cB / 2;
}
k = i; // ketasuu
int c[k];
i = 0;
while (cA != 0) {
i++;
a[i] = cA % 2;
cA = cA / 2;
}
for (j = i + 1; j <= k; j++) {
a[j] = 0;
}
if (a[1] == 0 && b[1] == 1) {
if ((B - A) % 4 == 0)
return 1;
else
return 0;
} else if (a[1] == 0 && b[1] == 0) {
if ((B - A) % 4 == 0) {
return B;
} else {
return B + 1;
}
} else if (a[1] == 1 && b[1] == 1) {
if ((B - A) % 4 == 0) {
return A;
} else {
return A - 1;
}
} else {
if ((B - A - 1) % 4 == 0) {
for (i = 1; i <= k; i++) {
if (a[i] + b[i] == 1)
c[i] = 1;
else
c[i] = 0;
if (c[i])
ans += pow(2, i - 1);
}
return ans;
} else {
for (i = 1; i <= k; i++) {
if (a[i] + b[i] == 1)
c[i] = 1;
else
c[i] = 0;
if (c[i])
ans += pow(2, i - 1);
}
if (ans % 2 == 0)
return ans + 1;
else
return ans - 1;
}
}
return 0;
}
int main() {
long long A, B;
cin >> A >> B;
if (A == B)
cout << A << endl;
else
cout << func(A, B) << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
long long func(long long A, long long B) {
long long cA = A, cB = B;
int a[100], b[100];
int i = 0, j, k;
long long ans = 0;
while (cB != 0) {
i++;
b[i] = cB % 2;
cB = cB / 2;
}
k = i; // ketasuu
int c[k];
i = 0;
while (cA != 0) {
i++;
a[i] = cA % 2;
cA = cA / 2;
}
for (j = i + 1; j <= k; j++) {
a[j] = 0;
}
if (a[1] == 0 && b[1] == 1) {
if ((B - A - 1) % 4 == 0)
return 1;
else
return 0;
} else if (a[1] == 0 && b[1] == 0) {
if ((B - A) % 4 == 0) {
return B;
} else {
return B + 1;
}
} else if (a[1] == 1 && b[1] == 1) {
if ((B - A) % 4 == 0) {
return A;
} else {
return A - 1;
}
} else {
if ((B - A - 1) % 4 == 0) {
for (i = 1; i <= k; i++) {
if (a[i] + b[i] == 1)
c[i] = 1;
else
c[i] = 0;
if (c[i])
ans += pow(2, i - 1);
}
return ans;
} else {
for (i = 1; i <= k; i++) {
if (a[i] + b[i] == 1)
c[i] = 1;
else
c[i] = 0;
if (c[i])
ans += pow(2, i - 1);
}
if (ans % 2 == 0)
return ans + 1;
else
return ans - 1;
}
}
return 0;
}
int main() {
long long A, B;
cin >> A >> B;
if (A == B)
cout << A << endl;
else
cout << func(A, B) << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 911,852 | 911,853 | u839397805 | cpp |
p03104 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define MAX_V 100005
int main(void) {
ll a, b;
cin >> a >> b;
ll ans = 0;
if (a % 2 == 1) {
ans ^= a;
}
if (b % 2 == 0) {
ans ^= b;
}
a += 4 * (ll)((b - a) / 4);
while (a != b + 1) {
ans ^= a % 2;
a++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define MAX_V 100005
int main(void) {
ll a, b;
cin >> a >> b;
ll ans = 0;
if (a % 2 == 1) {
ans ^= a;
ans ^= 1;
}
if (b % 2 == 0) {
ans ^= b;
}
a += 4 * (ll)((b - a) / 4);
while (a != b + 1) {
ans ^= a % 2;
a++;
}
cout << ans << endl;
return 0;
} | [
"assignment.add"
] | 911,866 | 911,867 | u838742270 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1e9
#define LINF 1e18
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<int, P> Pi;
typedef pair<P, P> PP;
const int MOD = 1e9 + 7;
const int dy[] = {0, 0, 1, -1};
const int dx[] = {1, -1, 0, 0};
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
int res;
if (A % 2) {
if ((B - A) / 2 % 2) {
if (B % 2)
res = A ^ 1;
else
res = A ^ B ^ 1;
} else {
if (B % 2)
res = A;
else
res = A ^ B;
}
} else {
if ((B - A) / 2 % 2) {
if (B % 2)
res = 1;
else
res = B ^ 1;
} else {
if (B % 2)
res = 0;
else
res = B;
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1e9
#define LINF 1e18
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<int, P> Pi;
typedef pair<P, P> PP;
const int MOD = 1e9 + 7;
const int dy[] = {0, 0, 1, -1};
const int dx[] = {1, -1, 0, 0};
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
int res;
if (A % 2) {
if ((B - A) / 2 % 2) {
if (B % 2)
res = A ^ 1;
else
res = A ^ B ^ 1;
} else {
if (B % 2)
res = A;
else
res = A ^ B;
}
} else {
if ((B - A + 1) / 2 % 2) {
if (B % 2)
res = 1;
else
res = B ^ 1;
} else {
if (B % 2)
res = 0;
else
res = B;
}
}
cout << res << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 911,879 | 911,880 | u292929213 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
int main(void) {
cout << std::fixed << std::setprecision(10);
cin.tie(0);
std::ios::sync_with_stdio(false);
int64_t a, b;
cin >> a >> b;
int64_t maxbit = 1;
while (b >= std::pow(2, maxbit)) {
maxbit++;
}
// cout << maxbit << endl;
std::bitset<64> bit;
// i=0
if (a % 2 == 0 & b % 2 == 0) {
if (((b - a) / 2) % 2 == 0)
bit[0] = false;
else
bit[0] = true;
} else if (a % 2 == 1 && b % 2 == 1) {
if (((b - a) / 2) % 2 == 0)
bit[0] = true;
else
bit[0] = false;
} else if (a % 2 == 0 && b % 2 == 1) {
if (((b - 1 - a) / 2) % 2 == 0)
bit[0] = true;
else
bit[0] = false;
} else {
if (((b + 1 - a) / 2) % 2 == 0)
bit[0] = false;
else
bit[0] = true;
}
cerr << "bit0 is " << ((bit[0]) ? "true" : "false") << endl;
for (int64_t i = 1; i < maxbit; i++) {
cerr << "=======" << endl;
cerr << i << endl;
int64_t cycle = std::pow(2, i + 1);
if (a / cycle != b / cycle) {
int64_t remainder_begin = 0;
int64_t remainder_end = 0;
remainder_begin = (a % cycle == 0) ? 0 : cycle - (a % cycle);
remainder_end = (b % cycle) + 1 == cycle ? 0 : (b % cycle) + 1;
cerr << remainder_begin << " " << remainder_end << endl;
int64_t count = 0;
count += std::min(remainder_begin, cycle / 2);
count += std::max(remainder_end - cycle / 2, (int64_t)0);
cerr << count << endl;
if (count % 2 == 0) {
bit[i] = false;
} else {
bit[i] = true;
}
} else {
cerr << "Same Cycle" << endl;
int64_t ma = (a % cycle) + 1;
int64_t mb = (b % cycle) + 1;
if (ma > mb)
std::swap(ma, mb);
if (mb <= cycle / 2) {
cout << 0 << endl;
bit[i] = false;
} else {
int64_t lower_limit = std::max(ma, cycle / 2 + 1);
int64_t count = mb - lower_limit + 1;
cerr << count << endl;
if (count % 2 == 0) {
bit[i] = false;
} else {
bit[i] = true;
}
}
}
}
cout << bit.to_ullong() << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
int main(void) {
cout << std::fixed << std::setprecision(10);
cin.tie(0);
std::ios::sync_with_stdio(false);
int64_t a, b;
cin >> a >> b;
int64_t maxbit = 1;
while (b >= std::pow(2, maxbit)) {
maxbit++;
}
// cout << maxbit << endl;
std::bitset<64> bit;
// i=0
if (a % 2 == 0 & b % 2 == 0) {
if (((b - a) / 2) % 2 == 0)
bit[0] = false;
else
bit[0] = true;
} else if (a % 2 == 1 && b % 2 == 1) {
if (((b - a) / 2) % 2 == 0)
bit[0] = true;
else
bit[0] = false;
} else if (a % 2 == 0 && b % 2 == 1) {
if (((b - 1 - a) / 2) % 2 == 0)
bit[0] = true;
else
bit[0] = false;
} else {
if (((b + 1 - a) / 2) % 2 == 0)
bit[0] = false;
else
bit[0] = true;
}
cerr << "bit0 is " << ((bit[0]) ? "true" : "false") << endl;
for (int64_t i = 1; i < maxbit; i++) {
cerr << "=======" << endl;
cerr << i << endl;
int64_t cycle = std::pow(2, i + 1);
if (a / cycle != b / cycle) {
int64_t remainder_begin = 0;
int64_t remainder_end = 0;
remainder_begin = (a % cycle == 0) ? 0 : cycle - (a % cycle);
remainder_end = (b % cycle) + 1 == cycle ? 0 : (b % cycle) + 1;
cerr << remainder_begin << " " << remainder_end << endl;
int64_t count = 0;
count += std::min(remainder_begin, cycle / 2);
count += std::max(remainder_end - cycle / 2, (int64_t)0);
cerr << count << endl;
if (count % 2 == 0) {
bit[i] = false;
} else {
bit[i] = true;
}
} else {
cerr << "Same Cycle" << endl;
int64_t ma = (a % cycle) + 1;
int64_t mb = (b % cycle) + 1;
if (ma > mb)
std::swap(ma, mb);
if (mb <= cycle / 2) {
cerr << 0 << endl;
bit[i] = false;
} else {
int64_t lower_limit = std::max(ma, cycle / 2 + 1);
int64_t count = mb - lower_limit + 1;
cerr << count << endl;
if (count % 2 == 0) {
bit[i] = false;
} else {
bit[i] = true;
}
}
}
}
cout << bit.to_ullong() << endl;
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 911,884 | 911,885 | u844133200 | cpp |
p03104 |
#include <iostream>
using namespace std;
int main() {
long long A, B;
long long ans = 0;
cin >> A >> B;
if (A % 2) {
ans ^= A - 1;
}
while ((B - A + 1) % 4 != 0) {
ans ^= B + 1;
B++;
}
cout << ans;
}
|
#include <iostream>
using namespace std;
int main() {
long long A, B;
long long ans = 0;
cin >> A >> B;
if (A % 2) {
ans ^= A - 1;
A--;
}
while ((B - A + 1) % 4 != 0) {
ans ^= B + 1;
B++;
}
cout << ans;
}
| [
"expression.unary.arithmetic.add"
] | 911,892 | 911,893 | u913048763 | cpp |
p03104 | //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll XOR(ll a, ll b);
int main() {
ll A, B;
cin >> A >> B;
int res = (B - A) % 4;
if (A == B) {
cout << A << endl;
} else if (A % 2 == 0) {
switch (res) {
case 0:
cout << B << endl;
break;
case 1:
cout << 1 << endl;
break;
case 2:
cout << B + 1 << endl;
break;
case 3:
cout << 0 << endl;
break;
default:
break;
}
} else if (A % 2 == 1) {
switch (res) {
case 0:
cout << A << endl;
break;
case 1:
cout << XOR(A, B) << endl;
break;
case 2:
cout << A << endl;
break;
case 3:
cout << XOR(A, B) - 1 << endl;
break;
default:
break;
}
}
return 0;
}
ll XOR(ll a, ll b) {
ll ans = 0;
ll mod;
ll x = 0, y = 0;
for (int i = 0; i <= max(log2(a) + 1, log2(b)); i++) {
x = 0;
y = 0;
mod = pow(2, i + 1);
if (a % mod != 0) {
x = 1;
a -= mod / 2;
}
if (b % mod != 0) {
y = 1;
b -= mod / 2;
}
ans += (mod / 2) * ((x | y) - (x & y));
}
return ans;
}
| //
// main.cpp
// CoderTest
//
// Created by yuya on 2019/07/25.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll XOR(ll a, ll b);
int main() {
ll A, B;
cin >> A >> B;
int res = (B - A) % 4;
if (A == B) {
cout << A << endl;
} else if (A % 2 == 0) {
switch (res) {
case 0:
cout << B << endl;
break;
case 1:
cout << 1 << endl;
break;
case 2:
cout << B + 1 << endl;
break;
case 3:
cout << 0 << endl;
break;
default:
break;
}
} else if (A % 2 == 1) {
switch (res) {
case 0:
cout << A << endl;
break;
case 1:
cout << XOR(A, B) << endl;
break;
case 2:
cout << A - 1 << endl;
break;
case 3:
cout << XOR(A, B) - 1 << endl;
break;
default:
break;
}
}
return 0;
}
ll XOR(ll a, ll b) {
ll ans = 0;
ll mod;
ll x = 0, y = 0;
for (int i = 0; i <= max(log2(a) + 1, log2(b)); i++) {
x = 0;
y = 0;
mod = pow(2, i + 1);
if (a % mod != 0) {
x = 1;
a -= mod / 2;
}
if (b % mod != 0) {
y = 1;
b -= mod / 2;
}
ans += (mod / 2) * ((x | y) - (x & y));
}
return ans;
}
| [
"expression.operation.binary.add"
] | 911,910 | 911,911 | u422769833 | cpp |
p03104 | // https://atcoder.jp/contests/abc121/tasks/abc121_d
// D - XOR World
// XORは結合と交換が成り立つ
//各位の結果は独立
//各位の値は周期的 -> 剰余でいい感じ -> もっといい感じにできる
//(logN)^2くらい？
// f(A,B) = f(0,A-1)^f(0,B)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b;
ll f0(ll num) {
if (num <= 0)
return 0;
int edge = num % 2;
string res = to_string((num + 1) % 4 <= 2);
num >>= 1;
while (num) {
if (num & 1 && !edge)
res += "1";
else
res += "0";
num >>= 1;
}
reverse(res.begin(), res.end());
return stoll(res, NULL, 2);
}
int main() {
cin >> a >> b;
ll res = f0(a - 1) ^ f0(b);
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b;
ll f0(ll num) {
if (num <= 0)
return 0;
int edge = num % 2;
string res = to_string((num + 1) % 4 >= 2);
num >>= 1;
while (num) {
if (num & 1 && !edge)
res += "1";
else
res += "0";
num >>= 1;
}
reverse(res.begin(), res.end());
return stoll(res, NULL, 2);
}
int main() {
cin >> a >> b;
ll res = f0(a - 1) ^ f0(b);
cout << res << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 911,920 | 911,919 | u877476774 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define el '\n'
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
a--;
ll tes = (a + 3) % 4;
if (tes == 1)
a = 1;
else if (tes == 2)
a++;
else if (tes == 3)
a = 0;
tes = (b + 3) % 4;
if (tes == 1)
b = 1;
else if (tes == 2)
b++;
else if (tes == 3)
b = 0;
cout << (a ^ b) << el;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define el '\n'
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
a--;
ll tes = (a + 4) % 4;
if (tes == 1)
a = 1;
else if (tes == 2)
a++;
else if (tes == 3)
a = 0;
tes = (b + 4) % 4;
if (tes == 1)
b = 1;
else if (tes == 2)
b++;
else if (tes == 3)
b = 0;
cout << (a ^ b) << el;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 911,925 | 911,926 | u420202803 | cpp |
p03104 | #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
int n, m;
n = a % 4;
m = (b + 1) % 4;
long long c = 0;
for (int i = 0; i < n; i++) {
c = c ^ (a + i);
}
for (int i = 0; i < m; i++) {
c = c ^ (b - i);
}
cout << c << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
int n, m;
n = a % 4;
m = (b + 1) % 4;
long long c = 0;
for (int i = 0; i < (4 - n); i++) {
c = c ^ (a + i);
}
for (int i = 0; i < m; i++) {
c = c ^ (b - i);
}
cout << c << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 911,929 | 911,930 | u102334466 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int main(void) {
ll a, b;
cin >> a >> b;
ll ans;
if (a % 2 == 0) {
if (b % 2 == 0)
ans = b + ((b - a) / 2 % 2);
else
ans = (b + 1 - a) / 2 % 2;
} else {
if (b % 2 == 0) {
ans = b ^ a ^ ((b - a - 1) / 2 % 2);
} else
ans = b ^ ((b + 1 - a - 1) / 2 % 2);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int main(void) {
ll a, b;
cin >> a >> b;
ll ans;
if (a % 2 == 0) {
if (b % 2 == 0)
ans = b + ((b - a) / 2 % 2);
else
ans = (b + 1 - a) / 2 % 2;
} else {
if (b % 2 == 0) {
ans = b ^ a ^ ((b - a - 1) / 2 % 2);
} else
ans = a ^ ((b + 1 - a - 1) / 2 % 2);
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 911,931 | 911,932 | u582848517 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int main(void) {
ll a, b;
cin >> a >> b;
ll ans;
if (a % 2 == 0) {
if (b % 2 == 0)
ans = b + ((b - a) / 2 % 2);
else
ans = (b + 1 - a) / 2 % 2;
} else {
if (b % 2 == 0) {
ans = b ^ a ^ ((b - a - 1) / 2 % 2);
} else
ans = b ^ ((b + 1 - a + 1) / 2 % 2);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int main(void) {
ll a, b;
cin >> a >> b;
ll ans;
if (a % 2 == 0) {
if (b % 2 == 0)
ans = b + ((b - a) / 2 % 2);
else
ans = (b + 1 - a) / 2 % 2;
} else {
if (b % 2 == 0) {
ans = b ^ a ^ ((b - a - 1) / 2 % 2);
} else
ans = a ^ ((b + 1 - a - 1) / 2 % 2);
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 911,933 | 911,932 | u582848517 | cpp |
p03104 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
using namespace std;
typedef long long ll;
ll f(ll a) {
ll n = (a + 1) / 2;
ll x = (n & 1) ? 1 : 0;
x ^= (a & 1) ? 0 : 1;
return x;
}
int main() {
ll a, b;
cin >> a >> b;
cout << (f(a - 1) ^ f(b)) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
using namespace std;
typedef long long ll;
ll f(ll a) {
ll n = (a + 1) / 2;
ll x = (n & 1) ? 1 : 0;
x ^= (a & 1) ? 0 : a;
return x;
}
int main() {
ll a, b;
cin >> a >> b;
cout << (f(a - 1) ^ f(b)) << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove"
] | 911,942 | 911,943 | u685009987 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typedef vector<int> vi;
typedef vector<ll> vl;
const int inf = numeric_limits<int>::max() >> 2;
const ll linf = numeric_limits<ll>::max() >> 2;
const ull ulinf = numeric_limits<ull>::max() >> 2;
const double pi = acos(-1);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dx8[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int dy8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
#define p_queue(i) priority_queue<i>
#define rp_queue(i) priority_queue<i, vector<i>, greater<i>>
#define umap(i, j) unordered_map<i, j>
#define P(p) cout << (p) << endl
#define PS(p) cout << (p) << " "
#define IN cin >>
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (int i = (m - 1); i >= (int)(n); i--)
#define inrep(n, a) \
for (int i = 0; i < (int)(n); i++) \
cin >> a[i];
#define mod(i) ((i) % (ll)(1e9 + 7))
#define divm(a, b) (mod(a * modpow((ll)b, (ll)(1e9 + 5))))
#define rsort(a, b, c) sort(a, b, greater<c>())
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.end(), v.begin());
#define ft first
#define sd second
#define pb push_back
#define it insert
#define sz(x) ((int)(x).size())
#define lb(a, n, k) (lower_bound(a, a + n, k) - a)
#define vlb(a, k) (lower_bound(a.begin(), a.end(), k) - a.begin())
#define ub(a, n, k) (upper_bound(a, a + n, k) - a)
#define vub(a, k) (upper_bound(a.begin(), a.end(), k) - a.begin())
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define ret return
ll modpow(ll i, ll j) {
ll tmp = 1;
while (j) {
if (j % 2)
tmp = mod(tmp * i);
i = mod(i * i);
j /= 2;
}
return tmp;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
vector<string> split(const string &str, char sep) {
vector<string> v;
stringstream ss(str);
string buffer;
while (getline(ss, buffer, sep)) {
v.push_back(buffer);
}
return v;
}
// ll ncr[100][100];
// ll nCr(int n, int r){if(n==r) ret ncr[n][r] = 1; if(r==0) ret ncr[n][r] = 1;
// if(r==1) ret ncr[n][r] = n;if(ncr[n][r]) ret ncr[n][r]; ret ncr[n][r] =
// nCr(n-1,r) + nCr(n-1,r-1);}
// ll npr[100][100]={};
// ll nPr(int n,int r){if(npr[n][r])ret npr[n][r];if(r==0)ret npr[n][r] =
// 1;if(r==1)ret npr[n][r] = n;ret npr[n][r] = n * nPr(n-1,r-1);}
// ll nHr(int n,int r){ret nCr(n+r-1,r);}
///////////////////////////////////////////////////////////////////////////
int main() {
ll a, b;
cin >> a >> b;
ll ans = 0;
if (a == b) {
P(a);
ret 0;
}
b++;
ll c = 2;
rep(i, 0, 63) {
ll l = a / c * (c / 2) + max(a % c - c / 2, 0LL);
ll r = b / c * (c / 2) + max(b % c - c / 2, 0LL);
if ((r - l) & 1)
ans += 1LL << i;
c *= 2;
// if(c > b)break;
}
P(ans);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typedef vector<int> vi;
typedef vector<ll> vl;
const int inf = numeric_limits<int>::max() >> 2;
const ll linf = numeric_limits<ll>::max() >> 2;
const ull ulinf = numeric_limits<ull>::max() >> 2;
const double pi = acos(-1);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dx8[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int dy8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
#define p_queue(i) priority_queue<i>
#define rp_queue(i) priority_queue<i, vector<i>, greater<i>>
#define umap(i, j) unordered_map<i, j>
#define P(p) cout << (p) << endl
#define PS(p) cout << (p) << " "
#define IN cin >>
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (int i = (m - 1); i >= (int)(n); i--)
#define inrep(n, a) \
for (int i = 0; i < (int)(n); i++) \
cin >> a[i];
#define mod(i) ((i) % (ll)(1e9 + 7))
#define divm(a, b) (mod(a * modpow((ll)b, (ll)(1e9 + 5))))
#define rsort(a, b, c) sort(a, b, greater<c>())
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.end(), v.begin());
#define ft first
#define sd second
#define pb push_back
#define it insert
#define sz(x) ((int)(x).size())
#define lb(a, n, k) (lower_bound(a, a + n, k) - a)
#define vlb(a, k) (lower_bound(a.begin(), a.end(), k) - a.begin())
#define ub(a, n, k) (upper_bound(a, a + n, k) - a)
#define vub(a, k) (upper_bound(a.begin(), a.end(), k) - a.begin())
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define ret return
ll modpow(ll i, ll j) {
ll tmp = 1;
while (j) {
if (j % 2)
tmp = mod(tmp * i);
i = mod(i * i);
j /= 2;
}
return tmp;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
vector<string> split(const string &str, char sep) {
vector<string> v;
stringstream ss(str);
string buffer;
while (getline(ss, buffer, sep)) {
v.push_back(buffer);
}
return v;
}
// ll ncr[100][100];
// ll nCr(int n, int r){if(n==r) ret ncr[n][r] = 1; if(r==0) ret ncr[n][r] = 1;
// if(r==1) ret ncr[n][r] = n;if(ncr[n][r]) ret ncr[n][r]; ret ncr[n][r] =
// nCr(n-1,r) + nCr(n-1,r-1);}
// ll npr[100][100]={};
// ll nPr(int n,int r){if(npr[n][r])ret npr[n][r];if(r==0)ret npr[n][r] =
// 1;if(r==1)ret npr[n][r] = n;ret npr[n][r] = n * nPr(n-1,r-1);}
// ll nHr(int n,int r){ret nCr(n+r-1,r);}
///////////////////////////////////////////////////////////////////////////
int main() {
ll a, b;
cin >> a >> b;
ll ans = 0;
if (a == b) {
P(a);
ret 0;
}
b++;
ll c = 2;
rep(i, 0, 60) {
ll l = a / c * (c / 2) + max(a % c - c / 2, 0LL);
ll r = b / c * (c / 2) + max(b % c - c / 2, 0LL);
if ((r - l) & 1)
ans += 1LL << i;
c *= 2;
// if(c > b)break;
}
P(ans);
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 911,946 | 911,947 | u254521846 | cpp |
p03104 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long ret(vector<bool> da) { // 2進法を変換
long long ans = 0, x = 1;
for (int i = 0; i < 40; i++) {
if (da[i])
ans += x;
x *= 2;
}
return ans;
}
vector<bool> mak(long long n) { // 2進法に変換
vector<bool> ans(40);
for (int i = 0; i < 40; i++) {
if (n % 2)
ans[i] = true;
else
ans[i] = false;
n /= 2;
}
return ans;
}
void su(vector<bool> &da) {
bool x = (da[0] && !da[1]) || (!da[0] && da[1]);
if (da[0]) {
for (int i = 1; i < 40; i++) {
da[i] = false;
}
}
da[0] = x;
}
void ref(vector<bool> da) { // input
bool x = false;
for (int i = 39; i > -1; i--) {
if (da[i])
x = true;
if (x) {
if (da[i])
cout << 1;
else
cout << 0;
}
}
cout << endl;
}
int main() {
long long a, b, g;
cin >> a >> b;
vector<bool> A(40, false), B(40, false), ans(40, false);
if (a % 4 == 1) {
A = mak(a - 1);
} else if (a % 4 == 2)
A[0] = true;
else if (a % 4 == 3) {
A = mak(a);
}
if (b % 4 == 0) {
B = mak(b);
} else if (b % 4 == 1)
B[0] = true;
else if (b % 4 == 2) {
B = mak(b);
}
for (int i = 0; i < 40; i++) {
ans[i] = A[i] ^ B[i];
}
cout << ret(ans) << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long ret(vector<bool> da) { // 2進法を変換
long long ans = 0, x = 1;
for (int i = 0; i < 40; i++) {
if (da[i])
ans += x;
x *= 2;
}
return ans;
}
vector<bool> mak(long long n) { // 2進法に変換
vector<bool> ans(40);
for (int i = 0; i < 40; i++) {
if (n % 2)
ans[i] = true;
else
ans[i] = false;
n /= 2;
}
return ans;
}
void su(vector<bool> &da) {
bool x = (da[0] && !da[1]) || (!da[0] && da[1]);
if (da[0]) {
for (int i = 1; i < 40; i++) {
da[i] = false;
}
}
da[0] = x;
}
void ref(vector<bool> da) { // input
bool x = false;
for (int i = 39; i > -1; i--) {
if (da[i])
x = true;
if (x) {
if (da[i])
cout << 1;
else
cout << 0;
}
}
cout << endl;
}
int main() {
long long a, b, g;
cin >> a >> b;
vector<bool> A(40, false), B(40, false), ans(40, false);
if (a % 4 == 1) {
A = mak(a - 1);
} else if (a % 4 == 2)
A[0] = true;
else if (a % 4 == 3) {
A = mak(a);
}
if (b % 4 == 0) {
B = mak(b);
} else if (b % 4 == 1)
B[0] = true;
else if (b % 4 == 2) {
B = mak(b + 1);
}
for (int i = 0; i < 40; i++) {
ans[i] = A[i] ^ B[i];
}
cout << ret(ans) << endl;
}
| [
"assignment.change"
] | 911,950 | 911,951 | u057079894 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return (true);
} else {
return (false);
}
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return (true);
} else {
return (false);
}
}
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Pll = pair<ll, ll>;
using Pull = pair<ull, ull>;
#define eb emplace_back
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)((n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = (int)((n)); i > 0; --i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define MOD (1e9 + 7)
int main() {
ll A, B;
cin >> A >> B;
// a ^ ( a + 1 ) == 1を利用する
// また、a ^ a = 0から、F( A, B ) = F( 0, A - 1) ^ F( 0, B )である
// -> ( 0 ^ 1 ^ 2 ^ ... (A - 1) ) ^ ( 0 ^ 1 ^ 2 ^ ... (A - 1) ^ A ^ ... B )
// となるので、 ( 0 ^ 0 ) ^ ( 1 ^ 1 ) ^ ... となり、(A-1)までは全て0となる
ll rA = ((A / 2) % 2);
if (A % 2) {
// 最大の偶数が残る
rA ^= (A - 1);
}
ll rB = ((B / 2) % 2);
if ((B % 2) == 0) {
rB ^= B;
}
cout << (rA ^ rB) << endl;
return (0);
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return (true);
} else {
return (false);
}
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return (true);
} else {
return (false);
}
}
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Pll = pair<ll, ll>;
using Pull = pair<ull, ull>;
#define eb emplace_back
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)((n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = (int)((n)); i > 0; --i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define MOD (1e9 + 7)
int main() {
ll A, B;
cin >> A >> B;
// a ^ ( a + 1 ) == 1を利用する
// また、a ^ a = 0から、F( A, B ) = F( 0, A - 1) ^ F( 0, B )である
// -> ( 0 ^ 1 ^ 2 ^ ... (A - 1) ) ^ ( 0 ^ 1 ^ 2 ^ ... (A - 1) ^ A ^ ... B )
// となるので、 ( 0 ^ 0 ) ^ ( 1 ^ 1 ) ^ ... となり、(A-1)までは全て0となる
ll rA = ((A / 2) % 2);
if (A % 2) {
// 最大の偶数が残る
rA ^= (A - 1);
}
ll rB = (((B + 1) / 2) % 2);
if ((B % 2) == 0) {
rB ^= B;
}
cout << (rA ^ rB) << endl;
return (0);
}
| [] | 911,960 | 911,961 | u408910484 | cpp |
p03104 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int cnt;
int ans;
if (a % 2 == 1) {
if (b % 2 == 0) {
cnt += (b - a - 1) / 2;
(cnt % 2 == 0 ? ans = a ^ b : ans = a ^ b ^ 1);
} else {
cnt += (b - a) / 2;
(cnt % 2 == 0 ? ans = a : ans = a ^ 1);
}
} else {
if (b % 2 == 0) {
cnt += (b - a) / 2;
(cnt % 2 == 0 ? ans = b : ans = b ^ 1);
} else {
cnt += (b - a + 1) / 2;
(cnt % 2 == 0 ? ans = 0 : ans = 1);
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long cnt;
long long ans;
if (a % 2 == 1) {
if (b % 2 == 0) {
cnt += (b - a - 1) / 2;
(cnt % 2 == 0 ? ans = a ^ b : ans = a ^ b ^ 1);
} else {
cnt += (b - a) / 2;
(cnt % 2 == 0 ? ans = a : ans = a ^ 1);
}
} else {
if (b % 2 == 0) {
cnt += (b - a) / 2;
(cnt % 2 == 0 ? ans = b : ans = b ^ 1);
} else {
cnt += (b - a + 1) / 2;
(cnt % 2 == 0 ? ans = 0 : ans = 1);
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 911,964 | 911,965 | u527806673 | cpp |
p03104 | #include <iostream>
int main() {
unsigned long long A, B;
std::cin >> A >> B;
auto as = A & 1 ? A + 1 : A;
auto be = B & 1 ? B : B - 1;
auto num = be - as + 1;
auto ans = num & 1;
if (A & 1)
ans ^= A;
if (B & 1 == 0)
ans ^= B;
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
int main() {
unsigned long long A, B;
std::cin >> A >> B;
auto as = A & 1 ? A + 1 : A;
auto be = B & 1 ? B : B - 1;
auto num = be - as + 1;
auto ans = (num / 2) & 1;
if (A & 1)
ans ^= A;
if ((B & 1) == 0)
ans ^= B;
std::cout << ans << std::endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 911,966 | 911,967 | u896932701 | cpp |
p03104 | #include <iostream>
using namespace std;
long long A, B;
long long FA, FB;
long long ans;
int main() {
cin >> A >> B;
if (A % 2 == 0) {
if ((A / 2) % 2 == 0)
FA = 0;
else
FA = 1;
} else {
if (((A - 1) / 2) % 2 == 0)
FA = A;
else
FA = (A - 1) ^ 1;
}
if ((B + 1) % 2 == 0) {
if (((B + 1) / 2) % 2 == 0)
FB = 0;
else
FB = 1;
} else {
if ((B / 2) % 2 == 0)
FB = B;
else
FB = B ^ 1;
}
ans = FA ^ FB;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
long long A, B;
long long FA, FB;
long long ans;
int main() {
cin >> A >> B;
if (A % 2 == 0) {
if ((A / 2) % 2 == 0)
FA = 0;
else
FA = 1;
} else {
if (((A - 1) / 2) % 2 == 0)
FA = A - 1;
else
FA = (A - 1) ^ 1;
}
if ((B + 1) % 2 == 0) {
if (((B + 1) / 2) % 2 == 0)
FB = 0;
else
FB = 1;
} else {
if ((B / 2) % 2 == 0)
FB = B;
else
FB = B ^ 1;
}
ans = FA ^ FB;
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 911,978 | 911,979 | u404710939 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll single(ll X) {
if (X & 1) {
return ((X + 1) / 2) & 1;
} else {
return ((X / 2) & 1) ^ X;
}
}
int main() {
ll A, B;
cin >> A >> B;
if (A == 0) {
cout << single(B) << endl;
} else {
ll ans = single(A) ^ single(B);
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll single(ll X) {
if (X & 1) {
return ((X + 1) / 2) & 1;
} else {
return ((X / 2) & 1) ^ X;
}
}
int main() {
ll A, B;
cin >> A >> B;
if (A == 0) {
cout << single(B) << endl;
} else {
ll ans = single(A - 1) ^ single(B);
cout << ans << endl;
}
return 0;
} | [
"assignment.change"
] | 911,980 | 911,981 | u826487371 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll single(ll X) {
if (X & 1) {
return ((X + 1) / 2) & 1;
} else {
return ((X >> 1) & 1) ^ X;
}
}
int main() {
ll A, B;
cin >> A >> B;
if (A == 0) {
ll ans = single(B);
cout << ans << endl;
} else {
ll ans = single(B) - single(A - 1);
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll single(ll X) {
if (X & 1) {
return ((X + 1) >> 1) & 1;
} else {
return ((X >> 1) & 1) ^ X;
}
}
int main() {
ll A, B;
cin >> A >> B;
if (A == 0) {
ll ans = single(B);
cout << ans << endl;
} else {
ll ans = single(B) ^ single(A - 1);
cout << ans << endl;
}
return 0;
}
| [
"expression.operation.binary.change"
] | 911,982 | 911,983 | u826487371 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll a, b;
cin >> a >> b;
ll left = 0, right = 0;
if (a & 1) {
left = a;
a++;
}
if ((b & 1) == false) {
right = b;
b--;
}
ll tot = (b - a + 1) / 2;
// cout << left << " "<< right << " ";
ll ans = 0;
if (tot % 2 == 0) {
ans ^= left;
ans ^= right;
} else {
ans ^= left;
ans = 1;
ans ^= right;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll a, b;
cin >> a >> b;
ll left = 0, right = 0;
if (a & 1) {
left = a;
a++;
}
if ((b & 1) == false) {
right = b;
b--;
}
ll tot = (b - a + 1) / 2;
// cout << left << " "<< right << " ";
ll ans = 0;
if (tot % 2 == 0) {
ans ^= left;
ans ^= right;
} else {
ans ^= left;
ans ^= 1;
ans ^= right;
}
cout << ans;
} | [
"assignment.value.change"
] | 911,984 | 911,985 | u595786324 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
LL w(LL e) {
if (e % 4 == 0)
return e;
if (e % 4 == 1)
return e + 1;
if (e % 4 == 2)
return 1;
if (e % 4 == 3)
return 0;
}
int main() {
LL A, B;
cin >> A >> B;
cout << (w(B) ^ w(A - 1)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using LL = long long;
LL w(LL e) {
if (e % 4 == 0)
return e;
if (e % 4 == 1)
return 1;
if (e % 4 == 2)
return e + 1;
if (e % 4 == 3)
return 0;
}
int main() {
LL A, B;
cin >> A >> B;
cout << (w(B) ^ w(A - 1)) << endl;
}
| [
"expression.operation.binary.remove"
] | 911,986 | 911,987 | u580402951 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
ll a, b;
int la[40], lb[40];
int main() {
cin >> a >> b;
ll dif = a - 1;
ll cnt = 1;
if (b % 4 == 1 || b % 4 == 2)
lb[0] = 1;
if (dif % 4 == 1 || b % 4 == 2)
la[0] = 1;
for (int i = 1; i < 40; i++) {
cnt *= 2;
if (b % (cnt * 2) >= cnt && (b % (cnt * 2)) % 2 == 0)
lb[i] = 1;
if (dif % (cnt * 2) >= cnt && (dif % (cnt * 2)) % 2 == 0)
la[i] = 1;
}
cnt = 1;
ll ans = 0;
for (int i = 0; i < 40; i++) {
// cout<<la[i]<<lb[i]<<endl;
if (la[i] != lb[i])
ans += cnt;
cnt *= 2;
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
ll a, b;
int la[40], lb[40];
int main() {
cin >> a >> b;
ll dif = a - 1;
ll cnt = 1;
if (b % 4 == 1 || b % 4 == 2)
lb[0] = 1;
if (dif % 4 == 1 || dif % 4 == 2)
la[0] = 1;
for (int i = 1; i < 40; i++) {
cnt *= 2;
if (b % (cnt * 2) >= cnt && (b % (cnt * 2)) % 2 == 0)
lb[i] = 1;
if (dif % (cnt * 2) >= cnt && (dif % (cnt * 2)) % 2 == 0)
la[i] = 1;
}
cnt = 1;
ll ans = 0;
for (int i = 0; i < 40; i++) {
// cout<<la[i]<<lb[i]<<endl;
if (la[i] != lb[i])
ans += cnt;
cnt *= 2;
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 911,988 | 911,989 | u652150585 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
int main() {
long A, B;
cin >> A >> B;
long ans = 0;
if (A % 2 == 0) {
if (B % 2 == 0) {
if (((B - A) / 2) % 2 == 0)
ans = B;
else
ans = 1 ^ B;
} else {
if (((B - A + 1) / 2) % 2 == 0)
ans = 0;
else
ans = 1;
}
} else {
if (B % 2 == 0) {
if (((B - A - 1) / 2) % 2 == 0)
ans = B ^ A ^ 0;
else
ans = 1 ^ B ^ A;
} else {
if (((B - A) / 2) % 2 == 0)
ans = B;
else
ans = 1 ^ B;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long A, B;
cin >> A >> B;
long ans = 0;
if (A % 2 == 0) {
if (B % 2 == 0) {
if (((B - A) / 2) % 2 == 0)
ans = B;
else
ans = 1 ^ B;
} else {
if (((B - A + 1) / 2) % 2 == 0)
ans = 0;
else
ans = 1;
}
} else {
if (B % 2 == 0) {
if (((B - A - 1) / 2) % 2 == 0)
ans = B ^ A ^ 0;
else
ans = 1 ^ B ^ A;
} else {
if (((B - A) / 2) % 2 == 0)
ans = A;
else
ans = 1 ^ A;
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 911,992 | 911,993 | u239087789 | cpp |
p03104 | #include <algorithm>
#include <functional>
#include <iostream>
#include <utility>
using namespace std;
int main() {
long int A, B;
cin >> A >> B;
long int xa = 0;
long int xb = 0;
if (A % 4 == 2 || A % 4 == 2)
xa += 1;
if (B % 4 == 2 || B % 4 == 2)
xb += 1;
long int one = 1;
long int i = 2;
while ((one << (i - 1)) <= A) {
long int checker = one << i;
long int rest = A % checker;
if (rest >= checker / 2) {
if (rest % 2 == 0)
xa += (one << (i - 1));
}
i++;
}
i = 2;
while ((one << (i - 1)) <= B) {
long int checker = one << i;
long int rest = B % checker;
if (rest >= checker / 2) {
if (rest % 2 == 0)
xb += (one << (i - 1));
}
i++;
}
cout << (xa ^ xb ^ A) << endl;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <utility>
using namespace std;
int main() {
long int A, B;
cin >> A >> B;
long int xa = 0;
long int xb = 0;
if (A % 4 == 2 || A % 4 == 1)
xa += 1;
if (B % 4 == 2 || B % 4 == 1)
xb += 1;
long int one = 1;
long int i = 2;
while ((one << (i - 1)) <= A) {
long int checker = one << i;
long int rest = A % checker;
if (rest >= checker / 2) {
if (rest % 2 == 0)
xa += (one << (i - 1));
}
i++;
}
i = 2;
while ((one << (i - 1)) <= B) {
long int checker = one << i;
long int rest = B % checker;
if (rest >= checker / 2) {
if (rest % 2 == 0)
xb += (one << (i - 1));
}
i++;
}
cout << (xa ^ xb ^ A) << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 912,023 | 912,024 | u650243369 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define range(i, n) for (int i = 0; i < n; i++)
#define rrange(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long int ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
ll A, B;
cin >> A >> B;
ll max = std::max(A, B);
ll bit = log2(max) + 1;
ll ret = 0;
ll countA = 0;
ll countB = 0;
ll count = 0;
ll mask = 1;
ll maskn = 0;
range(i, bit) {
count = 0;
// あといくつで該当bitが変わるか(正)
if ((mask & A)) {
count += mask - (maskn & A);
}
// (負)
if ((mask & B)) {
count += (maskn & B) + 1;
}
// 1の位だけ特殊
if (mask == 1) {
if ((B - A + ((A & 1) | (B & 1))) & 2) {
ret |= 1;
}
} else if ((count) % 2) {
ret |= mask;
}
//}
// else {
// if ((countA + countB) % 2) {
// ret |= mask;
// }
//}
mask = mask << 1;
maskn = maskn << 1;
maskn += 1;
}
cout << dec << ret;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define range(i, n) for (int i = 0; i < n; i++)
#define rrange(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long int ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
ll A, B;
cin >> A >> B;
ll max = std::max(A, B);
ll bit = log2(max) + 1;
ll ret = 0;
ll countA = 0;
ll countB = 0;
ll count = 0;
ll mask = 1;
ll maskn = 0;
range(i, bit) {
count = 0;
// あといくつで該当bitが変わるか(正)
if ((mask & A)) {
count += mask - (maskn & A);
}
// (負)
if ((mask & B)) {
count += (maskn & B) + 1;
}
// 1の位だけ特殊
if (mask == 1) {
if ((B - A + 1 + ((A & 1) | (B & 1))) & 2) {
ret |= 1;
}
} else if ((count) % 2) {
ret |= mask;
}
//}
// else {
// if ((countA + countB) % 2) {
// ret |= mask;
// }
//}
mask = mask << 1;
maskn = maskn << 1;
maskn += 1;
}
cout << dec << ret;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 912,028 | 912,029 | u991974907 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ll a, b;
cin >> a >> b;
a--;
ll ans = (((b + 1) / 2 - (a + 1) / 2) % 2 == 0 ? 0 : 1);
for (ll i = 2;; i *= 2) {
if (b < i)
break;
bool flg[2];
flg[0] = b % (i * 2) >= i;
flg[1] = a % (i * 2) >= i;
ll memo[2];
memo[0] = (b % (i * 2) - i + 1) % 2;
memo[1] = (a % (i * 2) - i + 1) % 2;
if (((flg[0] ? memo[0] : 2) - (flg[1] ? memo[1] : 0)) % 2 == 1)
ans += i;
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ll a, b;
cin >> a >> b;
a--;
ll ans = (((b + 1) / 2 - (a + 1) / 2) % 2 == 0 ? 0 : 1);
for (ll i = 2;; i *= 2) {
if (b < i)
break;
bool flg[2];
flg[0] = b % (i * 2) >= i;
flg[1] = a % (i * 2) >= i;
ll memo[2];
memo[0] = (b % (i * 2) - i + 1) % 2 + 2;
memo[1] = (a % (i * 2) - i + 1) % 2;
if (((flg[0] ? memo[0] : 2) - (flg[1] ? memo[1] : 0)) % 2 == 1)
ans += i;
}
cout << ans << endl;
}
| [
"assignment.change"
] | 912,030 | 912,031 | u938945369 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 8 * B) {
evenA = ((A) % diviser < diviser / 2) or ((A) % 2 == 0);
evenB = ((B) % diviser < diviser / 2) or ((B) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 2 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 8 * B) {
evenA = ((A) % diviser < diviser / 2) or ((A + 1) % 2 == 0);
evenB = ((B) % diviser < diviser / 2) or ((B + 1) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 4 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
}
| [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 912,047 | 912,048 | u617525345 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 8 * B) {
evenA = ((A + 1) % diviser < diviser / 2) or ((A + 1) % 2 == 0);
evenB = ((B + 1) % diviser < diviser / 2) or ((B + 1) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 2 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 8 * B) {
evenA = ((A) % diviser < diviser / 2) or ((A + 1) % 2 == 0);
evenB = ((B) % diviser < diviser / 2) or ((B + 1) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 4 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 912,049 | 912,048 | u617525345 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 8 * B) {
evenA = ((A) % diviser < diviser / 2) or ((A + 1) % 2 == 0);
evenB = ((B) % diviser < diviser / 2) or ((B + 1) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 2 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 8 * B) {
evenA = ((A) % diviser < diviser / 2) or ((A + 1) % 2 == 0);
evenB = ((B) % diviser < diviser / 2) or ((B + 1) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 4 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 912,050 | 912,048 | u617525345 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 4 * B) {
evenA = ((A + 1) % diviser < diviser / 2) or ((A + 1) % 2 == 0);
evenB = ((B + 1) % diviser < diviser / 2) or ((B + 1) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 2 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 8 * B) {
evenA = ((A) % diviser < diviser / 2) or ((A + 1) % 2 == 0);
evenB = ((B) % diviser < diviser / 2) or ((B + 1) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 4 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove",
"assignment.value.change",
"expression.operation.binary.change"
] | 912,051 | 912,048 | u617525345 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 4 * B) {
evenA = ((A + 1) % diviser < diviser / 2) or ((A + 1) % 2 == 0);
evenB = ((B + 1) % diviser < diviser / 2) or ((B + 1) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 2 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
A = A - 1 > 0 ? A - 1 : 0;
ll diviser = 2;
ll ans = 0;
// 1 -- A と 1-- B に 分けて 偶奇を管理する
bool evenA;
bool evenB;
while (diviser < 8 * B) {
evenA = ((A) % diviser < diviser / 2) or ((A + 1) % 2 == 0);
evenB = ((B) % diviser < diviser / 2) or ((B + 1) % 2 == 0);
if (diviser == 2) {
evenA = A % 4 == 0 or A % 4 == 3;
evenB = B % 4 == 0 or B % 4 == 3;
}
if ((evenA == true and evenB == true) or
(evenA == false and evenB == false)) {
// ans += diviser / 2;
} else {
ans += diviser / 2;
}
// cout<<evenA <<" " << evenB <<endl;
diviser = diviser * 2;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove",
"assignment.value.change",
"expression.operation.binary.change"
] | 912,052 | 912,048 | u617525345 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) range(i, 0, n)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define range(i, a, n) for (ll i = (a); i < (n); i++)
#define LINF ((ll)1ll << 60)
#define INF ((int)1 << 30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout << setprecision(a) << fixed
#define fs first
#define sc second
#define PI (3.1415926535897932384)
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
template <class T> void puta(T &&t) { cout << t << "\n"; }
template <class H, class... T> void puta(H &&h, T &&...t) {
cout << h << ' ';
puta(t...);
}
template <class S, class T> void tf(bool b, S t, T f) {
if (b)
puta(t);
else
puta(f);
}
void YN(bool b) { tf(b, "YES", "NO"); }
void Yn(bool b) { tf(b, "Yes", "No"); }
void yn(bool b) { tf(b, "yes", "no"); }
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "[" << p.first << ", " << p.second << "]";
return os;
};
template <class S> auto &operator<<(ostream &os, vector<S> t) {
bool a = 1;
for (auto s : t) {
os << (a ? "" : " ") << s;
a = 0;
}
return os;
}
template <class S> auto &operator>>(istream &is, vector<S> &t) {
for (S &a : t)
cin >> a;
return is;
}
/*他のライブラリを入れる場所*/
ll get(ll n, ll d) { //未満
if (d == 0)
return (n + 1) / 2;
ll ret = 0;
if (n % 2 == 0)
ret += (!!(n & (1ll << d)));
return ret + 2ll * get(n / 2, d - 1);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
if (a == b) {
puta(a);
return 0;
}
ll ans = 0;
rep(i, 40) {
// puta(b,1ll<<i,get(b,i));
if ((get(b, i) - get(a - 1, i)) % 2 == 1)
ans |= (1ll << i);
}
puta(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) range(i, 0, n)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define range(i, a, n) for (ll i = (a); i < (n); i++)
#define LINF ((ll)1ll << 60)
#define INF ((int)1 << 30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout << setprecision(a) << fixed
#define fs first
#define sc second
#define PI (3.1415926535897932384)
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
template <class T> void puta(T &&t) { cout << t << "\n"; }
template <class H, class... T> void puta(H &&h, T &&...t) {
cout << h << ' ';
puta(t...);
}
template <class S, class T> void tf(bool b, S t, T f) {
if (b)
puta(t);
else
puta(f);
}
void YN(bool b) { tf(b, "YES", "NO"); }
void Yn(bool b) { tf(b, "Yes", "No"); }
void yn(bool b) { tf(b, "yes", "no"); }
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "[" << p.first << ", " << p.second << "]";
return os;
};
template <class S> auto &operator<<(ostream &os, vector<S> t) {
bool a = 1;
for (auto s : t) {
os << (a ? "" : " ") << s;
a = 0;
}
return os;
}
template <class S> auto &operator>>(istream &is, vector<S> &t) {
for (S &a : t)
cin >> a;
return is;
}
/*他のライブラリを入れる場所*/
ll get(ll n, ll d) { //未満
if (d == 0)
return (n + 1) / 2;
ll ret = 0;
if (n % 2 == 0)
ret += (!!(n-- & (1ll << d)));
return ret + 2ll * get(n / 2, d - 1);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
if (a == b) {
puta(a);
return 0;
}
ll ans = 0;
rep(i, 40) {
if ((get(b, i) - get(a - 1, i)) % 2 == 1)
ans |= (1ll << i);
}
puta(ans);
return 0;
}
| [] | 912,053 | 912,054 | u364618491 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) range(i, 0, n)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define range(i, a, n) for (ll i = (a); i < (n); i++)
#define LINF ((ll)1ll << 60)
#define INF ((int)1 << 30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout << setprecision(a) << fixed
#define fs first
#define sc second
#define PI (3.1415926535897932384)
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
template <class T> void puta(T &&t) { cout << t << "\n"; }
template <class H, class... T> void puta(H &&h, T &&...t) {
cout << h << ' ';
puta(t...);
}
template <class S, class T> void tf(bool b, S t, T f) {
if (b)
puta(t);
else
puta(f);
}
void YN(bool b) { tf(b, "YES", "NO"); }
void Yn(bool b) { tf(b, "Yes", "No"); }
void yn(bool b) { tf(b, "yes", "no"); }
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "[" << p.first << ", " << p.second << "]";
return os;
};
template <class S> auto &operator<<(ostream &os, vector<S> t) {
bool a = 1;
for (auto s : t) {
os << (a ? "" : " ") << s;
a = 0;
}
return os;
}
template <class S> auto &operator>>(istream &is, vector<S> &t) {
for (S &a : t)
cin >> a;
return is;
}
/*他のライブラリを入れる場所*/
ll get(ll n, ll d) { //未満
if (n < (1ll << d))
return 0;
if (d == 0)
return (n + 1) / 2;
ll ret = 0;
if (n % 2 == 0)
ret += (!!(n & (1ll << d)));
ret += 2ll * get(n / 2, d - 1);
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
if (a == 0)
a = 1;
if (a == b) {
puta(a);
return 0;
}
ll ans = 0;
rep(i, 40) {
if ((get(b, i) - get(a - 1, i)) % 2 == 1)
ans |= (1ll << i);
}
puta(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) range(i, 0, n)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define range(i, a, n) for (ll i = (a); i < (n); i++)
#define LINF ((ll)1ll << 60)
#define INF ((int)1 << 30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout << setprecision(a) << fixed
#define fs first
#define sc second
#define PI (3.1415926535897932384)
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class S> S sum(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
template <class T> void puta(T &&t) { cout << t << "\n"; }
template <class H, class... T> void puta(H &&h, T &&...t) {
cout << h << ' ';
puta(t...);
}
template <class S, class T> void tf(bool b, S t, T f) {
if (b)
puta(t);
else
puta(f);
}
void YN(bool b) { tf(b, "YES", "NO"); }
void Yn(bool b) { tf(b, "Yes", "No"); }
void yn(bool b) { tf(b, "yes", "no"); }
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "[" << p.first << ", " << p.second << "]";
return os;
};
template <class S> auto &operator<<(ostream &os, vector<S> t) {
bool a = 1;
for (auto s : t) {
os << (a ? "" : " ") << s;
a = 0;
}
return os;
}
template <class S> auto &operator>>(istream &is, vector<S> &t) {
for (S &a : t)
cin >> a;
return is;
}
/*他のライブラリを入れる場所*/
ll get(ll n, ll d) { //未満
// puta("call",n,d);
if (n < (1ll << d))
return 0;
if (d == 0)
return (n + 1) / 2;
ll ret = 0;
if (n % 2 == 0) {
ret += (!!(n & (1ll << d)));
n--;
}
ret += 2ll * get(n / 2, d - 1);
// puta("ret",n,d,ret);
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
if (a == 0)
a = 1;
if (a == b) {
puta(a);
return 0;
}
ll ans = 0;
rep(i, 40) {
// puta(i,get(a,i));
// puta(i,get(b,i));
if ((get(b, i) - get(a - 1, i)) % 2 == 1)
ans |= (1ll << i);
}
puta(ans);
return 0;
} | [
"expression.unary.arithmetic.add"
] | 912,055 | 912,056 | u364618491 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll A, B;
scanf("%lld%lld", &A, &B);
if (A % 2 == 0 && B % 2 == 1) {
printf("%lld\n", ((B - A) / 2) % 2);
}
if (A % 2 == 0 && B % 2 == 0) {
printf("%lld\n", B ^ (((B - A) / 2) % 2));
}
if (A % 2 == 1 && B % 2 == 1) {
printf("%lld\n", A ^ (((B - A) / 2) % 2));
}
if (A % 2 == 1 && B % 2 == 0) {
if (0 < B - A - 1)
printf("%lld\n", A ^ B ^ ((B - A - 1) / 2) % 2);
else
printf("%lld\n", A ^ B);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll A, B;
scanf("%lld%lld", &A, &B);
if (A % 2 == 0 && B % 2 == 1) {
printf("%lld\n", ((B - A + 1) / 2) % 2);
}
if (A % 2 == 0 && B % 2 == 0) {
printf("%lld\n", B ^ (((B - A) / 2) % 2));
}
if (A % 2 == 1 && B % 2 == 1) {
printf("%lld\n", A ^ (((B - A) / 2) % 2));
}
if (A % 2 == 1 && B % 2 == 0) {
if (0 < B - A - 1)
printf("%lld\n", A ^ B ^ ((B - A - 1) / 2) % 2);
else
printf("%lld\n", A ^ B);
}
return 0;
} | [
"expression.operation.binary.add"
] | 912,066 | 912,067 | u697421413 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using tl = TP<ll, ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
using vtl = V<tl>;
using vvtl = V<vtl>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpl = queue<pl>;
using stll = stack<ll>;
using stpl = stack<pl>;
using mapll = map<ll, ll>;
using setll = set<ll>;
using pqll = priority_queue<ll>;
#define int ll
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define sz size()
#define bgn begin()
#define en end()
#define asn assign
#define emp empty()
#define fr front()
#define bk back()
#define clr clear()
#define ins insert
#define ers erase
#define res resize
#define tp top()
#define p_q priority_queue
#define inv inverse()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, a) FOR((i), 0, (ll)(a)-1)
#define REP0(i, a) FOR((i), 0, (ll)(a))
#define REP1(i, a) FOR((i), 1, (ll)(a))
#define rREP(i, a) rFOR((i), 0, (ll)(a)-1)
#define rREP0(i, a) rFOR((i), 0, (ll)(a))
#define rREP1(i, a) rFOR((i), 1, (ll)(a))
#define ROR(v, i) for (auto &(i) : (v))
#define IOTA(a, n) iota((a).bgn, (a).en, (n))
#define SORT(a) sort((a).bgn, (a).en)
#define rSORT(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bgn, (a).en), (a).en)
#define PREVP(a) prev_permutation((a).bgn, (a).en)
#define NEXTP(a) next_permutation((a).bgn, (a).en)
#define BINS(a, b) binary_search((a).bgn, (a).en, (b))
#define LOWB(a, b) (lower_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define UPB(a, b) (upper_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define CNT(a, b) count((a).bgn, (a).en, b)
#define SUM(a) accumulate((a).bgn, (a).en, 0)
#define REV(a) reverse((a).bgn, (a).en)
#define REGS(a, b) regex_search((a), regex(b))
#define REGM(a, b) regex_match((a), regex(b))
#define yn(a) cout << ((a) ? "yes" : "no") << "\n";
#define Yn(a) cout << ((a) ? "Yes" : "No") << "\n";
#define YN(a) cout << ((a) ? "YES" : "NO") << "\n";
#define imp(a) cout << ((a) ? "possible" : "impossible") << "\n";
#define Imp(a) cout << ((a) ? "Possible" : "Impossible") << "\n";
#define IMP(a) cout << ((a) ? "POSSIBLE" : "IMPOSSIBLE") << "\n";
#define fs(a) cout << ((a) ? "second" : "first") << "\n";
#define Fs(a) cout << ((a) ? "Second" : "First") << "\n";
#define FS(a) cout << ((a) ? "SECOND" : "FIRST") << "\n";
#define sak cout << "\n";
#define sas cout << " ";
#define sat cout << "\t";
#define dbg(a) cerr << (#a) << ": " << (a) << "\n";
#define dbgs(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__);
#define c2l(a) ((ll)(a - 48))
#define a2l(a) ((ll)(a - 97))
#define A2l(a) ((ll)(a - 65))
#define l2c(a) ((char)(a + 48))
#define l2a(a) ((char)(a + 97))
#define l2A(a) ((char)(a + 65))
#define DigN2(a) ((llabs(a) == 0) ? (1) : ((ll)(log2(double(llabs(a)))) + 1))
#define DigN10(a) ((llabs(a) == 0) ? (1) : ((ll)(log10(double(llabs(a)))) + 1))
#define Dig2(a, b) (((a) >> (b)) & 1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (double)(b))))) % 10)
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & (-(a)))
#define vin(v) \
ROR((v), (i)) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vllin2(a, b, N) \
vll(a)(N), (b)(N); \
REP(i, N) { cin >> (a)[i] >> (b)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define rdn(a, b) ((a) / (b))
#define rou(a, b) \
((((double(a) / double(b)) - ((a) / (b))) < 0.5) ? ((a) / (b)) \
: (((a) / (b)) + 1))
#define rup(a, b) ((((a) % (b)) == 0) ? ((a) / (b)) : (((a) / (b)) + 1))
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define powll(a, b) (ll)(pow((double)(a), (double)(b)))
#define Triangle(x1, y1, x2, y2, x3, y3) \
(((x1) - (x2)) * ((y1) - (y3)) - ((x1) - (x3)) * ((y1) - (y2)))
#define svll SumV<ll>
#define svvll SumV2<ll>
#define li(...) \
ll __VA_ARGS__; \
Input(__VA_ARGS__);
#define si(...) \
str __VA_ARGS__; \
Input(__VA_ARGS__);
#define vli(size, ...) \
vll __VA_ARGS__; \
vInput(size, __VA_ARGS__);
#define vsi(size, ...) \
vs __VA_ARGS__; \
vInput(size, __VA_ARGS__);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = 924844033;
// const ll MOD = 9007199254740881;
const ll INF = 1LL << 60; // 1.15e18
const double PI = acos(-1.0);
const vll DX = {0, -1, 0, 1, 0, -1, 1, 1, -1};
const vll DY = {0, 0, -1, 0, 1, -1, -1, 1, 1};
const str alp = "abcdefghijklmnopqrstuvwxyz";
const str ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
void Input() {}
template <class Var, class... Args> void Input(Var &var, Args &...args) {
cin >> var;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.res(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size, args...);
REP(i, size) vInputNum(i, args...);
}
template <class S, class T>
ostream &operator<<(ostream &out, const P<S, T> &p) {
return out << "[" << p.fi << ", " << p.se << "]";
}
template <class T> ostream &operator<<(ostream &out, V<T> &v) {
if (v.emp)
return out << "{}";
else {
auto itr = v.bgn;
out << "{" << *itr;
itr++;
while (itr != v.en) {
out << ", " << *itr;
itr++;
}
out << "}";
return out;
}
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &m) {
if (m.emp)
return out << "<[]>";
else {
auto itr = m.bgn;
out << "< [" << (itr->fi) << ": " << (itr->se);
itr++;
while (itr != m.en) {
out << "], [" << (itr->fi) << ": " << (itr->se);
itr++;
}
out << "] >";
return out;
}
}
template <class T> ostream &operator<<(ostream &out, const set<T> &s) {
if (s.emp)
return out << "<>";
else {
auto itr = s.bgn;
out << "<" << *itr;
itr++;
while (itr != s.en) {
out << ", " << *itr;
itr++;
}
out << ">";
return out;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head head, Body... body) {
cout << head << " ";
say(body...);
}
void sal() { cout << "\n"; }
template <class... Args> void sal(Args... args) {
say(args...);
cout << "\n";
}
void day() {}
template <class T> void day(T t) { cerr << t; }
template <class Head, class... Body> void day(Head head, Body... body) {
cerr << head << " ";
day(body...);
}
void dal() { cerr << "\n"; }
template <class... Args> void dal(Args... args) {
day(args...);
cerr << "\n";
}
void salv() {}
template <class T> void salv(V<T> v) {
if (v.emp)
sal();
else {
auto itr = v.bgn;
say(*itr);
itr++;
while (itr != v.en) {
sas;
say(*itr);
itr++;
}
sak;
}
}
template <class T, class... Args> void salv(V<T> v, Args... args) {
salv(v);
salv(args...);
}
void salv2() {}
template <class T> void salv2(V<V<T>> v) {
if (v.emp)
sal();
else {
ROR(v, i) salv(i);
}
}
template <class T, class... Args> void salv2(V<V<T>> v, Args... args) {
salv2(v);
salv2(args...);
}
template <class Monoid> struct Action {
public:
Monoid I;
function<Monoid(Monoid, Monoid)> A;
Action(Monoid I, function<Monoid(Monoid, Monoid)> A) : I(I), A(A) {}
Monoid operator()() { return I; }
Monoid operator()(Monoid x) { return x; }
Monoid operator()(Monoid l, Monoid r) { return A(l, r); }
template <class... Args> Monoid operator()(Monoid x, Args... args) {
Monoid tmp = operator()(args...);
return A(x, tmp);
}
};
template <class T> Action<T> ADD = Action<T>(0, [](T l, T r) { return l + r; });
template <>
Action<str> ADD<str> = Action<str>("", [](str l, str r) { return l + r; });
template <class T1, class T2>
Action<P<T1, T2>> ADD<P<T1, T2>> =
Action<P<T1, T2>>(mp(ADD<T1>.I, ADD<T2>.I), [](P<T1, T2> l, P<T1, T2> r) {
return mp(l.fi + r.fi, l.se + r.se);
});
template <class T> Action<T> MUL = Action<T>(1, [](T l, T r) { return l * r; });
template <class T> Action<T> OR = Action<T>(0, [](T l, T r) { return l | r; });
template <class T> Action<T> XOR = Action<T>(0, [](T l, T r) { return l ^ r; });
template <class T>
Action<T> AND = Action<T>(((ll)(1) << 63) - 1, [](T l, T r) { return l & r; });
template <>
Action<bool> AND<bool> = Action<bool>(true,
[](bool l, bool r) { return l & r; });
template <>
Action<ull> AND<ull> = Action<ull>(((ull)(1) << 63) - 1,
[](ull l, ull r) { return l & r; });
template <class T>
Action<T> MIN = Action<T>(INF, [](T l, T r) { return (l < r) ? l : r; });
template <class T>
Action<T> MAX = Action<T>(-INF, [](T l, T r) { return (l > r) ? l : r; });
template <class T>
Action<T> GCD = Action<T>(0, [](T l, T r) {
if (l < r) {
l ^= r;
r ^= l;
l ^= r;
}
return (r ? GCD<T>(r, l % r) : l);
});
template <class T>
Action<T> LCM = Action<T>(1, [](T l, T r) { return (l * r) / GCD<T>(l, r); });
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head head, Body... body) {
auto tmp = Min(body...);
return (head < tmp) ? head : tmp;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> auto Max(Head head, Body... body) {
auto tmp = Max(body...);
return (head > tmp) ? head : tmp;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll gcd(ll head) { return head; }
template <class... Body> ll gcd(ll head, Body... body) {
return gcd(head, gcd(body...));
}
ll lcm(ll head) { return head; }
template <class... Body> ll lcm(ll head, Body... body) {
return lcm(head, lcm(body...));
}
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UFT {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UFT() {}
UFT(const UFT &uft) {}
UFT(ll tsizeget, ll modeget = 0) {
tsize = tsizeget;
mode = modeget;
par.asn(tsize, -1);
if (!mode)
rank.res(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return x == root(x); }
bool same(ll x, ll y) { return root(x) == root(y); }
void merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] = x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
ll size(ll x) { return -par[root(x)]; }
};
struct pUFT {
public:
ll tsize;
ll now;
vll par;
vll rank;
vll mtime;
vvll sizepi;
vvll sizepv;
pUFT() {}
pUFT(const pUFT &puft) {}
pUFT(ll tsizeget) {
tsize = tsizeget;
now = 0;
par.asn(tsize, -1);
rank.asn(tsize, 0);
mtime.asn(tsize, INF);
sizepi.asn(tsize, {0});
sizepv.asn(tsize, {1});
}
ll root(ll x, ll t) { return (mtime[x] > t) ? x : root(par[x], t); }
bool same(ll x, ll y, ll t) { return root(x, t) == root(y, t); }
ll merge(ll x, ll y) {
now++;
x = root(x, now);
y = root(y, now);
if (x != y) {
if (rank[x] < rank[y]) {
par[y] += par[x];
sizepi[y].pb(now);
sizepv[y].pb(-par[y]);
par[x] = y;
mtime[x] = now;
} else {
par[x] += par[y];
sizepi[x].pb(now);
sizepv[x].pb(-par[x]);
par[y] = x;
mtime[y] = now;
if (rank[x] == rank[y])
rank[x]++;
}
}
return now;
}
ll size(ll x, ll t) {
x = root(x, t);
return sizepv[x][UPB(sizepi[x], t) - 1];
}
};
struct wUFT {
public:
ll tsize;
ll mode;
vll par;
vll rank;
vll dweight;
wUFT() {}
wUFT(const wUFT &wuft) {}
wUFT(ll tsizeget, ll modeget = 0) {
tsize = tsizeget;
mode = modeget;
par.asn(tsize, -1);
if (!mode)
rank.res(tsize, 0);
dweight.asn(tsize, 0);
}
ll root(ll x) {
if (par[x] < 0)
return x;
else {
ll r = root(par[x]);
dweight[x] += dweight[par[x]];
return par[x] = r;
}
}
ll weight(ll x) {
root(x);
return dweight[x];
}
ll diff(ll x, ll y) { return weight(y) - weight(x); }
bool isRoot(ll x) { return x == root(x); }
bool same(ll x, ll y) { return root(x) == root(y); }
void merge(ll x, ll y, ll w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] = x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
dweight[x] = -w;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
dweight[y] = w;
}
}
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename valtype> class SegT {
public:
ll size;
vector<valtype> v;
valtype initv;
function<valtype(valtype x, valtype y)> calc;
SegT() {}
SegT(const SegT &segt) {}
SegT(ll sizeget, ll modeget = 0) {
sizeset(sizeget);
modeset(modeget);
init();
}
SegT(vector<valtype> cpyvec, ll modeget = 0) {
sizeset(cpyvec.sz);
modeset(modeget);
init();
copy(cpyvec);
}
SegT(ll sizeget, valtype initvget,
function<valtype(valtype x, valtype y)> calcget) {
sizeset(sizeget);
initv = initvget;
calc = calcget;
init();
}
SegT(vector<valtype> cpyvec, valtype initvget,
function<valtype(valtype x, valtype y)> calcget) {
sizeset(cpyvec.sz);
initv = initvget;
calc = calcget;
init();
copy(cpyvec);
}
void sizeset(ll rsize) {
size = DigN2(rsize);
if (rsize == Pow2(size - 1))
size--;
return;
}
void modeset(ll mode) {
switch (mode) {
case 0:
initv = 0;
calc = [](valtype x, valtype y) { return x + y; };
break;
case 1:
initv = INF;
calc = [](valtype x, valtype y) { return min(x, y); };
break;
case 2:
initv = -INF;
calc = [](valtype x, valtype y) { return max(x, y); };
break;
}
return;
}
void init() { v.asn(Pow2(size + 1) - 1, initv); }
void copy(vector<valtype> cpyvec) {
REP(i, min(cpyvec.sz, Pow2(size))) set(i, cpyvec[i]);
}
ll i2v(ll i) const {
if (i < 0 || i >= Pow2(size))
return -1;
return Pow2(size) + i - 1;
}
ll top(ll i) const {
if (i == 0)
return -1;
return (i - 1) / 2;
}
pl bot(ll i) const {
if (i + 1 >= Pow2(size))
return mp(-1, -1);
return mp(2 * i + 1, 2 * i + 2);
}
void set(ll i, valtype x) {
i = i2v(i);
v[i] = x;
while (i > 0) {
i = top(i);
v[i] = calc(v[bot(i).fi], v[bot(i).se]);
}
return;
}
void add(ll i, valtype x) {
set(i, v[i2v(i)] + x);
return;
}
valtype operator[](const ll &i) const { return v[i2v(i)]; }
// valtype que(ll a = 0, ll b = Pow2(size) - 1) {
valtype que(ll a, ll b) {
if (a == b)
return v[i2v(a)];
if (a > b)
return initv; // swap(a, b);
valtype ans = initv;
ll ai = i2v(a);
ll bi = i2v(b);
FOR(i, 1, size + 1) {
if (a > b)
break;
if (a % Pow2(i)) {
ans = calc(ans, v[ai]);
a += Pow2(i - 1);
ai = top(ai) + 1;
} else {
ai = top(ai);
}
if (a > b)
break;
if ((b + 1) % Pow2(i)) {
ans = calc(ans, v[bi]);
b -= Pow2(i - 1);
bi = top(bi) - 1;
} else {
bi = top(bi);
}
if (a > b)
break;
}
return ans;
}
valtype que(ll b) { return que(0, b); }
valtype que() { return que(0, Pow2(size) - 1); }
};
template <typename lentype> class Graph {
public:
ll size;
ll mode;
ll mapmode;
lentype zlen;
lentype ilen;
vector<map<ll, ll>> v2n;
vvll n2v;
vector<vector<lentype>> Edge;
vector<pair<lentype, ll>> Primresult;
Graph() {}
Graph(const Graph &graph) {}
Graph(ll sizeget = 0, ll mapmodeget = 0, ll modeget = 0, lentype zlenget = 0,
lentype ilenget = INF) {
size = sizeget;
mapmode = mapmodeget;
mode = modeget;
zlen = zlenget;
ilen = ilenget;
init();
}
void init() {
Edge.res(size);
v2n.res(size);
n2v.res(size);
Primresult.asn(size, mp(ilen, -1));
}
lentype lenplus(lentype l, lentype r) { return l + r; }
lentype lenequal(lentype l, lentype r) { return l == r; }
lentype lenlcr(lentype l, lentype r) { return l < r; }
ll addV(ll vs) {
size += vs;
init();
return size;
}
void caddE(ll x, ll y, lentype c) {
if (mapmode)
v2n[x][y] = Edge[x].sz;
Edge[x].pb(c);
n2v[x].pb(y);
}
void csetE(ll x, ll y, lentype c) {
if (mapmode)
Edge[x][v2n[x][y]] = c;
}
void cersE(ll x, ll y) {
if (mapmode) {
ll n = v2n[x][y];
Edge[x][n] = ilen;
n2v[x][n] = -1;
v2n[x].ers(y);
}
}
void addE(ll x, ll y, lentype c) {
caddE(x, y, c);
if (!mode)
caddE(y, x, c);
}
void setE(ll x, ll y, lentype c) {
csetE(x, y, c);
if (!mode)
csetE(y, x, c);
}
void ersE(ll x, ll y, lentype c) {
cersE(x, y, c);
if (!mode)
cersE(y, x, c);
}
lentype getE(ll x, ll y) {
if (mapmode) {
if (v2n[x].count(y)) {
return Edge[x][v2n[x][y]];
}
}
return ilen;
}
ll getVsz(ll x) { return Edge[x].sz; }
pair<lentype, ll> getV(ll x, ll n) {
if (n >= getVsz(x))
return mp(ilen, -1);
return mp(Edge[x][n], n2v[x][n]);
}
vector<pair<lentype, vll>> Dijk(ll x) {
vector<pair<lentype, vll>> result(size);
REP(i, size) {
result[i].fi = ilen;
result[i].se = {-1};
}
vll stat(size, 0);
pair<lentype, ll> now;
pair<lentype, ll> nowlv;
SegT<pair<lentype, ll>> Q(size, mp(ilen, -1),
[](pair<lentype, ll> l, pair<lentype, ll> r) {
if (l.se == -1)
return r;
if (r.se == -1)
return l;
return l.fi < r.fi ? l : r;
});
Q.set(x, mp(zlen, x));
result[x].fi = zlen;
result[x].se = {-1};
while (Q.que(0, size - 1).se != -1) {
now = Q.que(0, size - 1);
Q.set(now.se, mp(ilen, -1));
stat[now.se] = 1;
REP(i, getVsz(now.se)) {
nowlv = getV(now.se, i);
if (stat[nowlv.se])
continue;
if (Q[nowlv.se].se == -1) {
result[nowlv.se].fi = lenplus(result[now.se].fi, nowlv.fi);
result[nowlv.se].se = {now.se};
Q.set(nowlv.se, mp(result[nowlv.se].fi, nowlv.se));
} else {
if (lenlcr(lenplus(result[now.se].fi, nowlv.fi),
result[nowlv.se].fi)) {
result[nowlv.se].fi = lenplus(result[now.se].fi, nowlv.fi);
result[nowlv.se].se = {now.se};
Q.set(nowlv.se, mp(result[nowlv.se].fi, nowlv.se));
} else if (lenequal(lenplus(result[now.se].fi, nowlv.fi),
result[nowlv.se].fi)) {
result[nowlv.se].se.pb(now.se);
}
}
}
}
return result;
}
lentype Prim(ll x = 0) {
lentype ans = zlen;
vll stat(size, 0);
pair<lentype, ll> now;
pair<lentype, ll> nowlv;
SegT<pair<lentype, ll>> Q(size, mp(ilen, -1),
[](pair<lentype, ll> l, pair<lentype, ll> r) {
if (l.se == -1)
return r;
if (r.se == -1)
return l;
return l.fi < r.fi ? l : r;
});
Q.set(x, mp(zlen, x));
Primresult[x] = mp(zlen, -1);
while (Q.que(0, size - 1).se != -1) {
now = Q.que(0, size - 1);
Q.set(now.se, mp(ilen, -1));
stat[now.se] = 1;
ans = lenplus(ans, Primresult[now.se].fi);
REP(i, getVsz(now.se)) {
nowlv = getV(now.se, i);
if (stat[nowlv.se])
continue;
if (Q[nowlv.se].se == -1) {
Primresult[nowlv.se] = mp(nowlv.fi, now.se);
Q.set(nowlv.se, mp(Primresult[nowlv.se].fi, nowlv.se));
} else {
if (lenlcr(nowlv.fi, Primresult[nowlv.se].fi)) {
Primresult[nowlv.se] = mp(nowlv.fi, now.se);
Q.set(nowlv.se, mp(Primresult[nowlv.se].fi, nowlv.se));
}
}
}
}
return ans;
}
};
/*template <class Type> class DP {
public:
vector<Type> v;
Type initv;
vll size, block;
DP() {}
DP(const DP &dp) {}
template<class... Args> DP(Args... args) {
block.asn(1, 1);
Initialize(args...);
}
void Initialize(Type initv_) {
initv = initv_;
v.asn(block.bk, initv);
}
template<class... Args> void Initialize(ll val, Args... args) {
size.pb(val);
block.pb(block.bk*val);
Initialize(args...);
}
};*/
pl Bezout(ll a, ll b) {
if (b != 0) {
pl xy;
xy = Bezout(b, a % b);
return mp(xy.se, xy.fi - ((a / b) * xy.se));
} else {
return mp(1, 0);
}
}
pl Bez(ll a, ll b, ll c) {
pl xy;
ll x, y, z, gc;
xy = Bezout(a, b);
gc = gcd(a, b);
if (c % gc != 0)
return mp(-1, -1);
x = xy.fi * (c / gc);
y = xy.se * (c / gc);
if (x < 0)
z = rup(-x, (b / gc));
if (x >= 0)
z = -x / (b / gc);
x += z * (b / gc);
y -= z * (a / gc);
return mp(x, y);
}
ll DigS10(ll n) {
ll ans = 0;
while (1) {
ans += n % 10;
n /= 10;
if (!n)
break;
}
return ans;
}
ll isP(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n) + 1) {
if (n % i == 0)
return 0;
}
return 1;
}
ll Tot(ll n) {
if (n <= 0)
return 0;
ll ans = n, x = 2;
while (x * x <= n) {
if (n % x == 0) {
ans -= ans / x;
while (n % x == 0)
n /= x;
}
x++;
}
if (n > 1)
ans -= ans / n;
return ans;
}
template <class T> struct Sum {
public:
V<T> v, s;
ll size;
Action<T> Add;
Sum(V<T> v, Action<T> Add = ADD<T>) : v(v), size(v.sz), Add(Add) {
Init();
Calc();
}
void Init() { s.asn(size + 1, Add.I); }
void Calc() { REP(i, size) s[i + 1] = Add(s[i], v[i]); }
T operator()(ll x) { return operator()(0, x); }
T operator()(ll l, ll r) {
if (l < 0)
l = 0;
if (r >= size)
r = size - 1;
if (l > r)
return Add.I;
return s[r + 1] - s[l]; // for ADD
}
};
using sumll = Sum<ll>;
template <class T> struct Sum2 {
public:
V<V<T>> v, s;
ll RowSize, ColumnSize;
Action<T> Add;
Sum2(V<V<T>> v, Action<T> Add = ADD<T>)
: v(v), RowSize(v.sz), ColumnSize(v.sz ? v[0].sz : 0), Add(Add) {
Init();
Calc();
}
void Init() { s.asn(RowSize + 1, V<T>(ColumnSize, Add.I)); }
void Calc() {
REP1(r, RowSize) {
REP1(c, ColumnSize) {
s[r][c] =
v[r - 1][c - 1] + operator()(r, c - 1) + operator()(r - 1, c) -
operator()(r - 1, c - 1);
}
}
}
T operator()(ll r, ll c) { return operator()(0, 0, r, c); }
T operator()(ll r1, ll c1, ll r2, ll c2) {
if (r1 < 0)
r1 = 0;
if (c1 < 0)
c1 = 0;
if (r2 >= RowSize)
r2 = RowSize - 1;
if (c2 >= ColumnSize)
c2 = ColumnSize - 1;
if (r1 > r2)
return Add.I;
if (c1 > c2)
return Add.I;
return s[r2 + 1][c2 + 1] - s[r2 + 1][c1] - s[r1][c2 + 1] + s[r1][c1];
}
};
using sum2ll = Sum2<ll>;
template <class T> struct Point2 {
public:
V<V<T>> v;
ll h, w;
Point2() : h(0), w(0) {}
Point2(ll h, ll w) : h(h), w(w) { asn(h, w); }
Point2(ll h, ll w, T val) : h(h), w(w) { asn(h, w, val); }
void assign(ll h, ll w) { v.asn(h, V<T>(w)); }
void assign(ll h, ll w, ll val) { v.asn(h, V<T>(w, val)); }
T &operator()(ll h, ll w) { return v[h][w]; }
T &operator()(pl p) { return v[p.fi][p.se]; }
};
template <class T> using P2 = Point2<T>;
template <ll Mod> struct Modll {
public:
ll v;
Modll() : v(0) {}
Modll(ll _v) { set(_v % Mod + Mod); }
Modll &set(ll _v) {
v = (_v < Mod) ? _v : (_v - Mod);
return *this;
}
Modll pow(ll n) const {
Modll x = *this, ans = 1;
while (n) {
if (n & 1)
ans *= x;
x *= x;
n >>= 1;
}
return ans;
}
Modll inverse() const { return (*this).pow(Mod - 2); }
Modll operator+(const Modll &m) const { return Modll().set(v + m.v); }
Modll operator-(const Modll &m) const { return Modll().set(Mod + v - m.v); }
Modll operator*(const Modll &m) const {
return Modll().set((ull(v) * m.v) % Mod);
}
Modll operator/(const Modll &m) const { return *this * m.inv; }
Modll &operator+=(const Modll &m) { return *this = *this + m; }
Modll &operator-=(const Modll &m) { return *this = *this - m; }
Modll &operator*=(const Modll &m) { return *this = *this * m; }
Modll &operator/=(const Modll &m) { return *this = *this / m; }
Modll operator-() const { return Modll(0) - *this; }
explicit operator bool() const { return v != 0; }
friend ostream &operator<<(ostream &out, const Modll &m) {
return out << m.v;
}
};
using mll = Modll<MOD>;
using vmll = V<mll>;
using vvmll = V<vmll>;
using vvvmll = V<vvmll>;
template <class T> T vmin(V<T> v) {
T tmp = MIN<T>.I;
ROR(v, i) emin(tmp, i);
return tmp;
}
template <class T, class... Args> T vmin(V<T> v, Args... args) {
T tmp = vmin(args...);
return min(vmin(v), tmp);
}
template <class T> T vmax(V<T> v) {
T tmp = MAX<T>.I;
ROR(v, i) emax(tmp, i);
return tmp;
}
template <class T, class... Args> T vmax(V<T> v, Args... args) {
T tmp = vmax(args...);
return max(vmax(v), tmp);
}
template <class T> T vgcd(V<T> v) {
T tmp = GCD<T>.I;
ROR(v, i) egcd(tmp, i);
return tmp;
}
template <class T, class... Args> T vgcd(V<T> v, Args... args) {
T tmp = vgcd(args...);
return gcd(vgcd(v), tmp);
}
template <class T> T vlcm(V<T> v) {
T tmp = LCM<T>.I;
ROR(v, i) elcm(tmp, i);
return tmp;
}
template <class T, class... Args> T vlcm(V<T> v, Args... args) {
T tmp = vlcm(args...);
return lcm(vlcm(v), tmp);
}
vmll MFactMemo(2, 1);
vmll MIFactMemo(2, 1);
mll mFact(ll n) {
if (MFactMemo.sz <= n) {
ll oldsize = MFactMemo.sz;
MFactMemo.res(n + 1, 1);
FOR(i, oldsize, n) MFactMemo[i] = MFactMemo[i - 1] * i;
}
return MFactMemo[n];
}
mll miFact(ll n) {
if (MIFactMemo.sz <= n) {
ll oldsize = MIFactMemo.sz;
MIFactMemo.res(n + 1, 1);
MIFactMemo.bk = mFact(n).inv;
rFOR(i, oldsize + 1, n) MIFactMemo[i - 1] = MIFactMemo[i] * i;
}
return MIFactMemo[n];
}
mll mComb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return mFact(n) * miFact(k) * miFact(n - k);
}
ll LIS(vll v, ll m = 0) {
if (v.sz > 0) {
ll ans = 0;
vll dp(v.sz, INF);
FOR(i, 0, v.sz - 1) { dp[m ? UPB(dp, v[i]) : LOWB(dp, v[i])] = v[i]; }
FOR(i, 0, v.sz - 1) {
if (dp[i] == INF)
break;
ans++;
}
return ans;
} else {
return 0;
}
}
void PCmprs(vll &v) {
if (v.sz == 0)
return;
vll vv(v);
IOTA(vv, 0);
sort(vv.bgn, vv.en, [&](ll v1, ll v2) { return v[v1] < v[v2]; });
IOTA(v, 0);
sort(v.bgn, v.en, [&](ll v1, ll v2) { return vv[v1] < vv[v2]; });
return;
}
ll BblCnt(vll v) {
PCmprs(v);
SegT<ll> b(v.sz, 0);
ll ans = 0;
REP(i, v.sz) {
ans += (i - b.que(0, v[i]));
b.add(v[i], 1);
}
return ans;
}
ll Bsrch(function<bool(ll x)> f, ll mi, ll ma) {
ll ng = mi - 1, ok = ma, mid;
while (ok - ng > 1) {
mid = (ng + ok) / 2;
(f(mid) ? ok : ng) = mid;
}
return ok;
}
template <class T>
V<V<T>> MultiMatrix(V<V<T>> A, V<V<T>> B, Action<T> Mul = MUL<T>,
Action<T> Add = ADD<T>) {
V<V<T>> ans;
ll ii = A.sz;
if (!ii)
return ans;
ll jj = A[0].sz;
if (!jj)
return ans;
ll jj2 = B.sz;
if (!jj2)
return ans;
if (jj != jj2)
return ans;
ll kk = B[0].sz;
if (!kk)
return ans;
ans.asn(ii, V<T>(kk, 0));
REP(i, ii) {
REP(k, kk) {
REP(j, jj) { ans[i][k] = Add(ans[i][k], Mul(A[i][j], B[j][k])); }
}
}
return ans;
}
vvll CombMemo(1000, vll(1000, -1));
ll Comb(ll n, ll k) {
if ((n < 0) || (k < 0))
return 0;
if (CombMemo[n][k] == -1) {
if (n < k)
CombMemo[n][k] = 0;
else {
if (n == 0)
CombMemo[n][k] = 1;
else if (k == 0)
CombMemo[n][k] = 1;
else if (n == k)
CombMemo[n][k] = 1;
else
CombMemo[n][k] = Comb(n - 1, k - 1) + Comb(n - 1, k);
}
}
return CombMemo[n][k];
}
template <class T> map<T, ll> Dict(V<T> v) {
map<T, ll> m;
if (!v.sz)
return m;
SORT(v);
UNIQUE(v);
REP(i, v.sz) { m[v[i]] = i; }
return m;
}
template <class T> vll Cmprs(V<T> v) {
auto m = Dict(v);
vll ans(v.sz);
REP(i, v.sz) { ans[i] = m[v[i]]; }
return ans;
}
template <class T> auto vecn(T val) { return val; }
template <class... Args> auto vecn(ll val, Args... args) {
auto tmp = vecn(args...);
return V<decltype(tmp)>(val, tmp);
}
void Solve();
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
Solve();
}
void Solve() {
li(a, b);
// a--;
ll c = 2, r = 0, t = 0, tt;
REP(i, 39) {
t = (a & c) / c * (c * 2 - a % (c * 2));
t += (b & c) / c * ((b + 1) % c);
r += t % 2 * c;
c *= 2;
}
tt = 0;
FOR(i, a % 4, 3) { tt += (i % 2); }
FOR(i, b % 4, 3) { tt += (i % 2); }
cout << r + tt % 2;
return;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using tl = TP<ll, ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
using vtl = V<tl>;
using vvtl = V<vtl>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpl = queue<pl>;
using stll = stack<ll>;
using stpl = stack<pl>;
using mapll = map<ll, ll>;
using setll = set<ll>;
using pqll = priority_queue<ll>;
#define int ll
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define sz size()
#define bgn begin()
#define en end()
#define asn assign
#define emp empty()
#define fr front()
#define bk back()
#define clr clear()
#define ins insert
#define ers erase
#define res resize
#define tp top()
#define p_q priority_queue
#define inv inverse()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, a) FOR((i), 0, (ll)(a)-1)
#define REP0(i, a) FOR((i), 0, (ll)(a))
#define REP1(i, a) FOR((i), 1, (ll)(a))
#define rREP(i, a) rFOR((i), 0, (ll)(a)-1)
#define rREP0(i, a) rFOR((i), 0, (ll)(a))
#define rREP1(i, a) rFOR((i), 1, (ll)(a))
#define ROR(v, i) for (auto &(i) : (v))
#define IOTA(a, n) iota((a).bgn, (a).en, (n))
#define SORT(a) sort((a).bgn, (a).en)
#define rSORT(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bgn, (a).en), (a).en)
#define PREVP(a) prev_permutation((a).bgn, (a).en)
#define NEXTP(a) next_permutation((a).bgn, (a).en)
#define BINS(a, b) binary_search((a).bgn, (a).en, (b))
#define LOWB(a, b) (lower_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define UPB(a, b) (upper_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define CNT(a, b) count((a).bgn, (a).en, b)
#define SUM(a) accumulate((a).bgn, (a).en, 0)
#define REV(a) reverse((a).bgn, (a).en)
#define REGS(a, b) regex_search((a), regex(b))
#define REGM(a, b) regex_match((a), regex(b))
#define yn(a) cout << ((a) ? "yes" : "no") << "\n";
#define Yn(a) cout << ((a) ? "Yes" : "No") << "\n";
#define YN(a) cout << ((a) ? "YES" : "NO") << "\n";
#define imp(a) cout << ((a) ? "possible" : "impossible") << "\n";
#define Imp(a) cout << ((a) ? "Possible" : "Impossible") << "\n";
#define IMP(a) cout << ((a) ? "POSSIBLE" : "IMPOSSIBLE") << "\n";
#define fs(a) cout << ((a) ? "second" : "first") << "\n";
#define Fs(a) cout << ((a) ? "Second" : "First") << "\n";
#define FS(a) cout << ((a) ? "SECOND" : "FIRST") << "\n";
#define sak cout << "\n";
#define sas cout << " ";
#define sat cout << "\t";
#define dbg(a) cerr << (#a) << ": " << (a) << "\n";
#define dbgs(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__);
#define c2l(a) ((ll)(a - 48))
#define a2l(a) ((ll)(a - 97))
#define A2l(a) ((ll)(a - 65))
#define l2c(a) ((char)(a + 48))
#define l2a(a) ((char)(a + 97))
#define l2A(a) ((char)(a + 65))
#define DigN2(a) ((llabs(a) == 0) ? (1) : ((ll)(log2(double(llabs(a)))) + 1))
#define DigN10(a) ((llabs(a) == 0) ? (1) : ((ll)(log10(double(llabs(a)))) + 1))
#define Dig2(a, b) (((a) >> (b)) & 1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (double)(b))))) % 10)
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & (-(a)))
#define vin(v) \
ROR((v), (i)) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vllin2(a, b, N) \
vll(a)(N), (b)(N); \
REP(i, N) { cin >> (a)[i] >> (b)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define rdn(a, b) ((a) / (b))
#define rou(a, b) \
((((double(a) / double(b)) - ((a) / (b))) < 0.5) ? ((a) / (b)) \
: (((a) / (b)) + 1))
#define rup(a, b) ((((a) % (b)) == 0) ? ((a) / (b)) : (((a) / (b)) + 1))
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define powll(a, b) (ll)(pow((double)(a), (double)(b)))
#define Triangle(x1, y1, x2, y2, x3, y3) \
(((x1) - (x2)) * ((y1) - (y3)) - ((x1) - (x3)) * ((y1) - (y2)))
#define svll SumV<ll>
#define svvll SumV2<ll>
#define li(...) \
ll __VA_ARGS__; \
Input(__VA_ARGS__);
#define si(...) \
str __VA_ARGS__; \
Input(__VA_ARGS__);
#define vli(size, ...) \
vll __VA_ARGS__; \
vInput(size, __VA_ARGS__);
#define vsi(size, ...) \
vs __VA_ARGS__; \
vInput(size, __VA_ARGS__);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = 924844033;
// const ll MOD = 9007199254740881;
const ll INF = 1LL << 60; // 1.15e18
const double PI = acos(-1.0);
const vll DX = {0, -1, 0, 1, 0, -1, 1, 1, -1};
const vll DY = {0, 0, -1, 0, 1, -1, -1, 1, 1};
const str alp = "abcdefghijklmnopqrstuvwxyz";
const str ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
void Input() {}
template <class Var, class... Args> void Input(Var &var, Args &...args) {
cin >> var;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.res(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size, args...);
REP(i, size) vInputNum(i, args...);
}
template <class S, class T>
ostream &operator<<(ostream &out, const P<S, T> &p) {
return out << "[" << p.fi << ", " << p.se << "]";
}
template <class T> ostream &operator<<(ostream &out, V<T> &v) {
if (v.emp)
return out << "{}";
else {
auto itr = v.bgn;
out << "{" << *itr;
itr++;
while (itr != v.en) {
out << ", " << *itr;
itr++;
}
out << "}";
return out;
}
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &m) {
if (m.emp)
return out << "<[]>";
else {
auto itr = m.bgn;
out << "< [" << (itr->fi) << ": " << (itr->se);
itr++;
while (itr != m.en) {
out << "], [" << (itr->fi) << ": " << (itr->se);
itr++;
}
out << "] >";
return out;
}
}
template <class T> ostream &operator<<(ostream &out, const set<T> &s) {
if (s.emp)
return out << "<>";
else {
auto itr = s.bgn;
out << "<" << *itr;
itr++;
while (itr != s.en) {
out << ", " << *itr;
itr++;
}
out << ">";
return out;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head head, Body... body) {
cout << head << " ";
say(body...);
}
void sal() { cout << "\n"; }
template <class... Args> void sal(Args... args) {
say(args...);
cout << "\n";
}
void day() {}
template <class T> void day(T t) { cerr << t; }
template <class Head, class... Body> void day(Head head, Body... body) {
cerr << head << " ";
day(body...);
}
void dal() { cerr << "\n"; }
template <class... Args> void dal(Args... args) {
day(args...);
cerr << "\n";
}
void salv() {}
template <class T> void salv(V<T> v) {
if (v.emp)
sal();
else {
auto itr = v.bgn;
say(*itr);
itr++;
while (itr != v.en) {
sas;
say(*itr);
itr++;
}
sak;
}
}
template <class T, class... Args> void salv(V<T> v, Args... args) {
salv(v);
salv(args...);
}
void salv2() {}
template <class T> void salv2(V<V<T>> v) {
if (v.emp)
sal();
else {
ROR(v, i) salv(i);
}
}
template <class T, class... Args> void salv2(V<V<T>> v, Args... args) {
salv2(v);
salv2(args...);
}
template <class Monoid> struct Action {
public:
Monoid I;
function<Monoid(Monoid, Monoid)> A;
Action(Monoid I, function<Monoid(Monoid, Monoid)> A) : I(I), A(A) {}
Monoid operator()() { return I; }
Monoid operator()(Monoid x) { return x; }
Monoid operator()(Monoid l, Monoid r) { return A(l, r); }
template <class... Args> Monoid operator()(Monoid x, Args... args) {
Monoid tmp = operator()(args...);
return A(x, tmp);
}
};
template <class T> Action<T> ADD = Action<T>(0, [](T l, T r) { return l + r; });
template <>
Action<str> ADD<str> = Action<str>("", [](str l, str r) { return l + r; });
template <class T1, class T2>
Action<P<T1, T2>> ADD<P<T1, T2>> =
Action<P<T1, T2>>(mp(ADD<T1>.I, ADD<T2>.I), [](P<T1, T2> l, P<T1, T2> r) {
return mp(l.fi + r.fi, l.se + r.se);
});
template <class T> Action<T> MUL = Action<T>(1, [](T l, T r) { return l * r; });
template <class T> Action<T> OR = Action<T>(0, [](T l, T r) { return l | r; });
template <class T> Action<T> XOR = Action<T>(0, [](T l, T r) { return l ^ r; });
template <class T>
Action<T> AND = Action<T>(((ll)(1) << 63) - 1, [](T l, T r) { return l & r; });
template <>
Action<bool> AND<bool> = Action<bool>(true,
[](bool l, bool r) { return l & r; });
template <>
Action<ull> AND<ull> = Action<ull>(((ull)(1) << 63) - 1,
[](ull l, ull r) { return l & r; });
template <class T>
Action<T> MIN = Action<T>(INF, [](T l, T r) { return (l < r) ? l : r; });
template <class T>
Action<T> MAX = Action<T>(-INF, [](T l, T r) { return (l > r) ? l : r; });
template <class T>
Action<T> GCD = Action<T>(0, [](T l, T r) {
if (l < r) {
l ^= r;
r ^= l;
l ^= r;
}
return (r ? GCD<T>(r, l % r) : l);
});
template <class T>
Action<T> LCM = Action<T>(1, [](T l, T r) { return (l * r) / GCD<T>(l, r); });
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head head, Body... body) {
auto tmp = Min(body...);
return (head < tmp) ? head : tmp;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> auto Max(Head head, Body... body) {
auto tmp = Max(body...);
return (head > tmp) ? head : tmp;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll gcd(ll head) { return head; }
template <class... Body> ll gcd(ll head, Body... body) {
return gcd(head, gcd(body...));
}
ll lcm(ll head) { return head; }
template <class... Body> ll lcm(ll head, Body... body) {
return lcm(head, lcm(body...));
}
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UFT {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UFT() {}
UFT(const UFT &uft) {}
UFT(ll tsizeget, ll modeget = 0) {
tsize = tsizeget;
mode = modeget;
par.asn(tsize, -1);
if (!mode)
rank.res(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return x == root(x); }
bool same(ll x, ll y) { return root(x) == root(y); }
void merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] = x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
ll size(ll x) { return -par[root(x)]; }
};
struct pUFT {
public:
ll tsize;
ll now;
vll par;
vll rank;
vll mtime;
vvll sizepi;
vvll sizepv;
pUFT() {}
pUFT(const pUFT &puft) {}
pUFT(ll tsizeget) {
tsize = tsizeget;
now = 0;
par.asn(tsize, -1);
rank.asn(tsize, 0);
mtime.asn(tsize, INF);
sizepi.asn(tsize, {0});
sizepv.asn(tsize, {1});
}
ll root(ll x, ll t) { return (mtime[x] > t) ? x : root(par[x], t); }
bool same(ll x, ll y, ll t) { return root(x, t) == root(y, t); }
ll merge(ll x, ll y) {
now++;
x = root(x, now);
y = root(y, now);
if (x != y) {
if (rank[x] < rank[y]) {
par[y] += par[x];
sizepi[y].pb(now);
sizepv[y].pb(-par[y]);
par[x] = y;
mtime[x] = now;
} else {
par[x] += par[y];
sizepi[x].pb(now);
sizepv[x].pb(-par[x]);
par[y] = x;
mtime[y] = now;
if (rank[x] == rank[y])
rank[x]++;
}
}
return now;
}
ll size(ll x, ll t) {
x = root(x, t);
return sizepv[x][UPB(sizepi[x], t) - 1];
}
};
struct wUFT {
public:
ll tsize;
ll mode;
vll par;
vll rank;
vll dweight;
wUFT() {}
wUFT(const wUFT &wuft) {}
wUFT(ll tsizeget, ll modeget = 0) {
tsize = tsizeget;
mode = modeget;
par.asn(tsize, -1);
if (!mode)
rank.res(tsize, 0);
dweight.asn(tsize, 0);
}
ll root(ll x) {
if (par[x] < 0)
return x;
else {
ll r = root(par[x]);
dweight[x] += dweight[par[x]];
return par[x] = r;
}
}
ll weight(ll x) {
root(x);
return dweight[x];
}
ll diff(ll x, ll y) { return weight(y) - weight(x); }
bool isRoot(ll x) { return x == root(x); }
bool same(ll x, ll y) { return root(x) == root(y); }
void merge(ll x, ll y, ll w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] = x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
dweight[x] = -w;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
dweight[y] = w;
}
}
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename valtype> class SegT {
public:
ll size;
vector<valtype> v;
valtype initv;
function<valtype(valtype x, valtype y)> calc;
SegT() {}
SegT(const SegT &segt) {}
SegT(ll sizeget, ll modeget = 0) {
sizeset(sizeget);
modeset(modeget);
init();
}
SegT(vector<valtype> cpyvec, ll modeget = 0) {
sizeset(cpyvec.sz);
modeset(modeget);
init();
copy(cpyvec);
}
SegT(ll sizeget, valtype initvget,
function<valtype(valtype x, valtype y)> calcget) {
sizeset(sizeget);
initv = initvget;
calc = calcget;
init();
}
SegT(vector<valtype> cpyvec, valtype initvget,
function<valtype(valtype x, valtype y)> calcget) {
sizeset(cpyvec.sz);
initv = initvget;
calc = calcget;
init();
copy(cpyvec);
}
void sizeset(ll rsize) {
size = DigN2(rsize);
if (rsize == Pow2(size - 1))
size--;
return;
}
void modeset(ll mode) {
switch (mode) {
case 0:
initv = 0;
calc = [](valtype x, valtype y) { return x + y; };
break;
case 1:
initv = INF;
calc = [](valtype x, valtype y) { return min(x, y); };
break;
case 2:
initv = -INF;
calc = [](valtype x, valtype y) { return max(x, y); };
break;
}
return;
}
void init() { v.asn(Pow2(size + 1) - 1, initv); }
void copy(vector<valtype> cpyvec) {
REP(i, min(cpyvec.sz, Pow2(size))) set(i, cpyvec[i]);
}
ll i2v(ll i) const {
if (i < 0 || i >= Pow2(size))
return -1;
return Pow2(size) + i - 1;
}
ll top(ll i) const {
if (i == 0)
return -1;
return (i - 1) / 2;
}
pl bot(ll i) const {
if (i + 1 >= Pow2(size))
return mp(-1, -1);
return mp(2 * i + 1, 2 * i + 2);
}
void set(ll i, valtype x) {
i = i2v(i);
v[i] = x;
while (i > 0) {
i = top(i);
v[i] = calc(v[bot(i).fi], v[bot(i).se]);
}
return;
}
void add(ll i, valtype x) {
set(i, v[i2v(i)] + x);
return;
}
valtype operator[](const ll &i) const { return v[i2v(i)]; }
// valtype que(ll a = 0, ll b = Pow2(size) - 1) {
valtype que(ll a, ll b) {
if (a == b)
return v[i2v(a)];
if (a > b)
return initv; // swap(a, b);
valtype ans = initv;
ll ai = i2v(a);
ll bi = i2v(b);
FOR(i, 1, size + 1) {
if (a > b)
break;
if (a % Pow2(i)) {
ans = calc(ans, v[ai]);
a += Pow2(i - 1);
ai = top(ai) + 1;
} else {
ai = top(ai);
}
if (a > b)
break;
if ((b + 1) % Pow2(i)) {
ans = calc(ans, v[bi]);
b -= Pow2(i - 1);
bi = top(bi) - 1;
} else {
bi = top(bi);
}
if (a > b)
break;
}
return ans;
}
valtype que(ll b) { return que(0, b); }
valtype que() { return que(0, Pow2(size) - 1); }
};
template <typename lentype> class Graph {
public:
ll size;
ll mode;
ll mapmode;
lentype zlen;
lentype ilen;
vector<map<ll, ll>> v2n;
vvll n2v;
vector<vector<lentype>> Edge;
vector<pair<lentype, ll>> Primresult;
Graph() {}
Graph(const Graph &graph) {}
Graph(ll sizeget = 0, ll mapmodeget = 0, ll modeget = 0, lentype zlenget = 0,
lentype ilenget = INF) {
size = sizeget;
mapmode = mapmodeget;
mode = modeget;
zlen = zlenget;
ilen = ilenget;
init();
}
void init() {
Edge.res(size);
v2n.res(size);
n2v.res(size);
Primresult.asn(size, mp(ilen, -1));
}
lentype lenplus(lentype l, lentype r) { return l + r; }
lentype lenequal(lentype l, lentype r) { return l == r; }
lentype lenlcr(lentype l, lentype r) { return l < r; }
ll addV(ll vs) {
size += vs;
init();
return size;
}
void caddE(ll x, ll y, lentype c) {
if (mapmode)
v2n[x][y] = Edge[x].sz;
Edge[x].pb(c);
n2v[x].pb(y);
}
void csetE(ll x, ll y, lentype c) {
if (mapmode)
Edge[x][v2n[x][y]] = c;
}
void cersE(ll x, ll y) {
if (mapmode) {
ll n = v2n[x][y];
Edge[x][n] = ilen;
n2v[x][n] = -1;
v2n[x].ers(y);
}
}
void addE(ll x, ll y, lentype c) {
caddE(x, y, c);
if (!mode)
caddE(y, x, c);
}
void setE(ll x, ll y, lentype c) {
csetE(x, y, c);
if (!mode)
csetE(y, x, c);
}
void ersE(ll x, ll y, lentype c) {
cersE(x, y, c);
if (!mode)
cersE(y, x, c);
}
lentype getE(ll x, ll y) {
if (mapmode) {
if (v2n[x].count(y)) {
return Edge[x][v2n[x][y]];
}
}
return ilen;
}
ll getVsz(ll x) { return Edge[x].sz; }
pair<lentype, ll> getV(ll x, ll n) {
if (n >= getVsz(x))
return mp(ilen, -1);
return mp(Edge[x][n], n2v[x][n]);
}
vector<pair<lentype, vll>> Dijk(ll x) {
vector<pair<lentype, vll>> result(size);
REP(i, size) {
result[i].fi = ilen;
result[i].se = {-1};
}
vll stat(size, 0);
pair<lentype, ll> now;
pair<lentype, ll> nowlv;
SegT<pair<lentype, ll>> Q(size, mp(ilen, -1),
[](pair<lentype, ll> l, pair<lentype, ll> r) {
if (l.se == -1)
return r;
if (r.se == -1)
return l;
return l.fi < r.fi ? l : r;
});
Q.set(x, mp(zlen, x));
result[x].fi = zlen;
result[x].se = {-1};
while (Q.que(0, size - 1).se != -1) {
now = Q.que(0, size - 1);
Q.set(now.se, mp(ilen, -1));
stat[now.se] = 1;
REP(i, getVsz(now.se)) {
nowlv = getV(now.se, i);
if (stat[nowlv.se])
continue;
if (Q[nowlv.se].se == -1) {
result[nowlv.se].fi = lenplus(result[now.se].fi, nowlv.fi);
result[nowlv.se].se = {now.se};
Q.set(nowlv.se, mp(result[nowlv.se].fi, nowlv.se));
} else {
if (lenlcr(lenplus(result[now.se].fi, nowlv.fi),
result[nowlv.se].fi)) {
result[nowlv.se].fi = lenplus(result[now.se].fi, nowlv.fi);
result[nowlv.se].se = {now.se};
Q.set(nowlv.se, mp(result[nowlv.se].fi, nowlv.se));
} else if (lenequal(lenplus(result[now.se].fi, nowlv.fi),
result[nowlv.se].fi)) {
result[nowlv.se].se.pb(now.se);
}
}
}
}
return result;
}
lentype Prim(ll x = 0) {
lentype ans = zlen;
vll stat(size, 0);
pair<lentype, ll> now;
pair<lentype, ll> nowlv;
SegT<pair<lentype, ll>> Q(size, mp(ilen, -1),
[](pair<lentype, ll> l, pair<lentype, ll> r) {
if (l.se == -1)
return r;
if (r.se == -1)
return l;
return l.fi < r.fi ? l : r;
});
Q.set(x, mp(zlen, x));
Primresult[x] = mp(zlen, -1);
while (Q.que(0, size - 1).se != -1) {
now = Q.que(0, size - 1);
Q.set(now.se, mp(ilen, -1));
stat[now.se] = 1;
ans = lenplus(ans, Primresult[now.se].fi);
REP(i, getVsz(now.se)) {
nowlv = getV(now.se, i);
if (stat[nowlv.se])
continue;
if (Q[nowlv.se].se == -1) {
Primresult[nowlv.se] = mp(nowlv.fi, now.se);
Q.set(nowlv.se, mp(Primresult[nowlv.se].fi, nowlv.se));
} else {
if (lenlcr(nowlv.fi, Primresult[nowlv.se].fi)) {
Primresult[nowlv.se] = mp(nowlv.fi, now.se);
Q.set(nowlv.se, mp(Primresult[nowlv.se].fi, nowlv.se));
}
}
}
}
return ans;
}
};
/*template <class Type> class DP {
public:
vector<Type> v;
Type initv;
vll size, block;
DP() {}
DP(const DP &dp) {}
template<class... Args> DP(Args... args) {
block.asn(1, 1);
Initialize(args...);
}
void Initialize(Type initv_) {
initv = initv_;
v.asn(block.bk, initv);
}
template<class... Args> void Initialize(ll val, Args... args) {
size.pb(val);
block.pb(block.bk*val);
Initialize(args...);
}
};*/
pl Bezout(ll a, ll b) {
if (b != 0) {
pl xy;
xy = Bezout(b, a % b);
return mp(xy.se, xy.fi - ((a / b) * xy.se));
} else {
return mp(1, 0);
}
}
pl Bez(ll a, ll b, ll c) {
pl xy;
ll x, y, z, gc;
xy = Bezout(a, b);
gc = gcd(a, b);
if (c % gc != 0)
return mp(-1, -1);
x = xy.fi * (c / gc);
y = xy.se * (c / gc);
if (x < 0)
z = rup(-x, (b / gc));
if (x >= 0)
z = -x / (b / gc);
x += z * (b / gc);
y -= z * (a / gc);
return mp(x, y);
}
ll DigS10(ll n) {
ll ans = 0;
while (1) {
ans += n % 10;
n /= 10;
if (!n)
break;
}
return ans;
}
ll isP(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n) + 1) {
if (n % i == 0)
return 0;
}
return 1;
}
ll Tot(ll n) {
if (n <= 0)
return 0;
ll ans = n, x = 2;
while (x * x <= n) {
if (n % x == 0) {
ans -= ans / x;
while (n % x == 0)
n /= x;
}
x++;
}
if (n > 1)
ans -= ans / n;
return ans;
}
template <class T> struct Sum {
public:
V<T> v, s;
ll size;
Action<T> Add;
Sum(V<T> v, Action<T> Add = ADD<T>) : v(v), size(v.sz), Add(Add) {
Init();
Calc();
}
void Init() { s.asn(size + 1, Add.I); }
void Calc() { REP(i, size) s[i + 1] = Add(s[i], v[i]); }
T operator()(ll x) { return operator()(0, x); }
T operator()(ll l, ll r) {
if (l < 0)
l = 0;
if (r >= size)
r = size - 1;
if (l > r)
return Add.I;
return s[r + 1] - s[l]; // for ADD
}
};
using sumll = Sum<ll>;
template <class T> struct Sum2 {
public:
V<V<T>> v, s;
ll RowSize, ColumnSize;
Action<T> Add;
Sum2(V<V<T>> v, Action<T> Add = ADD<T>)
: v(v), RowSize(v.sz), ColumnSize(v.sz ? v[0].sz : 0), Add(Add) {
Init();
Calc();
}
void Init() { s.asn(RowSize + 1, V<T>(ColumnSize, Add.I)); }
void Calc() {
REP1(r, RowSize) {
REP1(c, ColumnSize) {
s[r][c] =
v[r - 1][c - 1] + operator()(r, c - 1) + operator()(r - 1, c) -
operator()(r - 1, c - 1);
}
}
}
T operator()(ll r, ll c) { return operator()(0, 0, r, c); }
T operator()(ll r1, ll c1, ll r2, ll c2) {
if (r1 < 0)
r1 = 0;
if (c1 < 0)
c1 = 0;
if (r2 >= RowSize)
r2 = RowSize - 1;
if (c2 >= ColumnSize)
c2 = ColumnSize - 1;
if (r1 > r2)
return Add.I;
if (c1 > c2)
return Add.I;
return s[r2 + 1][c2 + 1] - s[r2 + 1][c1] - s[r1][c2 + 1] + s[r1][c1];
}
};
using sum2ll = Sum2<ll>;
template <class T> struct Point2 {
public:
V<V<T>> v;
ll h, w;
Point2() : h(0), w(0) {}
Point2(ll h, ll w) : h(h), w(w) { asn(h, w); }
Point2(ll h, ll w, T val) : h(h), w(w) { asn(h, w, val); }
void assign(ll h, ll w) { v.asn(h, V<T>(w)); }
void assign(ll h, ll w, ll val) { v.asn(h, V<T>(w, val)); }
T &operator()(ll h, ll w) { return v[h][w]; }
T &operator()(pl p) { return v[p.fi][p.se]; }
};
template <class T> using P2 = Point2<T>;
template <ll Mod> struct Modll {
public:
ll v;
Modll() : v(0) {}
Modll(ll _v) { set(_v % Mod + Mod); }
Modll &set(ll _v) {
v = (_v < Mod) ? _v : (_v - Mod);
return *this;
}
Modll pow(ll n) const {
Modll x = *this, ans = 1;
while (n) {
if (n & 1)
ans *= x;
x *= x;
n >>= 1;
}
return ans;
}
Modll inverse() const { return (*this).pow(Mod - 2); }
Modll operator+(const Modll &m) const { return Modll().set(v + m.v); }
Modll operator-(const Modll &m) const { return Modll().set(Mod + v - m.v); }
Modll operator*(const Modll &m) const {
return Modll().set((ull(v) * m.v) % Mod);
}
Modll operator/(const Modll &m) const { return *this * m.inv; }
Modll &operator+=(const Modll &m) { return *this = *this + m; }
Modll &operator-=(const Modll &m) { return *this = *this - m; }
Modll &operator*=(const Modll &m) { return *this = *this * m; }
Modll &operator/=(const Modll &m) { return *this = *this / m; }
Modll operator-() const { return Modll(0) - *this; }
explicit operator bool() const { return v != 0; }
friend ostream &operator<<(ostream &out, const Modll &m) {
return out << m.v;
}
};
using mll = Modll<MOD>;
using vmll = V<mll>;
using vvmll = V<vmll>;
using vvvmll = V<vvmll>;
template <class T> T vmin(V<T> v) {
T tmp = MIN<T>.I;
ROR(v, i) emin(tmp, i);
return tmp;
}
template <class T, class... Args> T vmin(V<T> v, Args... args) {
T tmp = vmin(args...);
return min(vmin(v), tmp);
}
template <class T> T vmax(V<T> v) {
T tmp = MAX<T>.I;
ROR(v, i) emax(tmp, i);
return tmp;
}
template <class T, class... Args> T vmax(V<T> v, Args... args) {
T tmp = vmax(args...);
return max(vmax(v), tmp);
}
template <class T> T vgcd(V<T> v) {
T tmp = GCD<T>.I;
ROR(v, i) egcd(tmp, i);
return tmp;
}
template <class T, class... Args> T vgcd(V<T> v, Args... args) {
T tmp = vgcd(args...);
return gcd(vgcd(v), tmp);
}
template <class T> T vlcm(V<T> v) {
T tmp = LCM<T>.I;
ROR(v, i) elcm(tmp, i);
return tmp;
}
template <class T, class... Args> T vlcm(V<T> v, Args... args) {
T tmp = vlcm(args...);
return lcm(vlcm(v), tmp);
}
vmll MFactMemo(2, 1);
vmll MIFactMemo(2, 1);
mll mFact(ll n) {
if (MFactMemo.sz <= n) {
ll oldsize = MFactMemo.sz;
MFactMemo.res(n + 1, 1);
FOR(i, oldsize, n) MFactMemo[i] = MFactMemo[i - 1] * i;
}
return MFactMemo[n];
}
mll miFact(ll n) {
if (MIFactMemo.sz <= n) {
ll oldsize = MIFactMemo.sz;
MIFactMemo.res(n + 1, 1);
MIFactMemo.bk = mFact(n).inv;
rFOR(i, oldsize + 1, n) MIFactMemo[i - 1] = MIFactMemo[i] * i;
}
return MIFactMemo[n];
}
mll mComb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return mFact(n) * miFact(k) * miFact(n - k);
}
ll LIS(vll v, ll m = 0) {
if (v.sz > 0) {
ll ans = 0;
vll dp(v.sz, INF);
FOR(i, 0, v.sz - 1) { dp[m ? UPB(dp, v[i]) : LOWB(dp, v[i])] = v[i]; }
FOR(i, 0, v.sz - 1) {
if (dp[i] == INF)
break;
ans++;
}
return ans;
} else {
return 0;
}
}
void PCmprs(vll &v) {
if (v.sz == 0)
return;
vll vv(v);
IOTA(vv, 0);
sort(vv.bgn, vv.en, [&](ll v1, ll v2) { return v[v1] < v[v2]; });
IOTA(v, 0);
sort(v.bgn, v.en, [&](ll v1, ll v2) { return vv[v1] < vv[v2]; });
return;
}
ll BblCnt(vll v) {
PCmprs(v);
SegT<ll> b(v.sz, 0);
ll ans = 0;
REP(i, v.sz) {
ans += (i - b.que(0, v[i]));
b.add(v[i], 1);
}
return ans;
}
ll Bsrch(function<bool(ll x)> f, ll mi, ll ma) {
ll ng = mi - 1, ok = ma, mid;
while (ok - ng > 1) {
mid = (ng + ok) / 2;
(f(mid) ? ok : ng) = mid;
}
return ok;
}
template <class T>
V<V<T>> MultiMatrix(V<V<T>> A, V<V<T>> B, Action<T> Mul = MUL<T>,
Action<T> Add = ADD<T>) {
V<V<T>> ans;
ll ii = A.sz;
if (!ii)
return ans;
ll jj = A[0].sz;
if (!jj)
return ans;
ll jj2 = B.sz;
if (!jj2)
return ans;
if (jj != jj2)
return ans;
ll kk = B[0].sz;
if (!kk)
return ans;
ans.asn(ii, V<T>(kk, 0));
REP(i, ii) {
REP(k, kk) {
REP(j, jj) { ans[i][k] = Add(ans[i][k], Mul(A[i][j], B[j][k])); }
}
}
return ans;
}
vvll CombMemo(1000, vll(1000, -1));
ll Comb(ll n, ll k) {
if ((n < 0) || (k < 0))
return 0;
if (CombMemo[n][k] == -1) {
if (n < k)
CombMemo[n][k] = 0;
else {
if (n == 0)
CombMemo[n][k] = 1;
else if (k == 0)
CombMemo[n][k] = 1;
else if (n == k)
CombMemo[n][k] = 1;
else
CombMemo[n][k] = Comb(n - 1, k - 1) + Comb(n - 1, k);
}
}
return CombMemo[n][k];
}
template <class T> map<T, ll> Dict(V<T> v) {
map<T, ll> m;
if (!v.sz)
return m;
SORT(v);
UNIQUE(v);
REP(i, v.sz) { m[v[i]] = i; }
return m;
}
template <class T> vll Cmprs(V<T> v) {
auto m = Dict(v);
vll ans(v.sz);
REP(i, v.sz) { ans[i] = m[v[i]]; }
return ans;
}
template <class T> auto vecn(T val) { return val; }
template <class... Args> auto vecn(ll val, Args... args) {
auto tmp = vecn(args...);
return V<decltype(tmp)>(val, tmp);
}
void Solve();
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
Solve();
}
void Solve() {
li(a, b);
// a--;
ll c = 2, r = 0, t = 0, tt;
REP(i, 39) {
t = (a & c) / c * (c * 2 - a % (c * 2));
t += (b & c) / c * ((b + 1) % c);
// cout << (a&c)/c * (c*2-a%(c*2)) << " " << (b&c)/c * ((b+1)%c) << endl;
r += t % 2 * c;
c *= 2;
}
tt = 0;
FOR(i, a % 4, 3) { tt += (i % 2); }
FOR(i, 0, b % 4) { tt += (i % 2); }
cout << r + tt % 2;
return;
} | [
"call.arguments.add",
"call.arguments.change"
] | 912,073 | 912,074 | u172929647 | cpp |
p03104 | #include <stdio.h>
#include <stdlib.h>
long p[111111], a[111111], b[111111];
int compare(const void *c, const void *d) {
return a[*(long *)c] - a[*(long *)d];
}
int main() {
long a, b, i, ans;
scanf("%ld%ld", &a, &b);
if (a % 2 == 0) {
if ((b - a) % 4 == 0)
ans = b;
if ((b - a) % 4 == 1)
ans = 1;
if ((b - a) % 4 == 2)
ans = b + 1;
if ((b - a) % 4 == 3)
ans = 0;
} else {
if ((b - a) % 4 == 0)
ans = a;
if ((b - a) % 4 == 1)
ans = a ^ b;
if ((b - a) % 4 == 2)
ans = a - 1;
if ((b - a) % 4 == 3)
ans = a ^ b - 1;
}
printf("%ld\n", ans);
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
long p[111111], a[111111], b[111111];
int compare(const void *c, const void *d) {
return a[*(long *)c] - a[*(long *)d];
}
int main() {
long a, b, i, ans;
scanf("%ld%ld", &a, &b);
if (a % 2 == 0) {
if ((b - a) % 4 == 0)
ans = b;
if ((b - a) % 4 == 1)
ans = 1;
if ((b - a) % 4 == 2)
ans = b + 1;
if ((b - a) % 4 == 3)
ans = 0;
} else {
if ((b - a) % 4 == 0)
ans = a;
if ((b - a) % 4 == 1)
ans = a ^ b;
if ((b - a) % 4 == 2)
ans = a - 1;
if ((b - a) % 4 == 3)
ans = (a ^ b) - 1;
}
printf("%ld\n", ans);
return 0;
}
| [] | 912,077 | 912,078 | u933068010 | cpp |
p03104 | #include <stdio.h>
#include <stdlib.h>
long p[111111], a[111111], b[111111];
int compare(const void *c, const void *d) {
return a[*(long *)c] - a[*(long *)d];
}
int main() {
long a, b, pa[44], pb[44], i, ans = 0, ca, cb, t;
scanf("%ld%ld", &a, &b);
i = 0;
ca = a;
cb = b;
while (ca != 0) {
pa[i] = ca % 2;
ca = ca / 2;
i++;
}
while (i <= 40) {
pa[i] = 0;
i++;
}
i = 0;
while (cb != 0) {
pb[i] = cb % 2;
cb = cb / 2;
i++;
}
while (i <= 40) {
pb[i] = 0;
i++;
}
if (a % 2 == 0) {
if ((b - a) % 4 == 0)
ans = b;
if ((b - a) % 4 == 1)
ans = 1;
if ((b - a) % 4 == 2)
ans = b + 1;
if ((b - a) % 4 == 3)
ans = 0;
} else {
if ((b - a) % 4 == 0)
ans = a;
if ((b - a) % 4 == 1) {
t = 1;
for (i = 0; i <= 40; i++) {
if (pa[i] != pb[i])
ans += t;
t = t * 2;
}
}
if ((b - a) % 4 == 2)
ans = a - 1;
if ((b - a) % 4 == 3) {
t = 1;
for (i = 0; i <= 40; i++) {
if (pa[i] != pb[i])
ans += t;
t = t * 2;
}
}
}
printf("%ld\n", ans);
return 0;
} | #include <stdio.h>
#include <stdlib.h>
long p[111111], a[111111], b[111111];
int compare(const void *c, const void *d) {
return a[*(long *)c] - a[*(long *)d];
}
int main() {
long a, b, pa[44], pb[44], i, ans = 0, ca, cb, t;
scanf("%ld%ld", &a, &b);
i = 0;
ca = a;
cb = b;
while (ca != 0) {
pa[i] = ca % 2;
ca = ca / 2;
i++;
}
while (i <= 40) {
pa[i] = 0;
i++;
}
i = 0;
while (cb != 0) {
pb[i] = cb % 2;
cb = cb / 2;
i++;
}
while (i <= 40) {
pb[i] = 0;
i++;
}
if (a % 2 == 0) {
if ((b - a) % 4 == 0)
ans = b;
if ((b - a) % 4 == 1)
ans = 1;
if ((b - a) % 4 == 2)
ans = b + 1;
if ((b - a) % 4 == 3)
ans = 0;
} else {
if ((b - a) % 4 == 0)
ans = a;
if ((b - a) % 4 == 1) {
t = 1;
for (i = 0; i <= 40; i++) {
if (pa[i] != pb[i])
ans += t;
t = t * 2;
}
}
if ((b - a) % 4 == 2)
ans = a - 1;
if ((b - a) % 4 == 3) {
t = 1;
for (i = 0; i <= 40; i++) {
if (pa[i] != pb[i])
ans += t;
t = t * 2;
}
ans--;
}
}
printf("%ld\n", ans);
return 0;
} | [
"expression.unary.arithmetic.add"
] | 912,079 | 912,080 | u933068010 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.