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>
using namespace std;
using pp = pair<int, int>;
using ll = long long;
int main() {
ll L, R, mod = 2019;
cin >> L >> R;
ll m = 10000;
if (R - L >= 2019) {
cout << 0 << endl;
} else {
L = L - L / mod * mod;
R = R - L / mod * mod;
for (ll i = L; i <= R; i++) {
for ... | #include <bits/stdc++.h>
using namespace std;
using pp = pair<int, int>;
using ll = long long;
int main() {
ll L, R, mod = 2019;
cin >> L >> R;
ll m = 10000;
if (R - L >= 2019) {
cout << 0 << endl;
} else {
R = R - L / mod * mod;
L = L - L / mod * mod;
for (ll i = L; i <= R; i++) {
for ... | [
"assignment.add"
] | 788,474 | 788,475 | u927463074 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int l, r;
cin >> l >> r;
int g = r - l;
l %= 2019;
r %= 2019;
int a... | #include <bits/stdc++.h>
using namespace std;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int l, r;
cin >> l >> r;
int g = r - l;
l %= 2019;
r %= 2019;
int a... | [
"assignment.change"
] | 788,480 | 788,481 | u785578220 | cpp |
p02983 | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;... | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;... | [
"assignment.value.change"
] | 788,485 | 788,486 | u807585808 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
const int MOD = 1000000007;
// void warshall_floyd(int n){
// for(int k=0;k<n;k... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
const int MOD = 1000000007;
// void warshall_floyd(int n){
// for(int k=0;k<n;k... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 788,494 | 788,493 | u010415482 | cpp |
p02983 | // https://atcoder.jp/contests/abc133/tasks/abc133_c
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#... | // https://atcoder.jp/contests/abc133/tasks/abc133_c
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,495 | 788,496 | u774438048 | cpp |
p02983 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int L, R, val;
cin >> L >> R;
if (R - L > 4050) {
cout << 1 << endl;
... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int L, R, val;
cin >> L >> R;
if (R - L > 2020) {
cout << 0 << endl;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change",
"control_flow.loop.for.initializer.change"
] | 788,501 | 788,500 | u067694854 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod = 1000000007;
const int MAX_N = 1000; // n の最大値
// nCk を取得
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod = 1000000007;
const int MAX_N = 1000; // n の最大値
// nCk を取得
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (d... | [
"control_flow.loop.for.initializer.change"
] | 788,506 | 788,507 | u722640678 | cpp |
p02983 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
ll c = 2019;
cin >> l >> r;
ll ans = 0;
if (l - r < c) {
l = l % c;
r = r % c;
if (l < r) {
ans = c;
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++)
ans = mi... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
ll c = 2019;
cin >> l >> r;
ll ans = 0;
if (r - l < c) {
l = l % c;
r = r % c;
if (l < r) {
ans = c;
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++)
ans = mi... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 788,516 | 788,517 | u012298376 | cpp |
p02983 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
ll c = 2019;
cin >> l >> r;
ll ans = 0;
if (l - r < c) {
l = l % c;
r = r % c;
if (l < r) {
ans = c;
for (int i = l; i < r - 1; i++) {
for (int j = i + 1; j < r; j++)
ans = min(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
ll c = 2019;
cin >> l >> r;
ll ans = 0;
if (r - l < c) {
l = l % c;
r = r % c;
if (l < r) {
ans = c;
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++)
ans = mi... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 788,518 | 788,517 | u012298376 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int l, r, MOD = 2019, min = 50000000000, i, j;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if (min > (i % MOD) * (j % MOD)) {
min = (i % MOD) * (j % MOD) % MOD;
}
if (min == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int l, r, MOD = 2019, min = 50000000000, i, j;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if (min > (i % MOD) * (j % MOD) % MOD) {
min = (i % MOD) * (j % MOD) % MOD;
}
if (min == 0) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 788,531 | 788,532 | u806320475 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int l, r, MOD = 2019, min = 50000000000, i, j;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if (min > (i % MOD) * (j % MOD)) {
min = (i % MOD) * (j % MOD);
}
if (min == 0) {
co... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int l, r, MOD = 2019, min = 50000000000, i, j;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if (min > (i % MOD) * (j % MOD) % MOD) {
min = (i % MOD) * (j % MOD) % MOD;
}
if (min == 0) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 788,533 | 788,532 | u806320475 | cpp |
p02983 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 788,543 | 788,544 | u151236434 | cpp |
p02983 | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = a; i > n; i--)
#define lrep(i, a, n) for (long int i = a; i < n; i++)
#define i... | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = a; i > n; i--)
#define lrep(i, a, n) for (long int i = a; i < n; i++)
#define i... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 788,547 | 788,548 | u829260400 | cpp |
p02983 | #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
unsigned long long l, r;
cin >> l >> r;
unsigned long long mi = INT_MAX, i = 0, j = 0;
if (r / 2019 - l / 2019 != 0)
cout << 0 << endl;
else {
l %= ... | #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
unsigned long long l, r;
cin >> l >> r;
unsigned long long mi = INT_MAX, i = 0, j = 0;
if (r / 2019 - l / 2019 != 0)
cout << 0 << endl;
else {
l %= ... | [] | 788,550 | 788,551 | u919983664 | cpp |
p02983 | #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
unsigned long long l, r;
cin >> l >> r;
unsigned long long mi = INT_MAX, i = 0, j = 0;
if (r / 2019 - l / 2019 != 0)
cout << 0 << endl;
else {
l %= ... | #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
unsigned long long l, r;
cin >> l >> r;
unsigned long long mi = INT_MAX, i = 0, j = 0;
if (r / 2019 - l / 2019 != 0)
cout << 0 << endl;
else {
l %= ... | [
"assignment.change"
] | 788,552 | 788,551 | u919983664 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, m, n) for (ll i = m; i > n; i--)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, m, n) for (ll i = m; i > n; i--)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmi... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 788,563 | 788,564 | u535010493 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r, ans = 2e9;
cin >> l >> r;
if (r - l + 1 <= 2050) {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << '\n';
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r, ans = 2e9;
cin >> l >> r;
if (r - l + 1 <= 2019) {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << '\n';
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 788,565 | 788,566 | u816631826 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int year1, year2;
cin >> year1 >> year2;
int min = 2020;
// 2000 5000
// 2020 4040
// 4038
if (year2 - year1 >= 2019) {
min = 0;
} else {
for (long long int i = year1; i <= year2; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int year1, year2;
cin >> year1 >> year2;
int min = 2020;
// 2000 5000
// 2020 4040
// 4038
if (year2 - year1 >= 2019) {
min = 0;
} else {
for (long long int i = year1; i <= year2; i++) {
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,569 | 788,570 | u353919145 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
r = min(l + 2019, r);
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
ans = min(ans, (i *... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
r = min(l + 2019, r);
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i *... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,572 | 788,573 | u005006157 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue> //priority_queue 优先队列
#include <set> //multiset set<int>::reverse_iterator rit; for(rit=s.rbegin();rit!=s.rend();rit++)
#include <sstream>
#include <stack>
#include <string>
#include <utility>... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue> //priority_queue 优先队列
#include <set> //multiset set<int>::reverse_iterator rit; for(rit=s.rbegin();rit!=s.rend();rit++)
#include <sstream>
#include <stack>
#include <string>
#include <utility>... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 788,580 | 788,581 | u018679195 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
ll L, R;
cin >> L >> R;
/*
ll sa = R - L;
L %= 2019;
R %= 2019;
if (L == 0 || L == 2018)... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
ll L, R;
cin >> L >> R;
/*
ll sa = R - L;
L %= 2019;
R %= 2019;
if (L == 0 || L == 2018)... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 788,586 | 788,587 | u437633151 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll ans = 2018;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll ans = 2018;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 788,599 | 788,600 | u678961336 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF (1LL << 60)
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF (1LL << 60)
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#de... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 788,612 | 788,613 | u768347697 | cpp |
p02983 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int n, d, k, sa, res = 9999, l, r;
long long int used[100005] = {}, ... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int n, d, k, sa, res = 9999, l, r;
long long int used[100005] = {}, ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,618 | 788,619 | u018872912 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll ans = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = (i * j) % 2019;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll ans = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| [
"call.add",
"call.arguments.change"
] | 788,624 | 788,625 | u850165979 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define intll int long long
#define rep(i, n) for (intll i = 0; i < (int)(n); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
intll l, r;
cin >> l >> r;
intll ans = INF;
for (int i = l; i < min(r, l + 2020); i++) ... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define intll int long long
#define rep(i, n) for (intll i = 0; i < (int)(n); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
intll l, r;
cin >> l >> r;
intll ans = INF;
for (int i = l; i < min(r, l + 2020); i++) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,634 | 788,635 | u260907804 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll L, R;
cin >> L >> R;
vector<ll> V;
for (ll i = L; i <= R; i++) {
V.push_back(i % 2019);
if (i % 2019 == 0)
break;
}
ll min_value = 2020;
for (int i = 0; i < V.size(); i++) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll L, R;
cin >> L >> R;
vector<ll> V;
for (ll i = L; i <= R; i++) {
V.push_back(i % 2019);
if (i % 2019 == 0 && i != 0)
break;
}
ll min_value = 2020;
for (int i = 0; i < V.size... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 788,642 | 788,643 | u418892821 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define p_q priority_queue
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define MAX 1000000001
int main() {
ll l, r;
cin >> l >> r;
ll len = r - l + 1;
if (len >= 2019) {
cout << 0 << endl;
} else {
ll value;
for (ll i ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define p_q priority_queue
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define MAX 1000000001
int main() {
ll l, r;
cin >> l >> r;
ll len = r - l + 1;
if (len >= 2019) {
cout << 0 << endl;
} else {
ll value = 99999999999;
... | [
"variable_declaration.value.change"
] | 788,663 | 788,664 | u830237447 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
const int INF = 1000000001;
int R, L;
int ans = INT_MAX;
int main() {
cin >> R >> L;
if (R - L >= 2018) {
ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
const int INF = 1000000001;
int R, L;
int ans = INT_MAX;
int main() {
cin >> R >> L;
if (L - R >= 2018) {
ans = 0;
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 788,665 | 788,666 | u317379170 | cpp |
p02983 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | [
"expression.operation.binary.remove"
] | 788,669 | 788,670 | u955627293 | cpp |
p02983 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
typedef long long int ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
typedef long long int ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) ... | [
"control_flow.loop.for.initializer.change"
] | 788,703 | 788,704 | u549743442 | cpp |
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++)
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2018;
for (int i = L; i < R; i++) {
for (int j = L + 1; j <= R; j++)
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,726 | 788,727 | u868132236 | cpp |
p02983 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 788,748 | 788,749 | u545938555 | cpp |
p02983 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define PI 3.141592653
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define PI 3.141592653
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,752 | 788,753 | u817523595 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); ... | [
"call.arguments.change"
] | 788,756 | 788,757 | u281168735 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); ... | [
"call.arguments.change"
] | 788,758 | 788,757 | u281168735 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define SUM(c) accumulate((c).begin(), (c).end(), 0)
#define ALL(a) (a).begin(), (a).end()
long long gcd(long long a, long long b) { return b ? gcd(b, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define SUM(c) accumulate((c).begin(), (c).end(), 0)
#define ALL(a) (a).begin(), (a).end()
long long gcd(long long a, long long b) { return b ? gcd(b, ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 788,769 | 788,770 | u335278042 | cpp |
p02983 | ///見ました
#include <bits/stdc++.h>
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; i++) {
for (long long j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
}... | ///見ました
#include <bits/stdc++.h>
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; i++) {
for (long long j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,775 | 788,776 | u028906014 | cpp |
p02983 | ///見ました
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
}
| ///見ました
#include <bits/stdc++.h>
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; i++) {
for (long long j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,777 | 788,776 | u028906014 | cpp |
p02983 | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main()... | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main()... | [
"literal.number.change",
"control_flow.loop.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 788,780 | 788,781 | u992779443 | cpp |
p02983 | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main()... | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main()... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 788,782 | 788,781 | u992779443 | cpp |
p02983 | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main()... | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main()... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 788,783 | 788,784 | u992779443 | cpp |
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
signed main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
for (int i = l; i <= r; ++i) {
for (int j = l; j <= r; ++j) {
ans = min(ans, i * j % 2019);
... | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
signed main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
for (int i = l; i <= r; ++i) {
for (int j = l; j < i; ++j) {
ans = min(ans, i * j % 2019);
... | [
"control_flow.loop.for.condition.change"
] | 788,785 | 788,786 | u491256431 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
int main() {
int l, r, ans = 10000;
cin >> l >> r;
if (r - l >= 2018)
ans = 0;
else {
l %... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
int main() {
int l, r, ans = 10000;
cin >> l >> r;
if (r - l >= 2018)
ans = 0;
else {
l %... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 788,796 | 788,797 | u088751997 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
int ans = 100000;
// lとrの間に2019の倍数があるか否か
if ((l - 1) / 2019 + 1 <= r /... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
int ans = 100000;
// lとrの間に2019の倍数があるか否か
if ((l - 1) / 2019 + 1 <= r /... | [
"control_flow.loop.for.initializer.change",
"assignment.change",
"call.add",
"call.arguments.change"
] | 788,808 | 788,809 | u779216084 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
int ans = 100000;
// lとrの間に2019の倍数があるか否か
if ((l - 1) / 2019 + 1 <= r /... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
int ans = 100000;
// lとrの間に2019の倍数があるか否か
if ((l - 1) / 2019 + 1 <= r /... | [
"expression.operation.binary.remove",
"call.add",
"call.arguments.change"
] | 788,810 | 788,809 | u779216084 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 788,846 | 788,847 | u618604643 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
;
int main() {
long long int A, B = 999999999999, C, L, R;
cin >> L >> R;
if (R - L > 2018)
A = 0;
else {
L %= 2019;
R %= 2019;
if (L >= R)
A = 0;
else {
for (int i = L; i < R; i++) {
for (int j = i + 1; j < R + 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
;
int main() {
long long int A, B = 999999999999, C, L, R;
cin >> L >> R;
if (R - L > 2018)
B = 0;
else {
L %= 2019;
R %= 2019;
if (L >= R)
B = 0;
else {
for (int i = L; i < R; i++) {
for (int j = i + 1; j < R + 1; j++) {
... | [
"assignment.variable.change",
"identifier.change"
] | 788,848 | 788,849 | u618604643 | cpp |
p02983 | #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... | [
"literal.number.change",
"call.arguments.change"
] | 788,856 | 788,857 | u917049698 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t l, r, res = (1 << 29);
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0;
return 0;
}
l %= 2019;
r %= 2019;
if (l >= r) {
cout << 0;
return 0;
}
for (int64_t i = l; i <= r; i++) {
for (int64_t j = i + 1; j <= r; j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t l, r, res = (1 << 29);
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0;
return 0;
}
l %= 2019;
r %= 2019;
if (l >= r) {
cout << 0;
return 0;
}
for (int64_t i = l; i <= r; i++) {
for (int64_t j = i + 1; j <= r; j... | [
"assignment.change"
] | 788,865 | 788,866 | u204536668 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n) for (int i = n; 0 < i; i--)
#define print(out) cout << out << "\n";
#define mod 1000000007
const int INF = 1e8;
typedef pair<int, int> P;
int main() {
ll L... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n) for (int i = n; 0 < i; i--)
#define print(out) cout << out << "\n";
#define mod 1000000007
const int INF = 1e8;
typedef pair<int, int> P;
int main() {
ll L... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 788,867 | 788,868 | u526459074 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | [
"literal.number.change",
"io.output.change"
] | 788,875 | 788,876 | u809967037 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define fastio ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define fastio ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,879 | 788,880 | u057226835 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define fastio ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define fastio ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 788,881 | 788,880 | u057226835 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 788,882 | 788,883 | u989306199 | cpp |
p02983 | #define rep(i, n) for (ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll mod_l = l % 2019;
ll div_l = l / 2019;
ll mod_r = r % 2019;
ll div_r = r / 2019;
ll ans = 2018;
if (div_r > div_l) {
ans... | #define rep(i, n) for (ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll mod_l = l % 2019;
ll div_l = l / 2019;
ll mod_r = r % 2019;
ll div_r = r / 2019;
ll ans = 2018;
if (div_r > div_l) {
ans... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 788,884 | 788,885 | u518206537 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define fir first
#define sec second
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define ll long long
#define ld long double
#define lp(i, n) for (int i = 0; (int)i < n; i++)
#define loop(i, x, n) for (i... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define fir first
#define sec second
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define ll long long
#define ld long double
#define lp(i, n) for (int i = 0; (int)i < n; i++)
#define loop(i, x, n) for (i... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 788,888 | 788,889 | u360892275 | cpp |
p02983 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2018) {
cout << 0 << endl;
return 0;
}
int l = L % 2019;
int r... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2018) {
cout << 0 << endl;
return 0;
}
int l = L % 2019;
int r... | [
"assignment.change"
] | 788,892 | 788,893 | u455266724 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
scanf("%lld %lld", &l, &r);
for (int i = l; i <= r; ++i)
if (i % 2019 == 0) {
puts("0");
return 0;
}
int mn = 2018;
for (int i = (l % 2019); i <= (r % 2019); ++i) {
for (int j = i; j <= (r % 2019); ++j) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
scanf("%lld %lld", &l, &r);
for (int i = l; i <= r; ++i)
if (i % 2019 == 0) {
puts("0");
return 0;
}
int mn = 2018;
for (int i = (l % 2019); i <= (r % 2019); ++i) {
for (int j = i + 1; j <= (r % 2019); ++j) {
... | [
"control_flow.loop.for.initializer.change"
] | 788,902 | 788,903 | u388682543 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, e) for (int x = 0; x <= e; x++)
#define in_arr(n) \
loop(i, 0, n - 1) { cin >> a[i]; }
#define out_arr(n) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, e) for (int x = 0; x <= e; x++)
#define in_arr(n) \
loop(i, 0, n - 1) { cin >> a[i]; }
#define out_arr(n) ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 788,912 | 788,911 | u341811631 | cpp |
p02983 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int l, r, ans = 2020;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
} el... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int l, r, ans = 2020;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
} el... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 788,918 | 788,919 | u075296067 | cpp |
p02983 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int L, R;
cin >> L >> R;
ll Ans = 1e18;
for (ll i = L; i <= min(L + 2020, R); i++) {
for (ll j = L + 1; j <= min(L + 2020, R); j++) {
Ans = min(Ans, (i * j) % 2019);
}
}
cout << Ans;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int L, R;
cin >> L >> R;
ll Ans = 1e18;
for (ll i = L; i <= min(L + 4020, R); i++) {
for (ll j = i + 1; j <= min(L + 4020, R); j++) {
Ans = min(Ans, (i * j) % 2019);
}
}
cout << Ans;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 788,930 | 788,931 | u365917065 | cpp |
p02983 | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | [
"call.arguments.change",
"call.arguments.add"
] | 788,943 | 788,944 | u137332130 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) ... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) ... | [
"expression.operation.binary.remove"
] | 788,957 | 788,958 | u330661451 | cpp |
p02983 | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | [
"control_flow.return.add"
] | 788,979 | 788,980 | u426683236 | cpp |
p02983 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll mod = 2019;
ll L, R;
cin >> L >> R;
R = min(L + mod, R);
ll ans = 2019;
for (ll i = L; i <= R; i++)
for (ll j = L + 1; j <= R; j++) {
ans = min(ans, (i * j) % mod);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll mod = 2019;
ll L, R;
cin >> L >> R;
R = min(L + mod, R);
ll ans = 2019;
for (ll i = L; i <= R; i++)
for (ll 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"
] | 788,989 | 788,990 | u119098168 | cpp |
p02983 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
using Graph = vector<vector<int>>;
typedef l... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
using Graph = vector<vector<int>>;
typedef l... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 788,993 | 788,994 | u203033720 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#define LIM 2000000000
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll L, R, mul, m = 2019 * 2020;
cin >> L >> R;
R = R < L + 2019 ? R : L + 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j... | #include <algorithm>
#include <iostream>
#define LIM 2000000000
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll L, R, mul, m = 2020;
cin >> L >> R;
R = R < L + 2019 ? R : L + 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 789,027 | 789,028 | u803684095 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#define LIM 2000000000
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll L, R, mul, m = LIM + 10;
cin >> L >> R;
R = R < L + 2019 ? R : L + 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++)... | #include <algorithm>
#include <iostream>
#define LIM 2000000000
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll L, R, mul, m = 2020;
cin >> L >> R;
R = R < L + 2019 ? R : L + 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change"
] | 789,029 | 789,028 | u803684095 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define RFOR(i, a, n) for (ll i = (ll)a; i >= n; --i)
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FOR(i, 1, n + 1)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPN(i, n) RFOR(i, n, 1)
con... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define RFOR(i, a, n) for (ll i = (ll)a; i >= n; --i)
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FOR(i, 1, n + 1)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPN(i, n) RFOR(i, n, 1)
con... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,038 | 789,039 | u835629653 | cpp |
p02983 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef l... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef l... | [
"call.arguments.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 789,040 | 789,041 | u346180161 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i <= r; i++) {... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i <= r; i++) {... | [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 789,061 | 789,062 | u648009244 | 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> P;
const int mod = 2019;
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l > 2019)
cout << 0;
else {
int m = 2020;
for (int i = l; i <= r; i++) {
for (int... | #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> P;
const int mod = 2019;
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l > 2018)
cout << 0;
else {
int m = 2020;
for (int i = l; i <= r; i++) {
for (int... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,088 | 789,089 | u243407720 | 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> P;
const int mod = 2019;
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l > 2018)
cout << 0;
else {
int m = 2020;
for (int i = l; i <= r; i++) {
for (int... | #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> P;
const int mod = 2019;
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l > 2018)
cout << 0;
else {
int m = 2020;
for (int i = l; i <= r; i++) {
for (int... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,090 | 789,089 | u243407720 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (... | [
"call.arguments.change",
"call.arguments.add"
] | 789,111 | 789,112 | u430209651 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
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 (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 789,113 | 789,112 | u430209651 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
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 (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 789,114 | 789,112 | u430209651 | cpp |
p02983 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) begin(x), end(x)
#defi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) begin(x), end(x)
#defi... | [
"literal.number.change",
"io.output.change"
] | 789,133 | 789,134 | u024616993 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, ans = 2020;
cin >> a >> b;
for (ll i = a; i < min(a + 2019, b); i++) {
for (ll j = i + 1; i < min(i + 2020, b); i++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, ans = 2020;
cin >> a >> b;
for (ll i = a; i <= min(a + 2019, b); i++) {
for (ll j = i + 1; j <= min(i + 2020, b); j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change"
] | 789,136 | 789,137 | u780122303 | cpp |
p02983 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------... | [
"call.arguments.change"
] | 789,138 | 789,139 | u118340517 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ALL(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ALL(a... | [
"identifier.change",
"call.function.change"
] | 789,153 | 789,154 | u761582382 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1000000007;
const ll LINF = 1e13;
const ll LLINF = 1e18;
const ll ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1000000007;
const ll LINF = 1e13;
const ll LLINF = 1e18;
const ll ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,155 | 789,156 | u134810655 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1000000007;
const ll LINF = 1e13;
const ll LLINF = 1e18;
const ll ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1000000007;
const ll LINF = 1e13;
const ll LLINF = 1e18;
const ll ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,158 | 789,156 | u134810655 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
constexpr long long int mod = 2019;
if (r - l >= mod) {
cout << 0 << endl;
} else {
long long int ans = (l % mod) * ((l + 1) % mod) % mod;
for (int i = l; l < r; l++) {
for (int j = i + 1; j <= r... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
constexpr long long int mod = 2019;
if (r - l >= mod) {
cout << 0 << endl;
} else {
long long int ans = ((l % mod) * ((l + 1) % mod)) % mod;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <=... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 789,173 | 789,174 | u251410638 | cpp |
p02983 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 789,175 | 789,176 | u047655753 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, ans = 2018;
cin >> l >> r;
r = min(r, l + 2018);
for (long long i = l; i <= r; ++i) {
for (long long j = l + 1; j <= r; ++j) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, ans = 2018;
cin >> l >> r;
r = min(r, l + 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;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,185 | 789,186 | u801916231 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b)... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,189 | 789,190 | u697090185 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b)... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 789,191 | 789,190 | u697090185 | cpp |
p02983 | #include <bits/stdc++.h>
//#pragma GCC optimize "-O3"
typedef unsigned long long ull;
typedef unsigned int ui;
typedef unsigned short us;
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll infll = (1ull << 63) - 1;
const int ... | #include <bits/stdc++.h>
//#pragma GCC optimize "-O3"
typedef unsigned long long ull;
typedef unsigned int ui;
typedef unsigned short us;
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll infll = (1ull << 63) - 1;
const int ... | [
"control_flow.branch.else.add"
] | 789,198 | 789,199 | u162126904 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 10000000000000;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll m = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = l; j <= r; j++) {
m = min(m, i * j % 20... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 10000000000000;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll m = 2018;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
m = min(m, i * j %... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 789,200 | 789,201 | u950411977 | cpp |
p02983 | #include <cstdio>
int main() {
long long int a, b, i, ss = 10000, s, j;
scanf("%lld%lld", &a, &b);
if (b / 2019 > a / 2019)
printf("0\n");
else {
for (i = a; i < b; i++)
for (j = i + 1; j < b; j++) {
s = (i * j) % 2019;
if (s < ss)
ss = s;
}
printf("%lld", ss);
... | #include <cstdio>
int main() {
long long int a, b, i, ss = 10000, s, j;
scanf("%lld%lld", &a, &b);
if (b / 2019 > a / 2019)
printf("0\n");
else {
for (i = a; i < b; i++)
for (j = i + 1; j <= b; j++) {
s = (i * j) % 2019;
if (s < ss)
ss = s;
}
printf("%lld", ss);... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 789,210 | 789,211 | u083959835 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 789,214 | 789,215 | u926242698 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 789,216 | 789,215 | u926242698 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 789,214 | 789,217 | u926242698 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 789,216 | 789,217 | u926242698 | cpp |
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 + 4038);
// long long ans = 1e18;
long long ans = 2018;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <=... | #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 ... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 789,228 | 789,229 | u455366471 | cpp |
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;
long long ans = 2018;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <=... | #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 ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,230 | 789,229 | u455366471 | cpp |
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 + 4038);
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 ... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 789,231 | 789,229 | u455366471 | cpp |
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"
] | 789,232 | 789,229 | u455366471 | cpp |
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"
] | 789,233 | 789,229 | u455366471 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.