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;
int main(void) {
long long L, R;
cin >> L >> R;
long long ans = 2018;
if (R - L > 2019)
cout << 0 << endl;
else {
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long L, R;
cin >> L >> R;
long long ans = 2018;
if (R - L > 2021)
cout << 0 << endl;
else {
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019);
}
}
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 787,762 | 787,761 | u150155436 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
vector<long long> z((y - x + 1) % 2019);
if (y - x + 1 < 673) {
if (y - x + 1 >= 3) {
for (long long i = 0; i < (y - x + 1) % 2019; i++) {
if ((x + i) % 673 == 0) {
cout << 0 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
vector<long long> z((y - x + 1) % 2019);
if (y - x + 1 < 673) {
if (y - x + 1 >= 3) {
for (long long i = 0; i < (y - x + 1) % 2019; i++) {
if ((x + i) % 673 == 0) {
cout << 0 << endl;
... | [
"control_flow.branch.if.condition.change"
] | 787,768 | 787,769 | u488207046 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
vector<long long> z((y - x + 1) % 2019);
if (y - x + 1 < 673) {
if (y - x + 1 >= 3) {
for (long long i = 0; i < (y - x + 1) % 2019; i++) {
if ((x + i) % 673 == 0) {
cout << 0 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
vector<long long> z((y - x + 1) % 2019);
if (y - x + 1 < 673) {
if (y - x + 1 >= 3) {
for (long long i = 0; i < (y - x + 1) % 2019; i++) {
if ((x + i) % 673 == 0) {
cout << 0 << endl;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 787,770 | 787,769 | u488207046 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 1 << endl;
} else {
int min = 999999;
for (int i = L; i < R; i++) {
for (int j = i + 1; j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long L, R;
cin >> L >> R;
if (R - L > 2019) {
cout << 0 << endl;
} else {
int min = 999999;
for (long long i = L; i < R; i++) {
for (long long j ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 787,771 | 787,772 | u686962993 | cpp |
p02983 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int mai... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int mai... | [] | 787,775 | 787,776 | u870074807 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
if (l / 2019 != r / 2019) {
cout << 0 << endl;
return 0;
} else {
ll res = 2020;
for (ll i = l; i <= r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
res = min(res, i * j % 2019);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
if (l / 2019 != r / 2019) {
cout << 0 << endl;
return 0;
} else {
ll res = 2020;
for (ll i = l; i <= r; ++i) {
for (ll j = i + 1; j <= r; ++j) {
res = min(res, i * j % 2019);
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 787,779 | 787,780 | u189867560 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int l, r;
cin >> l >> r;
ll ans = 2019;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, ((i % 2019) * (j * 2019)) % 2019);
if (ans == 0) {
cout << "0\n";
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int l, r;
cin >> l >> r;
ll ans = 2019;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
if (ans == 0) {
cout << "0\n";
return 0;
... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 787,783 | 787,784 | u507549471 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
int main() {
int l, r;
cin >> l >> r;
int min = 2018;
if (r - l < 2018) {
for (int i = l; i <= r; i++) {
for (int j = l; j <= r; j++) {
int a = i % 2019;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
int main() {
int l, r;
cin >> l >> r;
int min = 2018;
if (r - l < 2018) {
for (int i = l; i <= r; i++) {
for (int j = l; j <= r; j++) {
int a = i % 2019;
... | [
"identifier.change",
"expression.operation.binary.change"
] | 787,787 | 787,788 | u821071900 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
int main() {
int l, r;
cin >> l >> r;
int min = 2018;
if (r - l < 2019) {
for (int i = l; i <= r; i++) {
for (int j = l; j <= r; j++) {
int a = i % 2019;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
int main() {
int l, r;
cin >> l >> r;
int min = 2018;
if (r - l < 2018) {
for (int i = l; i <= r; i++) {
for (int j = l; j <= r; j++) {
int a = i % 2019;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"expression.operation.binary.change"
] | 787,789 | 787,788 | u821071900 | cpp |
p02983 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 787,792 | 787,793 | u128572736 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i, l, r) for (i = l; i < r; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define P pair<ll, ll>
#define F first
#define S second
signed main() {
ll L, R, i, j, ans = 2018;
cin >> L >> R;
if (R - L >= 2018)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i, l, r) for (i = l; i < r; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define P pair<ll, ll>
#define F first
#define S second
signed main() {
ll L, R, i, j, ans = 2018;
cin >> L >> R;
if (R - L >= 2018)... | [
"literal.number.change",
"assignment.value.change"
] | 787,794 | 787,795 | u820224016 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include ... | [
"assignment.change",
"call.arguments.change"
] | 787,810 | 787,811 | u143100985 | cpp |
p02983 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_C main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int... | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_C main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 787,814 | 787,815 | u404244809 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repeq(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define rep1(i, x, n) for (int(i) = (x); (i) < (int)(n); (i)++)
#define rep1eq(i, x, n) for (int(i) = (x); (i) <= (int)(n); (i)++)
#define rrep(i, x) for (int i = ((int)(x)-1);... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repeq(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define rep1(i, x, n) for (int(i) = (x); (i) < (int)(n); (i)++)
#define rep1eq(i, x, n) for (int(i) = (x); (i) <= (int)(n); (i)++)
#define rrep(i, x) for (int i = ((int)(x)-1);... | [
"assignment.change"
] | 787,817 | 787,818 | u924373338 | cpp |
p02983 | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int l, r, mn = 1e9;
scanf("%d %d", &l, &r);
if (l / 2019 != r / 2019) {
printf("0");
return 0;
}
for (int i = l; i <= r; i++)
for (int j = i + 1; j <= r; j++) {
mn = min(mn, (i % 2019) * (j % 2019));
}
printf("... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int l, r, mn = 1e9;
scanf("%d %d", &l, &r);
if (l / 2019 != r / 2019) {
printf("0");
return 0;
}
for (int i = l; i <= r; i++)
for (int j = i + 1; j <= r; j++) {
mn = min(mn, (i % 2019) * (j % 2019) % 2019);
// ... | [
"assignment.change"
] | 787,819 | 787,820 | u959634984 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
const int MOD = 2019;
int main() {
ll l, r, res, mini = 3000;
cin >> l >> r;
if (r - l > 2030) {
cout << 0 << endl;
} else {
for (int i = l; i < r; i++) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
const int MOD = 2019;
int main() {
ll l, r, res, mini = 3000;
cin >> l >> r;
if (r - l > 2030) {
cout << 0 << endl;
} else {
for (ll i = l; i < r; i++) {
f... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 787,821 | 787,822 | u147331814 | cpp |
p02983 | bool DBG = false;
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
// using i128 = __int128_t;
// using bint = boost::multiprecision::cpp_int;
// using d1024 =
// boost::multiprec... | bool DBG = false;
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
// using i128 = __int128_t;
// using bint = boost::multiprecision::cpp_int;
// using d1024 =
// boost::multiprec... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 787,823 | 787,824 | u952090000 | cpp |
p02983 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019LL) {
cout << 0 << endl;
} else {
bool f = false;
ll min = 2018LL;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019LL) {
cout << 0 << endl;
} else {
bool f = false;
ll min = 2018LL;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
... | [
"assignment.change"
] | 787,831 | 787,832 | u108843155 | cpp |
p02983 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll l, r;
ll ans = 2019;
ll i, j;
cin >> l >> r;
for (i = l; i <= r; i++) {
if (i % 2019 == 0) {
cout << 0 << endl;
return 0;
}
}
l %= 2019;
r %= 2019;
if (r <= l) {
r += 2019;
}
for (i = l; i ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll l, r;
ll ans = 2019;
ll i, j;
cin >> l >> r;
for (i = l; i <= r; i++) {
if (i % 2019 == 0) {
cout << 0 << endl;
return 0;
}
}
l %= 2019;
r %= 2019;
if (r <= l) {
r += 2019;
}
for (i = l; i ... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 787,850 | 787,851 | u165018080 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
long long l, r;
cin >> l >> r;
long long ans = 1e10;
for (long long i = l; i < l + 2019 && i < r; ++i) {
for (long long j = i + 1; j <= l + 2019 && j <= r; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
long long l, r;
cin >> l >> r;
long long ans = 1e10;
for (long long i = l; i < l + 2019 && i < r; ++i) {
for (long long j = i + 1; j <= l + 2019 && j <= r; ++j) {
... | [
"call.arguments.change"
] | 787,852 | 787,853 | u194015723 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
if (r - l > 2020)
cout << 0 << endl;
else {
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
if (r - l > 2020)
cout << 0 << endl;
else {
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(a... | [] | 787,858 | 787,859 | u816145694 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); 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 = 1001001001001;
for (ll i = l; i < r - 1; i++) {
for (ll j = i + 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); 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 = 1001001001001;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 787,865 | 787,866 | u304517780 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | [
"call.arguments.change"
] | 787,867 | 787,868 | u934272719 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
/*
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
//************** StrAnge.R *********************
#define ll long long int
#define ull unsigned long l... | #include <bits/stdc++.h>
using namespace std;
/*
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
//************** StrAnge.R *********************
#define ll long long int
#define ull unsigned long l... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 787,873 | 787,874 | u655790107 | cpp |
p02983 | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
int L, R;
cin >> L >> R;
if (R - L > 3000) {
cout << 0 << endl;
}
// (i * j) mod 2019
// (... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
int L, R;
cin >> L >> R;
if (R - L > 3000) {
cout << 0 << endl;
return (0);
}
// (i * j)... | [
"control_flow.return.add"
] | 787,895 | 787,896 | u027946359 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
ll l, r;
ll m = 2e9;
cin >> l >> r;
if (r - l >= ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
ll l, r;
ll m = 2e9;
cin >> l >> r;
if (r - l >= ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 787,916 | 787,917 | u704411633 | 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() {
int L, R;
cin >> L >> R;
int ans = 2018;
if (R - L >= 2019) {
for (int i = L; i < L + 2019; i++) {
for (int j = L + 1; j <= L + 2019; j++) {
... | #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() {
int L, R;
cin >> L >> R;
int ans = 2018;
if (R - L >= 2019) {
for (int i = L; i < L + 2019; i++) {
for (int j = i + 1; j <= L + 2019; j++) {
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"assignment.change"
] | 787,927 | 787,928 | u721094090 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long int;
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 10000000;
r = min(r, l + 3000);
for (int i = l; i < r; i++) {
for (int i2 = i + 1; i2 < r; i2++) {
ll g = (i * i2) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long int;
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 10000000;
r = min(r, l + 3000);
for (ll i = l; i < r; i++) {
for (ll i2 = i + 1; i2 <= r; i2++) {
ll g = (i * i2) %... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 787,942 | 787,941 | u167245594 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
ll l, r;
int main() {
cin >> l >> r;
ll res = 1e9;
const ll ub = (long)min(2019LL, r);
for (ll i = l; i <= ub - 1; i++) {
for (int j = l + 1; j <= ub; j++)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
ll l, r;
int main() {
cin >> l >> r;
ll res = 1e9;
const ll ub = (long)min(l + 2019LL, r);
for (ll i = l; i <= ub - 1; i++) {
for (int j = l + 1; j <= ub; ... | [
"assignment.change"
] | 787,948 | 787,949 | u389007679 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | [
"expression.operation.binary.add"
] | 787,960 | 787,961 | u297738015 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 1; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
bool hantei = false;
for (int i = l; i < r; ++i) {
for (int j = i; j ... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 1; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
bool hantei = false;
for (int i = l; i < r; ++i) {
for (int j = i + 1... | [
"control_flow.loop.for.initializer.change"
] | 787,962 | 787,963 | u553123421 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll l, r, ans = 99999;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j < r; j++) {
ll now... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll l, r, ans = 99999;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll no... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 787,964 | 787,965 | u692550512 | cpp |
p02983 | #include <bits/stdc++.h>
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++)
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
int l = L % 2019, r = R % 2019;
if (R - L >= 2019 || l >= r) {
cout << 0 << endl;
return 0;
}
int... | #include <bits/stdc++.h>
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++)
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
int l = L % 2019, r = R % 2019;
if (R - L >= 2019 || l >= r) {
cout << 0 << endl;
return 0;
}
int... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 787,966 | 787,967 | u187489367 | cpp |
p02983 | #include <bits/stdc++.h>
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++)
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
int l = L % 2019, r = R % 2019;
if (R - L >= 2019 || l >= r) {
cout << 0 << endl;
return 0;
}
int... | #include <bits/stdc++.h>
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++)
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
int l = L % 2019, r = R % 2019;
if (R - L >= 2019 || l >= r) {
cout << 0 << endl;
return 0;
}
int... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 787,968 | 787,967 | u187489367 | cpp |
p02983 | #include <bits/stdc++.h>
#define repz(i, z, n) for (decltype(n) i = (z); i < (n); i++)
#define rep(i, n) for (decltype(n) i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define SIZE(v) ((ll)(v).size())
#define MAX(v) (*max_element(ALL(v)))
#define MIN(v) (*min_element(ALL(v)))
#define INF 1000000000000 // 1E+12... | #include <bits/stdc++.h>
#define repz(i, z, n) for (decltype(n) i = (z); i < (n); i++)
#define rep(i, n) for (decltype(n) i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define SIZE(v) ((ll)(v).size())
#define MAX(v) (*max_element(ALL(v)))
#define MIN(v) (*min_element(ALL(v)))
#define INF 1000000000000 // 1E+12... | [
"call.arguments.change",
"assignment.change"
] | 787,972 | 787,973 | u354953865 | 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 lm, rm;
lm = l % 2019;
rm = r % 2019;
int ans, ans2;
// cout << rm << lm << endl;
if (lm >= rm) {
ans = 0;
} else... | #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 lm, rm;
lm = l % 2019;
rm = r % 2019;
int ans, ans2;
// cout << rm << lm << endl;
if (lm >= rm or r - l > 2019) {
a... | [
"control_flow.branch.if.condition.change"
] | 787,992 | 787,993 | u992471673 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 788,000 | 787,999 | u952081880 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"identifier.change"
] | 788,001 | 787,999 | u952081880 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 788,022 | 788,021 | u077104253 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 788,027 | 788,028 | u748757847 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
char area[100][100];
using P = pair<char, bool>;
int main() {
ll l, r;
std::cin >> l >> r;
bool flag = false;
ll mini = 2020;
for (ll i = l; i <= l + 3000 && i <= r; i++) {
for (ll j = l ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
char area[100][100];
using P = pair<char, bool>;
int main() {
ll l, r;
std::cin >> l >> r;
bool flag = false;
ll mini = 2020;
for (ll i = l; i <= l + 3000 && i <= r; i++) {
for (ll j = i ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,039 | 788,040 | u280097533 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
char area[100][100];
using P = pair<char, bool>;
int main() {
ll l, r;
std::cin >> l >> r;
bool flag = false;
ll mini = 2020;
for (ll i = l; i <= l + 3000 && i <= r; i++) {
for (ll j = l ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
char area[100][100];
using P = pair<char, bool>;
int main() {
ll l, r;
std::cin >> l >> r;
bool flag = false;
ll mini = 2020;
for (ll i = l; i <= l + 3000 && i <= r; i++) {
for (ll j = i ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 788,041 | 788,040 | u280097533 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main() {
long long L, R;
cin >> L >> R;
if ((R - L) >= 2018)
cout << 0 << endl;
else if (R % 2019 < L % 2019)
cout << 0 << endl;
else {
long long a = L %... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main() {
long long L, R;
cin >> L >> R;
if ((R - L) >= 2018)
cout << 0 << endl;
else if (R % 2019 < L % 2019)
cout << 0 << endl;
else {
long long a = L %... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 788,054 | 788,055 | u583701239 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
const long long MOD = 1e09 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define vi vector<int>
int main() {
ll l, r;
cin >> l >> r;
int answer = 2019;
if (l - ... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
const long long MOD = 1e09 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define vi vector<int>
int main() {
ll l, r;
cin >> l >> r;
int answer = 2019;
if (r - ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 788,059 | 788,060 | u391250239 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
ll R, L;
cin >> L >> R;
ll ans = 2018;
ll r, l;
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
ll R, L;
cin >> L >> R;
ll ans = 2018;
ll r, l;
... | [
"expression.operation.binary.remove"
] | 788,070 | 788,071 | u663191260 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
ll R, L;
cin >> L >> R;
ll ans = 2018;
ll r, l;
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
ll R, L;
cin >> L >> R;
ll ans = 2018;
ll r, l;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 788,072 | 788,071 | u663191260 | cpp |
p02983 | #include <stdio.h>
#include <stdlib.h>
typedef long long ll;
int main(void) {
ll ans = 2019;
ll l, r;
scanf("%lld%lld", &l, &r);
if (r - l >= 2019) {
puts("0");
return 0;
} else
for (ll i = l; i < r + 1; i++)
for (ll j = l + 1; j < r + 1; j++)
if ((i * j) % 2019 < ans)
an... | #include <stdio.h>
#include <stdlib.h>
typedef long long ll;
int main(void) {
ll ans = 2019;
ll l, r;
scanf("%lld%lld", &l, &r);
if (r - l >= 2019) {
puts("0");
return 0;
} else
for (ll i = l; i < r + 1; i++)
for (ll j = l + 1; j < r + 1; j++)
if (i != j && (i * j) % 2019 < ans)
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 788,075 | 788,076 | u032004842 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
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; i <= r; i++) {
int x = i * j % 2019;
ans = min(ans... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
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(ans... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 788,079 | 788,078 | u796273093 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
int main() {
long long l;
long long r;
long long min = 672;
std::cin >> l >> r;
for (long long i = l; i <= r && i < l + 2019; i++) {
for (long long j = i; j <= r && j < l + 2019; j++) {
min = std::min(i * j % 2019, min);
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
int main() {
long long l;
long long r;
long long min = 2019;
std::cin >> l >> r;
for (long long i = l; i <= r && i < l + 2019; i++) {
for (long long j = i + 1; j <= r && j < l + 2019; j++) {
min = std::min(i * j % 2019, min... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 788,080 | 788,081 | u543584809 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
int main() {
long long l;
long long r;
long long min = 672;
std::cin >> l >> r;
for (long long i = l; i <= r && i < l + 2019; i++) {
for (long long j = i + 1; j <= r && j < l + 2019; j++) {
min = std::min(i * j % 2019, min)... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
int main() {
long long l;
long long r;
long long min = 2019;
std::cin >> l >> r;
for (long long i = l; i <= r && i < l + 2019; i++) {
for (long long j = i + 1; j <= r && j < l + 2019; j++) {
min = std::min(i * j % 2019, min... | [
"literal.number.change",
"variable_declaration.value.change"
] | 788,082 | 788,081 | u543584809 | cpp |
p02983 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
int mod = 2019;
long long ans = 2019;
if (r - l >= 2019)
cout << 0;
else {
for (long long i = l; i <= r - 1; i++) {
for (long long j = i + 1; j <= r; j++) {
long long tmp = (i * j) % mod;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
int mod = 2019;
long long ans = 2019;
if (r - l >= 2019)
cout << 0;
else {
for (long long i = l; i <= r - 1; i++) {
for (long long j = i + 1; j <= r; j++) {
long long tmp = (i * j) % mod;
... | [] | 788,085 | 788,086 | u363703956 | cpp |
p02983 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
int mod = 2019;
long long ans = 2019;
if (r - l >= 2019)
cout << 0;
else {
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
long long tmp = (i * j) % mod;
ans = min(... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
int mod = 2019;
long long ans = 2019;
if (r - l >= 2019)
cout << 0;
else {
for (long long i = l; i <= r - 1; i++) {
for (long long j = i + 1; j <= r; j++) {
long long tmp = (i * j) % mod;
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 788,087 | 788,086 | u363703956 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
b... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
b... | [] | 788,090 | 788,091 | u418810472 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
b... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
b... | [
"expression.operation.binary.remove"
] | 788,092 | 788,091 | u418810472 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using P = pair<int, int>;
using vi = vector<int>;
using vii = vector<vi>;
using ll = long long;
const int dx4[4... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using P = pair<int, int>;
using vi = vector<int>;
using vii = vector<vi>;
using ll = long long;
const int dx4[4... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 788,118 | 788,119 | u363936720 | cpp |
p02983 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,120 | 788,121 | u700484101 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
int a;
if (R - L < 2019) {
a = R - L;
} else {
a = 2019;
}
ll ans = 2019;
for (int i = 0; i < a + 1; ++i) {
for (int j = 1; j < a + 1; ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
int a;
if (R - L < 2019) {
a = R - L;
} else {
a = 2019;
}
ll ans = 2019;
for (int i = 0; i < a + 1; ++i) {
for (int j = i + 1; j < a +... | [
"control_flow.loop.for.initializer.change"
] | 788,124 | 788,125 | u813559924 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r - l + 1 >= 2019)
cout << 0 << endl;
else {
long long ans = 2020 * 2020;
for (long long i = l; i <= r; i++) {
for (long long j = l + 1; j <= r; j++) {
if (ans > (i * j) % 2019)
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r - l + 1 >= 2019)
cout << 0 << endl;
else {
long long ans = 2020 * 2020;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
if (ans > (i * j) % 2019)
an... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,142 | 788,143 | u494609869 | cpp |
p02983 | // template version 1.12
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF = 1e18;
const int MOD = 1e9 + 7; //}}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i... | // template version 1.12
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF = 1e18;
const int MOD = 1e9 + 7; //}}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i... | [
"expression.operation.binary.add"
] | 788,144 | 788,145 | u314057689 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int ans = 2018;
int Rf = min(R - L, 2019);
for (int i = L; i < L + Rf; i++) {
for (int j = i + 1; j <= L + Rf; j++) {
int ansy = (i % 2019) * (j % 2019);
ans = min(ansy, ans);
}
}
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int ans = 2018;
int Rf = min(R - L, 2019);
for (int i = L; i < L + Rf; i++) {
for (int j = i + 1; j <= L + Rf; j++) {
int ansy = ((i % 2019) * (j % 2019)) % 2019;
ans = min(ansy, ans);
}
}
cout << ans ... | [
"assignment.change"
] | 788,159 | 788,160 | u430394202 | cpp |
p02983 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 788,163 | 788,164 | u740002394 | cpp |
p02983 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 788,165 | 788,164 | u740002394 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
ll l, r;
cin >> l >> r;
if (r - l > 3000) {
cout << 0 << endl;
return 0;
}
ll ans = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = l + ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
ll l, r;
cin >> l >> r;
if (r - l > 3000) {
cout << 0 << endl;
return 0;
}
ll ans = 2019;
for (ll i = l; i < r; i++) {
for (ll j = l + 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,172 | 788,173 | u886613668 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2020) {
cout << 0 << endl;
return 0;
}
ll ans = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = l +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
ll l, r;
cin >> l >> r;
if (r - l > 3000) {
cout << 0 << endl;
return 0;
}
ll ans = 2019;
for (ll i = l; i < r; i++) {
for (ll j = l + 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 788,174 | 788,173 | u886613668 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int l, r;
cin >> l >> r;
if (r - l >= 2025)
return cout << 0, 0;
vector<int> v;
int ans = 1e9;
for (int i = l; i <= r; i++)
v.push_back(i % 2019);
for (int i = 0; i < v.size();... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int l, r;
cin >> l >> r;
if (r - l >= 2025)
return cout << 0, 0;
vector<int> v;
int ans = 1e9;
for (int i = l; i <= r; i++)
v.push_back(i % 2019);
for (int i = 0; i < v.size()... | [
"call.arguments.change",
"call.arguments.add"
] | 788,175 | 788,176 | u280859559 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int l, r;
cin >> l >> r;
const int INF = 2000000005;
int ans = INF, cnt = 0;
for (int i =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int l, r;
cin >> l >> r;
const int INF = 2000000005;
int ans = INF, cnt = 0;
for (int i =... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,189 | 788,190 | u487530783 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
// 小数点以下桁数
// fixed << setprecision(i)
int gcd(int a, int b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int64_t lcm(int a, int b) { return (int64_t)a * b / gcd(a, b); }
int factorial(int a) {
int b = 1;
while (a) {
b *= a--;
}
return b;
} // 13以下対応
bool is_p... | #include <bits/stdc++.h>
using namespace std;
// 小数点以下桁数
// fixed << setprecision(i)
int gcd(int a, int b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int64_t lcm(int a, int b) { return (int64_t)a * b / gcd(a, b); }
int factorial(int a) {
int b = 1;
while (a) {
b *= a--;
}
return b;
} // 13以下対応
bool is_p... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 788,203 | 788,204 | u652660628 | cpp |
p02983 | #include <iostream>
using namespace std;
using ll = long long;
#define mod 2019
#define INF 2 << 30
int main(void) {
// Your code here!
ll l, r;
cin >> l >> r;
if (r + 1 - l >= mod) {
cout << 0;
return 0;
}
int m = mod;
for (int i = l; i <= r; i++)
for (int j = l + 1; j <= r; j++) {
... | #include <iostream>
using namespace std;
using ll = long long;
#define mod 2019
#define INF 2 << 30
int main(void) {
// Your code here!
ll l, r;
cin >> l >> r;
if (r + 1 - l >= mod) {
cout << 0;
return 0;
}
int m = mod;
for (int i = l; i < r; i++)
for (int j = l + 1; j <= r; j++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,205 | 788,206 | u288035794 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#i... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#i... | [
"assignment.change"
] | 788,207 | 788,208 | u940569542 | cpp |
p02983 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
templa... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
templa... | [
"call.arguments.change",
"call.arguments.add"
] | 788,209 | 788,210 | u450883456 | 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>;
const int mod = 1000000007;
const ll INF = ll(1e18) + 1;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <cla... | #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>;
const int mod = 1000000007;
const ll INF = ll(1e18) + 1;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <cla... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 788,213 | 788,214 | u147556624 | 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>;
const int mod = 1000000007;
const ll INF = 1001001001;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class... | #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>;
const int mod = 1000000007;
const ll INF = 1001001001;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"identifier.change",
"expression.operation.binary.change"
] | 788,217 | 788,216 | u147556624 | 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;
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(ans, x)... | #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;
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(ans, x... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,226 | 788,227 | u526630579 | 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;
r = min(r, l + 2019);
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(ans, x)... | #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;
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(ans, x... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 788,228 | 788,227 | u526630579 | cpp |
p02983 | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef ... | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef ... | [
"call.arguments.change",
"call.arguments.add"
] | 788,248 | 788,249 | u521389909 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < 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;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < 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 < ... | [] | 788,281 | 788,282 | u892615201 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < 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;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < 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 < ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 788,283 | 788,282 | u892615201 | cpp |
p02983 | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Rep(i, a, n) for (int i = a; i <= n; ++i)
#define Speed() ... | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Rep(i, a, n) for (int i = a; i <= n; ++i)
#define Speed() ... | [
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,284 | 788,285 | u002627851 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
int mod = 2019;
long long ans = 10000000;
for (long long i = L; i < R && i < L + 2019; i++) {
for (long long j = L + 1; j <= R && j <= L + 2019; j++) {
ans = min(ans, (i % mod) * (j % mod));
}
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
int mod = 2019;
long long ans = 10000000;
for (long long i = L; i < R && i < L + 2019; i++) {
for (long long j = L + 1; j <= R && j <= L + 2019; j++) {
ans = min(ans, i * j % mod);
}
}
cout << ans << e... | [
"call.arguments.change"
] | 788,297 | 788,298 | u864785784 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
int n, m;
cin >> n >> m;
int ans = 2020;
if (m - n >= 2018) {
a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
int n, m;
cin >> n >> m;
int ans = 2020;
if (m - n >= 2018) {
a... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 788,310 | 788,311 | u534923072 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template <class T> i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template <class T> i... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,335 | 788,336 | u298620933 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main() {
ll l, r;
cin >> l >> r;
int a = l % 2019;
int b = r % 2019;
int min = 2019;
if (l / 2019 < r / 2019 || l % 2019 == 0 || r % 2019 == 0) {
cout << 0 << endl;
return 0;
} else {
for (int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main() {
ll l, r;
cin >> l >> r;
int a = l % 2019;
int b = r % 2019;
int min = 2019;
if (l / 2019 < r / 2019 || l % 2019 == 0 || r % 2019 == 0) {
cout << 0 << endl;
return 0;
} else {
for (int ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 788,343 | 788,344 | u509860467 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long i = L;
long long j = L + 1;
int min = 2018;
int now;
while (i < j && i <= L + 2019) {
while (j <= R && j <= L + 2019) {
now = ((i % 2019) * (j % 2019)) % 2019;
if (now < min)
min... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long i = L;
long long j = L + 1;
int min = 2018;
int now;
while (i < j && i <= L + 2019) {
j = i + 1;
while (j <= R && j <= L + 2019) {
now = ((i % 2019) * (j % 2019)) % 2019;
if (now < m... | [
"assignment.add"
] | 788,386 | 788,387 | u422692699 | cpp |
p02983 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll ans = 2018;
for (ll i = l; i <= r; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll ans = 2018;
for (ll i = l; i <= r; i++) {
... | [
"control_flow.loop.for.initializer.change"
] | 788,393 | 788,394 | u412057008 | cpp |
p02983 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll ans = 1e9;
for (ll i = l; i <= r; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll ans = 2018;
for (ll i = l; i <= r; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 788,395 | 788,394 | u412057008 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | [
"call.arguments.change",
"assignment.change"
] | 788,400 | 788,401 | u644224332 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | [
"expression.operation.binary.remove",
"call.arguments.change",
"assignment.change"
] | 788,402 | 788,401 | u644224332 | cpp |
p02983 | // C.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
using namespace std;
int main() {
bool wareru = false;
int L, R, sa1, sa2, syou;
int min = 3000;
cin >> L >> R;
for (int i = L; i <= R; i++) {
if (i % 2019 == 0) {
wareru = true;
break;
}
// syou =... | // C.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
using namespace std;
int main() {
bool wareru = false;
int L, R, sa1, sa2, syou;
int min = 3000;
cin >> L >> R;
for (int i = L; i <= R; i++) {
if (i % 2019 == 0) {
wareru = true;
break;
}
// syou =... | [
"identifier.change",
"expression.operation.binary.change"
] | 788,407 | 788,408 | u902619368 | cpp |
p02983 | // C.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
using namespace std;
int main() {
bool wareru = false;
int L, R, sa1, sa2, syou;
int min = 3000;
cin >> L >> R;
for (int i = L; i <= R; i++) {
if (i % 2019 == 0) {
wareru = true;
break;
}
// syou =... | // C.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
using namespace std;
int main() {
bool wareru = false;
int L, R, sa1, sa2, syou;
int min = 3000;
cin >> L >> R;
for (int i = L; i <= R; i++) {
if (i % 2019 == 0) {
wareru = true;
break;
}
// syou =... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,409 | 788,408 | u902619368 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"identifier.change",
"expression.operation.binary.change"
] | 788,414 | 788,413 | u308463793 | cpp |
p02983 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019)
cout << 1 << endl;
else {
ll m = inf;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++)
m = min(... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else {
ll m = inf;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++)
m = min(... | [
"literal.number.change",
"io.output.change"
] | 788,420 | 788,421 | u016987091 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define BE(x) x.begin(), x.end()
int main() {
long long l, r;
cin >> l >> r;
long long ans = 2019;
int icnt = 0;
for (long long i = l; i < r; i++) {
int jcnt = 0;
for (long long j = i + 1; i <= r; i++) {
ans = min(ans, i * j % 2019);
jcnt++;
... | #include <bits/stdc++.h>
using namespace std;
#define BE(x) x.begin(), x.end()
int main() {
long long l, r;
cin >> l >> r;
long long ans = 2019;
int icnt = 0;
for (long long i = l; i < r; i++) {
int jcnt = 0;
for (long long j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
jcnt++;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 788,438 | 788,439 | u528258842 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define BE(x) x.begin(), x.end()
int main() {
long long l, r;
cin >> l >> r;
long long ans = 2019;
int icnt = 0;
for (long long i = l; i < r; i++) {
int jcnt = 0;
for (long long j = i + 1; i <= r; i++) {
ans = min(ans, i * j % 2019);
jcnt++;
... | #include <bits/stdc++.h>
using namespace std;
#define BE(x) x.begin(), x.end()
int main() {
long long l, r;
cin >> l >> r;
long long ans = 2019;
int icnt = 0;
for (long long i = l; i < r; i++) {
int jcnt = 0;
for (long long j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
jcnt++;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 788,440 | 788,439 | u528258842 | 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;
r = min(r, l + 4038);
int ans = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
int x = i * j % 20... | #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;
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 % 20... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,447 | 788,448 | u713178565 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,457 | 788,458 | u719183848 | cpp |
p02983 | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <stack>
#include <string.h>
#include <string>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
long a, b;
cin >> a >> b;
if (b - a >=... | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <stack>
#include <string.h>
#include <string>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
long a, b;
cin >> a >> b;
if (b - a >=... | [
"assignment.change"
] | 788,465 | 788,466 | u337018543 | cpp |
p02983 | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int64_t L, R;
cin >> L >> R;
int64_t a, b;
a = (L - 1) / 2019;
b = R / 2019;
int64_t ret = INF;
if (b - a == 0) {
for (int6... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int64_t L, R;
cin >> L >> R;
int64_t a, b;
a = (L - 1) / 2019;
b = R / 2019;
int64_t ret = INF;
if (b - a == 0) {
for (int6... | [
"assignment.change"
] | 788,467 | 788,468 | u295279251 | cpp |
p02983 | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const int INF = 1000100100;
int main() {
ll n, m, p, q, t, min = INF;
cin >> n >> m;
p = n % 2019;
q = m % 2019;
if (m - n >= 2019 || p >= q) {
... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const int INF = 1000100100;
int main() {
ll n, m, p, q, t, min = INF;
cin >> n >> m;
p = n % 2019;
q = m % 2019;
if (m - n >= 2019 || p >= q) {
... | [
"assignment.change"
] | 788,469 | 788,470 | u838152098 | cpp |
p02983 | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const int INF = 1000100100;
int main() {
ll n, m, p, q, t, min = INF;
cin >> n >> m;
p = n % 2019;
q = m % 2019;
if (m - n >= 2019 || p >= q) {
... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const int INF = 1000100100;
int main() {
ll n, m, p, q, t, min = INF;
cin >> n >> m;
p = n % 2019;
q = m % 2019;
if (m - n >= 673 || p >= q) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 788,469 | 788,471 | u838152098 | cpp |
p02983 | #include <iostream>
int main(void) {
int l, r;
std::cin >> l >> r;
if (r >= 2019 + l) {
r = 2019 + l;
}
int min = 2018;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
int cur = (i % 2019) * (j % 2019);
min = std::min(cur, min);
}
}
std::cout << min << std::end... | #include <iostream>
int main(void) {
int l, r;
std::cin >> l >> r;
if (r >= 2019 + l) {
r = 2019 + l;
}
int min = 2018;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
int cur = (i % 2019) * (j % 2019);
cur %= 2019;
min = std::min(cur, min);
}
}
std::cout... | [
"assignment.add"
] | 788,472 | 788,473 | u275256557 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.