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 |
|---|---|---|---|---|---|---|---|
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <= R; j++) {
long long ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change",
"assignment.change"
] | 789,234 | 789,229 | u455366471 | cpp |
p02983 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
std::cin >> l >> r;
if (4038 < r - l) {
/**
* r - l の幅が2019以上あるということは、その中に2019の倍数があるということ
* つまり、i または j を
* 0にでき、それは答えがゼロになるということが断定できる
*/
std::cout << 0 << '\n';
return 0;
}
ll ans = 2018... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
std::cin >> l >> r;
if (4038 < r - l) {
/**
* r - l の幅が2019以上あるということは、その中に2019の倍数があるということ
* つまり、i または j を
* 0にでき、それは答えがゼロになるということが断定できる
*/
std::cout << 0 << '\n';
return 0;
}
ll ans = 2018... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 789,248 | 789,249 | u507749492 | cpp |
p02983 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
std::cin >> l >> r;
if (4038 <= r - l) {
/**
* r - l の幅が2019以上あるということは、その中に2019の倍数があるということ
* つまり、i または j を
* 0にでき、それは答えがゼロになるということが断定できる
*/
std::cout << 0 << '\n';
return 0;
}
ll ans = 201... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
std::cin >> l >> r;
if (4038 < r - l) {
/**
* r - l の幅が2019以上あるということは、その中に2019の倍数があるということ
* つまり、i または j を
* 0にでき、それは答えがゼロになるということが断定できる
*/
std::cout << 0 << '\n';
return 0;
}
ll ans = 2018... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 789,250 | 789,249 | u507749492 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), ... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), ... | [
"call.arguments.change",
"call.arguments.add"
] | 789,253 | 789,254 | u771541325 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2019;
if (r - l + 1 >= 2019)
cout << 0 << endl;
else {
for (ll i = l; i <= r; i++) {
for (ll j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2019;
if (r - l + 1 >= 2019)
cout << 0 << endl;
else {
for (ll i = l; i <= r; i++) {
for (ll j... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 789,290 | 789,291 | u258994590 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MAX = 5100000;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MAX = 5100000;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMin... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 789,306 | 789,307 | u598710706 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
if (r - l < 2018 && l % 2019 < r % 2019) {
int min = 2019;
for (int i = l % 2019; i < r % 2019; i++) {
for (int j = i + 1; j <= r % 2019; j++) {
if (min > i * j)
min = i * j;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
if (r - l < 2018 && l % 2019 < r % 2019) {
int min = 2019;
for (int i = l % 2019; i < r % 2019; i++) {
for (int j = i + 1; j <= r % 2019; j++) {
if (min > i * j % 2019)
min = i * j % 201... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 789,312 | 789,313 | u180716041 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t L, R;
cin >> L >> R;
int64_t min = 1000000000;
for (int64_t i = L; i < R; i++) {
for (int64_t j = i; j < R + 1; j++) {
if ((i * j) % 2019 < min) {
min = (i * j) % 2019;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t L, R;
cin >> L >> R;
int64_t min = 1000000000;
for (int64_t i = L; i < R; i++) {
for (int64_t j = i + 1; j < R + 1; j++) {
if ((i * j) % 2019 < min) {
min = (i * j) % 2019;... | [
"control_flow.loop.for.initializer.change"
] | 789,350 | 789,351 | u967294601 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t L, R;
cin >> L >> R;
int min = 1000000000;
for (int64_t i = L; i < R; i++) {
for (int64_t j = i; j < R + 1; j++) {
if ((i * j) % 2019 < min) {
min = (i * j) % 2019;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t L, R;
cin >> L >> R;
int64_t min = 1000000000;
for (int64_t i = L; i < R; i++) {
for (int64_t j = i + 1; j < R + 1; j++) {
if ((i * j) % 2019 < min) {
min = (i * j) % 2019;... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 789,352 | 789,351 | u967294601 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int64_t minll(int64_t a, int64_t b) {
if (a > b)
return b;
else
return a;
}
int main() {
int64_t l, r;
cin >> l >> r;
if (r / 2019 - l / 2019 > 0 || l % 2019 == 0)
cout << 0 << endl;
else {
l %= 2019;
r %= 2019;
int64_t ans = 2019;
fo... | #include <bits/stdc++.h>
using namespace std;
int64_t minll(int64_t a, int64_t b) {
if (a > b)
return b;
else
return a;
}
int main() {
int64_t l, r;
cin >> l >> r;
if (r / 2019 - l / 2019 > 0 || l % 2019 == 0)
cout << 0 << endl;
else {
l %= 2019;
r %= 2019;
int64_t ans = 2019;
fo... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,367 | 789,368 | u366974105 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int64_t minll(int64_t a, int64_t b) {
if (a > b)
return b;
else
return a;
}
int main() {
int64_t l, r;
cin >> l >> r;
if (r / 2019 - l / 2019 > 0 || l % 2019 == 0)
cout << 0 << endl;
else {
l %= 2019;
r %= 2019;
int64_t ans = 2018;
fo... | #include <bits/stdc++.h>
using namespace std;
int64_t minll(int64_t a, int64_t b) {
if (a > b)
return b;
else
return a;
}
int main() {
int64_t l, r;
cin >> l >> r;
if (r / 2019 - l / 2019 > 0 || l % 2019 == 0)
cout << 0 << endl;
else {
l %= 2019;
r %= 2019;
int64_t ans = 2019;
fo... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,369 | 789,368 | u366974105 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
long long L, R;
long long res = INF;
cin >> L >> R;
long long divL, divR;
divL = L / 2019;
divR = R / 2019;
if (divL == divR) {
for (int i = 0; i < R - L; i++) /... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
long long L, R;
long long res = INF;
cin >> L >> R;
long long divL, divR;
divL = L / 2019;
divR = R / 2019;
if (divL == divR) {
for (int i = 0; i < R - L; i++) /... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 789,375 | 789,376 | u411427373 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 2019;
int main() {
int L;
cin >> L;
int R;
cin >> R;
int l = L % MOD;
int r = R % MOD;
int ans = 2019;
if (L / MOD < R / MOD)
cout << 0 << endl;
else {
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 2019;
int main() {
int L;
cin >> L;
int R;
cin >> R;
int l = L % MOD;
int r = R % MOD;
int ans = 2019;
if (L / MOD < R / MOD)
cout << 0 << endl;
else {
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 789,377 | 789,378 | u136342563 | cpp |
p02983 | #include <bits/stdc++.h>
#define INF 2e9
using namespace std;
typedef long long llong;
typedef long double ldouble;
int main() {
cout << fixed << setprecision(10);
llong L, R;
int num = 2018;
cin >> L >> R;
int modL, modR;
modL = L % 2019;
modR = R % 2019;
if (modL < modR && L + 2019 > R) {
for (int... | #include <bits/stdc++.h>
#define INF 2e9
using namespace std;
typedef long long llong;
typedef long double ldouble;
int main() {
cout << fixed << setprecision(10);
llong L, R;
int num = 2018;
cin >> L >> R;
int modL, modR;
modL = L % 2019;
modR = R % 2019;
if (modL < modR && L + 2019 > R) {
for (int... | [
"control_flow.loop.for.initializer.change"
] | 789,379 | 789,380 | u108484707 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int ans = 2019;
for (int i = l; i < r && i < l + 2019; i++) {
for (int j = i + 1; j <= r && j < l + 2019; j++) {
if (ans < (i * j) % 2019) {
ans = (i * j) % 2019;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int l, r;
cin >> l >> r;
long int ans = 2019;
for (long int i = l; i < r && i < l + 2019; i++) {
for (long int j = i + 1; j <= r && j < l + 2019; j++) {
if (ans > (i * j) % 2019) {
ans = (i * j) % 2019;
}
}
}
cout... | [
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 789,383 | 789,382 | u332946309 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | [
"control_flow.loop.for.initializer.change"
] | 789,392 | 789,393 | u310790595 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
using ll = long long;
int main()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
using ll = long long;
int main()... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 789,398 | 789,399 | u469451657 | cpp |
p02983 | #include <bits/stdc++.h>
#define INF 1e18
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
usi... | #include <bits/stdc++.h>
#define INF 1e18
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
usi... | [
"literal.number.change",
"variable_declaration.value.change"
] | 789,404 | 789,405 | u929199273 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t l, r;
cin >> l >> r;
int64_t length = (r - l);
int64_t lmod = l % 2019;
int64_t rmod = r % 2019;
// cout << lmod << endl;
// cout << (l+1)%2019 << endl;
// cout << (l*(l+1))%2019 << endl;
// cout << l*(l+1)/2111111111 << endl;
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t l, r;
cin >> l >> r;
int64_t length = (r - l);
int64_t lmod = l % 2019;
int64_t rmod = r % 2019;
// cout << lmod << endl;
// cout << (l+1)%2019 << endl;
// cout << (l*(l+1))%2019 << endl;
// cout << l*(l+1)/2111111111 << endl;
if (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 789,410 | 789,411 | u091552241 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change"
] | 789,415 | 789,413 | u876386943 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
main() {
ll l, r, ans = 3000, i, j;
cin >> l >> r;
if ((r - l) >= 2019) {
ans = 0;
} else {
for (i = l; i <= r; i++) {
for (j = l; j <= r; j++) {
if ((i * j) % 2019 <= ans)
ans = (i * j) % 2019;
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
main() {
ll l, r, ans = 3000, i, j;
cin >> l >> r;
if ((r - l) >= 2019) {
ans = 0;
} else {
for (i = l; i <= r; i++) {
for (j = i + 1; j <= r; j++) {
if ((i * j) % 2019 <= ans)
ans = (i * j) % 2019;
}
... | [
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 789,416 | 789,417 | u703537155 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
ll lc, rc;
lc = L / 2019;
rc = L / 2019;
int res = 2019;
if (rc - lc >= 1) {
cout << 0 << endl;
return 0;
} else {
ll ld = L % 2019;
ll rd = R % 2019;
for (int i = ld; i < rd; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
ll lc, rc;
lc = L / 2019;
rc = R / 2019;
// printf("lc %lld rc %lld\n",lc, rc);
int res = 2019;
if (rc - lc >= 1) {
cout << 0 << endl;
return 0;
} else {
ll ld = L % 2019;
ll rd ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 789,420 | 789,421 | u526476325 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
r = (r, l + 4038);
int ans = 2018;
for (long long i = l; i <= r - 1; i++) {
for (long long j = i + 1; j <= r; j++) {
int mod = i * j % 2019;
ans = min(ans, mod);
}
}
cout << ans << endl;
return 0;... | #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (long long i = l; i <= r - 1; i++) {
for (long long j = i + 1; j <= r; j++) {
int mod = i * j % 2019;
ans = min(ans, mod);
}
}
cout << ans << endl;
return... | [
"call.add"
] | 789,433 | 789,434 | u898758114 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
r = (r, r + 4038);
int ans = 2018;
for (long long i = l; i < r - 1; i++) {
for (long long j = i + 1; j < r; j++) {
int mod = i * j % 2019;
ans = min(ans, mod);
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (long long i = l; i <= r - 1; i++) {
for (long long j = i + 1; j <= r; j++) {
int mod = i * j % 2019;
ans = min(ans, mod);
}
}
cout << ans << endl;
return... | [
"call.add",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 789,435 | 789,434 | u898758114 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e5)
#define PI (acos(-1))
#define print(x) cout << x << endl
ll gcd(ll a, ll b) { return b ? ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e5)
#define PI (acos(-1))
#define print(x) cout << x << endl
ll gcd(ll a, ll b) { return b ? ... | [
"assignment.change"
] | 789,470 | 789,471 | u802905102 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gc... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gc... | [] | 789,496 | 789,497 | u822169805 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gc... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gc... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 789,498 | 789,497 | u822169805 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<ll> Vec;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
const int MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<ll> Vec;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
const int MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v)... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 789,499 | 789,500 | u592686932 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, l2, r2, k, s, t = 2019;
cin >> l >> r;
k = r - l;
l2 = l % 2019, r2 = r % 2019;
if (k > 2017)
cout << 0 << endl;
else if (l2 == 0)
cout << 0 << endl;
else if (r2 < l2)
cout << 0 << endl;
else
for (int i = 0; i < k; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, l2, r2, k, s, t = 2019;
cin >> l >> r;
k = r - l;
l2 = l % 2019, r2 = r % 2019;
if (k > 2017)
cout << 0 << endl;
else if (l2 == 0)
cout << 0 << endl;
else if (r2 < l2)
cout << 0 << endl;
else if (1) {
for (int i = 0; ... | [
"control_flow.branch.if.add"
] | 789,544 | 789,545 | u397130503 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int imax;
if (R - L > 2019) {
imax = 2019;
} else {
imax = R;
}
int ans = 2019;
for (long long i = L; i < imax; i++) {
for (long long j = i + 1; j <= imax; j++) {
if ((i * j) % 2019 < ans) {
ans =... | #include <iostream>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int imax;
if (R - L > 2019) {
imax = 2019 + L;
} else {
imax = R;
}
int ans = 2019;
for (long long i = L; i < imax; i++) {
for (long long j = i + 1; j <= imax; j++) {
if ((i * j) % 2019 < ans) {
a... | [
"assignment.change"
] | 789,551 | 789,552 | u299529534 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
int main() {
int L, R;
cin >> L >> R;
if (L / 2019 != R / 2019)
cout << 0 << endl;
else {
int ans = 2019 * 2019;
L %= 2019;
R %= 2019;
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019... | #include "bits/stdc++.h"
using namespace std;
int main() {
int L, R;
cin >> L >> R;
if (L / 2019 != R / 2019)
cout << 0 << endl;
else {
int ans = 2019 * 2019;
L %= 2019;
R %= 2019;
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,564 | 789,565 | u365956698 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
if (R - L > 2019)
cout << 0 << endl;
else {
long long ans = 2018;
for (long long i = L; i < R; ++i)
for (long long j = i + 1; j < R; ++j)
ans = min(ans, (i * j) % 2019);
cout << ans << endl;
}
... | #include <iostream>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
if (R - L > 2019)
cout << 0 << endl;
else {
long long ans = 2018;
for (long long i = L; i < R; ++i)
for (long long j = i + 1; j <= R; ++j)
ans = min(ans, (i * j) % 2019);
cout << ans << endl;
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 789,566 | 789,567 | u506858457 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
if (R - L > 2019)
cout << 0 << endl;
else {
long long ans = 2018;
for (long long i = L; i < R; ++i)
for (long long j = i + 1; j < R; ++j)
ans = min(ans, (i * j) % 2019);
cout << ans << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
if (R - L > 2019)
cout << 0 << endl;
else {
long long ans = 2018;
for (long long i = L; i < R; ++i)
for (long long j = i + 1; j <= R; ++j)
ans = min(ans, (i * j) % 2019);
cout << ans << endl;
}... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 789,568 | 789,567 | u506858457 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t L, R;
cin >> L >> R;
int64_t a = L % 2019;
int64_t b = R % 2019;
set<int64_t> sss;
if ((R - L) >= 2018) {
cout << 0 << endl;
}
if (((R - L) < 2018) && (a >= b)) {
cout << 0 << endl;
}
if (((R - L) < 2018) && (a < b)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t L, R;
cin >> L >> R;
int64_t a = L % 2019;
int64_t b = R % 2019;
set<int64_t> sss;
if ((R - L) >= 2018) {
cout << 0 << endl;
}
if (((R - L) < 2018) && (a >= b)) {
cout << 0 << endl;
}
if (((R - L) < 2018) && (a < b)) {... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 789,579 | 789,580 | u408053928 | cpp |
p02983 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long L, R, ans = 2019;
cin >> L >> R;
for (long long i = L; i <= R; i++) {
for (long long j = i; j <= R; j++) {
if (i != j)
ans = min(ans, (i * j) % 2019);
if (ans == 0) {
cou... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long L, R, ans = 2019;
cin >> L >> R;
for (long long i = L; i <= R; i++) {
for (long long j = i; j <= R; j++) {
if (i != j)
ans = min(ans, (i * j) % 2019);
if (ans == 0) {
cou... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 789,590 | 789,591 | u835561357 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 789,592 | 789,593 | u938389536 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int l, r;
cin >> l >> r;
int mod = 2019, ans = (1 << 30);
for (int i = l; i <= min(r, l + 2 * mod); i++) {
for (int j = l + 1; j <= min(r, l + 2 * mod); j++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int l, r;
cin >> l >> r;
int mod = 2019, ans = (1 << 30);
for (int i = l; i <= min(r, l + 2 * mod); i++) {
for (int j = i + 1; j <= min(r, l + 2 * mod); j++) {... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,594 | 789,595 | u804448625 | cpp |
p02983 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int L, R;
cin >> L >> R;
const int mod = 2019;
R = min(L + 2 * mod, R);
int ans = 1e18;
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++) {
ans = min(ans, i * j % mod);
}
}
cout << ans << e... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int L, R;
cin >> L >> R;
const int mod = 2019;
R = min(L + mod, R);
int ans = 1e18;
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
ans = min(ans, i * j % mod);
}
}
cout << ans << endl;... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,607 | 789,608 | u234435881 | cpp |
p02983 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int L, R;
cin >> L >> R;
const int mod = 2019;
R = min(L + mod, R);
int ans = 1e18;
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++) {
ans = min(ans, i * j % mod);
}
}
cout << ans << endl;... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int L, R;
cin >> L >> R;
const int mod = 2019;
R = min(L + mod, R);
int ans = 1e18;
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
ans = min(ans, i * j % mod);
}
}
cout << ans << endl;... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,609 | 789,608 | u234435881 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
signed main() {
int l, r;
cin >> l >> r;
if ((l - 1) / 2019 != r / 2019) {
cout << 0;
return 0;
}
int ans = 2018;
l %= 2019;
r %= 2019;
for (int i = l; i <= r; i++)
for (int j = i + 1; i <= r... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
signed main() {
int l, r;
cin >> l >> r;
if ((l - 1) / 2019 != r / 2019) {
cout << 0;
return 0;
}
int ans = 2018;
l %= 2019;
r %= 2019;
for (int i = l; i <= r; i++)
for (int j = i + 1; j <= r... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 789,628 | 789,627 | u502092128 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MAX 100000
typedef long long ll;
typedef pair<ll, int> P;
int main() {
ll L, R, ans = 20108;
cin >> L >> R;
if (L - R >= 2018) {... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MAX 100000
typedef long long ll;
typedef pair<ll, int> P;
int main() {
ll L, R, ans = 20108;
cin >> L >> R;
if (R - L >= 2018) {... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 789,629 | 789,630 | u591914971 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MAX 100000
typedef long long ll;
typedef pair<ll, int> P;
int main() {
ll L, R, ans = 20108;
cin >> L >> R;
if (L - R >= 2018) {... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MAX 100000
typedef long long ll;
typedef pair<ll, int> P;
int main() {
ll L, R, ans = 20108;
cin >> L >> R;
if (R - L >= 2018) {... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 789,632 | 789,630 | u591914971 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MAX 100000
typedef long long ll;
typedef pair<ll, int> P;
int main() {
ll L, R, ans = 2018;
cin >> L >> R;
if (L - R >= 2018) {
... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MAX 100000
typedef long long ll;
typedef pair<ll, int> P;
int main() {
ll L, R, ans = 20108;
cin >> L >> R;
if (R - L >= 2018) {... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 789,633 | 789,630 | u591914971 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll l, r, ans = 2019;
int main() {
cin >> l >> r;
for (ll i = l; i <= (r, l + 2018); i++) {
for (ll j = i + 1; j <= (r, i + 2019); j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll l, r, ans = 2019;
int main() {
cin >> l >> r;
for (ll i = l; i <= min(r, l + 2018); i++) {
for (ll j = i + 1; j <= min(r, i + 2019); j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| [
"call.add"
] | 789,636 | 789,637 | u200394944 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll l, r, ans = 2020;
int main() {
cin >> l >> r;
for (ll i = l; i <= (r, l + 2018); i++) {
for (ll j = i + 1; j <= (r, i + 2019); j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll l, r, ans = 2019;
int main() {
cin >> l >> r;
for (ll i = l; i <= min(r, l + 2018); i++) {
for (ll j = i + 1; j <= min(r, i + 2019); j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"call.add"
] | 789,638 | 789,637 | u200394944 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
vector<int> solve;
for (int i = l; i <= min(l + 4037, r); i++) {
solve.push_back(i % 2019);
}
int ans = 1'000'000'000;
for (int i = 0; i < solve.size(); i++) {
for (int j = i + 1; j < solve.size(); j++)
ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
vector<int> solve;
for (int i = l; i <= min(l + 4037, r); i++) {
solve.push_back(i % 2019);
}
int ans = 1'000'000'000;
for (int i = 0; i < solve.size(); i++) {
for (int j = i + 1; j < solve.size(); j++)
ans ... | [
"assignment.change"
] | 789,641 | 789,642 | u013408661 | cpp |
p02983 | #include <iostream>
int main() {
long l, r;
std::cin >> l >> r;
long min = 2019L;
if (r - l + 1 >= 2019L) {
std::cout << 0 << std::endl;
return 0;
}
long size = r - l + 1;
long *rem = new long[size];
for (long i = 0; i < size; i++)
rem[i] = (l + i) % 2019L;
for (long i = 0; i <= size - ... | #include <iostream>
int main() {
long l, r;
std::cin >> l >> r;
long min = 2019L;
if (r - l + 1 >= 2019L) {
std::cout << 0 << std::endl;
return 0;
}
long size = r - l + 1;
long *rem = new long[size];
for (long i = 0; i < size; i++)
rem[i] = (l + i) % 2019L;
for (long i = 0; i < size - 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 789,651 | 789,652 | u948212340 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1e9 + 7;
const long long INF = 1LL << 60;
const int INF_INT = 1e9;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (ll i = 0; i <= r; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1e9 + 7;
const long long INF = 1LL << 60;
const int INF_INT = 1e9;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (ll i = l; i <= r; i++) ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 789,655 | 789,656 | u747087681 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
scanf("%d%d", &L, &R);
long long MOD = 2019;
long long ans = MOD;
for (long long i = L; i < R && ans > 0; i++) {
for (long long j = i + 1; j <= R && ans > 0; j++) {
ans = min((i * j) % MOD, ans);
}
}
printf("%lld"... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
scanf("%lld%lld", &L, &R);
long long MOD = 2019;
long long ans = MOD;
for (long long i = L; i < R && ans > 0; i++) {
for (long long j = i + 1; j <= R && ans > 0; j++) {
ans = min((i * j) % MOD, ans);
}
}
printf("%... | [
"literal.string.change",
"call.arguments.change"
] | 789,662 | 789,663 | u553129408 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
ll smaller = min(r, l + 2019);
for (ll i = l; i < l + smaller; i++) {
for (ll j = i + 1; j <= l + smaller; j++) {
ans = min(ans, (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
ll smaller = min(r, l + 2019);
for (ll i = l; i < smaller; i++) {
for (ll j = i + 1; j <= smaller; j++) {
ans = min(ans, (i * j) %... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 789,666 | 789,667 | u447604786 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
ll smaller = min(r - l, (ll)2019);
for (ll i = l; i < l + smaller - 1; i++) {
for (ll j = i + 1; j <= l + smaller; j++) {
ans = mi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
ll smaller = min(r - l, (ll)2019);
for (ll i = l; i <= l + smaller - 1; i++) {
for (ll j = i + 1; j <= l + smaller; j++) {
ans = m... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 789,670 | 789,671 | u895393304 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << "0";
} else {
long long int min;
long long int ans = 2019;
for (long long int i = l; i <= r; i++) {
min = 2019;
for (long long int j = l + 1; j <= r; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << "0";
} else {
int min;
int ans = 2019;
for (long long int i = l; i <= r; i++) {
min = 2019;
for (long long int j = i + 1; j <= r; j++) {
if ((i * j) % 20... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,680 | 789,681 | u094746828 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << "0";
} else {
int min;
int ans = 2019;
for (long long int i = l; i <= r; i++) {
int min = 2019;
for (long long int j = l + 1; j <= r; j++) {
if ((i * j) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << "0";
} else {
int min;
int ans = 2019;
for (long long int i = l; i <= r; i++) {
min = 2019;
for (long long int j = i + 1; j <= r; j++) {
if ((i * j) % 20... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,682 | 789,681 | u094746828 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | [
"assignment.change"
] | 789,687 | 789,688 | u334351654 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long int l, r, d;
cin >> l >> r;
if (r - l > 2019)
d = 0;
else {
d = (l * (l + 1)) % 2019;
for (int i = l; i < r; i++) {
for (int m = i + 1; m < r; m++) {
if (((i % 2019) * (m % 2019)) % 2019 < d)
d = ((i % 2019) * ... | #include <iostream>
using namespace std;
int main() {
long long int l, r, d;
cin >> l >> r;
if (r - l > 2019)
d = 0;
else {
d = (l * (l + 1)) % 2019;
for (int i = l; i <= r; i++) {
for (int m = i + 1; m <= r; m++) {
if (((i % 2019) * (m % 2019)) % 2019 < d)
d = ((i % 2019) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 789,691 | 789,692 | u320407617 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j < r; j++) {
int x = i * j % 2019;
ans = min(an... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 789,697 | 789,698 | u934402094 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int m = 2019;
int mi = 2019;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
int ans = (i % m) * (j % m);
mi = min(mi, ans);
if (mi == 0)
break;
}
if (mi == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int m = 2019;
int mi = 2019;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
int ans = ((i % m) * j) % m;
mi = min(mi, ans);
if (mi == 0)
break;
}
if (mi == ... | [] | 789,704 | 789,705 | u625741705 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int m = 2019;
int mi = 2020;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
int ans = (i % m) * (j % m);
mi = min(mi, ans);
if (mi == 0)
break;
}
if (mi == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int m = 2019;
int mi = 2019;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
int ans = ((i % m) * j) % m;
mi = min(mi, ans);
if (mi == 0)
break;
}
if (mi == ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 789,706 | 789,705 | u625741705 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
if (L % 2019 == 0 || R % 2019 == 0 || L / 2019 < R / 2019) {
cout << endl;
} else {
L %= 2019;
R %= 2019;
int Min = 2018;
for (int i = L; i < R + 1; i++) {
for (int j = i + 1; j < R + 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
if (L % 2019 == 0 || R % 2019 == 0 || L / 2019 < R / 2019) {
cout << 0 << endl;
} else {
L %= 2019;
R %= 2019;
int Min = 2018;
for (int i = L; i < R + 1; i++) {
for (int j = i + 1; j < R + 1; j++... | [
"io.output.change"
] | 789,712 | 789,713 | u196629968 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long L, R;
long long remain = 2019 - 1;
//入力
cin >> L >> R;
if (R - L > 3000)
cout << 0 << endl;
else {
for (long long j = L + 1; j <= R; j++) {
for (long long i = L; i < j; i++) {
if (i * j % 2019 < remain) {
rem... | #include <iostream>
using namespace std;
int main() {
long long L, R;
long long remain = 2019 - 1;
//入力
cin >> L >> R;
if (R - L > 3000)
cout << 0 << endl;
else {
for (long long j = L + 1; j <= R; j++) {
for (long long i = L; i < j; i++) {
if (i * j % 2019 < remain) {
rem... | [] | 789,732 | 789,733 | u212083331 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
ll a, b;
cin >> a >> b;
ll min_mod = INF;
if (a >= b) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
ll a, b;
cin >> a >> b;
ll min_mod = INF;
if (a >= b) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 789,752 | 789,753 | u732817215 | cpp |
p02983 | // ABC133C
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
int ans = 2019;
for (int i = l;... | // ABC133C
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
int ans = 2019;
for (int i = l;... | [
"call.arguments.change",
"call.arguments.add"
] | 789,754 | 789,755 | u733391043 | cpp |
p02983 | // ABC133C
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
int ans = 0;
for (int i = l; i ... | // ABC133C
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
int ans = 2019;
for (int i = l;... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change",
"call.arguments.add"
] | 789,756 | 789,755 | u733391043 | cpp |
p02983 | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <vector>
//#include <functional>
//#include <cmath>
int main() {
int64_t L, R;
std::cin >> L >> R;
// i*j mod 2019 = (i mod 2019 * j mod 2019) mod 2019
// if R >= ((L / 2019) + 1 ) * 2019 -> min(i*j mod 2019) = 0
// else min(i*j mod 2019)... | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <vector>
//#include <functional>
//#include <cmath>
int main() {
int64_t L, R;
std::cin >> L >> R;
// i*j mod 2019 = (i mod 2019 * j mod 2019) mod 2019
// if R >= ((L / 2019) + 1 ) * 2019 -> min(i*j mod 2019) = 0
// else min(i*j mod 2019)... | [
"control_flow.loop.for.initializer.change"
] | 789,757 | 789,758 | u775900747 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y) {
return (x + y - 1) / y;
}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1)... | #include "bits/stdc++.h"
using namespace std;
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y) {
return (x + y - 1) / y;
}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1)... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 789,767 | 789,768 | u473116917 | cpp |
p02983 | #include <algorithm>
#include <iostream>
int main() {
long long L, R;
std::cin >> L >> R;
long long ans = L * (L + 1) % 2019;
for (long long i = L + 1; i < std::min(R, L + 2020); i++) {
for (long long j = i + 1; j < std::min(R + 1, i + 2020); j++) {
ans = std::min(ans, i * j % 2019);
}
}
std... | #include <algorithm>
#include <iostream>
int main() {
long long L, R;
std::cin >> L >> R;
long long ans = L * (L + 1) % 2019;
for (long long i = L; i < std::min(R, L + 2019); i++) {
for (long long j = i + 1; j < std::min(R + 1, i + 2020); j++) {
ans = std::min(ans, i * j % 2019);
}
}
std::co... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 789,773 | 789,774 | u150861392 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
ll L, R, ans;
cin >> L >> R;
if (L % 2019 >= R % ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
ll L, R, ans = 2019;
cin >> L >> R;
if (L % 2019 ... | [
"variable_declaration.value.change",
"literal.number.change",
"assignment.value.change"
] | 789,775 | 789,776 | u841131859 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2019;
if (R - L > 2100) {
cout << 0 << endl;
}
else {
for (ll i = L; i < R; i++) {
for (ll j = L + 1; j <= R; j++) {
ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2019;
if (R - L > 2100) {
cout << 0 << endl;
}
else {
for (ll i = L; i < R; i++) {
for (ll j = L + 1; j <= R; j++) {
ans... | [] | 789,781 | 789,782 | u454081619 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
int ans = 2019;
if (R - L > 2100) {
cout << 0 << endl;
}
for (int i = L; i < R; i++) {
for (int j = L + 1; j <= R; j++) {
ans = min(ans, (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2019;
if (R - L > 2100) {
cout << 0 << endl;
}
else {
for (ll i = L; i < R; i++) {
for (ll j = L + 1; j <= R; j++) {
ans... | [
"variable_declaration.type.change",
"control_flow.branch.else.add",
"control_flow.loop.for.initializer.change"
] | 789,783 | 789,782 | u454081619 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) ((int)(x).size)
const lo... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) ((int)(x).size)
const lo... | [] | 789,784 | 789,785 | u718774863 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef map<int, int> M;
typedef vector<int> V;
typedef queue<int> Q;
typedef pair<long, long> PLL;
typedef map<long, long> MLL;
typedef vector<long long> VLL;
typedef vector<pair<int, int>> VP;
typedef vector<vector<int>> VV... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef map<int, int> M;
typedef vector<int> V;
typedef queue<int> Q;
typedef pair<long, long> PLL;
typedef map<long, long> MLL;
typedef vector<long long> VLL;
typedef vector<pair<int, int>> VP;
typedef vector<vector<int>> VV... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 789,793 | 789,794 | u745562814 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 2019);
ll ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll j = L + 1; j <= R; j++) {
ll amari = (i * j) % 2019;
ans = min(amari, ans);
... | #include <algorithm>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 2019 * 2);
int ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
int amari = (i * j) % 2019;
ans = min(amari, ans... | [
"assignment.change",
"variable_declaration.type.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,797 | 789,798 | u355371431 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 2019 * 2);
ll ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll j = L + 1; j <= R; j++) {
ll amari = (i * j) % 2019;
ans = min(amari, ans);... | #include <algorithm>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 2019 * 2);
int ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
int amari = (i * j) % 2019;
ans = min(amari, ans... | [
"variable_declaration.type.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,799 | 789,798 | u355371431 | cpp |
p02983 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
cin >> l >> r;
int ans = 2018;
if (r - l >= 2019)
r = 2019 + l - 1;
for (int i = l; i <= r; i++) {
for (int j = j + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(x, ans);
}
}
cout << ans;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
if (r - l >= 2019)
r = 2019 + l - 1;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll x = i * j % 2019;
ans = min(x, ans);
}
}
cout << ans;
} | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"identifier.change",
"expression.operation.binary.change"
] | 789,808 | 789,809 | u764860452 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r, q1, q2, mi, pq;
cin >> l >> r;
mi = 2018;
for (ll i = l; i < r; i++) {
for (ll k = i + 1; k <= r; k++) {
q1 = i % 2019;
q2 = i % 2019;
pq = (q1 * q2)... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r, q1, q2, mi, pq;
cin >> l >> r;
mi = 2018;
for (ll i = l; i < r; i++) {
for (ll k = i + 1; k <= r; k++) {
q1 = i % 2019;
q2 = k % 2019;
pq = (q1 * q2)... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 789,812 | 789,813 | u862412671 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
long long res = 2019;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <= R; j++) {
res = min(res, (i * j) % 2019);
}
}
cout <... | #include <iostream>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
long long res = 2019;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
res = min(res, (i * j) % 2019);
}
}
cout ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,814 | 789,815 | u188117876 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
int res = 2019;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <= R; j++) {
res = min(res, (int)((i * j) % 2019));
}
}
cout ... | #include <iostream>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
int res = 2019;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
res = min(res, (int)((i * j) % 2019));
}
}
cout ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,816 | 789,817 | u188117876 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else {
int ans = 2019;
for (int i = l; i <= r; i++)
for (int j = l + 1; j <= r; j++)
ans = min(ans, (int)((long ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else {
int ans = 2019;
for (int i = l; i <= r; i++)
for (int j = i + 1; j <= r; j++)
ans = min(ans, (int)((long ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,819 | 789,820 | u781095600 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC133C() {
int L, R;
cin >> L >> R;
int dx = R - L;
if (dx >= 2019) {
cout << 0 << endl;
}
int minX = 2018;
for (int i = L; i < R; ++i) {
int ii = i % 2019;
for (int j = i + 1; j <= R; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC133C() {
int L, R;
cin >> L >> R;
int dx = R - L;
if (dx >= 2019) {
cout << 0 << endl;
return;
}
int minX = 2018;
for (int i = L; i < R; ++i) {
int ii = i % 2019;
for (int j = i +... | [
"control_flow.return.add"
] | 789,830 | 789,831 | u227117171 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (long long i = 1; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 789,855 | 789,856 | u980485808 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
const int MAX_N = 200000;
long long l, r;
cin >> l;
cin >> r;
long long answer = 2019;
for (long long i = l; i < r; i++) {
for (long long j = l + 1; j < r; j++) {
answer = min(a... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
const int MAX_N = 200000;
long long l, r;
cin >> l;
cin >> r;
long long answer = 2019;
for (long long i = l; i < r; i++) {
for (long long j = l + 1; j < r + 1; j++) {
answer = m... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 789,857 | 789,858 | u640834132 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int l, r;
cin >> l >> r;
Int min = pow(10, 18);
for (Int ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int l, r;
cin >> l >> r;
Int min = pow(10, 18);
for (Int ... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 789,859 | 789,860 | u026620445 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int l, r;
cin >> l >> r;
Int min = pow(10, 18);
for (Int ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int l, r;
cin >> l >> r;
Int min = pow(10, 18);
for (Int ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.add",
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 789,861 | 789,860 | u026620445 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
int main(void) {
int l, r;
cin >> l >> r;
if (r - l > 2030) {
cout << 0... | #include <bits/stdc++.h>
using namespace std;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
int main(void) {
long l, r;
cin >> l >> r;
if (r - l > 2030) {
cout << ... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change",
"identifier.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 789,882 | 789,881 | u720447689 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll inf = 1e9 + ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll inf = 1e9 + ... | [
"assignment.change"
] | 789,904 | 789,905 | u620242073 | cpp |
p02983 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,914 | 789,915 | u266346465 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L;
long long R;
cin >> L >> R;
long long l = L;
long long m = 2018;
if (4000 <= R - L) {
cout << "0" << endl;
return 0;
}
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j < R; j++) {
long long tmp = (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L;
long long R;
cin >> L >> R;
long long l = L;
long long m = 2018;
if (4000 <= R - L) {
cout << "0" << endl;
return 0;
}
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long tmp = (... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 789,916 | 789,917 | u259585438 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L;
long long R;
cin >> L >> R;
long long l = L;
long long m = 2018;
if (4000 <= R - L) {
cout << 0 << endl;
return 0;
}
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j < R; j++) {
long long tmp = (i *... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L;
long long R;
cin >> L >> R;
long long l = L;
long long m = 2018;
if (4000 <= R - L) {
cout << "0" << endl;
return 0;
}
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long tmp = (... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 789,918 | 789,917 | u259585438 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
int ans = 2018;
R = min(R, L + 4038);
for (long long i = L; i <= R; ++i) {
for (long long j = i + 2; j <= R; ++j) {
int mod = (i * j) % 2019;
ans = min(mod, ans);
}
}
cout << ans << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
int ans = 2018;
R = min(R, L + 4038);
for (long long i = L; i <= R; ++i) {
for (long long j = i + 1; j <= R; ++j) {
int mod = (i * j) % 2019;
ans = min(mod, ans);
}
}
cout << ans << endl;
ret... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 789,935 | 789,936 | u323327162 | cpp |
p02983 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int L, R;
int l, r;
int ans = 2019;
in... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int L, R;
int l, r;
int ans = 2019;
in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 789,939 | 789,940 | u551247219 | cpp |
p02983 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int L, R;
int l, r;
int ans = 2019;
in... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int L, R;
int l, r;
int ans = 2019;
in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 789,941 | 789,940 | u551247219 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define llint int
int amari(llint n) {
llint m = n;
while (1) {
m %= 2019;
if (m < 2019) {
break;
}
}
return m;
}
int main() {
llint L, R;
cin >> L >> R;
if (R - L > 2019) {
R = L + 2019;
}
llint min = 2020;
for (llint j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
#define llint int
int amari(llint n) {
llint m = n;
while (1) {
m %= 2019;
if (m < 2019) {
break;
}
}
return m;
}
int main() {
llint L, R;
cin >> L >> R;
if (R - L > 2019) {
R = L + 2019;
}
llint min = 2020;
for (llint j = 0; j ... | [
"control_flow.loop.for.condition.change"
] | 789,948 | 789,949 | u697931379 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
// long long ccw(const Point& A, const Point& B, const Point& C) {
// return 1LL * (B.x - A.x)*(C.y - A.y) - 1LL * (B.y - A.y)*(C.x - A.x);
//}
int m... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
// long long ccw(const Point& A, const Point& B, const Point& C) {
// return 1LL * (B.x - A.x)*(C.y - A.y) - 1LL * (B.y - A.y)*(C.x - A.x);
//}
int m... | [
"assignment.add"
] | 789,968 | 789,969 | u064087840 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1000000000
#define pow(x) pow(10, (x))
typedef long long int LL;
const int MOD = 1000000007;
// sort(all(x))とするとソートで... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1000000000
#define pow(x) pow(10, (x))
typedef long long int LL;
const int MOD = 1000000007;
// sort(all(x))とするとソートで... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 789,970 | 789,971 | u587857074 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 2019;
int min_search(int a, int b) {
int m = MOD;
for (int i = a; i <= b; i++) {
for (int j = a + 1; j <= b; j++) {
int tmp = (i * j) % MOD;
m = min(m, tmp);
}
}
return m;
}
int main() {
int L, R;
cin >> L >> R;
int ans;
... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 2019;
int min_search(int a, int b) {
int m = MOD;
for (int i = a; i <= b - 1; i++) {
for (int j = a + 1; j <= b; j++) {
int tmp = (i * j) % MOD;
m = min(m, tmp);
}
}
return m;
}
int main() {
int L, R;
cin >> L >> R;
int a... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 789,980 | 789,981 | u736788838 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
// const ll mod = 1000000007;
int l, r;
int ans;
signed main() {
cin >> l >> r;
ans = INF;
if (l - r >= 2018)
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
// const ll mod = 1000000007;
int l, r;
int ans;
signed main() {
cin >> l >> r;
ans = INF;
if (r - l >= 2019)
a... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 789,998 | 789,999 | u263858205 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
// const ll mod = 1000000007;
int l, r;
int ans;
signed main() {
cin >> l >> r;
ans = INF;
if (l - r >= 2019)
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define int ll
// const ll mod = 1000000007;
int l, r;
int ans;
signed main() {
cin >> l >> r;
ans = INF;
if (r - l >= 2019)
a... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 790,000 | 789,999 | u263858205 | cpp |
p02983 | #include <iostream>
using namespace std;
int l;
int r;
int main() {
cin >> l >> r;
int surp_l = l % 2019;
int d = r - l;
long long ans;
if ((d + surp_l) >= 2019) {
ans = 0;
} else {
for (int i = 0; i < d; i++) {
for (int j = (i + 1); j <= d; j++) {
int tmp = ((surp_l + i) * (surp_l + j... | #include <iostream>
using namespace std;
int l;
int r;
int main() {
cin >> l >> r;
int surp_l = l % 2019;
int d = r - l;
long long ans = 10000000;
if ((d + surp_l) >= 2019) {
ans = 0;
} else {
for (int i = 0; i < d; i++) {
for (int j = (i + 1); j <= d; j++) {
int tmp = ((surp_l + i) * ... | [
"variable_declaration.value.change"
] | 790,001 | 790,002 | u160754729 | cpp |
p02983 | #include <iostream>
int main() {
int L, R;
std::cin >> L >> R;
int min = 2018;
if (R - L + 1 >= 673)
min = 0;
else {
int r = L % 2019;
for (int i = 0; i < R - L; i++) {
for (int j = i + 1; j < R - L - i; j++) {
int buf = (r + i) * (r + j) % 2019;
if (buf < min)
mi... | #include <iostream>
int main() {
int L, R;
std::cin >> L >> R;
int min = 2018;
if (R - L + 1 >= 673)
min = 0;
else {
int r = L % 2019;
for (int i = 0; i < R - L; i++) {
for (int j = i + 1; j < R - L + 1; j++) {
int buf = (r + i) * (r + j) % 2019;
if (buf < min)
mi... | [
"control_flow.loop.for.condition.change"
] | 790,003 | 790,004 | u408372746 | cpp |
p02983 | #include <iostream>
int main() {
int L, R;
std::cin >> L >> R;
int min = 2018;
if (R - L + 1 >= 673)
min = 0;
else {
int r = L % 2019;
for (int i = 0; i < R - L; i++) {
for (int j = i + 1; j < R - L + 1 - i; j++) {
int buf = (r + i) * (r + j) % 2019;
if (buf < min)
... | #include <iostream>
int main() {
int L, R;
std::cin >> L >> R;
int min = 2018;
if (R - L + 1 >= 673)
min = 0;
else {
int r = L % 2019;
for (int i = 0; i < R - L; i++) {
for (int j = i + 1; j < R - L + 1; j++) {
int buf = (r + i) * (r + j) % 2019;
if (buf < min)
mi... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 790,005 | 790,004 | u408372746 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.