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 |
|---|---|---|---|---|---|---|---|
p02995 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a +... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 805,905 | 805,906 | u322177979 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll euq(ll, ll);
int main() {
ll A, B, C, D, count = 0, k = 1;
cin >> A >> B >> C >> D;
ll lmc = (C * D) / euq(C, D);
count += B / C + B / D - B / lmc;
count -= (A - 1) / C + (A - 1) / D + (A - 1) / lmc;
cout << (B - A + 1) - count << en... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll euq(ll, ll);
int main() {
ll A, B, C, D, count = 0, k = 1;
cin >> A >> B >> C >> D;
ll lmc = (C * D) / euq(C, D);
count += B / C + B / D - B / lmc;
count -= (A - 1) / C + (A - 1) / D - (A - 1) / lmc;
cout << (B - A + 1) - count << en... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 805,909 | 805,910 | u703503553 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
int cd = C * D / gcd(C, D);
ll a = (A - 1) - ((A - 1) / C + (A - 1) / D - (A - 1) / cd);
ll b = B - (B / C + B... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll cd = C * D / gcd(C, D);
ll a = (A - 1) - ((A - 1) / C + (A - 1) / D - (A - 1) / cd);
ll b = B - (B / C + B ... | [
"variable_declaration.type.change"
] | 805,924 | 805,925 | u679366464 | cpp |
p02995 | #include <iostream>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long cdiv, ddiv, cddiv;
long long cd;
cdiv = b / c - a / c;
if (a % c == 0)
cdiv++;
ddiv = b / d - a / d;
if (a % d == 0)
ddiv++;
long long cc = c;
long long dd = d;
while (cc != d... | #include <iostream>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long cdiv, ddiv, cddiv;
long long cd;
cdiv = b / c - a / c;
if (a % c == 0)
cdiv++;
ddiv = b / d - a / d;
if (a % d == 0)
ddiv++;
long long cc = c;
long long dd = d;
while (cc != d... | [] | 805,926 | 805,927 | u639203570 | cpp |
p02995 | // C,Dの最小公倍数を求めたい
//ユークリッドの互除法で最大公約数を求めたら公式で出せる
#include <iostream>
using namespace std;
long int euclideam(long int c, long int d); //最大公約数
long int euclideam(long int c, long int d) {
long int w, C = c, D = d;
if (C < D) {
w = C;
C = D;
D = w;
}
while (D != 0) {
w = C % D;
C = D;
D = ... | // C,Dの最小公倍数を求めたい
//ユークリッドの互除法で最大公約数を求めたら公式で出せる
#include <iostream>
using namespace std;
long int euclideam(long int c, long int d); //最大公約数
long int euclideam(long int c, long int d) {
long int w, C = c, D = d;
if (C < D) {
w = C;
C = D;
D = w;
}
while (D != 0) {
w = C % D;
C = D;
D = ... | [
"expression.unary.arithmetic.add"
] | 805,928 | 805,929 | u924527074 | cpp |
p02995 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int gcd(long long int a, long long int b) {
long long int r, tmp;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
wh... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
long long int r, tmp;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a... | [
"variable_declaration.type.widen.change"
] | 805,932 | 805,933 | u939401127 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) cerr << #x << " = " <<... | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) cerr << #x << " = " <<... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 805,955 | 805,956 | u802237789 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define popcnt(a) __builtin_popcount(a)
#define IO() \
assert(freopen("in.in", "rt", stdin)), \
assert(freopen("out.out", "wt", stdout))
#define FastIO() ios::syn... | #include <bits/stdc++.h>
using namespace std;
#define popcnt(a) __builtin_popcount(a)
#define IO() \
assert(freopen("in.in", "rt", stdin)), \
assert(freopen("out.out", "wt", stdout))
#define FastIO() ios::syn... | [
"variable_declaration.type.change"
] | 805,959 | 805,960 | u970872504 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); }
int main(void) {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long i;
long long count = 0;
int C_divable_count = 0;
int D_divable_count = 0;
int CD_divable_count = 0;
C_... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); }
int main(void) {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long i;
long long count = 0;
long long C_divable_count = 0;
long long D_divable_count = 0;
long long CD_divabl... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 805,961 | 805,962 | u209053759 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int main() {
long long a, b, c, d, i;
cin >> a >> b >> c >> d;
int z = c * d / gcd(c, d);
long long sum = b / c + b / d - b / z;
long lo... | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int main() {
long long a, b, c, d, i;
cin >> a >> b >> c >> d;
long long z = c * d / gcd(c, d);
long long sum = b / c + b / d - b / z;
l... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 805,969 | 805,970 | u827250617 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int sum = b - a + 1;
sum -= (b / c - (a - 1) / c);
sum -= (b / d - (a - 1) / d);
int x = c * d;
int tmp;
if (d < c) {
tmp = c;
c = d;
d = tmp;
}
tmp = d % c;
while (tmp != 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, c, d;
cin >> a >> b >> c >> d;
long sum = b - a + 1;
sum -= (b / c - (a - 1) / c);
sum -= (b / d - (a - 1) / d);
long x = c * d;
long tmp;
if (d < c) {
tmp = c;
c = d;
d = tmp;
}
tmp = d % c;
while (tmp != 0) {
... | [
"variable_declaration.type.primitive.change"
] | 805,975 | 805,976 | u891544435 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, ans = 0, i, G;
long long gcd(long long x, long long y) {
if (x < y)
return gcd(y, x);
long long r;
while ((r = x % y)) {
x = y;
y = r;
}
return y;
}
int main() {
cin >> a >> b >> c >> d;
if (c == 1 || d == 1) {
cout << b ... | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, ans = 0, i, G;
long long gcd(long long x, long long y) {
if (x < y)
return gcd(y, x);
long long r;
while ((r = x % y)) {
x = y;
y = r;
}
return y;
}
int main() {
cin >> a >> b >> c >> d;
if (c == 1 || d == 1) {
cout << 0 ... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"expression.operation.binary.remove"
] | 805,997 | 805,998 | u660351670 | cpp |
p02995 | #include <iostream>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
a -= 1;
cout << b - b / c - b / d + b / (c * d / gcd(c, d)) -
(a - a / c - a / d + a / (c * d / gcd(c, d)));
}
| #include <iostream>
using namespace std;
int gcd(long long x, long long y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
a -= 1;
cout << b - b / c - b / d + b / (c * d / gcd(c, d)) -
(a - a / c - a / d + a / (c * d / ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 806,007 | 806,008 | u859897687 | cpp |
p02995 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long A, B, C, D, sum_A, sum_B;
cin >> A >> B >> C >> D;
sum_B = B - B / C - B / D;
if (C < D) {
int tmp;
tmp = C;
C = D;
D = tmp;
}
int g = C % D, c, d; // Euclid
c = C;
d = D;
while (g != 0) {
c = d;
d = ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long A, B, C, D, sum_A, sum_B;
cin >> A >> B >> C >> D;
sum_B = B - B / C - B / D;
if (C < D) {
int tmp;
tmp = C;
C = D;
D = tmp;
}
long g = C % D, c, d; // Euclid
c = C;
d = D;
while (g != 0) {
c = d;
d =... | [
"variable_declaration.type.primitive.change"
] | 806,022 | 806,023 | u348109388 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long euclid(long long a, long long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> ... | #include <bits/stdc++.h>
using namespace std;
long long euclid(long long a, long long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 806,037 | 806,038 | u341309363 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long euclid(long long a, long long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> ... | #include <bits/stdc++.h>
using namespace std;
long long euclid(long long a, long long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> ... | [
"expression.operation.unary.arithmetic.remove",
"assignment.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 806,039 | 806,038 | u341309363 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long euclid(long a, long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long ... | #include <bits/stdc++.h>
using namespace std;
long long euclid(long long a, long long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> ... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 806,040 | 806,038 | u341309363 | cpp |
p02995 | #include <stdio.h>
typedef long long int ll;
ll gcd(ll m, ll n) {
if (m < n) {
ll temp = m;
m = n;
n = temp;
}
ll r = m % n;
while (r != 0) {
m = n;
n = r;
r = m % n;
}
return n;
}
ll function(ll a, ll c, ll d) {
ll count = 0; // a以下の自然数でcとdで割り切れない
ll gcm = (c * d) / gcd(c... | #include <stdio.h>
typedef long long int ll;
ll gcd(ll m, ll n) {
if (m < n) {
ll temp = m;
m = n;
n = temp;
}
ll r = m % n;
while (r != 0) {
m = n;
n = r;
r = m % n;
}
return n;
}
ll function(ll a, ll c, ll d) {
ll count = 0; // a以下の自然数でcとdで割り切れない
ll lcm = (c * d) / gcd(c... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 806,087 | 806,088 | u497418592 | cpp |
p02995 | #include <stdio.h>
typedef long long int ll;
ll gcd(ll m, ll n) {
if (m < n) {
ll temp = m;
m = n;
n = temp;
}
ll r = m % n;
while (r != 0) {
m = n;
n = r;
r = m % n;
}
return n;
}
ll function(ll a, ll c, ll d) {
ll count = 0; // a以下の自然数でcとdで割り切れない
ll gcm = (c * d) / gcd(c... | #include <stdio.h>
typedef long long int ll;
ll gcd(ll m, ll n) {
if (m < n) {
ll temp = m;
m = n;
n = temp;
}
ll r = m % n;
while (r != 0) {
m = n;
n = r;
r = m % n;
}
return n;
}
ll function(ll a, ll c, ll d) {
ll count = 0; // a以下の自然数でcとdで割り切れない
ll lcm = (c * d) / gcd(c... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 806,089 | 806,088 | u497418592 | cpp |
p02995 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"expression.operation.binary.add"
] | 806,094 | 806,095 | u874996917 | cpp |
p02995 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"assignment.change"
] | 806,096 | 806,095 | u874996917 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll solve(ll l, ll r, ll div) { return r / div - (l - 1) / div; }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll gcm = a * b / __gcd(a, b);
cout << (b - a + 1) - (solve(a, b, c) + solve(a, b, d) - solve(a, b, gcm));
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll solve(ll l, ll r, ll div) { return r / div - (l - 1) / div; }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll gcm = c * d / __gcd(c, d);
cout << (b - a + 1) - (solve(a, b, c) + solve(a, b, d) - solve(a, b, gcm));
} | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 806,099 | 806,100 | u914762730 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y)
return gcd(y, x % y);
else
return x;
}
int main(void) {
long long a, b, po = 0;
int c, d, t;
cin >> a >> b >> c >> d;
po += b / c - (a - 1) / c;
po += b / d - (a - 1) / d;
t = c * d / gcd(c, d);
po -= b / t - (a - 1... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y)
return gcd(y, x % y);
else
return x;
}
int main(void) {
long long a, b, po = 0, c, d, t;
cin >> a >> b >> c >> d;
po += b / c - (a - 1) / c;
po += b / d - (a - 1) / d;
t = c * d / gcd(c, d);
po -= b / t - (a - 1) / t;... | [] | 806,110 | 806,111 | u088895504 | cpp |
p02995 | #include <iostream>
long long gcd(long long x_g, long long y_g) {
long long tmp_small;
long long tmp_big;
long long tmp;
if (x_g < y_g) {
tmp_big = y_g;
tmp_small = x_g;
} else {
tmp_big = x_g;
tmp_small = y_g;
}
while (false) {
tmp = (tmp_big % tmp_small);
if (tmp == 0) {
... | #include <iostream>
long long gcd(long long x_g, long long y_g) {
long long tmp_small;
long long tmp_big;
long long tmp;
if (x_g < y_g) {
tmp_big = y_g;
tmp_small = x_g;
} else {
tmp_big = x_g;
tmp_small = y_g;
}
while (true) {
tmp = (tmp_big % tmp_small);
if (tmp == 0) {
r... | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 806,112 | 806,113 | u290584325 | cpp |
p02995 | #include <iostream>
int main(void) {
using namespace std;
long long a, b, c, d;
cin >> a >> b >> c >> d;
a -= 1;
long long count_div_c = b / c - a / c;
long long count_div_d = b / d - a / d;
long long x = c, y = d;
while (true) {
if (x < y) {
swap(x, y);
}
if (y == 0) {
break;... | #include <iostream>
int main(void) {
using namespace std;
long long a, b, c, d;
cin >> a >> b >> c >> d;
a--;
long long count_div_c = b / c - a / c;
long long count_div_d = b / d - a / d;
long long x = c, y = d;
while (true) {
if (x < y) {
swap(x, y);
}
if (y == 0) {
break;
... | [
"expression.operation.binary.remove"
] | 806,114 | 806,115 | u894129918 | cpp |
p02995 | #include <iostream>
typedef long long ll;
using namespace std;
ll div(ll n, ll C, ll D) {
ll nC = n / C;
ll nD = n / D;
ll r = C % D;
ll t = C * D;
while (r != 0) {
C = D;
D = r;
r = C % D;
}
return nC + nD - n / (t / D);
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
if (C < ... | #include <iostream>
typedef long long ll;
using namespace std;
ll div(ll n, ll C, ll D) {
ll nC = n / C;
ll nD = n / D;
ll r = C % D;
ll t = C * D;
while (r != 0) {
C = D;
D = r;
r = C % D;
}
return n - (nC + nD) + n / (t / D);
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
if... | [
"function.return_value.change",
"expression.operation.binary.change"
] | 806,140 | 806,141 | u002428461 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (((a) % mod) * ((b) % mod)) % mod
#define rollcall ... | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (((a) % mod) * ((b) % mod)) % mod
#define rollcall ... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 806,156 | 806,157 | u691493208 | cpp |
p02995 | #include <iostream>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll ged(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll a, b, c, d;
ll ans = 0;
cin >> a >> b >> c >> d;
ll q = b - a + 1;
ll s = b / c - a / c;
if (a % c == 0)
s++;
ll h = b / ... | #include <iostream>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll ged(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll a, b, c, d;
ll ans = 0;
cin >> a >> b >> c >> d;
ll q = b - a + 1;
ll s = b / c - a / c;
if (a % c == 0)
s++;
ll h = b / ... | [
"identifier.change",
"call.function.change"
] | 806,158 | 806,159 | u848650181 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long ct(long long a, long long b, long long c) {
long long ct1 = (a % c == 0) ? a / c : (a + c) / c, ct2 = b / c;
return ct2 - ct1 + 1;
}
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long lcm = (c * d) / (long long)__gcd(c, d);
int ans... | #include <bits/stdc++.h>
using namespace std;
long long ct(long long a, long long b, long long c) {
long long ct1 = (a % c == 0) ? a / c : (a + c) / c, ct2 = b / c;
return ct2 - ct1 + 1;
}
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long lcm = (c * d) / (long long)__gcd(c, d);
long lo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 806,168 | 806,169 | u372798233 | cpp |
p02995 | #include <iostream>
#define rop(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll c, ll d) { return d ? gcd(d, c % d) : c; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
ll f(ll n, ll c, ll d) {
int as = n;
as -= n / c;
as -= n / d;
as -= n / lcm(c, d);
return as;... | #include <iostream>
#define rop(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll c, ll d) { return d ? gcd(d, c % d) : c; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
ll f(ll n, ll c, ll d) {
ll as = n;
as -= n / c;
as -= n / d;
as += n / lcm(c, d);
return as;
... | [
"variable_declaration.type.change",
"expression.operator.change"
] | 806,187 | 806,188 | u722986066 | cpp |
p02995 | #include <iostream>
#define rop(i, n) for (i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll c, ll d) { return d ? gcd(d, c % d) : c; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
ll f(ll n, ll c, ll d) {
int as = n;
as -= n / c;
as -= n / d;
as -= n / lcm(c, d);
return as;
}
... | #include <iostream>
#define rop(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll c, ll d) { return d ? gcd(d, c % d) : c; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
ll f(ll n, ll c, ll d) {
ll as = n;
as -= n / c;
as -= n / d;
as += n / lcm(c, d);
return as;
... | [
"variable_declaration.type.change",
"expression.operator.change"
] | 806,189 | 806,188 | u722986066 | cpp |
p02995 | #include <iostream>
using namespace std;
long long gcd(long long c, long long d) { return d ? gcd(d, c % d) : c; }
long long lcm(long long c, long long d) { return c / gcd(c, d) * d; }
int main() {
long long a, b;
long long c, d, cd;
cin >> a >> b >> c >> d;
long long c1, c2, d1, d2, cd1, cd2;
c2 = b / c;... | #include <iostream>
using namespace std;
long long gcd(long long c, long long d) { return d ? gcd(d, c % d) : c; }
long long lcm(long long c, long long d) { return c / gcd(c, d) * d; }
int main() {
long long a, b;
long long c, d, cd;
cin >> a >> b >> c >> d;
long long c1, c2, d1, d2, cd1, cd2;
c2 = b / c;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 806,221 | 806,222 | u056123277 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int GCD(ll x, ll y) {
if (x % y == 0)
return y;
else
return GCD(y, x % y);
}
int LCM(ll x, ll y) { return x * y / GCD(x, y); }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll c_num = b / c - (a - 1) / c;
ll d_num = b / d ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll GCD(ll x, ll y) {
if (x % y == 0)
return y;
else
return GCD(y, x % y);
}
ll LCM(ll x, ll y) { return x * y / GCD(x, y); }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll c_num = b / c - (a - 1) / c;
ll d_num = b / d - ... | [] | 806,225 | 806,226 | u560381579 | cpp |
p02995 | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
while (b) {
swap(a, b);
b %= a;
}
return a;
}
long long lo(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long K =... | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
while (b) {
swap(a, b);
b %= a;
}
return a;
}
long long lo(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long K =... | [
"identifier.change",
"expression.operation.binary.change"
] | 806,242 | 806,243 | u058186113 | cpp |
p02995 | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
long long temp;
while (a % b != 0) {
temp = b;
b = a % b;
a = temp;
}
return b;
}
int countDivisor(long long min_dividend, long long max_dividend,
long long divisor) {
int count = 0;
long long m... | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
long long temp;
while (a % b != 0) {
temp = b;
b = a % b;
a = temp;
}
return b;
}
long countDivisor(long long min_dividend, long long max_dividend,
long long divisor) {
long count = 0;
long lon... | [
"variable_declaration.type.primitive.change"
] | 806,244 | 806,245 | u829844117 | cpp |
p02995 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define FORi(N) for (int i = 0; i < N; ++i)... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define FORi(N) for (int i = 0; i < N; ++i)... | [
"assignment.change"
] | 806,250 | 806,251 | u373586461 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
ll A, B, C, D, ans;
cin >> A >> B >> C >> D;
ll numc = 0, numd = 0, numgcd = 0;
numgcd = gcd(C, D);
/*if(B%C == 0){
numc = B... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
ll A, B, C, D, ans;
cin >> A >> B >> C >> D;
ll numc = 0, numd = 0, numgcd = 0;
numgcd = gcd(C, D);
/*if(B%C == 0){
numc = B... | [
"variable_declaration.type.change"
] | 806,254 | 806,255 | u845882023 | cpp |
p02995 | #include <bits/stdc++.h>
#include <sstream>
using namespace std;
int cntn(long n, long a, long b) { return b / n - (a - 1) / n; }
int main() {
long a, b, c, d;
cin >> a >> b >> c >> d;
long ans = 0;
long prod = c * d;
long u = b - a + 1;
ans = u - cntn(c, a, b) - cntn(d, a, b);
long r = d % c;
wh... | #include <bits/stdc++.h>
#include <sstream>
using namespace std;
long cntn(long n, long a, long b) { return b / n - (a - 1) / n; }
int main() {
long a, b, c, d;
cin >> a >> b >> c >> d;
long ans = 0;
long prod = c * d;
long u = b - a + 1;
ans = u - cntn(c, a, b) - cntn(d, a, b);
long r = d % c;
w... | [
"variable_declaration.type.primitive.change"
] | 806,261 | 806,262 | u448354193 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
int r;
if (x < y)
swap(x, y);
while (y > 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
long long a, b;
int c, d;
cin >> a >> b >> c >> d;
long long g = gcd(c, d);
long long cd = c * d / g;
long lon... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
int r;
if (x < y)
swap(x, y);
while (y > 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
long long a, b;
long long c, d;
cin >> a >> b >> c >> d;
long long g = gcd(c, d);
unsigned long long cd = c * d /... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 806,272 | 806,273 | u594803920 | cpp |
p02995 | //#include "pch.h"
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
long A, B, C, D;
cin >> A >> B >> C >> D;
long lcm;
int r = C % D;
long lcd = C * D;
long ans;
int C_1, C_2, D_1, D_2, call, dall, l... | //#include "pch.h"
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
long A, B, C, D;
cin >> A >> B >> C >> D;
long lcm;
int r = C % D;
long lcd = C * D;
long ans;
long C_1, C_2, D_1, D_2, call, dall, ... | [
"variable_declaration.type.primitive.change"
] | 806,274 | 806,275 | u919992484 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b, c, d, e, f;
cin >> a >> b >> c >> d;
e = c;
f = d;
int64_t p, q, r, s, t, u, x, tmp, R, w;
x = c * d;
if (c < d) {
tmp = c;
c = d;
d = tmp;
}
R = c % d;
while (R != 0) {
c = d;
d = R;
R = c % d;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b, c, d, e, f;
cin >> a >> b >> c >> d;
e = c;
f = d;
int64_t p, q, r, s, t, u, x, tmp, R, w;
x = c * d;
if (c < d) {
tmp = c;
c = d;
d = tmp;
}
R = c % d;
while (R != 0) {
c = d;
d = R;
R = c % d;
}
... | [
"variable_declaration.add",
"expression.operation.binary.remove",
"assignment.change"
] | 806,281 | 806,282 | u567252408 | cpp |
p02995 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long euclid(long long m, long long n) {
long long m1 = m, n1 = n, tmp = 0;
while (n1 != 0) {
tmp = n1;
n1 = m1 % n1;
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long euclid(long long m, long long n) {
long long m1 = m, n1 = n, tmp = 0;
while (n1 != 0) {
tmp = n1;
n1 = m1 % n1;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 806,289 | 806,290 | u115306811 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long ans = 0;
long long ta = c, tb = d, r, tmp;
if (ta < tb) {
tmp = ta;
ta = b;
tb = tmp;
}
r = ta % tb;
while (r != 0) {
ta = tb;
tb = r;
r = ta % tb;
}
tmp = (a ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long ans = 0;
long long ta = c, tb = d, r, tmp;
if (ta < tb) {
tmp = ta;
ta = tb;
tb = tmp;
}
r = ta % tb;
while (r != 0) {
ta = tb;
tb = r;
r = ta % tb;
}
tmp = (a... | [
"assignment.value.change",
"identifier.change"
] | 806,300 | 806,301 | u405230134 | cpp |
p02995 | #include <algorithm>
#include <iostream>
using namespace std;
using LLI = long long int;
LLI gcd(LLI a, LLI b) {
if (a == 0)
return b;
return gcd(a % b, a);
}
int main() {
LLI a, b, c, d;
cin >> a >> b >> c >> d;
LLI cd = (c * d) / gcd(max(c, d), min(c, d));
LLI ab_c = b / c - a / c + (a % c == 0 ? ... | #include <algorithm>
#include <iostream>
using namespace std;
using LLI = long long int;
LLI gcd(LLI a, LLI b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int main() {
LLI a, b, c, d;
cin >> a >> b >> c >> d;
LLI cd = c * d / gcd(max(c, d), min(c, d));
LLI ab_c = b / c - a / c + (a % c == 0 ? 1 ... | [
"expression.operation.binary.remove"
] | 806,304 | 806,305 | u559820201 | cpp |
p02995 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
unsigned long long int a, b, c, d, g;
cin >> a >> b >> c >> d;
g = __gcd(c, d);
printf("%lld", (b - a + 1) - ((b / c + b / d - b / g) -
((a ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
unsigned long long int a, b, c, d, g;
cin >> a >> b >> c >> d;
g = c * d / __gcd(c, d);
printf("%lld", (b - a + 1) - ((b / c + b / d - b / g) -
... | [
"assignment.change"
] | 806,312 | 806,313 | u455317716 | cpp |
p02995 | #include <cstdint>
#include <iostream>
using namespace std;
int64_t baisuu(const int64_t &a, const int64_t &b) { return a / b; }
int64_t gcd(int64_t a, int64_t b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int64_t gcm(int64_t a, int64_t... | #include <cstdint>
#include <iostream>
using namespace std;
int64_t baisuu(const int64_t &a, const int64_t &b) { return a / b; }
int64_t gcd(int64_t a, int64_t b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int64_t gcm(int64_t a, int64_t... | [
"assignment.change"
] | 806,317 | 806,318 | u445575414 | cpp |
p02995 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [
"expression.operation.binary.remove"
] | 806,327 | 806,328 | u261965335 | cpp |
p02995 | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
LL p = 1000000007ll;
LL gcd(LL x, LL y) { return (!x || !y) ? x + y : gcd(y, x % y); }
LL lcm(LL x, LL y) { return x / gcd(x, y) * y; }
LL solve(LL n, LL c, LL d) { r... | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
LL p = 1000000007ll;
LL gcd(LL x, LL y) { return (!x || !y) ? x + y : gcd(y, x % y); }
LL lcm(LL x, LL y) { return x / gcd(x, y) * y; }
LL solve(LL n, LL c, LL d) { r... | [] | 806,357 | 806,358 | u633757735 | cpp |
p02995 | #include <iostream>
using namespace std;
long Gcd(long m, long n) {
long temp = 0;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return n;
}
long Lcm(long m, long n) { return m * n / Gcd(m, n); }
int main() {
long A, B, C, D;
cin >> A >> B >> C >> D;
long div_c = B / C;
long div_... | #include <iostream>
using namespace std;
long Gcd(long m, long n) {
long temp = 0;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return n;
}
long Lcm(long m, long n) { return m * n / Gcd(m, n); }
int main() {
long A, B, C, D;
cin >> A >> B >> C >> D;
long div_c = B / C;
long div_... | [] | 806,365 | 806,366 | u762603420 | cpp |
p02995 | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
#define p(x) cout << (x) << endl;
#define pv(v) \
for (auto a : v) { ... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
#define p(x) cout << (x) << endl;
#define pv(v) \
for (auto a : v) { ... | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 806,367 | 806,368 | u900303768 | cpp |
p02995 | #include "math.h"
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define RFOR(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define REP(i, n) for (long long i = 0; ... | #include "math.h"
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define RFOR(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define REP(i, n) for (long long i = 0; ... | [] | 806,371 | 806,372 | u032627078 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [] | 806,377 | 806,378 | u863279562 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D;
//最小公倍数
int a, b, r, x, tmp;
a = C;
b = D;
x = a * b;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
r = a % b;
while (r != 0) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
long A, B, C, D, E;
cin >> A >> B >> C >> D;
//最小公倍数
long a, b, r, x, tmp;
a = C;
b = D;
x = a * b;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
r = a % b;
while (r != 0) {
a = b;
... | [
"variable_declaration.type.primitive.change"
] | 806,379 | 806,380 | u591779169 | cpp |
p02995 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = int64_t;
/// <summary>
/// GCDを計算します
/// </sum... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = int64_t;
/// <summary>
/// GCDを計算します
/// </sum... | [] | 806,403 | 806,404 | u976560086 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 806,430 | 806,431 | u966921248 | cpp |
p02995 | /*
Author - KISHAN TIWARI
Dream bigger. Do bigger.
Wake up with determination. Go to bed with satisfaction.
*/
// Sometimes later becomes never. Do it now.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define fi first
#defi... | /*
Author - KISHAN TIWARI
Dream bigger. Do bigger.
Wake up with determination. Go to bed with satisfaction.
*/
// Sometimes later becomes never. Do it now.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define fi first
#defi... | [] | 806,450 | 806,451 | u218900592 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (a == 0) {
return b;
} else {
gcd(a, b % a);
}
}
int atob(int a, int b, int d) { return b / d - (a - 1) / d; }
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long ans = b - a + 1;... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (a == 0) {
return b;
} else {
gcd(a, b % a);
}
}
long atob(long a, long b, long d) { return b / d - (a - 1) / d; }
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long ans = b - a ... | [
"variable_declaration.type.primitive.change"
] | 806,452 | 806,453 | u885523920 | cpp |
p02995 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long x, long long y) {
long long k = x, l = y;
while (x != 0) {
if (x < ... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long x, long long y) {
long long k = x, l = y;
while (x != 0) {
if (x < ... | [] | 806,456 | 806,457 | u252348942 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int A, B, C, D;
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
signed main() {
cin >> A >> B >> C >> D;
int cntUntilB = B - ((B /... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int A, B, C, D;
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
signed main() {
cin >> A >> B >> C >> D;
int cntUntilB = B - ((B /... | [] | 806,482 | 806,483 | u093453891 | cpp |
p02995 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define pb(x) push_back(x)
#define int long long
int calc(in... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define pb(x) push_back(x)
#define int long long
int calc(in... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 806,486 | 806,487 | u785975381 | cpp |
p02995 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll a, b, c, d, ans;
ll f(ll p, ll q) {
if (q == 0)
return p;
return f(q, p % q);
}
int main() {
ll t;
cin >> a >> b >> c >> d;
a--;
ans = b / c - a / c + b / d - a / d;
t = f(c, d);
t = c / t * d;
ans -= b / t - c ... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll a, b, c, d, ans;
ll f(ll p, ll q) {
if (q == 0)
return p;
return f(q, p % q);
}
int main() {
ll t;
cin >> a >> b >> c >> d;
a--;
ans = b / c - a / c + b / d - a / d;
t = f(c, d);
t = c / t * d;
ans -= b / t - a ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 806,510 | 806,511 | u230265105 | cpp |
p02995 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | [
"assignment.value.change",
"identifier.change"
] | 806,512 | 806,513 | u624800360 | cpp |
p02995 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <string>
using namespace std;
long long sk(long long n, long long m) {
int N = max(n, m);
int M = min(n, m);
if (M == 0)
return N;
return sk(M, N % M);
}
int main() {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <string>
using namespace std;
long long sk(long long n, long long m) {
long long N = max(n, m);
long long M = min(n, m);
if (M == 0)
return N;
return sk(M, N % M);
}
int ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 806,533 | 806,534 | u220922076 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a, _n = n; i <= _n; ++i)
#define drep(i, a, n) for (int i = a, _n = n; i >= n; --i)
#define debug(x) cout << #x << " = " << x << endl
long long a, b, c, d;
long long D(long long x) {
return x - x / c - x / d + x / (c / __gcd(c, d) * d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a, _n = n; i <= _n; ++i)
#define drep(i, a, n) for (int i = a, _n = n; i >= n; --i)
#define debug(x) cout << #x << " = " << x << endl
long long a, b, c, d;
long long D(long long x) {
return x - x / c - x / d + x / (c / __gcd(c, d) * d... | [
"expression.operation.binary.add"
] | 806,535 | 806,536 | u608862204 | cpp |
p02995 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | [
"expression.operation.binary.remove"
] | 806,537 | 806,538 | u539402331 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | [
"identifier.change"
] | 806,547 | 806,548 | u856232850 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | [
"identifier.change"
] | 806,549 | 806,548 | u856232850 | cpp |
p02995 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef pa... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef pa... | [] | 806,554 | 806,555 | u464804957 | cpp |
p02995 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
long long GCD(long long u, long long v) {
while (v != 0) {
long long r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
ios_base::s... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
long long GCD(long long u, long long v) {
while (v != 0) {
long long r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
ios_base::s... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 806,566 | 806,567 | u377363903 | cpp |
p02995 | // #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int... | // #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int... | [
"variable_declaration.remove",
"expression.operation.binary.change"
] | 806,568 | 806,569 | u216962796 | cpp |
p02995 | #include <bits/stdc++.h>
#define inf 0x6fffffff
using namespace std;
const int N = 5e6 + 10;
typedef long long ll;
ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';... | #include <bits/stdc++.h>
#define inf 0x6fffffff
using namespace std;
const int N = 5e6 + 10;
typedef long long ll;
ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';... | [
"identifier.change",
"io.output.change"
] | 806,574 | 806,575 | u550756195 | cpp |
p02995 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll... | [] | 806,582 | 806,583 | u222509161 | cpp |
p02995 | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF INT_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priority... | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF INT_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priority... | [
"call.arguments.change",
"call.arguments.add"
] | 806,595 | 806,596 | u259210975 | cpp |
p02995 | // Gaurav Aggarwal
/*
useful stl
array<ll,size> ar; //size(),front(),back(),fill(),empty()
deque<ll> d //push_back(),push_front(),pop_front(),pop_back()
vector<ll> v(size,val);
//push_back(),*max_element(v.begin(),v.end()),accumulate(v.begin(),v.end(),0)
stack<ll> g; //push(),pop()... | // Gaurav Aggarwal
/*
useful stl
array<ll,size> ar; //size(),front(),back(),fill(),empty()
deque<ll> d //push_back(),push_front(),pop_front(),pop_back()
vector<ll> v(size,val);
//push_back(),*max_element(v.begin(),v.end()),accumulate(v.begin(),v.end(),0)
stack<ll> g; //push(),pop()... | [
"variable_declaration.type.change"
] | 806,597 | 806,598 | u371472297 | cpp |
p02995 | // Gaurav Aggarwal
/*
useful stl
array<ll,size> ar; //size(),front(),back(),fill(),empty()
deque<ll> d //push_back(),push_front(),pop_front(),pop_back()
vector<ll> v(size,val);
//push_back(),*max_element(v.begin(),v.end()),accumulate(v.begin(),v.end(),0)
stack<ll> g; //push(),pop()... | // Gaurav Aggarwal
/*
useful stl
array<ll,size> ar; //size(),front(),back(),fill(),empty()
deque<ll> d //push_back(),push_front(),pop_front(),pop_back()
vector<ll> v(size,val);
//push_back(),*max_element(v.begin(),v.end()),accumulate(v.begin(),v.end(),0)
stack<ll> g; //push(),pop()... | [
"variable_declaration.type.change"
] | 806,599 | 806,598 | u371472297 | cpp |
p02995 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef unsigned long long ul;
typedef long long ll;
typedef pair<int, int> PAIR;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef unsigned long long ul;
typedef long long ll;
typedef pair<int, int> PAIR;
... | [] | 806,615 | 806,616 | u211490974 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, e;
long long gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x * y / gcd(x, y); }
long long C(long long x) {
int ret = x / c + x / d - x / e;
return ret;
}
int ... | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, e;
long long gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x * y / gcd(x, y); }
long long C(long long x) {
long long ret = x / c + x / d - x / e;
return ret;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 806,619 | 806,620 | u872406755 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) (a < b) ? a : b;
#define max(a, b) (a > b) ? a : b;
long long gcd(long long c, long long d) {
return (c % d == 0) ? d : gcd(d, c % d);
}
long long lcd(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
long long A, B, C, D;
cin >... | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) (a < b) ? a : b;
#define max(a, b) (a > b) ? a : b;
long long gcd(long long c, long long d) {
return (c % d == 0) ? d : gcd(d, c % d);
}
long long lcd(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
long long A, B, C, D;
cin >... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 806,626 | 806,627 | u849073847 | cpp |
p02995 | #include <cmath>
#include <iostream>
#include <numeric>
#define pans cout << ans << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
long gcd(long a, long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
long lcm(long a, long b) { return a * ... | #include <cmath>
#include <iostream>
#include <numeric>
#define pans cout << ans << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
long gcd(long a, long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
long lcm(long a, long b) { return a * ... | [
"assignment.value.change",
"call.function.change",
"expression.operation.binary.change"
] | 806,628 | 806,629 | u514429645 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int64_t GCD(int64_t m, int64_t n) {
int64_t big, small;
int64_t p = -1;
big = max(m, n);
small = min(m, n);
while (1) {
p = big % small;
if (p == 0)
break;
big = small;
small = p;
}
return small;
}
int main() {
int64_t a, b, c, d;
... | #include <bits/stdc++.h>
using namespace std;
int64_t GCD(int64_t m, int64_t n) {
int64_t big, small;
int64_t p = -1;
big = max(m, n);
small = min(m, n);
while (1) {
p = big % small;
if (p == 0)
break;
big = small;
small = p;
}
return small;
}
int main() {
int64_t a, b, c, d;
... | [
"variable_declaration.type.primitive.change"
] | 806,635 | 806,636 | u355424600 | cpp |
p02995 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
long a, b;
int c, d;
long cd;
long ans = 0;
int main() {
long i;
int buf, r;
int buf_c, buf_d;
cin >> a >> b >> c >> d;
if (c < d) {
// NOTHING
} else {
buf = c;
c = d;
d = buf;
}
buf_... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
long a, b;
long c, d;
long cd;
long ans = 0;
int main() {
long i;
long buf, r;
long buf_c, buf_d;
cin >> a >> b >> c >> d;
if (c < d) {
// NOTHING
} else {
buf = c;
c = d;
d = buf;
}
b... | [
"variable_declaration.type.primitive.change"
] | 806,643 | 806,644 | u085376000 | cpp |
p02995 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | [] | 806,653 | 806,654 | u102602414 | cpp |
p02995 |
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long lld;
lld gcd(lld a, lld b) { return b == 0 ? a : gcd(b, a % b); }
lld lcm(lld a, lld b) { return a * b / gcd(a, b); }
int main() {
lld A, B, C, D;
scanf("%lld%lld%lld%lld", &A, &B, &C, &D);
prin... |
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long lld;
lld gcd(lld a, lld b) { return b == 0 ? a : gcd(b, a % b); }
lld lcm(lld a, lld b) { return a * b / gcd(a, b); }
int main() {
lld A, B, C, D;
scanf("%lld%lld%lld%lld", &A, &B, &C, &D);
prin... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 806,657 | 806,658 | u720394712 | cpp |
p02995 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long int;
ll a, b, c, d;
ll ret = 0;
ll gcd(ll a, ll b) {
while (b) {
ll m = a % b;
a = b;
b = m;
}
return a;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int main(void) {
ci... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long int;
ll a, b, c, d;
ll ret = 0;
ll gcd(ll a, ll b) {
while (b) {
ll m = a % b;
a = b;
b = m;
}
return a;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int main(void) {
ci... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 806,687 | 806,688 | u728082661 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T x, T y) {
if (!x)
return y;
return gcd(y % x, x);
}
template <class T> T lcm(T x, T y) { return x * y / gcd(x, y); }
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long x = B / C - (A - 1) / C;
long long y = B... | #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T x, T y) {
if (!x)
return y;
return gcd(y % x, x);
}
template <class T> T lcm(T x, T y) { return x * y / gcd(x, y); }
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long x = B / C - (A - 1) / C;
long long y = B... | [
"call.add",
"expression.operation.binary.change"
] | 806,689 | 806,690 | u154289649 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const ll INF = 1e16;
void solver(int N, map<ll, ll> &ab, bool &flg) {
ll t_limit{}, t_done{};
for (auto p : ab) {
auto b = p.first;
auto a = p.second;
t_limit += b;
t_done... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const ll INF = 1e16;
void solver(int N, map<ll, ll> &ab, bool &flg) {
ll t_limit{}, t_done{};
for (auto p : ab) {
auto b = p.first;
auto a = p.second;
t_limit = b;
t_done ... | [
"assignment.value.change"
] | 806,695 | 806,696 | u118647609 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep_r(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define resize(x, n) x.resize(n)
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll INF = 1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep_r(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define resize(x, n) x.resize(n)
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll INF = 1... | [
"control_flow.break.add"
] | 806,697 | 806,698 | u915582296 | cpp |
p02996 | #include <algorithm>
#include <iostream>
using namespace std;
#define ll long long
int main() {
int n;
scanf("%d", &n);
pair<ll, ll> t[n];
for (int i = 0; i < n; i++) {
scanf("%lld %lld", &t[i].second, &t[i].first);
}
sort(t, t + n);
ll sum = 0;
string ans = "YES";
for (int i = 0; i < n; i++)... | #include <algorithm>
#include <iostream>
using namespace std;
#define ll long long
int main() {
int n;
scanf("%d", &n);
pair<ll, ll> t[n];
for (int i = 0; i < n; i++) {
scanf("%lld %lld", &t[i].second, &t[i].first);
}
sort(t, t + n);
ll sum = 0;
string ans = "Yes";
for (int i = 0; i < n; i++)... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 806,699 | 806,700 | u666641075 | cpp |
p02996 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
vector<P> v(n);
rep(i, n) {
ll a1, b1;
cin >> a1 >> b1;
v[i] = make_pair(b1, a1);
}
sort(v.begin(), v.en... |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
vector<P> v(n);
rep(i, n) {
ll a1, b1;
cin >> a1 >> b1;
v[i] = make_pair(b1, a1);
}
sort(v.begin(), v.en... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 806,703 | 806,704 | u289381123 | cpp |
p02996 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].first >> p[i].second;
sort(p.begin(), p.end());
int sum = 0;
rep(i, n) {
su... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
int sum = 0;
rep(i, n) {
su... | [
"expression.operation.binary.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 806,705 | 806,706 | u886613668 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define prec(n) fixed <<... | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define prec(n) fixed <<... | [
"literal.number.change",
"variable_declaration.value.change"
] | 806,714 | 806,715 | u397944802 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
bool cmp(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, x, y;
cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; i++) {
cin >> x >> y;
v.push_ba... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
bool cmp(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, x, y;
cin >> n;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
cin >> x >> y;
v.push_back(... | [] | 806,716 | 806,717 | u280859559 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++)
cin >> a[i].second >> a[i].first;
sort(a.begin(), a.end());
int cur = 0;
for (int i = 0; i < n; i++) {
cur += a[i].second;
if (cur > a[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++)
cin >> a[i].second >> a[i].first;
sort(a.begin(), a.end());
int cur = 0;
for (int i = 0; i < n; i++) {
cur += a[i].second;
if (cur > a[i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,722 | 806,723 | u543584809 | cpp |
p02996 | #include <bits/stdc++.h>
//#include <iomanip>
#define hell 1000000007
#define M 1000000007
#define Maxi 10000000000000000
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<long long>
#define pll vector<pair<ll, ll>>
#define pb push_back
//#define mp ... | #include <bits/stdc++.h>
//#include <iomanip>
#define hell 1000000007
#define M 1000000007
#define Maxi 10000000000000000
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<long long>
#define pll vector<pair<ll, ll>>
#define pb push_back
//#define mp ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,724 | 806,725 | u964292132 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr ll INFLL = 1e18;
constexpr int MOD = 1e9 + 7;
const ld PI = acosl(-1);
#define rep(i, n) for (int i = 0; i < (n); ++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr ll INFLL = 1e18;
constexpr int MOD = 1e9 + 7;
const ld PI = acosl(-1);
#define rep(i, n) for (int i = 0; i < (n); ++... | [] | 806,726 | 806,727 | u959682820 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<P> ba(N);
FOR(i, 0, N) {
int a, b;
cin >> a >> b;
ba[i] = P(b, a);
}... | #include <bits/stdc++.h>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<P> ba(N);
FOR(i, 0, N) {
int a, b;
cin >> a >> b;
ba[i] = P(b, a);
}... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,728 | 806,729 | u310790595 | cpp |
p02996 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1e9 + 7
#define mx 1000000000
#define endl '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
pair<int, int> arr[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> ar... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1e9 + 7
#define mx 1000000000
#define endl '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
pair<int, int> arr[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> ar... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,740 | 806,741 | u760542644 | cpp |
p02996 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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) ... | [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 806,742 | 806,743 | u028554976 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
vector<pair<ll, ll>> p(n);
for (auto &i : p)
cin >> i.second >> i.first;
sort(p.begin(), p.end());
ll ans = 0;
for (auto i : p) {
ans += i.second;
if (ans > i.first) {
cout << "No" << endl;
return... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<ll, ll>> p(n);
for (auto &i : p)
cin >> i.second >> i.first;
sort(p.begin(), p.end());
ll ans = 0;
for (auto i : p) {
ans += i.second;
if (ans > i.first) {
cout << "No" << endl;
... | [] | 806,744 | 806,745 | u526630579 | cpp |
p02996 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int mod = 1000000007;
int gcd(ll a, ll b) {
if (b == 0) {
return a;
} else ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int mod = 1000000007;
int gcd(ll a, ll b) {
if (b == 0) {
return a;
} else ... | [
"literal.string.change",
"io.output.change"
] | 806,756 | 806,757 | u272628953 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.