problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03104 | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#i... | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 912,085 | 912,086 | u376103660 | cpp |
p03104 | #include <bits/stdc++.h>
#define INT long long int
#define oo 987654321
using namespace std;
INT a, b, A, B;
int main() {
ios::sync_with_stdio(false);
cin >> a >> b;
a--;
if (b > 2) {
if (b % 4 == 3)
B = 0;
else if (b % 4 == 2)
B = b + 1;
else if (b % 4 == 1)
B = 1;
else if (b... | #include <bits/stdc++.h>
#define INT long long int
#define oo 987654321
using namespace std;
INT a, b, A, B;
int main() {
ios::sync_with_stdio(false);
cin >> a >> b;
a--;
if (b > 2) {
if (b % 4 == 3)
B = 0;
else if (b % 4 == 2)
B = b + 1;
else if (b % 4 == 1)
B = 1;
else if (b... | [
"assignment.variable.change",
"identifier.change"
] | 912,089 | 912,090 | u846271630 | cpp |
p03104 | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
ll cx(ll n) {
ll b = (... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
ll cx(ll n) {
ll c = (... | [
"variable_declaration.name.change",
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 912,097 | 912,098 | u158253287 | cpp |
p03104 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for(__typeof(c.begin() x=c.begin();x!=c.end();x++)
#define RITR(x, c) for(__typeof(c.rbegin() x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#define vll vector... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ITR(x, c) for(__typeof(c.begin() x=c.begin();x!=c.end();x++)
#define RITR(x, c) for(__typeof(c.rbegin() x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
#define lf double
#define ll long long
#define vll vector... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 912,109 | 912,110 | u682686221 | cpp |
p03104 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | [
"expression.operation.binary.remove"
] | 912,113 | 912,114 | u130196064 | cpp |
p03104 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll a, b, bita[40], bitb[42], pow2[42], A[42], B[42], ans;
int main() {
cin >> a >> b;
ll c = a, d = b;
ll s = 0, t = 0;
while (c) {
A[s] = c % 2;
s++, c /= 2;
}
whi... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll a, b, bita[42], bitb[42], pow2[42], A[42], B[42], ans;
int main() {
cin >> a >> b;
ll c = a, d = b;
ll s = 0, t = 0;
while (c) {
A[s] = c % 2;
s++, c /= 2;
}
whi... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 912,115 | 912,116 | u475007080 | cpp |
p03104 | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 912,128 | 912,129 | u487476769 | cpp |
p03104 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).be... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).be... | [
"expression.operation.binary.remove"
] | 912,146 | 912,145 | u789417951 | cpp |
p03104 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"expression.operation.binary.change"
] | 912,152 | 912,153 | u186359321 | cpp |
p03104 | #include <iostream>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
long long f(long long a) {
long long t, s;
if ((a + 1) % 2 == 0)
t = 0;
else
t = 1;
if ((a + 1) % 2 == 0)
s = 0;
else
s = a;
return t ^ s;
}
int main() {
long long a, b;
cin >> a >> b;
co... | #include <iostream>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
long long f(long long a) {
long long t, s;
if (((a + 1) / 2) % 2 == 0)
t = 0;
else
t = 1;
if ((a + 1) % 2 == 0)
s = 0;
else
s = a;
return t ^ s;
}
int main() {
long long a, b;
cin >> a >> b... | [
"control_flow.branch.if.condition.change"
] | 912,160 | 912,161 | u886790158 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
uint64_t GetXor(uint64_t A, uint64_t B) {
uint64_t ret;
for (uint64_t i = A; i <= B; i++) {
... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
uint64_t GetXor(uint64_t A, uint64_t B) {
uint64_t ret;
for (uint64_t i = A; i <= B; i++) {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 912,162 | 912,163 | u074059110 | cpp |
p03104 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
uint64_t GetXor(uint64_t A, uint64_t B) {
uint64_t ret;
for (uint64_t i = A; i <= B; i++) {
... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
uint64_t GetXor(uint64_t A, uint64_t B) {
uint64_t ret;
for (uint64_t i = A; i <= B; i++) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 912,164 | 912,163 | u074059110 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
long long f(long long x) {
if (x % 4 == 0) {
return x;
} else if (x % 4 == 1) {
return 1;
} else if (x % 4 == 2) {
return x + 1;
} else {
return 0;
}
}
int main() {
long long a, b;
cin >> a >> b;
cout << (f(b) ^ (a == 0 ? 0 : (a - 1))) << end... | #include <bits/stdc++.h>
using namespace std;
long long f(long long x) {
if (x % 4 == 0) {
return x;
} else if (x % 4 == 1) {
return 1;
} else if (x % 4 == 2) {
return x + 1;
} else {
return 0;
}
}
int main() {
long long a, b;
cin >> a >> b;
cout << (f(b) ^ (a == 0 ? 0 : f(a - 1))) << en... | [
"call.add"
] | 912,167 | 912,168 | u653786383 | cpp |
p03104 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define REP(i, n) FOR(i, 0, n)
ll f_func(ll x) {
if (x < 0) {
return 0;
}
ll ans;
if (x % 2) {
ans = (x + 1) / 2 % 2;
} else {
ans = x / 2 % 2 + x;
}
return ans;
}
ll ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define REP(i, n) FOR(i, 0, n)
ll f_func(ll x) {
if (x < 0) {
return 0;
}
ll ans;
if (x % 2) {
ans = (x + 1) / 2 % 2;
} else {
ans = x / 2 % 2 + x;
}
return ans;
}
ll ... | [
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 912,180 | 912,181 | u960732690 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
long long func(long long x) {
if (x % 4 == 0)
return x;
if (x % 4 == 1)
return 1;
if (x % 4 == 2)
return x + 1;
if (x % 4 == 0)
return 0;
}
int main() {
long long A, B;
cin >> A >> B;
if (A == 0) {
cout << func(B) << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
long long func(long long 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() {
long long A, B;
cin >> A >> B;
if (A == 0) {
cout << func(B) << endl;
return 0;
}... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 912,184 | 912,185 | u546943614 | cpp |
p03104 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x, y) \
for (int i = 0; i < (n); i++) \
cin >> x[i] >> y[i... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x, y) \
for (int i = 0; i < (n); i++) \
cin >> x[i] >> y[i... | [
"variable_declaration.type.change"
] | 912,193 | 912,194 | u928536113 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
long long A, B;
long long func_xor(long long a) {
// int max_2_power = std::log2(a);
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
} else if (a == 2) {
return 3;
} else {
long long souwa_xor = 0;
int ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
long long A, B;
long long func_xor(long long a) {
// int max_2_power = std::log2(a);
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
} else if (a == 2) {
return 3;
} else {
long long souwa_xor = 0;
int ... | [
"assignment.value.change",
"call.arguments.change"
] | 912,195 | 912,196 | u604262137 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x... | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"expression.operator.change"
] | 912,199 | 912,200 | u943004959 | cpp |
p03104 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define int long long
using namespace std;
typedef vector<int> vint;
typedef pair<int, int> pint;
int calc(int N) // 0^1^...^N
{
int res = 0;
for (int i = N / 4 * 4; i <= N... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define int long long
using namespace std;
typedef vector<int> vint;
typedef pair<int, int> pint;
int calc(int N) // 0^1^...^N
{
int res = 0;
for (int i = N / 4 * 4; i <= N... | [
"expression.operator.change"
] | 912,205 | 912,206 | u738450435 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
ll a, b;
cin >> a >> b;
if (a % 2 == 0 && b % 2 == 0) {
if (((b - 1 - a + 1) / 2) % 2 == 1) {
cout << (1 ^ b) << endl;
} else {
cout << b << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
ll a, b;
cin >> a >> b;
if (a % 2 == 0 && b % 2 == 0) {
if (((b - 1 - a + 1) / 2) % 2 == 1) {
cout << (1 ^ b) << endl;
} else {
cout << b << endl;
... | [
"control_flow.branch.if.condition.change"
] | 912,211 | 912,212 | u376817785 | cpp |
p03104 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | [
"expression.unary.arithmetic.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 912,230 | 912,231 | u917944707 | cpp |
p03104 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | [
"control_flow.branch.if.condition.change"
] | 912,230 | 912,232 | u917944707 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
long long ans(long long n) {
if (n & 1LL)
return ((n + 1) / 2) & 1LL;
else
return ((n / 2) & 1LL) ^ n;
}
int main() {
long long a, b;
cin >> a >> b;
cout << (ans(a > 0 ? a : 1LL) ^ ans(b)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long ans(long long n) {
if (n & 1LL)
return ((n + 1) / 2) & 1LL;
else
return ((n / 2) & 1LL) ^ n;
}
int main() {
long long a, b;
cin >> a >> b;
cout << (ans(a > 0 ? a - 1 : a) ^ ans(b)) << endl;
} | [
"io.output.change",
"call.arguments.change"
] | 912,235 | 912,236 | u647474992 | 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 - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | #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 - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | [
"identifier.change",
"io.output.change"
] | 912,239 | 912,240 | u986276444 | cpp |
p03104 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | [
"expression.unary.arithmetic.add"
] | 912,243 | 912,244 | u566864240 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
long cal(long n) {
if (n % 2 == 0) {
return ((long)(n / 2) % 2) ^ n;
} else {
return ((long)((n + 1) / 2) % 2);
}
}
int main() {
long A, B;
cin >> A >> B;
long C = cal(A) ^ cal(B);
cout << C;
}
| #include <bits/stdc++.h>
using namespace std;
long cal(long n) {
if (n % 2 == 0) {
return ((long)(n / 2) % 2) ^ n;
} else {
return ((long)((n + 1) / 2) % 2);
}
}
int main() {
long A, B;
cin >> A >> B;
long C = cal(A - 1) ^ cal(B);
cout << C;
}
| [
"assignment.change"
] | 912,245 | 912,246 | u873627575 | cpp |
p03104 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <vector>
using sll = signed long long;
using bs = std::bitset<16>;
auto f(sll a) -> sll {
if (a < 0)
return 0;
auto m4 = a % 4;
auto ans = a - m4;
for (sll i{ans + 1}; i <= a; ++i)
ans ^= i;
return -1;
}
int mai... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <vector>
using sll = signed long long;
using bs = std::bitset<16>;
auto f(sll a) -> sll {
if (a < 0)
return 0;
auto m4 = a % 4;
auto ans = a - m4;
for (sll i{ans + 1}; i <= a; ++i)
ans ^= i;
return ans;
}
int ma... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 912,247 | 912,248 | u837286475 | cpp |
p03104 | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b;
cin >> a >> b;
ll ans = 0;
for (int i = 0; i < 40; i++) {
ll k;
if (i == 0) {
if (a % 2 == 0 && b % 2 == 0)
k = (b - a);
... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b;
cin >> a >> b;
ll ans = 0;
for (int i = 0; i < 40; i++) {
ll k;
if (i == 0) {
if (a % 2 == 0 && b % 2 == 0)
k = (b - a) / ... | [
"assignment.change"
] | 912,251 | 912,252 | u921168761 | cpp |
p03104 | #include <iostream>
using namespace std;
typedef long long ll;
ll two(ll n) {
ll ans = 1;
for (int i = 0; i < n; i++) {
ans *= 2;
}
return ans;
}
string bit(ll n) {
string ans = "";
for (int i = 0; i < 42; i++) {
char c = '0' + n % 2;
ans = ans + c;
n /= 2;
}
return ans;
}
ll my_xor(... | #include <iostream>
using namespace std;
typedef long long ll;
ll two(ll n) {
ll ans = 1;
for (int i = 0; i < n; i++) {
ans *= 2;
}
return ans;
}
string bit(ll n) {
string ans = "";
for (int i = 0; i < 42; i++) {
char c = '0' + n % 2;
ans = ans + c;
n /= 2;
}
return ans;
}
ll my_xor(... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 912,253 | 912,254 | u179970156 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | [
"control_flow.branch.if.condition.change"
] | 912,265 | 912,266 | u013628553 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | #include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x)... | [
"control_flow.branch.if.condition.change"
] | 912,267 | 912,266 | u013628553 | cpp |
p03104 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long f(long long n) {
long long s = 0;
if (n % 4 == 1 || n % 4 == 2)
s ^= 1;
for (int i = 1; i < 40; i++) {
long long t = 1LL << i;
if (n % (2 * t) >= t) {
if (n... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long f(long long n) {
long long s = 0;
if (n % 4 == 1 || n % 4 == 2)
s ^= 1;
for (int i = 1; i < 40; i++) {
long long t = 1LL << i;
if (n % (2 * t) >= t) {
if (n... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 912,298 | 912,299 | u006493569 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
struct node {
int num, val;
} a[111111];
int cmp(node a, node b) { return a.val < b.val; }
int main(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
struct node {
long long num, val;
} a[111111];
int cmp(node a, node b) { return a.val < b.val; }
int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 912,302 | 912,303 | u173380057 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
#define all(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(void) {
int n, m;
cin >> n >> m;
vector<pii> ab(n);
for (int i = 0; i < n; i++) {
cin >> ab[i].first >> ab[i].second;
}
sor... | #include <algorithm>
#include <iostream>
#include <vector>
#define all(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
int main(void) {
ll n, m;
cin >> n >> m;
vector<pii> ab(n);
for (int i = 0; i < n; i++) {
cin >> ab[i].first >> ab[i].second;
}
sort(a... | [
"variable_declaration.type.change"
] | 912,312 | 912,313 | u188020698 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M; // N個の店舗(値段と購入制限をのちに持たせる), M個のドリンクが欲しい
cin >> N >> M;
vector<int> A(N), B(N); // Aは値段のみを格納, Bは購入制限のみを格納
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
// AとB... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M; // N個の店舗(値段と購入制限をのちに持たせる), M個のドリンクが欲しい
cin >> N >> M;
vector<int> A(N), B(N); // Aは値段のみを格納, Bは購入制限のみを格納
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
// AとB... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 912,314 | 912,315 | u708255304 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> drink(N);
for (int i = 0; i < N; i++) {
cin >> drink[i].first >> drink[i].second;
}
sort(drink.begin(), drink.end());
int i = 0;
int money = 0;
while (M > d... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> drink(N);
for (int i = 0; i < N; i++) {
cin >> drink[i].first >> drink[i].second;
}
sort(drink.begin(), drink.end());
int i = 0;
long money = 0;
while (M > ... | [
"variable_declaration.type.primitive.change"
] | 912,321 | 912,322 | u761510695 | cpp |
p03103 | #include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
pair<int, int> m[100010];
for (int i = 0; i < n; i++) {
cin >> m[i].first >> m[i].second;
}
sort(m, m + n);
long long int ans = 0;
for (int j = 0; j < n; j++) {
if (m[j].second ... | #include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
pair<long int, int> m[100010];
for (int i = 0; i < n; i++) {
cin >> m[i].first >> m[i].second;
}
sort(m, m + n);
long long int ans = 0;
for (int j = 0; j < n; j++) {
if (m[j].se... | [
"variable_declaration.type.widen.change"
] | 912,323 | 912,324 | u127856129 | cpp |
p03103 | #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 - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | #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 - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | [
"assignment.value.change"
] | 912,327 | 912,328 | u986276444 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct AB {
long long a;
long long b;
AB(long long sub_a, long long sub_b) {
a = sub_a;
b = sub_b;
}
bool operator<(const AB &another) const { return a < another.a; };
};
int main() {
int N, M;
long long ans = 0;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct AB {
long long a;
long long b;
AB(long long sub_a, long long sub_b) {
a = sub_a;
b = sub_b;
}
bool operator<(const AB &another) const { return a < another.a; };
};
int main() {
long long N, M;
long long ans ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"call.arguments.change"
] | 912,329 | 912,330 | u950603962 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
ios::sync_with_stdio(false);
int N, M;
map<int, int> m;
cin >> N >> M;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
ios::sync_with_stdio(false);
int N, M;
map<int, int> m;
cin >> N >> M;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A... | [
"type_conversion.add"
] | 912,331 | 912,332 | u572532976 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> p(N);
int cnt = 0;
long long sum = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i).first >> p.at(i).second;
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
cnt = min(M, p.at(i).... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long M;
cin >> N >> M;
vector<pair<long, long>> p(N);
long cnt = 0;
long sum = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i).first >> p.at(i).second;
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
cnt = min(M, p.a... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 912,335 | 912,336 | u873627575 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> p(N);
int cnt = 0;
long sum = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i).first >> p.at(i).second;
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
cnt = min(M, p.at(i).secon... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long M;
cin >> N >> M;
vector<pair<long, long>> p(N);
long cnt = 0;
long sum = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i).first >> p.at(i).second;
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
cnt = min(M, p.a... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 912,337 | 912,336 | u873627575 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> p(N);
int cnt = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i).first >> p.at(i).second;
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
cnt = min(M, p.at(i).second... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long M;
cin >> N >> M;
vector<pair<long, long>> p(N);
long cnt = 0;
long sum = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i).first >> p.at(i).second;
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
cnt = min(M, p.a... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 912,338 | 912,336 | u873627575 | cpp |
p03103 | /*
Date:
Author:
Descipction
*/
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
struct store {
int price;
int num;
};
bool compare(store a, store b) { return a.price < b.price; };
int main() {
int n, m, i = 0, j, sum = 0 /*算累積錢*/, need /*差幾罐*/;
cin >> n >> m;
need = m;
sto... | /*
Date:
Author:
Descipction
*/
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
struct store {
long long int price;
long long int num;
};
bool compare(store a, store b) { return a.price < b.price; };
int main() {
long long int n, m, i = 0, j, sum = 0 /*算累積錢*/, need /*差幾罐*/;
ci... | [
"variable_declaration.type.widen.change"
] | 912,342 | 912,343 | u046140700 | cpp |
p03103 | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> a(n);
rep(i, ... | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) (a).begin(), (a).end()
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long, long>> a(n);
rep(i... | [
"variable_declaration.type.primitive.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 912,346 | 912,347 | u434662823 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef struct {
int a;
int b;
} mise;
bool cmp(const mise &x, const mise &y) { return x.a < y.a; }
int main(void) {
long long n, m, ans = 0;
mise da[100010];
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> da[i].a >> da[i].b;
sort(da, da + 2 * n, cmp... | #include <bits/stdc++.h>
using namespace std;
typedef struct {
long long a;
long long b;
} mise;
bool cmp(const mise &x, const mise &y) { return x.a < y.a; }
int main(void) {
long long n, m, ans = 0;
mise da[100010];
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> da[i].a >> da[i].b;
sort(da, da ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 912,352 | 912,353 | u314988220 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
int n, m;
pair<int, int> a[100001];
bool cmp(pii x, pii y) { return x.first < y.first; }
ll ans;
int main() {
// freopen("input.txt","r",s... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
int n, m;
pair<int, int> a[100001];
bool cmp(pii x, pii y) { return x.first < y.first; }
ll ans;
int main() {
// freopen("input.txt","r",s... | [
"assignment.change"
] | 912,367 | 912,368 | u247996218 | cpp |
p03103 | #include <iostream>
#include <map>
#include <utility>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
std::map<long, int> sorted_map;
long long result = 0;
for (int i = 0; i < N; i++) {
long a = 0;
int b = 0;
cin >> a;
cin >> b;
sorted_map.insert(std::make_pair(a, b));
}
for... | #include <iostream>
#include <map>
#include <utility>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
std::multimap<long, int> sorted_map;
long long result = 0;
for (int i = 0; i < N; i++) {
long a = 0;
int b = 0;
cin >> a;
cin >> b;
sorted_map.insert(std::make_pair(a, b));
}
... | [] | 912,405 | 912,406 | u475695911 | cpp |
p03103 | #include <iostream>
#include <map>
#include <utility>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
std::map<long, int> sorted_map;
long result = 0;
for (int i = 0; i < N; i++) {
long a = 0;
int b = 0;
cin >> a;
cin >> b;
sorted_map.insert(std::make_pair(a, b));
}
for (aut... | #include <iostream>
#include <map>
#include <utility>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
std::multimap<long, int> sorted_map;
long long result = 0;
for (int i = 0; i < N; i++) {
long a = 0;
int b = 0;
cin >> a;
cin >> b;
sorted_map.insert(std::make_pair(a, b));
}
... | [
"variable_declaration.type.widen.change"
] | 912,407 | 912,406 | u475695911 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
struct juice {
int money;
int number;
} a[100000];
bool cmp(juice a, juice b) { return a.money < b.money; }
int main() {
int n, m, sum = 0, sum2 = 0;
cin >> n >> m;
for (i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
struct juice {
long money;
long number;
} a[100000];
bool cmp(juice a, juice b) { return a.money < b.money; }
int main() {
long long n, m, sum = 0, sum2 = 0;
cin >> n >> m;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 912,412 | 912,411 | u991748891 | cpp |
p03103 | #include <algorithm>
#include <cassert>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
long long N, M;
int main() {
cin >> N >> M;
map<long long, long long> m;
for (long long i = 0; i < N; i++... | #include <algorithm>
#include <cassert>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
long long N, M;
int main() {
cin >> N >> M;
multimap<long long, long long> m;
for (long long i = 0; i < N... | [
"variable_declaration.type.change"
] | 912,416 | 912,417 | u393187783 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
struct node {
int cans, yuan;
} a[1000005];
bool cmp(node x, node y) { return x.yuan < y.yuan; }
int main() {
int n, m;
long long sum = 0, cnt = 0;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scan... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
struct node {
long long cans, yuan;
} a[1000005];
bool cmp(node x, node y) { return x.yuan < y.yuan; }
int main() {
int n, m;
long long sum = 0, cnt = 0;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 912,427 | 912,428 | u276626173 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
struct node {
int cans, yuan;
} a[10005];
bool cmp(node x, node y) { return x.yuan < y.yuan; }
int main() {
int n, m;
long long sum = 0, cnt = 0;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf(... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
struct node {
long long cans, yuan;
} a[1000005];
bool cmp(node x, node y) { return x.yuan < y.yuan; }
int main() {
int n, m;
long long sum = 0, cnt = 0;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"call.arguments.change"
] | 912,429 | 912,428 | u276626173 | cpp |
p03103 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | [
"type_conversion.add"
] | 912,438 | 912,439 | u378419207 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
ll A, B = 0;
int main() {
clock_t start = clock();
cin >> A >> B;
ll total = 0;
switch ((A - 1) % 4) {
case 0:
total = A;
br... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
ll A, B = 0;
int main() {
clock_t start = clock();
cin >> A >> B;
ll total = 0;
switch ((A - 1) % 4) {
case 0:
total = A - 1;
... | [
"assignment.change"
] | 912,463 | 912,464 | u048791623 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
ll A, B = 0;
int main() {
clock_t start = clock();
cin >> A >> B;
ll total = 0;
switch ((A - 1) % 4) {
case 0:
total = A;
br... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
ll A, B = 0;
int main() {
clock_t start = clock();
cin >> A >> B;
ll total = 0;
switch ((A - 1) % 4) {
case 0:
total = A - 1;
... | [
"assignment.change",
"expression.operation.binary.remove"
] | 912,465 | 912,464 | u048791623 | cpp |
p03104 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<ll> g(ll A) {
vector<ll> ret(50, 0);
for (ll i = 0; i < 50; i++) {
ll b = (ll)1 << i;
ret[i] = (A + 1) / (2 * b) * b + max((ll)0, (A + 1) % (2 * b) - b);
cout << A << " " << i << " " << ret[i] << endl;
}
return ret;
}
int ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<ll> g(ll A) {
vector<ll> ret(50, 0);
for (ll i = 0; i < 50; i++) {
ll b = (ll)1 << i;
ret[i] = (A + 1) / (2 * b) * b + max((ll)0, (A + 1) % (2 * b) - b);
cerr << A << " " << i << " " << ret[i] << endl;
}
return ret;
}
int ... | [
"identifier.change",
"expression.operation.binary.change"
] | 912,470 | 912,471 | u119098168 | cpp |
p03104 | #include <iostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#incl... | #include <iostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#incl... | [
"control_flow.return.add"
] | 912,474 | 912,475 | u824332405 | cpp |
p03104 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
long long calc(long A) {
if (A <= 0)
return 0;
// 10^3 <= 2^10
// 1000 <= 1024
// 10^12 <= 2^40
// 10^12 <= 2進数 40桁くらい
long long ans = 0;
// i桁目の偶奇を調べる
for (int i = 0... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
long long calc(long long A) {
if (A <= 0)
return 0;
// 4の時に、0,1,2,3,4までになるので、これは5つの整数まで
//なので帳尻合わせで１足してあげる。
A++;
// 10^3 <= 2^10
// 1000 <= 1024
// 10^12 <= 2^40
// 1... | [
"variable_declaration.type.widen.change",
"expression.unary.arithmetic.add"
] | 912,478 | 912,479 | u987412812 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
ll ans = 0;
if (a == b) {
cout << a << endl;
return 0;
}
if (a ^ (a + 1) != 1)
ans = a, a++;
ll p = (b - a) % 4;
if (p == 0)
ans = ans ^ b;
else if (p == 1)
ans = ans ^ b ^ (b ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
ll ans = 0;
if (a == b) {
cout << a << endl;
return 0;
}
if ((a ^ (a + 1)) != 1)
ans = a, a++;
ll p = (b - a) % 4;
if (p == 0)
ans = ans ^ b;
else if (p == 1)
ans = ans ^ b ^ (... | [
"control_flow.branch.if.condition.change"
] | 912,482 | 912,483 | u394482932 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
long long f(long long n) {
long long ret = 0;
if (n % 2 == 0) {
ret = n;
if (n / 2 % 2 == 1)
ret |= 1;
} else {
ret = (n + 1) / 2 % 2;
}
return ret;
}
int main() {
long long A, B;
cin >> A... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
long long f(long long n) {
long long ret = 0;
if (n % 2 == 0) {
ret = n;
if (n / 2 % 2 == 1)
ret ^= 1;
} else {
ret = (n + 1) / 2 % 2;
}
return ret;
}
int main() {
long long A, B;
cin >> A... | [
"expression.operator.change",
"expression.operation.binary.change"
] | 912,488 | 912,489 | u412769245 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef unsigned long long ull;
ull func(ull A, ull B) {
ull ans = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef unsigned long long ull;
ull func(ull A, ull B) {
ull ans = 0;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 912,532 | 912,533 | u134576652 | cpp |
p03104 | #include <algorithm>
#include <bitset> // std::bitset<N>
#include <cstring>
#include <iostream>
#include <sstream> // std::stringstream
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
if (A == B) {
cout << A;
} el... | #include <algorithm>
#include <bitset> // std::bitset<N>
#include <cstring>
#include <iostream>
#include <sstream> // std::stringstream
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
if (A == B) {
cout << A;
} el... | [
"identifier.change",
"io.output.change",
"literal.number.change"
] | 912,540 | 912,541 | u227379863 | cpp |
p03104 | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
int main() {
unsigned long A, B;
std::cin >> A >> B;
... | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
int main() {
unsigned long A, B;
std::cin >> A >> B;
... | [] | 912,544 | 912,545 | u504322356 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a / b, c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
}
| [
"expression.operation.binary.remove"
] | 912,567 | 912,568 | u842459010 | cpp |
p03105 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
double a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
} | [
"variable_declaration.type.primitive.change"
] | 912,583 | 912,584 | u456303471 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * C > B) {
cout << C << endl;
} else {
cout << B / A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * C < B) {
cout << C << endl;
} else {
cout << B / A << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 912,587 | 912,588 | u208581309 | cpp |
p03105 | #include <bits/stdc++.h>
#define foreach(i, v) \
for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define BETWEEN(a, x, b) (a <= x && x < b)
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(... | #include <bits/stdc++.h>
#define foreach(i, v) \
for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define BETWEEN(a, x, b) (a <= x && x < b)
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 912,594 | 912,595 | u369633456 | cpp |
p03105 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(b / a, c) << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 912,596 | 912,597 | u181719868 | cpp |
p03105 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 912,603 | 912,604 | u694422786 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << (x) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
#define Yes(x) cout << (x ? "Yes" : "No") << endl;
#define YES(x) cout << (x ? "YES" : "NO") << endl;
using ll = long long;
using P = pair<i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << (x) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
#define Yes(x) cout << (x ? "Yes" : "No") << endl;
#define YES(x) cout << (x ? "YES" : "NO") << endl;
using ll = long long;
using P = pair<i... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 912,619 | 912,620 | u303884911 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << (x) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
#define Yes(x) cout << (x ? "Yes" : "No") << endl;
#define YES(x) cout << (x ? "YES" : "NO") << endl;
using ll = long long;
using P = pair<i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << (x) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
#define Yes(x) cout << (x ? "Yes" : "No") << endl;
#define YES(x) cout << (x ? "YES" : "NO") << endl;
using ll = long long;
using P = pair<i... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 912,621 | 912,620 | u303884911 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B, C, times;
cin >> A >> B >> C;
times = A / B;
if (times > C)
times = C;
cout << times << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B, C, times;
cin >> A >> B >> C;
times = B / A;
if (times > C)
times = C;
cout << times << endl;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 912,625 | 912,626 | u346040900 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 912,638 | 912,639 | u901862155 | cpp |
p03105 | #include <algorithm>
#include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
std::cout << std::min(A / B, C);
return 0;
} | #include <algorithm>
#include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
std::cout << std::min(B / A, C);
return 0;
} | [
"expression.operation.binary.remove"
] | 912,666 | 912,667 | u337949146 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define UNIQUE(v) \
v.erase(unique(v.begin(), v.end()), v.end()) // sortしてから使う
#define INF 2147483647
#define LLINF... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define UNIQUE(v) \
v.erase(unique(v.begin(), v.end()), v.end()) // sortしてから使う
#define INF 2147483647
#define LLINF... | [
"identifier.change",
"io.output.change"
] | 912,673 | 912,674 | u166553470 | cpp |
p03105 | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | [
"expression.operation.binary.remove"
] | 912,678 | 912,679 | u539145601 | cpp |
p03105 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = min(c, a / b);
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = min(c, b / a);
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 912,682 | 912,683 | u437633151 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = (B / A);
if (ans > C) {
cout << C << endl;
return 0;
} else if (ans < C) {
cout << ans << endl;
return 0;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = (B / A);
if (ans > C) {
cout << C << endl;
return 0;
} else {
cout << ans << endl;
return 0;
}
}
| [] | 912,703 | 912,704 | u843939291 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = A / B;
if (ans > C)
ans = C;
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = B / A;
if (ans > C)
ans = C;
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 912,709 | 912,710 | u016119075 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = b % a;
if (d > c) {
cout << c << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = b / a;
if (d > c) {
cout << c << endl;
... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 912,713 | 912,714 | u680574634 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(c, a / b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(c, b / a) << endl;
} | [
"expression.operation.binary.remove"
] | 912,719 | 912,720 | u652660628 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c, a / b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(c, b / a) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.remove"
] | 912,721 | 912,720 | u652660628 | cpp |
p03105 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << ((ll)n))
#define SHIFT_LEFT(n) (1LL << ((ll)n))
#define SUBS(s, f, t) (... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << ((ll)n))
#define SHIFT_LEFT(n) (1LL << ((ll)n))
#define SUBS(s, f, t) (... | [
"expression.operation.binary.remove"
] | 912,732 | 912,733 | u905715926 | cpp |
p03105 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | [
"expression.operation.binary.remove"
] | 912,738 | 912,739 | u942085302 | cpp |
p03105 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | [
"expression.operation.binary.remove"
] | 912,740 | 912,739 | u942085302 | cpp |
p03105 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
cout << max(B / A, C) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
cout << min(B / A, C) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 912,743 | 912,744 | u563743611 | cpp |
p03105 | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 912,745 | 912,746 | u407213771 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 912,747 | 912,748 | u741815956 | cpp |
p03105 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 912,759 | 912,760 | u069521477 | cpp |
p03105 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 912,761 | 912,760 | u069521477 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * c < b)
cout << c << endl;
if (a * c > b)
cout << b / a << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * c <= b)
cout << c << endl;
if (a * c > b)
cout << b / a << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 912,762 | 912,763 | u657208344 | cpp |
p03105 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a / b, c);
}
| #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c);
} | [
"expression.operation.binary.remove"
] | 912,764 | 912,765 | u683078179 | cpp |
p03105 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll A, B, C;
cin >> A >> B ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll A, B, C;
cin >> A >> B ... | [
"expression.operation.binary.remove"
] | 912,772 | 912,773 | u742595961 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B / A > C) {
cout << C << endl;
}
if (B / A < C) {
cout << B / A << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B / A >= C) {
cout << C << endl;
}
if (B / A < C) {
cout << B / A << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 912,789 | 912,790 | u834753207 | cpp |
p03105 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * c <= b)
cout << a * c << endl;
else
cout << b / a << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * c <= b)
cout << c << endl;
else
cout << b / a << endl;
}
| [
"expression.operation.binary.remove"
] | 912,793 | 912,794 | u717483569 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (C <= B / A) {
cout << C;
} else {
cout << A / B;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (C <= B / A) {
cout << C;
} else {
cout << B / A;
}
} | [
"expression.operation.binary.remove"
] | 912,803 | 912,804 | u079860059 | cpp |
p03105 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a / b;
if (ans > c)
ans = c;
cout << ans << endl;
return 0... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = b / a;
if (ans > c)
ans = c;
cout << ans << endl;
return 0... | [
"expression.operation.binary.remove"
] | 912,807 | 912,808 | u607564800 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
b /= a;
if (b < c)
cout << a;
else
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
b /= a;
if (b < c)
cout << b;
else
cout << c;
} | [
"identifier.change",
"io.output.change"
] | 912,822 | 912,823 | u098101671 | cpp |
p03105 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 912,824 | 912,825 | u504800764 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.