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);
}
}
}
cout << ans << endl;
return 0;
} | #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);
}
}
cout << ans << endl;
}
return 0;
} | [
"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;
return 0;
}
z.at(i) = (x + i) % 2019;
}
vector<long long> t;
for (long long j = z.at(0); j <= z.at((y - x + 1) % 2019 - 2); j++) {
for (long long k = j + 1; k <= z.at((y - x + 1) % 2019) - 1; k++) {
t.push_back(j * k % 2019);
}
}
sort(t.begin(), t.end());
cout << t.at(0) << endl;
} else {
cout << (y * x) % 2019 << endl;
}
} else {
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;
return 0;
}
z.at(i) = (x + i) % 2019;
}
vector<long long> t;
for (long long j = z.at(0); j <= z.at((y - x + 1) % 2019 - 2); j++) {
for (long long k = j + 1; k <= z.at((y - x + 1) % 2019 - 1); k++) {
t.push_back(j * k % 2019);
}
}
sort(t.begin(), t.end());
cout << t.at(0) << endl;
} else {
cout << (y * x) % 2019 << endl;
}
} else {
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;
return 0;
}
z.at(i) = (x + i) % 2019;
}
vector<long long> t;
for (long long j = z.at(0); j <= z.at((y - x + 1) % 2019 - 2); j++) {
for (long long k = j + 1; k <= z.at((y - x + 1) % 2019); k++) {
t.push_back(j * k % 2019);
}
}
sort(t.begin(), t.end());
cout << t.at(0) << endl;
} else {
cout << (y * x) % 2019 << endl;
}
} else {
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;
return 0;
}
z.at(i) = (x + i) % 2019;
}
vector<long long> t;
for (long long j = z.at(0); j <= z.at((y - x + 1) % 2019 - 2); j++) {
for (long long k = j + 1; k <= z.at((y - x + 1) % 2019 - 1); k++) {
t.push_back(j * k % 2019);
}
}
sort(t.begin(), t.end());
cout << t.at(0) << endl;
} else {
cout << (y * x) % 2019 << endl;
}
} else {
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 <= R; j++) {
if ((i % 2019 * j % 2019) % 2019 < min) {
min = i % 2019 * (j % 2019) % 2019;
}
}
}
cout << min << endl;
}
} | #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 = i + 1; j <= R; j++) {
if ((i % 2019 * j % 2019) % 2019 < min) {
min = i % 2019 * (j % 2019) % 2019;
}
}
}
cout << min << endl;
}
} | [
"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 main() {
ll l, r, a, b, mini = 2019;
cin >> l >> r;
const int p = 2019;
if (r - l >= 2019)
cout << 0 << endl;
else {
rep(i, l, r) {
rep(j, l + 1, r + 1) {
a = i % p;
b = j % p;
a *= b;
mini = min(mini, a % p);
}
}
}
cout << mini << endl;
return 0;
}
| #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 main() {
ll l, r, a, b, mini = 2019;
cin >> l >> r;
const int p = 2019;
if (r - l >= 2019)
cout << 0 << endl;
else {
rep(i, l, r) {
rep(j, l + 1, r + 1) {
a = i % p;
b = j % p;
a *= b;
mini = min(mini, a % p);
}
}
cout << mini << endl;
}
return 0;
}
| [] | 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);
}
}
cout << res << endl;
}
return 0;
} | #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);
}
}
cout << res << endl;
}
return 0;
} | [
"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;
}
}
}
cout << ans << "\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;
}
}
}
cout << ans << "\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;
int b = i % 2019;
int n = a * b;
if (i < j && min > n % 2019) {
min = n % 2019;
}
}
}
cout << min << endl;
}
if (r - l >= 2018)
cout << 0 << endl;
}
| #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;
int b = j % 2019;
int n = a * b;
if (i < j && min > n % 2019) {
min = n % 2019;
}
}
}
cout << min << endl;
}
if (r - l >= 2018)
cout << 0 << endl;
}
| [
"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;
int b = i % 2019;
int n = a * b;
if (i < j && min > n % 2019) {
min = n % 2019;
}
}
}
cout << min << endl;
}
if (r - l >= 2019)
cout << 0 << endl;
} | #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;
int b = j % 2019;
int n = a * b;
if (i < j && min > n % 2019) {
min = n % 2019;
}
}
}
cout << min << endl;
}
if (r - l >= 2018)
cout << 0 << endl;
}
| [
"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(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
int main() {
int l, r, ans = 1 << 30;
scanf("%d%d", &l, &r);
if (l / 2019 != r / 2019) {
puts("0");
return 0;
}
rep(i, l, r + 1) {
rep(i2, i + 1, r + 1) { ans = min(ans, (l % 2019 * (r % 2019)) % 2019); }
}
printf("%d\n", ans);
return 0;
} | #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(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
int main() {
int l, r, ans = 1 << 30;
scanf("%d%d", &l, &r);
if (l / 2019 != r / 2019) {
puts("0");
return 0;
}
rep(i, l, r + 1) {
rep(i2, i + 1, r + 1) { ans = min(ans, (i % 2019 * (i2 % 2019)) % 2019); }
}
printf("%d\n", ans);
return 0;
} | [
"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)
ans = 1;
else
FOR(i, L, R + 1) FOR(j, L, i) ans = min(ans, i % 2019 * j % 2019);
cout << ans << endl;
return 0;
} | #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)
ans = 0;
else
FOR(i, L, R + 1) FOR(j, L, i) ans = min(ans, i % 2019 * j % 2019);
cout << ans << endl;
return 0;
} | [
"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 <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using prll = pair<ll, ll>;
constexpr ll MOD = 1000000007; // 10億 = 10^9になってる
constexpr ll mINF = -922337200085470000; // llのmax-1桁の小さい方
constexpr ll pINF = 1LL << 60;
constexpr ull uINF = 1844674407399900000; // ullのmax-1桁してる
constexpr long double pi = 3.1415926535897932384;
constexpr ll juu = 100000; // 10万 10e5
constexpr ll hyaku = 1000000; // 100万 10e6
constexpr int dx[4] = {0, 0, 1, -1}; //上下左右のベクトル
constexpr int dy[4] = {1, -1, 0, 0}; //上下左右のベクトル
constexpr int ddx[8] = {0, 0, 1, -1, 1, 1, -1, -1};
constexpr int ddy[8] = {1, -1, 0, 0, -1, 1, 1, -1};
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Debug(xx) cerr << " DEBUG:" << xx << endl;
#define Debug2(xx, yy) cerr << " DEBUG:" << xx << ":" << yy << endl;
ll factor[300];
ll memory[300];
/*素朴法で計算
factorは必ずmemset(factor,0,sizeof(factor));
グローバルであるmemoryに個数を書き込む
memory配列の走査にはfactorの要素を使う*/
void primefac(ll num) {
int i = 0, kosuu = 0;
while (*(factor + i) != 0) {
while (num % *(factor + i) == 0) {
num /= *(factor + i);
memory[*(factor + i)] += 1;
}
if (num == 1)
break;
i++;
}
}
/*グローバルにあるfactorに素数書き込む.個数を返すので配列は-1しろforは<*/
int elast(ll number) {
ll tmp = 0;
int flag = 0;
*factor = 2;
for (int i = 3; i <= number; i++) {
flag = 0;
for (int j = 0; j <= tmp; j++) {
if (i % (*(factor + j)) == 0) {
flag = 1;
break;
}
}
if (flag)
continue;
tmp += 1;
*(factor + tmp) = i;
}
return tmp + 2;
}
//繰り返し二乗。掛けられる数、回数、mod
ll powpow(ll n, ll p) {
if (p == 0) {
return 1;
}
if (p == 1)
return n % MOD;
if (p % 2 == 1) {
return (n * powpow(n, p - 1)) % MOD;
}
ll dob = powpow(n, p / 2);
return (dob * dob) % MOD;
}
// MODとn、rが互いに素である事が確定していないとこれは出来ない。小定理、またchild,parentでおかしくなる。
// mod取った後にそれら同士で割り算するとおかしくなるから逆元使う。（合同式の性質考えろ）
ll nCrMod(ll n, ll r) {
ll child = 1;
ll parent = 1;
if (r == 0)
return 1;
for (ll i = 0; i < r; ++i) {
child = child * (n - i) % MOD;
parent = parent * (r - i) % MOD;
}
ll ans = child * powpow(parent, MOD - 2);
return ans % MOD;
}
ll to_digit(ll num) { return (ll)(to_string(num).size()); }
ll nCr(ll n, ll r) {
ll val = 1, val2 = 1;
if (r == 0)
return 1;
if (n < r)
return 0;
for (ll i = 0; i < r; ++i) {
val *= (n - i);
val2 *= (r - i);
}
return val / val2;
}
ll nPr(ll n, ll r) {
ll val = 1;
for (ll i = 0; i < r; ++i) {
val *= (n - i);
}
return val;
}
template <typename T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/*ソートして被りを無くす*/
template <typename T> void eraseSame(T &a) {
sort(all(a));
a.erase(unique(all(a)), a.end());
}
/*aとbで大きい方を後ろにする。変更なしならtrue、ありならfalse */
template <typename T> bool swapmax(T &a, T &b) {
T temp;
temp = a;
if (a > b) {
swap(a, b);
return false;
}
return true;
}
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*一行に入力が何個あるかを1,ぶち込むvectorを2*/
template <typename T> void splitIn(ll N, vector<T> &array) {
T temp;
int i = 0;
if (N == 0) {
return;
}
array.resize(N);
while (cin >> temp) {
array[i] = temp;
++i;
if (i >= N) {
break;
}
}
return;
}
/*時間計測
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
end = std::chrono::system_clock::now();
double elapsed =
std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count();
*/
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(20);
ll n, k, m, l, r;
ll ans = pINF;
ll sum = 0;
string s;
vector<ll> v;
cin >> l >> r;
if (abs(r - l) >= 2019) {
cout << 0;
return 0;
}
for (int i = l; i <= r; ++i) {
v.push_back(i % 2019);
}
sort(all(v));
for (int i = 0; i < v.size(); ++i) {
for (int j = i + 1; j < v.size(); ++j) {
ans = min(ans, (ll)((i * j) % 2019));
}
}
cout << ans << "\n";
return 0;
} | #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 <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using prll = pair<ll, ll>;
constexpr ll MOD = 1000000007; // 10億 = 10^9になってる
constexpr ll mINF = -922337200085470000; // llのmax-1桁の小さい方
constexpr ll pINF = 1LL << 60;
constexpr ull uINF = 1844674407399900000; // ullのmax-1桁してる
constexpr long double pi = 3.1415926535897932384;
constexpr ll juu = 100000; // 10万 10e5
constexpr ll hyaku = 1000000; // 100万 10e6
constexpr int dx[4] = {0, 0, 1, -1}; //上下左右のベクトル
constexpr int dy[4] = {1, -1, 0, 0}; //上下左右のベクトル
constexpr int ddx[8] = {0, 0, 1, -1, 1, 1, -1, -1};
constexpr int ddy[8] = {1, -1, 0, 0, -1, 1, 1, -1};
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Debug(xx) cerr << " DEBUG:" << xx << endl;
#define Debug2(xx, yy) cerr << " DEBUG:" << xx << ":" << yy << endl;
ll factor[300];
ll memory[300];
/*素朴法で計算
factorは必ずmemset(factor,0,sizeof(factor));
グローバルであるmemoryに個数を書き込む
memory配列の走査にはfactorの要素を使う*/
void primefac(ll num) {
int i = 0, kosuu = 0;
while (*(factor + i) != 0) {
while (num % *(factor + i) == 0) {
num /= *(factor + i);
memory[*(factor + i)] += 1;
}
if (num == 1)
break;
i++;
}
}
/*グローバルにあるfactorに素数書き込む.個数を返すので配列は-1しろforは<*/
int elast(ll number) {
ll tmp = 0;
int flag = 0;
*factor = 2;
for (int i = 3; i <= number; i++) {
flag = 0;
for (int j = 0; j <= tmp; j++) {
if (i % (*(factor + j)) == 0) {
flag = 1;
break;
}
}
if (flag)
continue;
tmp += 1;
*(factor + tmp) = i;
}
return tmp + 2;
}
//繰り返し二乗。掛けられる数、回数、mod
ll powpow(ll n, ll p) {
if (p == 0) {
return 1;
}
if (p == 1)
return n % MOD;
if (p % 2 == 1) {
return (n * powpow(n, p - 1)) % MOD;
}
ll dob = powpow(n, p / 2);
return (dob * dob) % MOD;
}
// MODとn、rが互いに素である事が確定していないとこれは出来ない。小定理、またchild,parentでおかしくなる。
// mod取った後にそれら同士で割り算するとおかしくなるから逆元使う。（合同式の性質考えろ）
ll nCrMod(ll n, ll r) {
ll child = 1;
ll parent = 1;
if (r == 0)
return 1;
for (ll i = 0; i < r; ++i) {
child = child * (n - i) % MOD;
parent = parent * (r - i) % MOD;
}
ll ans = child * powpow(parent, MOD - 2);
return ans % MOD;
}
ll to_digit(ll num) { return (ll)(to_string(num).size()); }
ll nCr(ll n, ll r) {
ll val = 1, val2 = 1;
if (r == 0)
return 1;
if (n < r)
return 0;
for (ll i = 0; i < r; ++i) {
val *= (n - i);
val2 *= (r - i);
}
return val / val2;
}
ll nPr(ll n, ll r) {
ll val = 1;
for (ll i = 0; i < r; ++i) {
val *= (n - i);
}
return val;
}
template <typename T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/*ソートして被りを無くす*/
template <typename T> void eraseSame(T &a) {
sort(all(a));
a.erase(unique(all(a)), a.end());
}
/*aとbで大きい方を後ろにする。変更なしならtrue、ありならfalse */
template <typename T> bool swapmax(T &a, T &b) {
T temp;
temp = a;
if (a > b) {
swap(a, b);
return false;
}
return true;
}
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*一行に入力が何個あるかを1,ぶち込むvectorを2*/
template <typename T> void splitIn(ll N, vector<T> &array) {
T temp;
int i = 0;
if (N == 0) {
return;
}
array.resize(N);
while (cin >> temp) {
array[i] = temp;
++i;
if (i >= N) {
break;
}
}
return;
}
/*時間計測
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
end = std::chrono::system_clock::now();
double elapsed =
std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count();
*/
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(20);
ll n, k, m, l, r;
ll ans = pINF;
ll sum = 0;
string s;
vector<ll> v;
cin >> l >> r;
if (abs(r - l) >= 2019) {
cout << 0;
return 0;
}
for (int i = l; i <= r; ++i) {
v.push_back(i % 2019);
}
sort(all(v));
for (int i = 0; i < v.size(); ++i) {
for (int j = i + 1; j < v.size(); ++j) {
ans = min(ans, (ll)((v[i] * v[j]) % 2019));
}
}
cout << ans << "\n";
return 0;
} | [
"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 MGN = 8;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using psi = pair<string, int>;
// functions
#endif
int main_C() {
std::cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll ans = LINF;
for (ll i = L; i < min(R, 2100LL); i++) {
ll l = i % 2019;
for (ll j = i + 1; j <= min(R, 2100LL); j++) {
ll r = j % 2019;
ans = min(ans, (l * r) % 2019);
}
}
cout << ans << endl;
return 0;
} | #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 MGN = 8;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using psi = pair<string, int>;
// functions
#endif
int main_C() {
std::cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll ans = LINF;
for (ll i = L; i < min(R, L + 2019LL); i++) {
ll l = i % 2019;
for (ll j = i + 1; j <= min(R, L + 2019LL); j++) {
ll r = j % 2019;
ans = min(ans, (l * r) % 2019);
}
}
cout << ans << endl;
return 0;
} | [
"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); i >= 0; i--)
using namespace std;
using ll = long long;
using Int = long long;
const int MOD = 1000000007;
const ll INF = numeric_limits<ll>::max();
const int inf = 1e8;
typedef pair<int, int> P;
typedef std::priority_queue<int> IntPrioQueue;
typedef std::priority_queue<int, std::vector<int>, std::greater<int>>
IntReversePrioQueue;
//少数点表示
// cout << std::fixed << std::setprecision(14) << 値
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
ll ans = inf;
if ((r - l) < 2019) {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll a = (i % 2019) * (j % 2019);
ans = min(ans, a);
}
}
} else {
ans = 0;
}
cout << ans << endl;
return 0;
} | #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); i >= 0; i--)
using namespace std;
using ll = long long;
using Int = long long;
const int MOD = 1000000007;
const ll INF = numeric_limits<ll>::max();
const int inf = 1e8;
typedef pair<int, int> P;
typedef std::priority_queue<int> IntPrioQueue;
typedef std::priority_queue<int, std::vector<int>, std::greater<int>>
IntReversePrioQueue;
//少数点表示
// cout << std::fixed << std::setprecision(14) << 値
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
ll ans = inf;
if ((r - l) < 2019) {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll a = ((i % 2019) * (j % 2019)) % 2019;
ans = min(ans, a);
}
}
} else {
ans = 0;
}
cout << ans << endl;
return 0;
} | [
"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("%d", mn);
return 0;
} | #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);
// mn=min(mn, i*j%2019);
}
printf("%d", mn);
return 0;
}
| [
"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++) {
for (int j = i + 1; j <= r; j++) {
res = (i * j) % MOD;
mini = min(res, mini);
}
}
}
cout << mini << endl;
} | #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++) {
for (ll j = i + 1; j <= r; j++) {
res = (i * j) % MOD;
mini = min(res, mini);
}
}
cout << mini << endl;
}
} | [
"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::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i >= (a); --i)
#define ALL(x) x.begin(), x.end()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define endl "\n"
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define dcouts(x) \
if (DBG) \
couts(x)
#define dcoutn(x) \
if (DBG) \
coutn(x);
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T1, typename T2>
std::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec) {
os << "deque[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os,
const std::unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
std::ostream &operator<<(std::ostream &os,
const std::unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <class T> using V = vector<T>;
template <class T> using V2 = V<V<T>>;
template <class T> using V3 = V<V2<T>>;
void solve() {
int l, r;
cin >> l >> r;
if ((r - l) >= 2019 || (r % 2019 <= l % 2019) || l % 2019 == 0)
coutn(0);
else {
r %= 2019;
l %= 2019;
int ans = 1 << 28;
FOR(i, l, r + 1) FOR(j, l + 1, r + 1) ans = min(ans, (i * j) % 2019);
coutn(ans);
}
}
int main(void) {
// std::cout << std::fixed << std::setprecision(100);
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | 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::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i >= (a); --i)
#define ALL(x) x.begin(), x.end()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define endl "\n"
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define dcouts(x) \
if (DBG) \
couts(x)
#define dcoutn(x) \
if (DBG) \
coutn(x);
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T1, typename T2>
std::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec) {
os << "deque[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os,
const std::unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
std::ostream &operator<<(std::ostream &os,
const std::unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <class T> using V = vector<T>;
template <class T> using V2 = V<V<T>>;
template <class T> using V3 = V<V2<T>>;
void solve() {
int l, r;
cin >> l >> r;
if ((r - l) >= 2019 || (r % 2019 <= l % 2019) || r % 2019 == 0)
coutn(0);
else {
r %= 2019;
l %= 2019;
int ans = 1 << 28;
FOR(i, l, r + 1) FOR(j, i + 1, r + 1) ans = min(ans, (i * j) % 2019);
coutn(ans);
}
}
int main(void) {
// std::cout << std::fixed << std::setprecision(100);
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"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++) {
ll k = (i % 2019LL) * (j % 2019LL);
if (k % 2019LL < min) {
min = k;
}
if (min == 0) {
f = true;
break;
}
}
if (f) {
break;
}
}
cout << min << endl;
}
}
| #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++) {
ll k = (i % 2019LL) * (j % 2019LL);
if (k % 2019LL < min) {
min = k % 2019LL;
}
if (min == 0) {
f = true;
break;
}
}
if (f) {
break;
}
}
cout << min << endl;
}
} | [
"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 <= r; i++) {
for (j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans) {
// cout << i << " " << j << endl;
// cout << i*j << endl;
ans = (i * j) % 2019;
// cout << 111111111111111 << endl;
}
}
}
// cout << ans << endl;
cout << 0 << endl;
return 0;
}
| #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 <= r; i++) {
for (j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans) {
// cout << i << " " << j << endl;
// cout << i*j << endl;
ans = (i * j) % 2019;
// cout << 111111111111111 << endl;
}
}
}
cout << ans << endl;
return 0;
}
| [
"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) {
ans = min(ans, (i % 2019) * (j % 2019));
}
}
cout << ans << '\n';
return 0;
} | #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) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << '\n';
return 0;
} | [
"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(ans, i * j % 2019);
}
}
}
cout << ans << endl;
}
| #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(ans, i * j % 2019);
}
}
cout << ans << endl;
}
} | [] | 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; j < r; j++) {
ll tmp = (i * j) % 2019;
ans = min(ans, tmp);
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
return 0;
} | #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 <= r; j++) {
ll tmp = (i * j) % 2019;
ans = min(ans, tmp);
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
return 0;
} | [
"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 vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int, int, int> tpl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define EXIST(m, v) (m).find((v)) != (m).end()
#define LB(a, x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a, x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RREP(i, n) RFOR(i, n, 0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL << 60;
constexpr long long MOD = 1000000007; // 998244353;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void Main() {
int L, R;
cin >> L >> R;
VI v;
FOR(i, L, min(R + 1, L + 4038)) v.push_back(i % 2019);
int ans = INF;
int K = v.size();
REP(i, K - 1) FOR(j, i + 1, K) chmin(ans, i * j % 2019);
cout << ans << en;
return;
}
int main(void) {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(15);
int t = 1; // cin>>t;
REP(_, t) Main();
return 0;
} | #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 vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int, int, int> tpl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define EXIST(m, v) (m).find((v)) != (m).end()
#define LB(a, x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a, x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RREP(i, n) RFOR(i, n, 0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL << 60;
constexpr long long MOD = 1000000007; // 998244353;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void Main() {
int L, R;
cin >> L >> R;
VI v;
FOR(i, L, min(R + 1, L + 4038)) v.push_back(i % 2019);
int ans = INF;
int K = v.size();
REP(i, K - 1) FOR(j, i + 1, K) chmin(ans, v[i] * v[j] % 2019);
cout << ans << en;
return;
}
int main(void) {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(15);
int t = 1; // cin>>t;
REP(_, t) Main();
return 0;
} | [
"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 long
#define ld long double
#define lll __int128
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define piii pair<int, pair<int, int>>
#define pll pair<ll, ll>
#define vii vector<pii>
#define sz(v) ((int)(v).size())
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define unq(c) (sort(all(c)), c.resize(distance(c.begin(), unique(all(c)))))
#define get_pos(c, x) (lower_bound(all(c), x) - c.begin())
#define MS0(v) memset((v), 0, sizeof((v)))
#define MS1(v) memset((v), -1, sizeof((v)))
#define LEN(v) strlen(v)
#define MP make_pair
#define pb push_back
#define pob pop_back
#define ff first
#define ss second
#define sc scanf
#define pf printf
#define endl "\n"
#define TEST_CASE \
int ___T; \
cin >> ___T; \
for (int cs = 1; cs <= ___T; cs++)
#define PRINT_CASE printf("Case %d: ", cs)
#define vpf(v) \
for (int i = 0; i < v.size(); i++) { \
cout << v[i]; \
if (i != v.size() - 1) \
cout << " "; \
else \
cout << "\n"; \
}
#define vsc(v) \
for (int i = 0; i < v.size(); i++) \
cin >> v[i];
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPP(i, a, b) for (int i = (a); i < (b); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORS(i, s) for (int i = 0; s[i]; i++)
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define fileio \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout)
#define intlim 2147483648
#define infinity (1LL << 50)
#define intmx INT_MAX
#define PI 3.14159265358979323846264338327950L // acos(-1.0)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
int on_bit(int N, int pos) { return N = N | (1 << pos); }
int off_bit(int N, int pos) { return N = N & ~(1 << pos); }
bool check_bit(ll N, int pos) { return (bool)(N & (1 << pos)); }
#define start_clock clock_t tStart = clock()
#define end_clock \
printf("\n>>Runtime: %.10fs\n", (double)(clock() - tStart) / CLOCKS_PER_SEC)
template <class T> inline bool read(T &x) {
int c = getchar();
int sgn = 1;
while (~c && c < '0' || c > '9') {
if (c == '-')
sgn = -1;
c = getchar();
}
for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar())
x = x * 10 + c - '0';
x *= sgn;
return ~c;
}
//******************* my code starts here **********************************
int main() {
ll l, r;
cin >> l >> r;
ll x = l;
while (x % 2019 != 0)
x++;
if (x <= r)
cout << "0\n";
else {
ll mn = infinity;
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
if (((i % 2019) * (j % 2019)) % 2019 < mn) {
mn = ((i % 2019) * (j % 2019)) % 2019;
}
}
}
cout << mn << "\n";
}
return 0;
}
| #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 long
#define ld long double
#define lll __int128
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define piii pair<int, pair<int, int>>
#define pll pair<ll, ll>
#define vii vector<pii>
#define sz(v) ((int)(v).size())
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define unq(c) (sort(all(c)), c.resize(distance(c.begin(), unique(all(c)))))
#define get_pos(c, x) (lower_bound(all(c), x) - c.begin())
#define MS0(v) memset((v), 0, sizeof((v)))
#define MS1(v) memset((v), -1, sizeof((v)))
#define LEN(v) strlen(v)
#define MP make_pair
#define pb push_back
#define pob pop_back
#define ff first
#define ss second
#define sc scanf
#define pf printf
#define endl "\n"
#define TEST_CASE \
int ___T; \
cin >> ___T; \
for (int cs = 1; cs <= ___T; cs++)
#define PRINT_CASE printf("Case %d: ", cs)
#define vpf(v) \
for (int i = 0; i < v.size(); i++) { \
cout << v[i]; \
if (i != v.size() - 1) \
cout << " "; \
else \
cout << "\n"; \
}
#define vsc(v) \
for (int i = 0; i < v.size(); i++) \
cin >> v[i];
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPP(i, a, b) for (int i = (a); i < (b); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORS(i, s) for (int i = 0; s[i]; i++)
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define fileio \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout)
#define intlim 2147483648
#define infinity (1LL << 50)
#define intmx INT_MAX
#define PI 3.14159265358979323846264338327950L // acos(-1.0)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
int on_bit(int N, int pos) { return N = N | (1 << pos); }
int off_bit(int N, int pos) { return N = N & ~(1 << pos); }
bool check_bit(ll N, int pos) { return (bool)(N & (1 << pos)); }
#define start_clock clock_t tStart = clock()
#define end_clock \
printf("\n>>Runtime: %.10fs\n", (double)(clock() - tStart) / CLOCKS_PER_SEC)
template <class T> inline bool read(T &x) {
int c = getchar();
int sgn = 1;
while (~c && c < '0' || c > '9') {
if (c == '-')
sgn = -1;
c = getchar();
}
for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar())
x = x * 10 + c - '0';
x *= sgn;
return ~c;
}
//******************* my code starts here **********************************
int main() {
ll l, r;
cin >> l >> r;
ll x = l;
while (x % 2019 != 0)
x++;
if (x <= r)
cout << "0\n";
else {
ll mn = infinity;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
if (((i % 2019) * (j % 2019)) % 2019 < mn) {
mn = ((i % 2019) * (j % 2019)) % 2019;
}
}
}
cout << mn << "\n";
}
return 0;
}
| [
"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
// (i mod 2019) * (j mod 2019)
ll num;
ll mn = LINF;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
num = (i * j) % 2019;
mn = min(mn, num);
}
}
printf("%d\n", mn);
return (0);
} | #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) mod 2019
// (i mod 2019) * (j mod 2019)
ll num;
ll mn = LINF;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
num = (i * j) % 2019;
mn = min(mn, num);
}
}
printf("%d\n", mn);
return (0);
} | [
"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 >= 2500) {
cout << 0 << endl;
return 0;
} else {
for (ll i = l; l < r + 1; l++) {
for (ll j = i + 1; j < r + 1; j++) {
ll tmp = i * j;
tmp %= 2019;
m = min(m, tmp);
}
}
// reps(i,l,r+1){
// reps(j,i+1,r+1){
// ll tmp = i*j;
// tmp %= 2019;
// m = min(m,tmp);
// //cout << i << " " << j << endl;
// }
// }
}
cout << m << endl;
return 0;
}
| #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 >= 2500) {
cout << 0 << endl;
return 0;
} else {
for (ll i = l; i < r + 1; i++) {
for (ll j = i + 1; j < r + 1; j++) {
ll tmp = (i * j) % 2019;
m = min(m, tmp);
}
}
// reps(i,l,r+1){
// reps(j,i+1,r+1){
// ll tmp = i*j;
// tmp %= 2019;
// m = min(m,tmp);
// //cout << i << " " << j << endl;
// }
// }
}
cout << m << endl;
return 0;
}
| [
"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++) {
ans = min(ans, ((i % 2019) * (j % 2019)));
}
}
} else {
for (int i = L; i < R; i++) {
for (int j = L + 1; j <= R; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)));
}
}
}
cout << ans << endl;
return 0;
}
| #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++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
} else {
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
}
cout << ans << endl;
return 0;
}
| [
"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) % 2019;
ans = min(ans, g);
}
}
cout << ans << endl;
} | #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) % 2019;
ans = min(ans, g);
}
}
cout << ans << endl;
} | [
"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++) {
res = min(res, ((i * j) % 2019LL));
}
}
cout << res << endl;
return 0;
} | #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; j++) {
res = min(res, ((i * j) % 2019LL));
}
}
cout << res << endl;
return 0;
} | [
"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
#define DF(x) x.erase(x.begin()) // 先頭文字削除
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr ll INFL = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) { return x == 0 ? 1 : log10(x) + 1; }
signed main() {
ll L, R;
cin >> L >> R;
// debug(4000 % 2019);
// debug(4001 % 2019);
// debug(4002 % 2019);
// ll a = (4000 % 2019) * (4000 % 2019);
// ll b = (4001 % 2019) * (4002 % 2019);
// debug(a);
// debug(a % 2019);
// debug(b);
// debug(b % 2019);
if (2019 - (L % 2019) + L <= R) {
COUT(0);
} else {
ll max = INFL;
if (R - L == 1) {
COUT((R * L) % 2019);
return 0;
}
if (R % 2019 == 0 || L % 2019 == 0) {
COUT(0);
return 0;
}
rep(i, R - L) {
rep2(j, i + 1, R - L) {
ll left = i + L;
ll right = j + L;
// debug(left);
// debug(right);
ll v = (left * right) % 2019;
if (max > v) {
// debug(v);/
max = v;
}
}
}
COUT(max);
}
return 0;
} | #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
#define DF(x) x.erase(x.begin()) // 先頭文字削除
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr ll INFL = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) { return x == 0 ? 1 : log10(x) + 1; }
signed main() {
ll L, R;
cin >> L >> R;
if (2019 - (L % 2019) + L <= R) {
COUT(0);
} else {
ll max = INFL;
if (R - L == 1) {
COUT((R * L) % 2019);
return 0;
}
if (R % 2019 == 0 || L % 2019 == 0) {
COUT(0);
return 0;
}
rep(i, R - L + 1) {
rep2(j, i + 1, R - L + 1) {
ll left = i + L;
ll right = j + L;
// debug(left);
// debug(right);
ll v = (left * right) % 2019;
if (max > v) {
// debug(v);/
max = v;
}
}
}
COUT(max);
}
return 0;
} | [
"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 < r + 1; ++j) {
int a = i % 2019;
int b = j % 2019;
ans = min(ans, a * b % 2019);
if (ans == 0) {
hantei = true;
break;
}
}
if (hantei)
break;
}
cout << ans << endl;
}
| #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; j < r + 1; ++j) {
int a = i % 2019;
int b = j % 2019;
ans = min(ans, a * b % 2019);
if (ans == 0) {
hantei = true;
break;
}
}
if (hantei)
break;
}
cout << ans << endl;
}
| [
"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_ans;
ll tmp = i, tmp2 = j;
tmp %= 2019;
tmp2 %= 2019;
now_ans = tmp * tmp2 % 2019;
ans = min(now_ans, ans);
}
}
cout << ans << endl;
} | #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_ans;
ll tmp = i, tmp2 = j;
tmp %= 2019;
tmp2 %= 2019;
now_ans = tmp * tmp2 % 2019;
ans = min(now_ans, ans);
}
}
cout << ans << endl;
} | [
"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 ans = 2018;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
if (ans == 1) {
cout << ans << endl;
return 0;
} // 1になりうることを忘れていた。
}
}
cout << ans << endl;
} | #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 ans = 2018;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
if (ans == 0) {
cout << ans << endl;
return 0;
} // 1や0になりうることを忘れていた。
}
}
cout << ans << endl;
} | [
"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 ans = 2018;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
if (ans == 2) {
cout << ans << endl;
return 0;
}
}
}
cout << ans << endl;
} | #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 ans = 2018;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
if (ans == 0) {
cout << ans << endl;
return 0;
} // 1や0になりうることを忘れていた。
}
}
cout << ans << endl;
} | [
"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
// 略
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define READ cin >>
#define PRINT cout <<
#define PYES cout << "Yes" << endl;
#define POK cout << "OK" << endl;
#define PNO cout << "No" << endl;
#define PNG cout << "NG" << endl;
using namespace std;
// デバッグ用
void debug_out() { cout << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
// typedef
typedef long long ll;
typedef unsigned long long ul;
// const
// 円周率
const double pi = M_PI;
// mod用
// 1E+9 +7
const ll mod = (int)1e+9 + 7;
// 1s間で可能なループ回数2E+8回
// int 最大値2147483647 〜2E+9
// long long 最大値9223372036854775807〜9E+18
// 総和accumulate
// 単純リストvector<type> push_back
// 連想配列map<key,value> insert,
// 集合set<type>
// pair キーとバリューを格納 firstとsecondでアクセス
// 小数点指定 cout << fixed << setprecision(15) << endl;
// to_string<->stoi
// stoll(longlong)
// stod(double)
// deep copy v1->v2 copy(v1.begin(), v1.end(), back_inserter(v2) );
// 大文字65-90(-32)
// 小文字97-122(+32)
int main() {
// faster
// C言語流の入出力は使用できない
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll l, r;
cin >> l >> r;
ll min1 = INF;
for (ll i = l; i <= min(l + 2019, r); i++) {
for (ll j = i + 1; j <= min(l + 2019, r); j++) {
min1 = min((i % 2019) * (j % 2019), min1);
}
}
cout << min1 << endl;
return 0;
}
| #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
// 略
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define READ cin >>
#define PRINT cout <<
#define PYES cout << "Yes" << endl;
#define POK cout << "OK" << endl;
#define PNO cout << "No" << endl;
#define PNG cout << "NG" << endl;
using namespace std;
// デバッグ用
void debug_out() { cout << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
// typedef
typedef long long ll;
typedef unsigned long long ul;
// const
// 円周率
const double pi = M_PI;
// mod用
// 1E+9 +7
const ll mod = (int)1e+9 + 7;
// 1s間で可能なループ回数2E+8回
// int 最大値2147483647 〜2E+9
// long long 最大値9223372036854775807〜9E+18
// 総和accumulate
// 単純リストvector<type> push_back
// 連想配列map<key,value> insert,
// 集合set<type>
// pair キーとバリューを格納 firstとsecondでアクセス
// 小数点指定 cout << fixed << setprecision(15) << endl;
// to_string<->stoi
// stoll(longlong)
// stod(double)
// deep copy v1->v2 copy(v1.begin(), v1.end(), back_inserter(v2) );
// 大文字65-90(-32)
// 小文字97-122(+32)
int main() {
// faster
// C言語流の入出力は使用できない
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll l, r;
cin >> l >> r;
ll min1 = INF;
for (ll i = l; i <= min(l + 2019, r); i++) {
for (ll j = i + 1; j <= min(l + 2019, r); j++) {
min1 = min(((i % 2019) * (j % 2019)) % 2019, min1);
}
}
cout << min1 << endl;
return 0;
}
| [
"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 {
ans = 10000;
rep(i, rm - lm + 1) {
rep(j, rm - lm + 1 - i - 1) {
ans2 = ((i + lm) * (i + j + lm + 1)) % 2019;
ans = min(ans, ans2);
}
}
}
cout << ans << endl;
return 0;
} | #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) {
ans = 0;
} else {
ans = 10000;
rep(i, rm - lm + 1) {
rep(j, rm - lm + 1 - i - 1) {
ans2 = ((i + lm) * (i + j + lm + 1)) % 2019;
ans = min(ans, ans2);
}
}
}
cout << ans << endl;
return 0;
} | [
"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>;
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) {
a = b;
return true;
}
return false;
}
const ll MOD = 1000000007;
const int INF = 1 << 30;
// const ll INF = (ll)1e18 + 1;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
} else {
ll ans = INF;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; i <= R; ++i) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
}
| #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>;
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) {
a = b;
return true;
}
return false;
}
const ll MOD = 1000000007;
const int INF = 1 << 30;
// const ll INF = (ll)1e18 + 1;
int main() {
ll L, R;
cin >> L >> R;
if (R - L > 2019) {
cout << 0 << endl;
return 0;
} else {
ll ans = INF;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"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>;
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) {
a = b;
return true;
}
return false;
}
const ll MOD = 1000000007;
const int INF = 1 << 30;
// const ll INF = (ll)1e18 + 1;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
} else {
int ans = INF;
for (int i = L; i <= R; ++i) {
for (int j = i + 1; i <= R; ++i) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
}
| #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>;
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) {
a = b;
return true;
}
return false;
}
const ll MOD = 1000000007;
const int INF = 1 << 30;
// const ll INF = (ll)1e18 + 1;
int main() {
ll L, R;
cin >> L >> R;
if (R - L > 2019) {
cout << 0 << endl;
return 0;
} else {
ll ans = INF;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"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) {
a = b;
return true;
}
return false;
}
typedef pair<ll, ll> P;
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 4038);
ll ans = 2018;
for (ll i = L; L <= R; L++) {
for (ll k = i + 1; k <= R; k++) {
ll x = i * k % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return 0;
}
| #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) {
a = b;
return true;
}
return false;
}
typedef pair<ll, ll> P;
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 4038);
ll ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll k = i + 1; k <= R; k++) {
ll x = i * k % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return 0;
}
| [
"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 chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 2019);
int ans = 2018;
for (ll i = L; i <= L; i++) {
for (ll j = i + 1; j <= R; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return 0;
} | #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 chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
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);
}
}
cout << ans << endl;
return 0;
} | [
"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 + 1; j <= l + 3000 && j <= r; j++) {
ll temp = i * j % 2019;
mini = min(temp, mini);
if (mini == 0) {
flag = true;
break;
}
}
if (flag)
break;
}
std::cout << mini << '\n';
return 0;
}
| #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 + 1; j <= l + 3000 && j <= r; j++) {
ll temp = i * j % 2019;
mini = min(temp, mini);
if (mini == 0) {
flag = true;
break;
}
}
if (flag)
break;
}
std::cout << mini << '\n';
return 0;
}
| [
"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 + 1; j <= r + 3000 && j <= r; j++) {
ll temp = i * j % 2019;
mini = min(temp, mini);
if (mini == 0) {
flag = true;
}
}
if (flag)
break;
}
std::cout << mini << '\n';
return 0;
}
| #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 + 1; j <= l + 3000 && j <= r; j++) {
ll temp = i * j % 2019;
mini = min(temp, mini);
if (mini == 0) {
flag = true;
break;
}
}
if (flag)
break;
}
std::cout << mini << '\n';
return 0;
}
| [
"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 % 2019;
long long b = R % 2019;
long long ans = 2020;
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
if (i * j < ans)
ans = i * j;
}
}
cout << ans << endl;
}
}
| #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 % 2019;
long long b = R % 2019;
long long ans = 2020;
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
if (i * j % 2019 < ans)
ans = i * j % 2019;
}
}
cout << ans << endl;
}
}
| [
"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 - r >= 2018) {
answer = 0;
}
l %= 2019;
r %= 2019;
if (l >= r) {
answer = 0;
}
else {
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
int tmp;
tmp = (i * j) % 2019;
answer = min(answer, tmp);
}
}
}
cout << answer << endl;
} | #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 - l >= 2018) {
answer = 0;
}
l %= 2019;
r %= 2019;
if (l >= r) {
answer = 0;
}
else {
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
int tmp;
tmp = (i * j) % 2019;
answer = min(answer, tmp);
}
}
}
cout << answer << endl;
} | [
"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;
rep(i, 2030) {
l = L + i;
if (l >= R) {
continue;
}
rep(j, 2030) {
r = l + 1 + i + j;
if (r > R) {
continue;
}
ll tmp = (l * r) % 2019;
// cout << tmp << endl;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
| #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;
rep(i, 2030) {
l = L + i;
if (l >= R) {
continue;
}
rep(j, 2030) {
r = l + 1 + j;
if (r > R) {
continue;
}
ll tmp = (l * r) % 2019;
// cout << tmp << endl;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
| [
"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;
rep(i, 2030) {
l = L + i;
if (l > R - 1) {
continue;
}
rep(j, 2030) {
r = l + 1 + i + j;
if (r > R) {
continue;
}
ll tmp = (l * r) % 2019;
// cout << tmp << endl;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
| #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;
rep(i, 2030) {
l = L + i;
if (l >= R) {
continue;
}
rep(j, 2030) {
r = l + 1 + j;
if (r > R) {
continue;
}
ll tmp = (l * r) % 2019;
// cout << tmp << endl;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
| [
"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)
ans = (i * j) % 2019;
printf("%lld\n", ans);
return 0;
} | #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)
ans = (i * j) % 2019;
printf("%lld\n", ans);
return 0;
} | [
"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, x);
}
}
cout << ans << endl;
return 0;
} | #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, x);
}
}
cout << ans << endl;
return 0;
} | [
"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);
}
}
std::cout << min << std::endl;
} | #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);
}
}
std::cout << min << std::endl;
} | [
"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);
}
}
std::cout << min << std::endl;
} | #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);
}
}
std::cout << min << std::endl;
} | [
"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;
ans = min(ans, tmp);
}
}
}
cout << ans;
return 0;
} |
#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;
ans = min(ans, tmp);
}
}
cout << ans;
}
return 0;
} | [] | 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(ans, tmp);
}
}
}
cout << ans;
return 0;
} |
#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;
ans = min(ans, tmp);
}
}
cout << ans;
}
return 0;
} | [
"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;
bool ok = 0;
string s;
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else {
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;
}
| #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;
bool ok = 0;
string s;
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else {
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;
}
//
}
| [] | 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;
bool ok = 0;
string s;
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l + 1 >= 2019)
cout << 0 << endl;
else {
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;
}
| #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;
bool ok = 0;
string s;
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else {
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;
}
//
}
| [
"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] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int dy8[8] = {1, 1, 1, 0, -1, -1, -1, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int l, r;
cin >> l >> r;
if (l - r >= 2019) {
cout << 0 << endl;
return 0;
}
int mod = 2019;
l %= mod;
r %= mod;
if (l >= r)
r += mod;
int ans = 1001001001;
for (int i = l + 1; i <= r; i++) {
for (int j = l; j < i; j++) {
int tmp = i * j % mod;
ans = min(ans, tmp);
}
}
cout << ans << endl;
} | #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] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int dy8[8] = {1, 1, 1, 0, -1, -1, -1, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int mod = 2019;
l %= mod;
r %= mod;
if (l >= r)
r += mod;
int ans = 1001001001;
for (int i = l + 1; i <= r; i++) {
for (int j = l; j < i; j++) {
int tmp = i * j % mod;
ans = min(ans, tmp);
}
}
cout << ans << endl;
} | [
"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, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
signed main() {
int l, r, ans = 1e18;
cin >> l >> r;
for (int i = l; i <= r && i <= l + 4038; i++) {
for (int j = l + 1; j <= r && j <= l + 4038; j++) {
chmin(ans, (i * j) % 2019);
}
}
print(ans);
}
| #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, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
const int mod = 1e9 + 7;
signed main() {
int l, r, ans = 1e18;
cin >> l >> r;
for (int i = l; i <= r && i <= l + 4038; i++) {
for (int j = i + 1; j <= r && j <= l + 4038; j++) {
chmin(ans, (i * j) % 2019);
}
}
print(ans);
}
| [
"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; ++j) {
ll b = (L + i) * (L + j);
ans = min(ans, b % 2019);
}
}
cout << ans << endl;
return 0;
} | #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 + 1; ++j) {
ll b = (L + i) * (L + j);
ans = min(ans, b % 2019);
}
}
cout << ans << endl;
return 0;
} | [
"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)
ans = (i * j) % 2019;
}
}
cout << ans << endl;
}
} | #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)
ans = (i * j) % 2019;
}
}
cout << ans << endl;
}
} | [
"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, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x) - A.begin())
#define posu(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
if ((a) < (b))
(a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
if ((a) > (b))
(a) = (b);
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
//}}}
int solve() {
int L, R;
cin >> L >> R;
if (R - L > 2020) {
cout << 0 << endl;
} else {
int res = INF;
rep(i, L, R + 1) {
rep(j, i + 1, R + 1) { chmin(res, (i % 2019) * (j % 2019)); }
}
cout << res << endl;
}
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| // 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, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x) - A.begin())
#define posu(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
if ((a) < (b))
(a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
if ((a) > (b))
(a) = (b);
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
//}}}
int solve() {
int L, R;
cin >> L >> R;
if (R - L > 2020) {
cout << 0 << endl;
} else {
int res = INF;
rep(i, L, R + 1) {
rep(j, i + 1, R + 1) { chmin(res, (i % 2019) * (j % 2019) % 2019); }
}
cout << res << endl;
}
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| [
"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 << endl;
}
| [
"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 <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true; // v を訪問済にする
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v])
continue; // next_v が探索済だったらスルー
dfs(G, next_v); // 再帰的に探索
}
}
signed main() {
int L, R;
cin >> L >> R;
int M = 2019;
bool J = false;
if (L / 2019 == R / 2019 && L % 2019 != 0) {
for (int X = L % 2019; X < R % 2019; X++) {
for (int Y = L % 2019 + 1; Y < R % 2019; Y++) {
if ((X * Y) % 2019 < M) {
M = (X * Y) % 2019;
J = true;
}
}
}
if (J == true) {
cout << M << endl;
}
} else {
cout << 0 << endl;
J = true;
}
if (L + 1 == R && J == false) {
cout << ((L % 2019) * (R % 2019)) % 2019 << endl;
}
}
| #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 <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true; // v を訪問済にする
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v])
continue; // next_v が探索済だったらスルー
dfs(G, next_v); // 再帰的に探索
}
}
signed main() {
int L, R;
cin >> L >> R;
int M = 2019;
bool J = false;
if (L / 2019 == R / 2019 && L % 2019 != 0) {
for (int X = L % 2019; X < R % 2019; X++) {
for (int Y = L % 2019 + 1; Y <= R % 2019; Y++) {
if ((X * Y) % 2019 < M) {
M = (X * Y) % 2019;
J = true;
}
}
}
if (J == true) {
cout << M << endl;
}
} else {
cout << 0 << endl;
J = true;
}
if (L + 1 == R && J == false) {
cout << ((L % 2019) * (R % 2019)) % 2019 << endl;
}
}
| [
"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 <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true; // v を訪問済にする
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v])
continue; // next_v が探索済だったらスルー
dfs(G, next_v); // 再帰的に探索
}
}
signed main() {
int L, R;
cin >> L >> R;
int M = 2019;
bool J = false;
if (L / 2019 == R / 2019 && L % 2019 != 0) {
for (int X = L % 2019; X < R % 2019 - 1; X++) {
for (int Y = L % 2019 + 1; Y < R % 2019; Y++) {
if ((X * Y) % 2019 < M) {
M = (X * Y) % 2019;
J = true;
}
}
}
if (J == true) {
cout << M << endl;
}
} else {
cout << 0 << endl;
J = true;
}
if (L + 1 == R && J == false) {
cout << ((L % 2019) * (R % 2019)) % 2019 << endl;
}
} | #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 <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true; // v を訪問済にする
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v])
continue; // next_v が探索済だったらスルー
dfs(G, next_v); // 再帰的に探索
}
}
signed main() {
int L, R;
cin >> L >> R;
int M = 2019;
bool J = false;
if (L / 2019 == R / 2019 && L % 2019 != 0) {
for (int X = L % 2019; X < R % 2019; X++) {
for (int Y = L % 2019 + 1; Y <= R % 2019; Y++) {
if ((X * Y) % 2019 < M) {
M = (X * Y) % 2019;
J = true;
}
}
}
if (J == true) {
cout << M << endl;
}
} else {
cout << 0 << endl;
J = true;
}
if (L + 1 == R && J == false) {
cout << ((L % 2019) * (R % 2019)) % 2019 << endl;
}
}
| [
"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 + 1; j <= r; j++) {
ll di = i % 2019;
ll dj = j % 2019;
ll res = (di * dj) % 2019;
ans = min(ans, res);
}
}
cout << ans << endl;
}
| #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; j <= r; j++) {
ll di = i % 2019;
ll dj = j % 2019;
ll res = (di * dj) % 2019;
ans = min(ans, res);
}
}
cout << ans << endl;
}
| [
"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 + 1; j <= r; j++) {
int di = i % 2019;
int dj = j % 2019;
ll res = (di * dj) % 2019;
ans = min(ans, res);
}
}
cout << ans << endl;
}
| #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; j <= r; j++) {
ll di = i % 2019;
ll dj = j % 2019;
ll res = (di * dj) % 2019;
ans = min(ans, res);
}
}
cout << ans << endl;
}
| [
"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(); i++) {
for (int j = i + 1; j < v.size(); j++) {
ans = min(ans, v[i] * v[j]);
}
}
cout << ans;
} | #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(); i++) {
for (int j = i + 1; j < v.size(); j++) {
ans = min(ans, (v[i] * v[j]) % 2019);
}
}
cout << ans;
} | [
"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 = l; i <= r; i++) {
if (i % 2019 == 0) {
ans = 0;
break;
}
for (int j = i % 2019; j < r % 2019; j++) {
ans = min((i % 2019 * j % 2019) % 2019, ans);
}
if (cnt == 2019)
break;
cnt++;
}
cout << ans << endl;
return 0;
} | #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 = l; i <= r; i++) {
if (i % 2019 == 0) {
ans = 0;
break;
}
for (int j = i % 2019 + 1; j <= r % 2019; j++) {
ans = min((i % 2019 * j % 2019) % 2019, ans);
}
if (cnt == 2019)
break;
cnt++;
}
cout << ans << endl;
return 0;
} | [
"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_prime(int a) {
if (a <= 1)
return false;
for (int i = 2; (int64_t)i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
int get_adp(double x, int n) {
return (int)round((x - (int)x) * pow(10, n)) % 10;
} // 小数点以下の指定桁の値を取得
int64_t sigma(int64_t s, int64_t n) { return n * (2 * s + n - 1) / 2; }
//順列の全列挙
// vector<int> v(N);
// iota(v.begin(), v.end(), 1); // v に 1, 2, ... N を設定
// do {
// for(auto x : v) cout << x << " "; cout << "\n"; // v の要素を表示
// } while( next_permutation(v.begin(), v.end()) );
// bit全探索
// for (int tmp = 0; tmp < (1 << ビット数); tmp++) {
// bitset<ビット数> s(tmp);
// // (ビット列sに対する処理)
// }
int main() {
int l, r, ans = 2018;
cin >> l >> r;
if (l - r >= 2019)
ans = 0;
l %= 2019;
r %= 2019;
if (r <= l)
ans = 0;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++)
ans = min(ans, (i * j) % 2019);
}
cout << ans << endl;
}
| #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_prime(int a) {
if (a <= 1)
return false;
for (int i = 2; (int64_t)i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
int get_adp(double x, int n) {
return (int)round((x - (int)x) * pow(10, n)) % 10;
} // 小数点以下の指定桁の値を取得
int64_t sigma(int64_t s, int64_t n) { return n * (2 * s + n - 1) / 2; }
//順列の全列挙
// vector<int> v(N);
// iota(v.begin(), v.end(), 1); // v に 1, 2, ... N を設定
// do {
// for(auto x : v) cout << x << " "; cout << "\n"; // v の要素を表示
// } while( next_permutation(v.begin(), v.end()) );
// bit全探索
// for (int tmp = 0; tmp < (1 << ビット数); tmp++) {
// bitset<ビット数> s(tmp);
// // (ビット列sに対する処理)
// }
int main() {
int l, r, ans = 2018;
cin >> l >> r;
if (r - l >= 2019)
ans = 0;
l %= 2019;
r %= 2019;
if (r <= l)
ans = 0;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++)
ans = min(ans, (i * j) % 2019);
}
cout << ans << endl;
}
| [
"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++) {
m = min(((i % mod) * (j % mod)) % mod, m);
}
cout << m << endl;
}
| #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++) {
m = min(((i % mod) * (j % mod)) % mod, m);
}
cout << m << endl;
}
| [
"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>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 1e9;
const double EPS = 1e-9;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int bitCount(long bits) {
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r;
int ans;
cin >> l >> r;
if (r - l + 1 >= 2019) {
ans = 0;
} else {
ans = 2020;
FOR(i, l, r) {
FOR(j, i + 1, r + 1) {
int tmp = (i % 2019) * (j % 2019);
ans = min(ans, tmp);
}
}
}
cout << ans << '\n';
return 0;
}
| #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>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 1e9;
const double EPS = 1e-9;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int bitCount(long bits) {
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r;
int ans;
cin >> l >> r;
if (r - l + 1 >= 2019) {
ans = 0;
} else {
ans = 2020;
FOR(i, l, r) {
FOR(j, i + 1, r + 1) {
int tmp = (i % 2019) * (j % 2019);
ans = min(ans, tmp % 2019);
}
}
}
cout << ans << '\n';
return 0;
}
| [
"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)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2019;
for (ll i = L; i - L < 2019 && i <= R; i++) {
for (ll j = i + 1; j - i < 2019 && j <= R; j++) {
chmin(ans, (i % 2019) * (j % 2019));
}
}
cout << ans << endl;
return 0;
} | #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)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2019;
for (ll i = L; i - L < 2019 && i <= R; i++) {
for (ll j = i + 1; j - i < 2019 && j <= R; j++) {
chmin(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
return 0;
} | [
"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 <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int mod1 = 2019;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4017);
ll ans = 2020;
for (ll i = l; l < r; l++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
} | #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 <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int mod1 = 2019;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4037);
ll ans = 2018;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
}
| [
"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 T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll 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 t = (l * r) % 2019;
ans = min(ans, t);
}
}
cout << ans << endl;
} | #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 T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
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 t = (i * j) % 2019;
ans = min(ans, t);
}
}
cout << ans << endl;
} | [
"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);
}
}
cout << ans << endl;
return 0;
}
| #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);
}
}
cout << ans << endl;
return 0;
}
| [
"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);
}
}
cout << ans << endl;
return 0;
}
| #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);
}
}
cout << ans << endl;
return 0;
}
| [
"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 long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s)-1; (i) >= 0; --(i))
#define all(x) x.begin(), x.end()
#pragma region UnionFind
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
#pragma endregion
#pragma region GCD
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
#pragma endregion
#pragma region chmin
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main() {
int l, r;
cin >> l >> r;
if (r - l + 1 >= 2019 || l == 0)
cout << 0 << endl;
else {
int res = 1e7;
for (int i = l; i < r; ++i) {
for (int j = i + 1; j <= r; ++j) {
chmin(res, (i % 2019) * (j % 2019));
}
}
cout << res << endl;
}
} | #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 long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s)-1; (i) >= 0; --(i))
#define all(x) x.begin(), x.end()
#pragma region UnionFind
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
#pragma endregion
#pragma region GCD
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
#pragma endregion
#pragma region chmin
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main() {
int l, r;
cin >> l >> r;
if (r - l + 1 >= 2019 || l == 0)
cout << 0 << endl;
else {
int res = 1e7;
for (int i = l; i < r; ++i) {
for (int j = i + 1; j <= r; ++j) {
chmin(res, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << res << endl;
}
} | [
"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 < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define PI 3.14159265359
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(int a, int b) { return (long long)a * b / gcd(a, b); }
int main() {
long long L, R;
cin >> L >> R;
long long ans = 2018;
if (R - L > 2020) {
cout << 0 << endl;
}
else {
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long a = (i * j) % 2019;
ans = min(ans, a);
}
}
}
cout << ans << endl;
} | #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 < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define PI 3.14159265359
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(int a, int b) { return (long long)a * b / gcd(a, b); }
int main() {
long long L, R;
cin >> L >> R;
long long ans = 2018;
if (R - L > 2020) {
cout << 0 << endl;
}
else {
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long a = (i * j) % 2019;
ans = min(ans, a);
}
}
cout << ans << endl;
}
} | [] | 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 < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define PI 3.14159265359
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(int a, int b) { return (long long)a * b / gcd(a, b); }
int main() {
long long L, R;
cin >> L >> R;
long long ans = 2020;
if (R - L > 2018) {
cout << 0 << endl;
}
else {
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long a = (i * j) % 2019;
ans = min(ans, a);
}
}
}
cout << ans << endl;
} | #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 < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define PI 3.14159265359
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(int a, int b) { return (long long)a * b / gcd(a, b); }
int main() {
long long L, R;
cin >> L >> R;
long long ans = 2018;
if (R - L > 2020) {
cout << 0 << endl;
}
else {
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long a = (i * j) % 2019;
ans = min(ans, a);
}
}
cout << ans << endl;
}
} | [
"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() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define mset multiset
#define pqueue priority_queue
#define umap unordered_map
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const double PI = acos(-1), eps = 1e-9;
const int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
const int N = 3e5 + 5, mod = 2019, inf = 1e9;
void solve() {
ll l, r;
cin >> l >> r;
if (r - l >= 5000) {
cout << 0;
return;
}
ll ans = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
ll x = i * j;
ans = min(ans, x % mod);
}
}
cout << ans;
}
int main() {
Speed();
int T = 1;
// cin>>T;
while (T--)
solve();
}
| #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() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define mset multiset
#define pqueue priority_queue
#define umap unordered_map
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const double PI = acos(-1), eps = 1e-9;
const int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
const int N = 3e5 + 5, mod = 2019, inf = 1e9;
void solve() {
ll l, r;
cin >> l >> r;
if (r - l + 1 >= 5000) {
cout << 0;
return;
}
ll ans = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll x = i * j;
ans = min(ans, x % mod);
}
}
cout << ans;
}
int main() {
Speed();
int T = 1;
// cin>>T;
while (T--)
solve();
}
| [
"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 << ans << endl;
}
| #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 << endl;
}
| [
"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) {
ans = 0;
} else {
rep(i, m - n) {
for (int j = i + 1; j < m - n; j++) {
ans = min(ans, (((n + i) % 2019) * ((n + j) % 2019) % 2019));
}
}
}
cout << ans << endl;
return 0;
} | #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) {
ans = 0;
} else {
rep(i, m - n) {
for (int j = i + 1; j < m - n + 1; j++) {
ans = min(ans, (((n + i) % 2019) * ((n + j) % 2019) % 2019));
}
}
}
cout << ans << endl;
return 0;
} | [
"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> 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) {
a = b;
return true;
}
return false;
}
void coY() { cout << "Yes" << endl; }
void coN() { cout << "No" << endl; }
const ll INF = 1LL << 60;
const int mod = 1e9 + 7;
// Write From this Line
int main() {
int l, r;
cin >> l >> r;
if (l / 2019 != r / 2019) {
puts("0");
return 0;
}
l %= 2019, r %= 2019;
int ans = 2020;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
int tmp = (i * j) % 2019;
chmin(ans, tmp);
}
}
cout << ans << endl;
}
| #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> 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) {
a = b;
return true;
}
return false;
}
void coY() { cout << "Yes" << endl; }
void coN() { cout << "No" << endl; }
const ll INF = 1LL << 60;
const int mod = 1e9 + 7;
// Write From this Line
int main() {
int l, r;
cin >> l >> r;
if (l / 2019 != r / 2019) {
puts("0");
return 0;
}
l %= 2019, r %= 2019;
int ans = 2020;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
int tmp = (i * j) % 2019;
chmin(ans, tmp);
}
}
cout << ans << endl;
}
| [
"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 i = a; i < b - 1; i++) {
for (int j = i + 1; j < b; j++) {
if (((i % 2019) * (j % 2019)) % 2019 < min)
min = ((i % 2019) * (j % 2019)) % 2019;
}
}
}
cout << min << endl;
}
| #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 i = a; i < b; i++) {
for (int j = i + 1; j < b + 1; j++) {
if (((i % 2019) * (j % 2019)) % 2019 < min)
min = ((i % 2019) * (j % 2019)) % 2019;
}
}
}
cout << min << endl;
}
| [
"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 = now;
j++;
}
i++;
}
cout << min << endl;
}
| #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 < min)
min = now;
j++;
}
i++;
}
cout << min << endl;
}
| [
"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++) {
for (ll j = i; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
} |
#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++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
} | [
"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++) {
for (ll j = i; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
} |
#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++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
} | [
"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;
// REPEAT
// ----------------------------------------
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) \
;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) { \
cout << (a)[i] << " "; \
} \
cout << endl;
// UTIL
// ----------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
// DEBUG
// ----------------------------------------
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T> void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) { cout << i << ":" << v[i] << " "; }
cout << endl;
#else
(void)v;
#endif
}
// BIT FLAG
// ----------------------------------------
const unsigned int BIT_FLAG_0 = (1 << 0); // 0000 0000 0000 0001
const unsigned int BIT_FLAG_1 = (1 << 1); // 0000 0000 0000 0010
const unsigned int BIT_FLAG_2 = (1 << 2); // 0000 0000 0000 0100
const unsigned int BIT_FLAG_3 = (1 << 3); // 0000 0000 0000 1000
const unsigned int BIT_FLAG_4 = (1 << 4); // 0000 0000 0001 0000
const unsigned int BIT_FLAG_5 = (1 << 5); // 0000 0000 0010 0000
const unsigned int BIT_FLAG_6 = (1 << 6); // 0000 0000 0100 0000
const unsigned int BIT_FLAG_7 = (1 << 7); // 0000 0000 1000 0000
const unsigned int BIT_FLAG_8 = (1 << 8); // 0000 0001 0000 0000
const unsigned int BIT_FLAG_9 = (1 << 9); // 0000 0010 0000 0000
const unsigned int BIT_FLAG_10 = (1 << 10); // 0000 0100 0000 0000
const unsigned int BIT_FLAG_11 = (1 << 11); // 0000 1000 0000 0000
// CONST
// ----------------------------------------
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.14159265358979323846; // or M_PI
constexpr int MOD = 1000000007;
void Main() {
ll l, r;
cin >> l >> r;
const ll mod = 2019;
ll ans = INF;
ll ir = min(r, l + mod - 1);
FOR(i, l, ir) {
ll jr = min(r, i + mod);
FOR(j, i + 1, jr) {
ans = min((i % mod) * (j % mod), ans);
// ans = min((i * j) % mod, ans);
}
}
COUT(ans);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
/*
5 2
3 1 2 5
2 2 3
1 0
*/
| #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;
// REPEAT
// ----------------------------------------
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) \
;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) { \
cout << (a)[i] << " "; \
} \
cout << endl;
// UTIL
// ----------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
// DEBUG
// ----------------------------------------
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T> void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) { cout << i << ":" << v[i] << " "; }
cout << endl;
#else
(void)v;
#endif
}
// BIT FLAG
// ----------------------------------------
const unsigned int BIT_FLAG_0 = (1 << 0); // 0000 0000 0000 0001
const unsigned int BIT_FLAG_1 = (1 << 1); // 0000 0000 0000 0010
const unsigned int BIT_FLAG_2 = (1 << 2); // 0000 0000 0000 0100
const unsigned int BIT_FLAG_3 = (1 << 3); // 0000 0000 0000 1000
const unsigned int BIT_FLAG_4 = (1 << 4); // 0000 0000 0001 0000
const unsigned int BIT_FLAG_5 = (1 << 5); // 0000 0000 0010 0000
const unsigned int BIT_FLAG_6 = (1 << 6); // 0000 0000 0100 0000
const unsigned int BIT_FLAG_7 = (1 << 7); // 0000 0000 1000 0000
const unsigned int BIT_FLAG_8 = (1 << 8); // 0000 0001 0000 0000
const unsigned int BIT_FLAG_9 = (1 << 9); // 0000 0010 0000 0000
const unsigned int BIT_FLAG_10 = (1 << 10); // 0000 0100 0000 0000
const unsigned int BIT_FLAG_11 = (1 << 11); // 0000 1000 0000 0000
// CONST
// ----------------------------------------
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.14159265358979323846; // or M_PI
constexpr int MOD = 1000000007;
void Main() {
ll l, r;
cin >> l >> r;
const ll mod = 2019;
ll ans = INF;
ll ir = min(r, l + mod - 1);
FOR(i, l, ir) {
ll jr = min(r, i + mod);
FOR(j, i + 1, jr) {
ans = min(((i % mod) * (j % mod)) % mod, ans);
// ans = min((i * j) % mod, ans);
}
}
COUT(ans);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
/*
5 2
3 1 2 5
2 2 3
1 0
*/
| [
"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;
// REPEAT
// ----------------------------------------
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) \
;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) { \
cout << (a)[i] << " "; \
} \
cout << endl;
// UTIL
// ----------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
// DEBUG
// ----------------------------------------
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T> void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) { cout << i << ":" << v[i] << " "; }
cout << endl;
#else
(void)v;
#endif
}
// BIT FLAG
// ----------------------------------------
const unsigned int BIT_FLAG_0 = (1 << 0); // 0000 0000 0000 0001
const unsigned int BIT_FLAG_1 = (1 << 1); // 0000 0000 0000 0010
const unsigned int BIT_FLAG_2 = (1 << 2); // 0000 0000 0000 0100
const unsigned int BIT_FLAG_3 = (1 << 3); // 0000 0000 0000 1000
const unsigned int BIT_FLAG_4 = (1 << 4); // 0000 0000 0001 0000
const unsigned int BIT_FLAG_5 = (1 << 5); // 0000 0000 0010 0000
const unsigned int BIT_FLAG_6 = (1 << 6); // 0000 0000 0100 0000
const unsigned int BIT_FLAG_7 = (1 << 7); // 0000 0000 1000 0000
const unsigned int BIT_FLAG_8 = (1 << 8); // 0000 0001 0000 0000
const unsigned int BIT_FLAG_9 = (1 << 9); // 0000 0010 0000 0000
const unsigned int BIT_FLAG_10 = (1 << 10); // 0000 0100 0000 0000
const unsigned int BIT_FLAG_11 = (1 << 11); // 0000 1000 0000 0000
// CONST
// ----------------------------------------
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.14159265358979323846; // or M_PI
constexpr int MOD = 1000000007;
void Main() {
ll l, r;
cin >> l >> r;
const ll mod = 2019;
ll ans = INF;
ll ir = min(r, l + mod - 1);
FOR(i, l, ir) {
ll jr = min(r, i + mod - 1);
FOR(j, i + 1, jr) {
ans = min((i % mod) * (j % mod), ans);
// ans = min((i * j) % mod, ans);
}
}
COUT(ans);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
/*
5 2
3 1 2 5
2 2 3
1 0
*/
| #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;
// REPEAT
// ----------------------------------------
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) \
;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) { \
cout << (a)[i] << " "; \
} \
cout << endl;
// UTIL
// ----------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
// DEBUG
// ----------------------------------------
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T> void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) { cout << i << ":" << v[i] << " "; }
cout << endl;
#else
(void)v;
#endif
}
// BIT FLAG
// ----------------------------------------
const unsigned int BIT_FLAG_0 = (1 << 0); // 0000 0000 0000 0001
const unsigned int BIT_FLAG_1 = (1 << 1); // 0000 0000 0000 0010
const unsigned int BIT_FLAG_2 = (1 << 2); // 0000 0000 0000 0100
const unsigned int BIT_FLAG_3 = (1 << 3); // 0000 0000 0000 1000
const unsigned int BIT_FLAG_4 = (1 << 4); // 0000 0000 0001 0000
const unsigned int BIT_FLAG_5 = (1 << 5); // 0000 0000 0010 0000
const unsigned int BIT_FLAG_6 = (1 << 6); // 0000 0000 0100 0000
const unsigned int BIT_FLAG_7 = (1 << 7); // 0000 0000 1000 0000
const unsigned int BIT_FLAG_8 = (1 << 8); // 0000 0001 0000 0000
const unsigned int BIT_FLAG_9 = (1 << 9); // 0000 0010 0000 0000
const unsigned int BIT_FLAG_10 = (1 << 10); // 0000 0100 0000 0000
const unsigned int BIT_FLAG_11 = (1 << 11); // 0000 1000 0000 0000
// CONST
// ----------------------------------------
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.14159265358979323846; // or M_PI
constexpr int MOD = 1000000007;
void Main() {
ll l, r;
cin >> l >> r;
const ll mod = 2019;
ll ans = INF;
ll ir = min(r, l + mod - 1);
FOR(i, l, ir) {
ll jr = min(r, i + mod);
FOR(j, i + 1, jr) {
ans = min(((i % mod) * (j % mod)) % mod, ans);
// ans = min((i * j) % mod, ans);
}
}
COUT(ans);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
/*
5 2
3 1 2 5
2 2 3
1 0
*/
| [
"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 = i / 2019;
// sa1 = i - 2019 * syou;
// sa2 = 2019 - i + 2019 * syou;
// if (sa1 < sa2) {
// if (min > sa1) {
// min = sa1;
// }
//}
// else {
// if (min > sa2) {
// min = sa2;
// }
//}
}
if (wareru) {
cout << 0 << endl;
return 0;
}
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
int x = L % 2019;
int y = R % 2019;
int syou = (x * y) % 2019;
if (syou < min)
min = syou;
}
}
cout << min << endl;
return 0;
}
| // 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 = i / 2019;
// sa1 = i - 2019 * syou;
// sa2 = 2019 - i + 2019 * syou;
// if (sa1 < sa2) {
// if (min > sa1) {
// min = sa1;
// }
//}
// else {
// if (min > sa2) {
// min = sa2;
// }
//}
}
if (wareru) {
cout << 0 << endl;
return 0;
}
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
int x = i % 2019;
int y = j % 2019;
int syou = (x * y) % 2019;
if (syou < min)
min = syou;
}
}
cout << min << endl;
return 0;
}
| [
"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 = i / 2019;
// sa1 = i - 2019 * syou;
// sa2 = 2019 - i + 2019 * syou;
// if (sa1 < sa2) {
// if (min > sa1) {
// min = sa1;
// }
//}
// else {
// if (min > sa2) {
// min = sa2;
// }
//}
}
if (wareru) {
cout << 0 << endl;
return 0;
}
for (int i = L; i < R; i++) {
for (int j = L + 1; j <= R; j++) {
int x = L % 2019;
int y = R % 2019;
int syou = (x * y) % 2019;
if (syou < min)
min = syou;
}
}
cout << min << endl;
return 0;
}
| // 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 = i / 2019;
// sa1 = i - 2019 * syou;
// sa2 = 2019 - i + 2019 * syou;
// if (sa1 < sa2) {
// if (min > sa1) {
// min = sa1;
// }
//}
// else {
// if (min > sa2) {
// min = sa2;
// }
//}
}
if (wareru) {
cout << 0 << endl;
return 0;
}
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
int x = i % 2019;
int y = j % 2019;
int syou = (x * y) % 2019;
if (syou < min)
min = syou;
}
}
cout << min << endl;
return 0;
}
| [
"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 &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) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
ll L, R;
cin >> L >> R;
if (R - L < 2019) {
ll ans = 2021;
for (int i = L; i <= R; ++i) {
for (int k = L + 1; k <= R; ++k) {
ll tmp = (i * k) % 2019;
if (ans > tmp)
ans = tmp;
}
}
cout << ans << endl;
} else {
cout << 0 << endl;
}
} | #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 &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) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
ll L, R;
cin >> L >> R;
if (R - L < 2019) {
ll ans = 2018;
for (ll i = L; i <= R; ++i) {
for (ll k = i + 1; k <= R; ++k) {
ll tmp = (i * k) % 2019;
if (ans > tmp)
ans = tmp;
}
}
cout << ans << endl;
} else {
cout << 0 << endl;
}
} | [
"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(m, i * j % 2019);
}
cout << m << endl;
}
} | #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(m, i * j % 2019);
}
cout << m << endl;
}
} | [
"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++;
if (jcnt == 2020)
break;
}
icnt++;
if (icnt == 2020)
break;
}
cout << ans << endl;
} | #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++;
if (jcnt == 2020)
break;
}
icnt++;
if (icnt == 2020)
break;
}
cout << ans << endl;
} | [
"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++;
if (jcnt == 2019)
break;
}
icnt++;
if (icnt == 2019)
break;
}
cout << ans << endl;
} | #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++;
if (jcnt == 2020)
break;
}
icnt++;
if (icnt == 2020)
break;
}
cout << ans << endl;
} | [
"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 % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return 0;
} | #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 % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return 0;
} | [
"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(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (auto v : vec)
os << v << ' ';
os << '\n';
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << '(' << pa.first << ',' << pa.second << ')';
return os;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
void solve() {
ll l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return;
}
l %= 2019;
r %= 2019;
if (r <= l)
r += 2019;
ll ans = LINF;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
chmin(ans, 1LL * i * j % 2019);
}
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #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(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (auto v : vec)
os << v << ' ';
os << '\n';
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << '(' << pa.first << ',' << pa.second << ')';
return os;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
void solve() {
ll l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return;
}
l %= 2019;
r %= 2019;
if (r <= l)
r += 2019;
ll ans = LINF;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
chmin(ans, 1LL * i * j % 2019);
}
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| [
"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 >= 2019) {
cout << 0 << endl;
return 0;
}
int mi = 2020;
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
mi = min(mi, (i % 2019) * (j % 2019));
}
}
cout << mi << endl;
}
| #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 >= 2019) {
cout << 0 << endl;
return 0;
}
int mi = 2020;
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
mi = min(mi, (i % 2019) * (j % 2019) % 2019);
}
}
cout << mi << endl;
}
| [
"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 (int64_t i = L; i < R; i++) {
for (int64_t j = i + 1; j <= R; j++) {
int64_t n = (i % 2019) * (j % 2019);
ret = min(ret, n);
}
}
} else {
ret = 0;
}
cout << ret << endl;
} | #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 (int64_t i = L; i < R; i++) {
for (int64_t j = i + 1; j <= R; j++) {
int64_t n = (i % 2019) * (j % 2019) % 2019;
ret = min(ret, n);
}
}
} else {
ret = 0;
}
cout << ret << endl;
} | [
"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) {
cout << 0;
} else {
for (int i = p; i <= q - 1; i++) {
for (int j = i + 1; j <= q; j++) {
t = (i * j) % 2019;
if (min > t) {
t = min;
}
}
}
cout << min;
}
} | #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) {
cout << 0;
} else {
for (int i = p; i <= q - 1; i++) {
for (int j = i + 1; j <= q; j++) {
t = (i * j) % 2019;
if (min > t) {
min = t;
}
}
}
cout << min;
}
} | [
"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) {
cout << 0;
} else {
for (int i = p; i <= q - 1; i++) {
for (int j = i + 1; j <= q; j++) {
t = (i * j) % 2019;
if (min > t) {
t = min;
}
}
}
cout << min;
}
} | #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) {
cout << 0;
} else {
for (int i = p; i <= q - 1; i++) {
for (int j = i + 1; j <= q; j++) {
t = (i * j) % 2019;
if (min > t) {
min = t;
}
}
}
cout << min;
}
} | [
"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::endl;
return 0;
} | #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 << min << std::endl;
return 0;
} | [
"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.