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 <iostream>
using namespace std;
typedef long long LL;
LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; }
LL lcm(LL x, LL y) { return x / gcd(x, y) * y; }
// |S| s.t. S = {x | 0<=x<m, x%a!=0,x%b!=0}
LL f(LL m, LL a, LL b) {
// cout << m/a << " " << m/b << " " << m/lcm(a,b) << endl;
return m - (m / a + m... | #include <iostream>
using namespace std;
typedef long long LL;
LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; }
LL lcm(LL x, LL y) { return x / gcd(x, y) * y; }
// |S| s.t. S = {x | 0<=x<=m, x%a!=0,x%b!=0}
LL f(LL m, LL a, LL b) {
// cout << m/a << " " << m/b << " " << m/lcm(a,b) << endl;
return m - (m / a + ... | [
"expression.operation.binary.remove"
] | 805,047 | 805,048 | u023463844 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int count_baisu(int long long x, int long long A, int long long B) {
// cout <<B/x - (A-1)/x <<endl;
return B / x - (A - 1) / x;
}
int long long Gratest_Common_Deviser(int long long a, int long long b) {
int long long r = b % a;
while (r != 0) {
b = a;
a = ... | #include <bits/stdc++.h>
using namespace std;
int long long count_baisu(int long long x, int long long A, int long long B) {
// cout <<B/x - (A-1)/x <<endl;
return B / x - (A - 1) / x;
}
int long long Gratest_Common_Deviser(int long long a, int long long b) {
int long long r = b % a;
while (r != 0) {
b = a... | [] | 805,049 | 805,050 | u260907804 | cpp |
p02995 | #include <iostream>
using namespace std;
long long lcm(int a, int b) {
long long x = a * b;
/* 自然数 a > b を確認・入替 */
if (a < b) {
long long tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return x / b;
}
int main() {... | #include <iostream>
using namespace std;
long long lcm(long long a, long long b) {
long long x = a * b;
/* 自然数 a > b を確認・入替 */
if (a < b) {
long long tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return x / b;
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 805,060 | 805,061 | u644568158 | cpp |
p02995 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a... | [] | 805,076 | 805,077 | u820341516 | cpp |
p02995 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b);
long long lcm(long long a, long long b);
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
a--;
long long ansb = b;
long long ansa = a;
ansb -= b / c;
ansb -= b / d;
an... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b);
long long lcm(long long a, long long b);
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
a--;
long long ansb = b;
long long ansa = a;
ansb -= b / c;
ansb -= b / d;
an... | [
"assignment.variable.change",
"identifier.change"
] | 805,081 | 805,082 | u955202970 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long euc(long long x, long long y) {
long long gcd;
while (y >= 1) {
if (y == 1) {
gcd = 1;
break;
}
if (y > x) {
swap(x, y);
}
if (x % y == 0) {
gcd = y;
break;
} else {
x = x % y;
}
}
return gcd... | #include <bits/stdc++.h>
using namespace std;
long long euc(long long x, long long y) {
long long gcd;
while (y >= 1) {
if (y == 1) {
gcd = 1;
break;
}
if (y > x) {
swap(x, y);
}
if (x % y == 0) {
gcd = y;
break;
} else {
x = x % y;
}
}
return gcd... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 805,092 | 805,093 | u342075214 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, C, D;
cin >> A >> B >> C >> D;
int64_t LCM, Cc = C, Dc = D, r;
while (Cc % Dc != 0) {
r = Cc % Dc;
Cc = Dc, Dc = r;
}
LCM = C * D / r;
int64_t ans_1 = B / C + B / D - B / LCM;
int64_t ans_2 = (A - 1) / C + (A - 1) / D - (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, C, D;
cin >> A >> B >> C >> D;
int64_t LCM, Cc = C, Dc = D, r = Dc;
while (Cc % Dc != 0) {
r = Cc % Dc;
Cc = Dc;
Dc = r;
}
LCM = C * D / r;
int64_t ans_1 = B / C + B / D - B / LCM;
int64_t ans_2 = (A - 1) / C + (A - 1... | [
"variable_declaration.value.change"
] | 805,109 | 805,110 | u227176034 | cpp |
p02995 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll gcd = C / __gcd(C, D) * D;
ll cok = B / C - A / C;
if (A % C == 0)
... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll gcd = C / __gcd(C, D) * D;
ll cok = B / C - A / C;
if (A % C == 0)
... | [
"control_flow.branch.if.condition.change"
] | 805,120 | 805,121 | u138273120 | cpp |
p02995 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | [
"expression.operation.binary.add"
] | 805,124 | 805,125 | u880221923 | cpp |
p02995 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
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; }
int main() {
ll a, b;
ll c, d;
cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
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; }
int main() {
ll a, b;
ll c, d;
cin >>... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 805,126 | 805,127 | u068713120 | cpp |
p02995 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
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; }
int main() {
ll a, b;
ll c, d;
cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
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; }
int main() {
ll a, b;
ll c, d;
cin >>... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 805,128 | 805,127 | u068713120 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long g = c / __gcd(c, d) * d;
long long ret = 0;
ret = (b - a) + 1;
// cout << g << endl;
ret = ret - (b / c) - (b / d) + (b / g);
// cout << ret << endl;;
ret = ret + ((a - 1) / c) + ((a... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long g = c / __gcd(c, d) * d;
long long ret = 0;
ret = (b - a) + 1;
// cout << g << endl;
ret = ret - (b / c) - (b / d) + (b / g);
// cout << ret << endl;;
ret = ret + ((a - 1) / c) + ((a... | [] | 805,150 | 805,151 | u383179205 | cpp |
p02995 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
ll gcd(ll m, ll n) {
ll tmp;
while (m % n != 0) {
tmp = n;
n = m % n;
m = tmp;
}
return n;
}
ll lc... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
ll gcd(ll m, ll n) {
ll tmp;
while (m % n != 0) {
tmp = n;
n = m % n;
m = tmp;
}
return n;
}
ll lc... | [
"variable_declaration.type.change"
] | 805,159 | 805,160 | u986754154 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int a, b, c, d;
cin >> a >> b >> c >> d;
ll int n = b - a + 1;
ll int x1 = a / c;
ll int y1 = b / c;
ll int x2 = a / d;
ll int y2 = b / d;
ll int c1, c2, c3;
if (x1 * y1 == 0 || a % c != 0)
c1 = y1 - x1;
else
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int a, b, c, d;
cin >> a >> b >> c >> d;
ll int n = b - a + 1;
ll int x1 = a / c;
ll int y1 = b / c;
ll int x2 = a / d;
ll int y2 = b / d;
ll int c1, c2, c3;
if (x1 * y1 == 0 || a % c != 0)
c1 = y1 - x1;
else
... | [] | 805,176 | 805,177 | u294547216 | cpp |
p02995 | #include <bits/stdc++.h>
//#include <boost/math/common_factor.hpp>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#defi... | #include <bits/stdc++.h>
//#include <boost/math/common_factor.hpp>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#defi... | [
"identifier.change",
"call.arguments.change"
] | 805,178 | 805,179 | u734938632 | cpp |
p02995 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long n, long long m) {
if (n % m == 0) {
return m;
} else {
return gcd(m, n % m);
}
}
long long lcm(long long n, long l... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long n, long long m) {
if (n % m == 0) {
return m;
} else {
return gcd(m, n % m);
}
}
long long lcm(long long n, long l... | [] | 805,182 | 805,183 | u323542775 | cpp |
p02995 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long n, long long m) {
if (n % m == 0) {
return m;
} else {
return gcd(m, n % m);
}
}
long long lcm(long long n, long l... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long n, long long m) {
if (n % m == 0) {
return m;
} else {
return gcd(m, n % m);
}
}
long long lcm(long long n, long l... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 805,184 | 805,183 | u323542775 | cpp |
p02995 | #include <bits/stdc++.h>
#define fastio() ios_base::sync_with_stdio(false);
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll cntC = (b / c) - ((a - 1) / c);
ll cntD = (b / d) - ((a - 1) / d);
ll g = (c * d) / __gcd(c, d);
ll cntG = (... | #include <bits/stdc++.h>
#define fastio() ios_base::sync_with_stdio(false);
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll cntC = (b / c) - ((a - 1) / c);
ll cntD = (b / d) - ((a - 1) / d);
ll g = (c * d) / __gcd(c, d);
ll cntG = (... | [] | 805,189 | 805,190 | u211631457 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 805,200 | 805,201 | u917049698 | cpp |
p02995 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll a, b, c, d;
cin >> a >> b... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll a, b, c, d;
cin >> a >> b... | [
"expression.operation.binary.remove"
] | 805,206 | 805,207 | u745267317 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long Euclid(long long x, long long y) {
long long S = y % x;
while (S != 0) {
S = y % x;
if (S == 0)
return x;
y = x;
x = S;
}
return y;
}
int main(void) {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long E = C * D / Euclid(C... | #include <bits/stdc++.h>
using namespace std;
long long Euclid(long long x, long long y) {
long long S = y % x;
while (x != 0) {
S = y % x;
if (S == 0)
return x;
y = x;
x = S;
}
return 1;
}
int main(void) {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long E = C * D / Euclid(C... | [
"identifier.change",
"control_flow.loop.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 805,208 | 805,209 | u406634703 | cpp |
p02995 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a, b, c, d;
inline ll read() {
ll s = 0, w = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
w *= -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
s = s * 10 + ch - '0';
ch = getchar();
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a, b, c, d;
inline ll read() {
ll s = 0, w = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
w *= -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
s = s * 10 + ch - '0';
ch = getchar();
... | [
"call.arguments.change"
] | 805,211 | 805,212 | u093420168 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll findLCD(ll X, ll Y) {
ll g;
ll A = max(X, Y);
ll B = min(X, Y);
ll iniA = A;
ll iniB = B;
if (A == B)
g = A;
else {
if (A % B == 0)
g = B;
while (true) {
g = A % B;
A = B;
B = g;
if (A % B ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll findLCD(ll X, ll Y) {
ll g;
ll A = max(X, Y);
ll B = min(X, Y);
ll iniA = A;
ll iniB = B;
if (A == B)
g = A;
else {
if (A % B == 0)
g = B;
else {
while (true) {
g = A % B;
A = B;
B = g;... | [
"control_flow.branch.else.add"
] | 805,215 | 805,216 | u241312295 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | [] | 805,221 | 805,222 | u584787460 | cpp |
p02995 | #include <bits/stdc++.h>
#define repeat(i, n) for (int(i) = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const double EPS = numeric_limits<double>::epsilon();
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) % b; }
ll f(ll x, ll c, ll d) {
ll result = x;
... | #include <bits/stdc++.h>
#define repeat(i, n) for (int(i) = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const double EPS = numeric_limits<double>::epsilon();
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll f(ll x, ll c, ll d) {
ll result = x;
... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 805,225 | 805,226 | u822130495 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long int saisyou(long long int C, long long int D) {
long long int LCM = (C * D) / __gcd(C, D);
return LCM;
}
int main() {
long long int A, B;
long long int C, D;
cin >> A >> B >> C >> D;
long long int saisyo1 = B / saisyou(C, D);
long long int c1 = B / C... | #include <bits/stdc++.h>
using namespace std;
long long int saisyou(long long int C, long long int D) {
long long int LCM = (C * D) / __gcd(C, D);
return LCM;
}
int main() {
long long int A, B;
long long int C, D;
cin >> A >> B >> C >> D;
long long int saisyo1 = B / saisyou(C, D);
long long int c1 = B / C... | [] | 805,234 | 805,235 | u231455327 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A, B;
long int C, D;
long long int c1, c2, c3, c4;
// Taking input
cin >> A >> B >> C >> D;
c1 = B / C - A / C;
c2 = B / D - A / D;
// c3 : lcm of A & B
c3 = (A * B) / __gcd(A, B);
c4 = B / c3 - A / c3;
if (A % C == 0)
c1... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A, B;
long int C, D;
long long int c1, c2, c3, c4;
// Taking input
cin >> A >> B >> C >> D;
c1 = B / C - A / C;
c2 = B / D - A / D;
// c3 : lcm of A & B
c3 = (C * D) / __gcd(C, D);
c4 = B / c3 - A / c3;
if (A % C == 0)
c1... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 805,253 | 805,254 | u551519692 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long a, b, c, d;
long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long lcm(long a, long b) { return a / gcd(a, b) * b; }
long sub(long n) { return n - n / c - n / d + n / lcm(c, d); }
int main() {
cin >> a >> b >> c >> d;
cout << sub(... | #include <bits/stdc++.h>
using namespace std;
long a, b, c, d;
long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long lcm(long a, long b) { return a / gcd(a, b) * b; }
long sub(long n) { return n - n / c - n / d + n / lcm(c, d); }
int main() {
cin >> a >> b >> c >> d;
cout << sub(... | [
"expression.operation.binary.remove"
] | 805,265 | 805,266 | u993619636 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll f(ll x, ll d) { return x - x / d; }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll x = f(b, c) - f(a - 1, c);
ll y = f(b, d) - f(a - 1, d);
ll g = __gcd(c, d);
ll z = f(b, g) - f(a - 1, g);
cout << x + y - z << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll f(ll x, ll d) { return x - x / d; }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll x = f(b, c) - f(a - 1, c);
ll y = f(b, d) - f(a - 1, d);
ll g = c / __gcd(c, d) * d;
ll z = f(b, g) - f(a - 1, g);
cout << x + y - z << endl;... | [
"assignment.change"
] | 805,267 | 805,268 | u946322619 | cpp |
p02995 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define mod 1000000007
#define ten5 100005
#define PI 3.1415926
using namespace std;
long long int getGCD(long long int, long long int);
int main() {
// int m,n,o=0,i,j,k... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define mod 1000000007
#define ten5 100005
#define PI 3.1415926
using namespace std;
long long int getGCD(long long int, long long int);
int main() {
// int m,n,o=0,i,j,k... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 805,271 | 805,272 | u763410402 | cpp |
p02995 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
ll A, B, C, D;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll func(ll x) { return (x / C)... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
ll A, B, C, D;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll func(ll x) { return x - ((x... | [
"function.return_value.change"
] | 805,275 | 805,276 | u157322125 | cpp |
p02995 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
ll gcd(ll c, ll d) { return c ? gcd(c, d % c) : c; }
ll lcm(ll c, ll d) { return (c / gcd(c, d) * d); }
ll f(ll x, ll c, ll d) {
ll res = x;
res -= x / c;
res -= x / d;
res += x / lcm(c, d);
r... | #include <bits/stdc++.h>
#define rep(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 x, ll c, ll d) {
ll res = x;
res -= x / c;
res -= x / d;
res += x / lcm(c, d);
r... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"function.return_value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 805,293 | 805,294 | u147556624 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll b, ll c) { return c ? gcd(c, b % c) : b; }
ll lcm(ll b, ll c) { return b / gcd(b, c) * c; }
ll f(ll a, ll b, ll c) {
ll ans = a;
ans -= a / b;
ans -= a / c;
ans += a / lcm(b, c);
return ans;
}
int main() {
ll A, B, C, D;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll b, ll c) { return c ? gcd(c, b % c) : b; }
ll lcm(ll b, ll c) { return b / gcd(b, c) * c; }
ll f(ll a, ll b, ll c) {
ll ans = a;
ans -= a / b;
ans -= a / c;
ans += a / lcm(b, c);
return ans;
}
int main() {
ll A, B, C, D;
... | [] | 805,295 | 805,296 | u147556624 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
template <typename TypeInt> TypeInt G_C_D(TypeInt a, TypeInt b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
while (b != 0) {
a %= b;
if (a == 0)
return b;
b %= a;
}
return... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
template <typename TypeInt> TypeInt G_C_D(TypeInt a, TypeInt b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
while (b != 0) {
a %= b;
if (a == 0)
return b;
b %= a;
}
return... | [] | 805,326 | 805,327 | u981304949 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) \
cerr << #x << " is "; \
for (auto &e : (x)) ... | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) \
cerr << #x << " is "; \
for (auto &e : (x)) ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 805,335 | 805,336 | u411771230 | cpp |
p02995 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const int INF = 100100100;
const double PI = 3.141592653589;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll c = a % b;
if (c == 0)
... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const int INF = 100100100;
const double PI = 3.141592653589;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll c = a % b;
if (c == 0)
... | [] | 805,342 | 805,340 | u634999820 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
//最大公約数
long long x, y, gcd = 1;
x = c;
y = d;
long long sw;
if (y < x) {
sw = x;
x = y;
y = sw;
}
vector<long long> gc(1000, 0);
// xの約数
int count = 0;
for (long long i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
//最大公約数
long long x, y, gcd = 1;
x = c;
y = d;
long long sw;
if (y < x) {
sw = x;
x = y;
y = sw;
}
vector<long long> gc(1000, 1);
// xの約数
int count = 0;
for (long long i =... | [
"literal.number.change",
"call.arguments.change"
] | 805,346 | 805,347 | u830237447 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long e = max(c, d);
long long f = min(c, d);
long long r = e % f;
while (r != 0) {
e = f;
f = r;
r = e % f;
}
int s = c * d / f;
cout << fixed << setprecision(10);
cout << b -... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long e = max(c, d);
long long f = min(c, d);
long long r = e % f;
while (r != 0) {
e = f;
f = r;
r = e % f;
}
long long s = c * d / f;
cout << fixed << setprecision(20);
cout ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"io.output.change"
] | 805,355 | 805,356 | u882039496 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
int C, D;
cin >> A >> B >> C >> D;
ll gcd_CD = C * D / __gcd(C, D);
ll not_ans = (B / C - (A - 1) / C) + (B / D - (A - 1) / D) -
(B / gcd_CD - (A - 1) / gcd_CD);
cout << (B - A + 1) - not_ans << endl;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll gcd_CD = C * D / __gcd(C, D);
ll not_ans = (B / C - (A - 1) / C) + (B / D - (A - 1) / D) -
(B / gcd_CD - (A - 1) / gcd_CD);
cout << (B - A + 1) - not_ans << endl;
ret... | [] | 805,381 | 805,382 | u476833465 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
int C, D;
cin >> A >> B >> C >> D;
int gcd_CD = C * D / __gcd(C, D);
ll not_ans = (B / C - (A - 1) / C) + (B / D - (A - 1) / D) -
(B / gcd_CD - (A - 1) / gcd_CD);
cout << (B - A + 1) - not_ans << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll gcd_CD = C * D / __gcd(C, D);
ll not_ans = (B / C - (A - 1) / C) + (B / D - (A - 1) / D) -
(B / gcd_CD - (A - 1) / gcd_CD);
cout << (B - A + 1) - not_ans << endl;
ret... | [
"variable_declaration.type.change"
] | 805,383 | 805,382 | u476833465 | cpp |
p02995 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
int main() {
long long int a, b, c, d;
cin >> a >> b >> c ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
int main() {
long long int a, b, c, d;
cin >> a >> b >> c ... | [
"io.output.change"
] | 805,387 | 805,388 | u530329977 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, tmp, x, hoge, r, tmpc, tmpd;
cin >> a >> b >> c >> d;
x = c * d;
tmpc = c;
tmpd = d;
if (tmpc < tmpd) {
tmp = tmpc;
tmpc = tmpd;
tmpd = tmp;
}
/* ユークリッドの互除法 */
r = tmpc % tmpd;
while (r != ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, tmp, x, hoge, r, tmpc, tmpd;
cin >> a >> b >> c >> d;
x = c * d;
tmpc = c;
tmpd = d;
if (tmpc < tmpd) {
tmp = tmpc;
tmpc = tmpd;
tmpd = tmp;
}
/* ユークリッドの互除法 */
r = tmpc % tmpd;
while (r != ... | [
"identifier.change",
"expression.operation.binary.change"
] | 805,395 | 805,396 | u364916333 | cpp |
p02995 | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 805,397 | 805,398 | u061984624 | cpp |
p02995 | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 805,399 | 805,398 | u061984624 | cpp |
p02995 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int gcm... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int gcm... | [
"variable_declaration.type.change"
] | 805,402 | 805,403 | u982721693 | cpp |
p02995 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | [
"expression.operation.binary.remove"
] | 805,409 | 805,410 | u861345985 | cpp |
p02995 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | [
"expression.operation.binary.remove",
"identifier.change",
"expression.operation.binary.change"
] | 805,411 | 805,410 | u861345985 | cpp |
p02995 | /*
g++ -std=c++14 -O2 -Wall a.cpp -o a && a
g++ -std=c++14 -O2 -Wall a.cpp -o a && a < in.txt > out.txt
*/
// io
#include <iostream>
//#include <fstream> //http://www.cplusplus.com/reference/fstream/fstream/
//#include <cstdio>
#include <iomanip> //http://www.cplusplus.com/reference/iomanip/
#include <lim... | /*
g++ -std=c++14 -O2 -Wall a.cpp -o a && a
g++ -std=c++14 -O2 -Wall a.cpp -o a && a < in.txt > out.txt
*/
// io
#include <iostream>
//#include <fstream> //http://www.cplusplus.com/reference/fstream/fstream/
//#include <cstdio>
#include <iomanip> //http://www.cplusplus.com/reference/iomanip/
#include <lim... | [
"expression.unary.arithmetic.add",
"expression.operation.binary.remove"
] | 805,412 | 805,413 | u027395921 | cpp |
p02995 | #include <iostream>
using namespace std;
typedef long long LL;
LL a, b, c, d;
LL gcd(LL x, LL y) {
if (x > y) {
LL t = x;
x = y;
y = t;
}
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
cin >> a >> b >> c >> d;
LL l = c * d / gcd(c, d);
LL A = a - 1, B = b;
A -= a / c;
A -... | #include <iostream>
using namespace std;
typedef long long LL;
LL a, b, c, d;
LL gcd(LL x, LL y) {
if (x > y) {
LL t = x;
x = y;
y = t;
}
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
cin >> a >> b >> c >> d;
a--;
LL l = c * d / gcd(c, d);
LL A = a, B = b;
A -= a / c;
... | [
"expression.unary.arithmetic.add",
"expression.operation.binary.remove"
] | 805,436 | 805,437 | u047554023 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
using S = set<long long>;
using D = deque<long long>;
using L = vector<long long>;
using M = map<int, long long>;
using A = vector<vector<long long>>;
using Q = priority_queue<long long>;
using U =
unordered_map<int, long long>; // mapとの違いはkeyの順番を保持していない
#define sorte... | #include <bits/stdc++.h>
using namespace std;
using S = set<long long>;
using D = deque<long long>;
using L = vector<long long>;
using M = map<int, long long>;
using A = vector<vector<long long>>;
using Q = priority_queue<long long>;
using U =
unordered_map<int, long long>; // mapとの違いはkeyの順番を保持していない
#define sorte... | [] | 805,457 | 805,458 | u367130284 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
ll lcm(ll x, ll y) {
x /= __gcd(x, y);
// y /= gcd(x, y);
return (x * y);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
ll lcm(ll x, ll y) {
x /= gcd(x, y);
// y /= gcd(x, y);
return (x * y);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long a, ... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 805,461 | 805,462 | u423624748 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
ll lcm(ll x, ll y) {
x /= gcd(x, y);
// y /= gcd(x, y);
return (x * y);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long a, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
ll lcm(ll x, ll y) {
x /= gcd(x, y);
// y /= gcd(x, y);
return (x * y);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long a, ... | [
"expression.operation.binary.remove"
] | 805,463 | 805,462 | u423624748 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
ll lcm(ll a, ll b) {
if (a < b)
swap(a, b);
return a % b ? lcm(b, a % b) : b;
}
ll gcd(ll a, ll b) { return a * b / lcm(a, b); }
int main() {
ll n, k, a, b;
cin >> n >> k >> a >> b;
cout << n - ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
ll lcm(ll a, ll b) {
if (a < b)
swap(a, b);
return a % b ? lcm(b, a % b) : b;
}
ll gcd(ll a, ll b) { return a * b / lcm(a, b); }
int main() {
ll n, k, a, b;
cin >> k >> n >> a >> b;
cout << n - ... | [
"expression.operation.binary.remove"
] | 805,470 | 805,471 | u987476436 | cpp |
p02995 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int lcm(long long x, long long y) {
long long tmp, a, b;
if (x > y) {
b = x;
a = y;
} else {
a = x;
b = y;
}
while (a > 0) {
tmp =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
long long lcm(long long x, long long y) {
long long tmp, a, b;
if (x > y) {
b = x;
a = y;
} else {
a = x;
b = y;
}
while (a > 0) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 805,480 | 805,481 | u448407332 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
//ユークリッド互除法
long long p = min(c, d);
long long q = max(c, d);
long long r = q % p;
while (r != 0) {
q = p;
p = r;
r = q % p;
}
long long lcm_cd = c * d / q; // cとdの最小公倍数
long lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
//ユークリッド互除法
long long p = min(c, d);
long long q = max(c, d);
long long r = q % p;
while (r != 0) {
q = p;
p = r;
r = q % p;
}
long long lcm_cd = c * d / p; // cとdの最小公倍数
long lon... | [
"identifier.change",
"expression.operation.binary.change"
] | 805,492 | 805,493 | u237713747 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll gcd(ll a, ll b) { return (b ? gcd(b, a % b) : a); }
ll lcd(ll a, ll b) { return (a / gcd(a, b) * b); }
ll f(ll x, ll c, ll d) {
ll ans = x;
ans -= x / c;
ans -= x / d;
ans += x / lcd(c, d);
re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll gcd(ll a, ll b) { return (b ? gcd(b, a % b) : a); }
ll lcd(ll a, ll b) { return (a / gcd(a, b) * b); }
ll f(ll x, ll c, ll d) {
ll ans = x;
ans -= x / c;
ans -= x / d;
ans += x / lcd(c, d);
re... | [
"expression.operation.binary.add"
] | 805,496 | 805,497 | u854161810 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b, count = 0;
ll c, d;
cin >> a >> b >> c >> d;
if (c < d)
swap(c, d);
// for(ll i = (a - 1) / c + 1; i * c <= b; i++)
// count++;
// for(ll i = (a - 1) / d + 1; i * d <= b; i++)
// coun... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b, count = 0;
ll c, d;
cin >> a >> b >> c >> d;
if (c < d)
swap(c, d);
// for(ll i = (a - 1) / c + 1; i * c <= b; i++)
// count++;
// for(ll i = (a - 1) / d + 1; i * d <= b; i++)
// coun... | [] | 805,500 | 805,501 | u326152409 | cpp |
p02995 | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll a, b;
int c, d;
cin >> a >> b >> c >> d;
ll e = b / c - (a - 1) / c;
ll f = b /... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int 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 e = b / c - (a - 1) / c;
ll f = b / d - (a ... | [] | 805,528 | 805,529 | u374190629 | cpp |
p02995 | #include <iostream>
using namespace std;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
long long f1(long long X1, long long C1, long long D1) {
long long G1 = GCD(C1, D1);
long long L1 = C1 / G1 * D1;
return X1 - X1 / C1 - X1 / D1 ... | #include <iostream>
using namespace std;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
long long f1(long long X1, long long C1, long long D1) {
long long G1 = GCD(C1, D1);
long long L1 = C1 / G1 * D1;
return X1 - X1 / C1 - X1 / D1 ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 805,535 | 805,536 | u506858457 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vvi = vector<vector<int>>;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
while (a % b != 0) {
a = a % b;
swap(a, b);
}
return b;
}
int main() {
long a, b, c, d, e;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vvi = vector<vector<int>>;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
while (a % b != 0) {
a = a % b;
swap(a, b);
}
return b;
}
int main() {
long a, b, c, d, e;
... | [
"assignment.change"
] | 805,539 | 805,540 | u422633119 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll c_count = 0, d_count = 0;
c_count = (b) / c - (a - 1) / c;
d_count = (b) / d - (a - 1) / d;
ll gcd = d % c, kioku = c * d;
while (gcd != 0) {
d = c;
c = gcd;
g... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll c_count = 0, d_count = 0;
c_count = (b) / c - (a - 1) / c;
d_count = (b) / d - (a - 1) / d;
ll gcd = d % c, kioku = c * d;
while (gcd != 0) {
d = c;
c = gcd;
g... | [
"expression.operation.binary.remove"
] | 805,587 | 805,588 | u843292252 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll c_count = 0, d_count = 0;
c_count = (b) / c - (a - 1) / c;
d_count = (b) / d - (a - 1) / d;
ll gcd = d % c, kioku = c * d;
while (gcd != 0) {
d = c;
c = gcd;
g... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll c_count = 0, d_count = 0;
c_count = (b) / c - (a - 1) / c;
d_count = (b) / d - (a - 1) / d;
ll gcd = d % c, kioku = c * d;
while (gcd != 0) {
d = c;
c = gcd;
g... | [] | 805,589 | 805,588 | u843292252 | cpp |
p02995 | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define REP_IN(i, n, x) ... | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define REP_IN(i, n, x) ... | [] | 805,608 | 805,609 | u703877026 | cpp |
p02995 | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
int x = b / c + b / d - b / lcm(c, d);
a--;
int y = a / c + a / d - a / lcm(c, d);
cout << (b - a) - (x - y) << endl;... | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll x = b / c + b / d - b / lcm(c, d);
a--;
ll y = a / c + a / d - a / lcm(c, d);
cout << (b - a) - (x - y) << endl;
... | [
"variable_declaration.type.change"
] | 805,616 | 805,617 | u412908746 | cpp |
p02995 | #include <stdio.h>
#include <stdlib.h>
long int lcm(long int C, long int D);
int main(void) {
long int A, B, C, D, uni, L;
scanf("%ld %ld %ld %ld", &A, &B, &C, &D);
L = lcm(C, D);
uni = B / C + B / D - B / L - (A - 1) / C - (A - 1) / D + (A - 1) / L;
printf("%ld", B - A + 1 - uni);
return 0;
}
long int l... | #include <stdio.h>
#include <stdlib.h>
long int lcm(long int C, long int D);
int main(void) {
long int A, B, C, D, uni, L;
scanf("%ld %ld %ld %ld", &A, &B, &C, &D);
L = lcm(C, D);
uni = B / C + B / D - B / L - (A - 1) / C - (A - 1) / D + (A - 1) / L;
printf("%ld", B - A + 1 - uni);
return 0;
}
long int l... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 805,622 | 805,623 | u651802048 | cpp |
p02995 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long lcm(long long x, long long y) {
long long sum = x * y;
long long tmp = x;
long long i = y;
long long ret;
if (x > y) {
tmp = y;
i = x;
}
ret = i % tmp;
while (ret != 0LL) {
i = tmp;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long lcm(long long x, long long y) {
long long sum = x * y;
long long tmp = x;
long long i = y;
long long ret;
if (x > y) {
tmp = y;
i = x;
}
ret = i % tmp;
while (ret != 0LL) {
i = tmp;... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 805,624 | 805,625 | u100586344 | cpp |
p02995 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long lcm(long long x, long long y) {
long long sum = x * y;
long long tmp = x;
long long i = y;
long long ret;
if (x > y) {
tmp = y;
i = x;
}
ret = i % tmp;
while (!ret != 0LL) {
i = tmp... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long lcm(long long x, long long y) {
long long sum = x * y;
long long tmp = x;
long long i = y;
long long ret;
if (x > y) {
tmp = y;
i = x;
}
ret = i % tmp;
while (ret != 0LL) {
i = tmp;... | [
"expression.operation.unary.logical.remove",
"control_flow.loop.condition.change",
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 805,626 | 805,625 | u100586344 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
int r;
cin >> a >> b;
if (b > a) {
r = a;
a = b;
b = r;
}
while (1) {
r = a % b;
if (r == 0)
break;
a = b;
b = r;
}
return b;
}
int main() {
int64_t A, B, LCM, cnum = 0, dnum = 0, lcmnum = 0;
int... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
int r;
cin >> a >> b;
if (b > a) {
r = a;
a = b;
b = r;
}
while (1) {
r = a % b;
if (r == 0)
break;
a = b;
b = r;
}
return b;
}
int main() {
int64_t A, B, LCM, cnum = 0, dnum = 0, lcmnum = 0, C, D,... | [] | 805,627 | 805,628 | u481581904 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, cc = 0;
cin >> a >> b >> c >> d;
long long lcm, gcd;
long long C = c, D = d, r;
if (c > d) {
C = d;
D = c;
}
r = a % b;
while (r != 0) {
C = D;
D = r;
r = C % D;
}
gcd = D;
lcm = (c * d) / gcd;
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, cc = 0;
cin >> a >> b >> c >> d;
long long lcm, gcd;
long long C = c, D = d, r;
if (c > d) {
C = d;
D = c;
}
r = C % D;
while (r != 0) {
C = D;
D = r;
r = C % D;
}
gcd = D;
lcm = (c * d) / gcd;
c... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 805,640 | 805,641 | u477516105 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int64 gcd(int a, int b) {
if (a < b)
return gcd(b, a);
int r = a % b;
if (r == 0)
return b;
else
return gcd(b, r);
}
int main() {
int64 a, b, c, d;
cin >> a >> b >> c >> d;
int64 lcm = c * d * gcd(c, d);
int64 ans = 0... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int64 gcd(int64 a, int64 b) {
if (a < b)
return gcd(b, a);
int64 r = a % b;
if (r == 0)
return b;
else
return gcd(b, r);
}
int main() {
int64 a, b, c, d;
cin >> a >> b >> c >> d;
int64 lcm = c * d / gcd(c, d);
// cout... | [
"variable_declaration.type.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 805,642 | 805,643 | u771276542 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
scanf("%lld %lld %lld %lld", &a, &b, &c, &d);
printf("%lld", (b - a + 1) - (b / c - (a - 1)... | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
scanf("%lld %lld %lld %lld", &a, &b, &c, &d);
printf("%lld", (b - a + 1) - ((b / c - (a - 1... | [
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 805,651 | 805,652 | u713051936 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
scanf("%lld %lld %lld %lld", &a, &b, &c, &d);
printf("%lld", (b - a + 1) - ((b / c - (a - 1... | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
scanf("%lld %lld %lld %lld", &a, &b, &c, &d);
printf("%lld", (b - a + 1) - ((b / c - (a - 1... | [
"call.arguments.change"
] | 805,653 | 805,652 | u713051936 | cpp |
p02995 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long int solve(long long int n, long long int c, long... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long int solve(long long int n, long long int c, long... | [
"expression.operation.binary.add"
] | 805,674 | 805,675 | u372177994 | cpp |
p02995 | //前置き
#pragma region
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).e... | //前置き
#pragma region
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).e... | [] | 805,689 | 805,690 | u833064541 | cpp |
p02995 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | [
"variable_declaration.type.change"
] | 805,691 | 805,692 | u373984877 | cpp |
p02995 | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow(ll a, ll b, ll c) {
ll ans = 1;
a %= c;
while (b) {
if (b & 1)
ans = (ans * a) % c;
a = (a * a) % c;
b >>= 1;
}
return (ans % c);
}
bool cmp(const int &a, const int &b) { return a < b... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow(ll a, ll b, ll c) {
ll ans = 1;
a %= c;
while (b) {
if (b & 1)
ans = (ans * a) % c;
a = (a * a) % c;
b >>= 1;
}
return (ans % c);
}
bool cmp(const int &a, const int &b) { return a < b... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 805,693 | 805,694 | u337067848 | cpp |
p02995 | #include <iostream>
using namespace std;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
long long A, B, C, D, G;
long long L;
long long cnt;
cin >> A >> B >> C >> D;
G = GCD(A, B);
L = C * D / G;
A = A - ... | #include <iostream>
using namespace std;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
long long A, B, C, D, G;
long long L;
long long cnt;
cin >> A >> B >> C >> D;
G = GCD(C, D);
L = C * D / G;
A = A - ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 805,701 | 805,702 | u372187342 | cpp |
p02995 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(long long int a, long long int b) { return a * b / gcd(a, b); }
int main() {
long long int a, b, c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
return a * b / gcd(a, b);
}
int main() {
long long... | [
"variable_declaration.type.widen.change"
] | 805,707 | 805,708 | u552004736 | cpp |
p02995 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 805,709 | 805,710 | u791593901 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
long long A, B, C, D;
int count = 0;
cin >> A >> B >> C >> D;
count = B / C - (A - 1) / C... | #include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
long long A, B, C, D;
long long count = 0;
cin >> A >> B >> C >> D;
count = B / C - (A - ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 805,711 | 805,712 | u792521295 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b, c, d;
cin >> a >> b >> c >> d;
int e;
e = c * d / __gcd(c, d);
int kekk... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
lint a, b, c, d;
cin >> a >> b >> c >> d;
lint e;
e = c * d / __gcd(c, d);
lint k... | [
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 805,718 | 805,719 | u853585082 | cpp |
p02995 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
long func(long x, long y) {
long r = y % x, tmpgcd;
while (r != 0) {
y = x;
x = r;
r = y % x;
}
tmpgcd = x;
return tmpgcd;
}
int main() {
long a, b, c, d;
std::cin >> a >> b ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
long func(long x, long y) {
long r = y % x, tmpgcd;
while (r != 0) {
y = x;
x = r;
r = y % x;
}
tmpgcd = x;
return tmpgcd;
}
int main() {
long a, b, c, d;
std::cin >> a >> b ... | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 805,722 | 805,723 | u832726997 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
int main() {
ll A, B;
int C, D;
cin >> A >> B >> C >> D;
int gcd = __gcd(C, D);
ll lcm = C * D / gcd;
ll a = A - 1;
ll r = B - (ll)(B / C) - (ll)(B / D) + (ll)(B / lcm);
ll ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
int gcd = __gcd(C, D);
ll lcm = C * D / gcd;
ll a = A - 1;
ll r = B - (ll)(B / C) - (ll)(B / D) + (ll)(B / lcm);
ll l = a ... | [] | 805,733 | 805,734 | u987594251 | cpp |
p02995 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y)... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, y), b = min(x, y)... | [] | 805,743 | 805,744 | u776056110 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mkp make_pair
#define sz size()
#define forf(a, b, c) for (int i = a; i <= b; i... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mkp make_pair
#define sz size()
#define forf(a, b, c) for (int i = a; i <= b; i... | [] | 805,758 | 805,759 | u615763347 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
// int 2×10の9乗
int main() {
ll a, b;
int c, d;
cin >> a >> b >> c >> d;
ll ans = 0;
ll C = b / c, D = b / d, l = c * d / __gcd(c, d), L = b / l;
ll ansk1 = b - (C + D - L);
ll CC = (a -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
// int 2×10の9乗
int main() {
ll a, b;
ll c, d;
cin >> a >> b >> c >> d;
ll ans = 0;
ll C = b / c, D = b / d, l = c * d / __gcd(c, d), L = b / l;
ll ansk1 = b - (C + D - L);
ll CC = (a - ... | [
"variable_declaration.type.change"
] | 805,766 | 805,767 | u510383220 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, 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 ans = b - a + 1;
ans -= (b / ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, 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 ans = b - a + 1;
ans -= (b / ... | [
"identifier.change",
"call.arguments.change"
] | 805,770 | 805,771 | u774417629 | cpp |
p02995 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | [] | 805,792 | 805,793 | u342051078 | cpp |
p02995 | #include <iostream>
using namespace std;
long long koubaisuu(long long a, long long b);
long long koubaisuu2(long long a, long long b);
int main() {
long long a, b, c, d, cd, ans[5];
cin >> a >> b >> c >> d;
ans[0] = b / c - (a - 1) / c;
ans[1] = b / d - (a - 1) / d;
cd = koubaisuu2(c, d);
ans[2] = b / (c... | #include <iostream>
using namespace std;
long long koubaisuu(long long a, long long b);
long long koubaisuu2(long long a, long long b);
int main() {
long long a, b, c, d, cd, ans[5];
cin >> a >> b >> c >> d;
ans[0] = b / c - (a - 1) / c;
ans[1] = b / d - (a - 1) / d;
cd = koubaisuu2(c, d);
ans[2] = b / (c... | [
"literal.number.change"
] | 805,796 | 805,797 | u778738287 | cpp |
p02995 | #include <iostream>
using namespace std;
long long koubaisuu(long long a, long long b);
long long koubaisuu2(long long a, long long b);
int main() {
long long a, b, c, d, cd, ans[5];
cin >> a >> b >> c >> d;
ans[0] = b / c - (a - 1) / c;
ans[1] = b / d - (a - 1) / d;
cd = koubaisuu2(c, d);
ans[2] = b / (c... | #include <iostream>
using namespace std;
long long koubaisuu(long long a, long long b);
long long koubaisuu2(long long a, long long b);
int main() {
long long a, b, c, d, cd, ans[5];
cin >> a >> b >> c >> d;
ans[0] = b / c - (a - 1) / c;
ans[1] = b / d - (a - 1) / d;
cd = koubaisuu2(c, d);
ans[2] = b / (c... | [
"variable_declaration.value.change"
] | 805,798 | 805,797 | u778738287 | 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() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll m1 = B / C - A / C;
ll m2 = B / D - A / D;
ll lcm = (C * D);... | #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() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll m1 = B / C - A / C;
ll m2 = B / D - A / D;
ll lcm = (C * D);... | [
"expression.operation.binary.add"
] | 805,805 | 805,806 | u781659997 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 805,817 | 805,818 | u288432959 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int function1(long a, long b) {
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long s;
long long r = B / C - (A - 1) / C;
long long t = B / D - (A -... | #include <bits/stdc++.h>
using namespace std;
int function1(long a, long b) {
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
long long A, B, C, D;
cin >> A >> B >> C >> D;
long long s;
long long r = B / C - (A - 1) / C;
long long t = B / D - (A -... | [] | 805,821 | 805,822 | u910028046 | cpp |
p02995 | #include <iostream>
using namespace std;
long gcd(long a, long b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long lcm(long a, long b) { return a * b / gcd(a, b); }
int main() {
long a, b, c, d;
cin >> a >> b >> c >> d;
long num = b - a + 1;
long ans = (b / c) + (b / ... | #include <iostream>
using namespace std;
long gcd(long a, long b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long lcm(long a, long b) { return a * b / gcd(a, b); }
int main() {
long a, b, c, d;
cin >> a >> b >> c >> d;
long num = b - a + 1;
long ans = (b / c) + (b / ... | [] | 805,827 | 805,828 | u900267897 | cpp |
p02995 | #include <iostream>
using namespace std;
int main() {
long a, b, c, d, cd = 0, r[1000000000000]; // cdはcとdの最小公倍数
cin >> a >> b >> c >> d;
r[0] = max(c, d) % min(c, d);
if (r[0] == 0)
cd = c * d / min(c, d);
else {
r[1] = min(c, d) % r[0];
for (int j = 0;; j++) {
if (r[j + 1] == 0) {
... | #include <iostream>
using namespace std;
int main() {
long a, b, c, d, cd = 0, r[1000000]; // cdはcとdの最小公倍数
cin >> a >> b >> c >> d;
r[0] = max(c, d) % min(c, d);
if (r[0] == 0)
cd = c * d / min(c, d);
else {
r[1] = min(c, d) % r[0];
for (int j = 0;; j++) {
if (r[j + 1] == 0) {
cd = ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 805,839 | 805,840 | u164385976 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
long long a, b, c, d;
long long f(int x) { return x - (x / c) - (x / d) + x / ... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
long long a, b, c, d;
long long f(long long x) { return x - (x / c) - (x / d) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 805,847 | 805,848 | u703214333 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d;
long long f(int x) { return x - x / c - x / d + x / ((c * d) / __gcd(c, d)); }
int main() {
cin >> a >> b >> c >> d;
long long ans = f(b) - f(a - 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long a, b, c, d;
long long f(long long x) {
return x - x / c - x / d + x / ((c * d) / __gcd(c, d));
}
int main() {
cin >> a >> b >> c >> d;
long long ans = f(b) - f(a - 1);
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 805,849 | 805,850 | u703214333 | cpp |
p02995 | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#define REP_1(i, n) for (int i = 1; i < n + 1; i++)
#define bitSearch(bit,... | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#define REP_1(i, n) for (int i = 1; i < n + 1; i++)
#define bitSearch(bit,... | [] | 805,851 | 805,852 | u741556152 | cpp |
p02995 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#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 F... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#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 F... | [
"variable_declaration.type.change"
] | 805,892 | 805,893 | u343110708 | cpp |
p02995 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
#ifndef GCD
#define GCD
// solve ax+by=gcd(a, b)
// return gcd(a, b)
template <typename T>
T gcd(const T a, const T b, ... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
#ifndef GCD
#define GCD
// solve ax+by=gcd(a, b)
// return gcd(a, b)
template <typename T>
T gcd(const T a, const T b, ... | [
"variable_declaration.type.change"
] | 805,900 | 805,901 | u660834360 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.