problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02983 | #include <bits/stdc++.h>
using namespace std;
using pp = pair<int, int>;
using ll = long long;
int main() {
ll L, R, mod = 2019;
cin >> L >> R;
ll m = 10000;
if (R - L >= 2019) {
cout << 0 << endl;
} else {
L = L - L / mod * mod;
R = R - L / mod * mod;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
ll n = i * j;
m = min(m, n - n / mod * mod);
}
}
cout << m << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using pp = pair<int, int>;
using ll = long long;
int main() {
ll L, R, mod = 2019;
cin >> L >> R;
ll m = 10000;
if (R - L >= 2019) {
cout << 0 << endl;
} else {
R = R - L / mod * mod;
L = L - L / mod * mod;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
ll n = i * j;
m = min(m, n - n / mod * mod);
}
}
cout << m << endl;
}
} | [
"assignment.add"
] | 788,474 | 788,475 | u927463074 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int l, r;
cin >> l >> r;
int g = r - l;
l %= 2019;
r %= 2019;
int ans = 2020;
int m = 2020;
if (l < r)
FOR(i, l, r) FOR(j, i + 1, r) ans = min(ans, (i * j) % 2019);
else
ans = 0;
if (g >= 2019)
ans = 0;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int l, r;
cin >> l >> r;
int g = r - l;
l %= 2019;
r %= 2019;
int ans = 2020;
int m = 2020;
if (l < r)
FOR(i, l, r) FOR(j, i + 1, r + 1) ans = min(ans, (i * j) % 2019);
else
ans = 0;
if (g >= 2019)
ans = 0;
cout << ans << endl;
} | [
"assignment.change"
] | 788,480 | 788,481 | u785578220 | cpp |
p02983 | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> using numr = std::numeric_limits<T>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const ll LLINF = 1e16;
const int mod = 1000000007;
const int mod2 = 998244353;
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
std::cerr << " " << head;
debug_impl(tail...);
}
#if DEBUG
#define debug(...) \
do { \
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
std::cerr << std::noboolalpha; \
} while (false)
#else
#define debug(...) \
{}
#endif
template <typename Container, typename Value = typename Container::value_type,
std::enable_if_t<!std::is_same<Container, std::string>::value,
std::nullptr_t> = nullptr>
std::istream &operator>>(std::istream &is, Container &v) {
for (auto &x : v) {
is >> x;
}
return is;
}
template <typename Container, typename Value = typename Container::value_type,
std::enable_if_t<!std::is_same<Container, std::string>::value,
std::nullptr_t> = nullptr>
std::ostream &operator<<(std::ostream &os, Container const &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); it++) {
os << (it != v.begin() ? "," : "") << *it;
}
return os << "}";
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
ll ans = INF;
for (ll i = l; i <= min(r, l + 2019); i++) {
for (ll j = i + 1; j <= min(r, l + 2019); j++) {
ans += min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
} | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> using numr = std::numeric_limits<T>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const ll LLINF = 1e16;
const int mod = 1000000007;
const int mod2 = 998244353;
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
std::cerr << " " << head;
debug_impl(tail...);
}
#if DEBUG
#define debug(...) \
do { \
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
std::cerr << std::noboolalpha; \
} while (false)
#else
#define debug(...) \
{}
#endif
template <typename Container, typename Value = typename Container::value_type,
std::enable_if_t<!std::is_same<Container, std::string>::value,
std::nullptr_t> = nullptr>
std::istream &operator>>(std::istream &is, Container &v) {
for (auto &x : v) {
is >> x;
}
return is;
}
template <typename Container, typename Value = typename Container::value_type,
std::enable_if_t<!std::is_same<Container, std::string>::value,
std::nullptr_t> = nullptr>
std::ostream &operator<<(std::ostream &os, Container const &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); it++) {
os << (it != v.begin() ? "," : "") << *it;
}
return os << "}";
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
ll ans = INF;
for (ll i = l; i <= min(r, l + 2019); i++) {
for (ll j = i + 1; j <= min(r, l + 2019); j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
} | [
"assignment.value.change"
] | 788,485 | 788,486 | u807585808 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
const int MOD = 1000000007;
// void warshall_floyd(int n){
// for(int k=0;k<n;k++){
// for(int i=0;i<n;i++){
// for(int j=0;j<n;j++){
// d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
// }
// }
// }
//}
// ll calc_digit(ll N) {
// ll res = 0;
// while (N) {
// ++res;
// N /= 10;
// }
// return res;
//}
// ll sum_digit(ll N) {
// ll res = 0;
// while (N) {
// res += N % 10;
// N /= 10;
// }
// return res;
//}
int main() {
ll l, r;
cin >> l >> r;
ll ans = 10000;
if (r - l >= 2019) {
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;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
const int MOD = 1000000007;
// void warshall_floyd(int n){
// for(int k=0;k<n;k++){
// for(int i=0;i<n;i++){
// for(int j=0;j<n;j++){
// d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
// }
// }
// }
//}
// ll calc_digit(ll N) {
// ll res = 0;
// while (N) {
// ++res;
// N /= 10;
// }
// return res;
//}
// ll sum_digit(ll N) {
// ll res = 0;
// while (N) {
// res += N % 10;
// N /= 10;
// }
// return res;
//}
int main() {
ll l, r;
cin >> l >> r;
ll ans = 10000;
if (r - l >= 2500) {
cout << 0 << endl;
return 0;
} else {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
}
cout << ans;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 788,494 | 788,493 | u010415482 | cpp |
p02983 | // https://atcoder.jp/contests/abc133/tasks/abc133_c
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define REP(i, n) for (size_t i = 0; i < (n); ++i)
int main() {
constexpr ll mod = 2019;
ll L, R;
cin >> L >> R;
ll d = R - L;
if (d >= 2019) {
printf("0\n");
return 0;
}
ll ans = 2020;
for (ll i = L; i <= R; ++i) {
for (ll j = L + 1; j <= R; ++j) {
ll r = (i * j) % mod;
if (r < 0)
r = (r + mod) % mod;
ans = min(ans, r);
}
}
printf("%lld\n", ans);
return 0;
}
| // https://atcoder.jp/contests/abc133/tasks/abc133_c
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define REP(i, n) for (size_t i = 0; i < (n); ++i)
int main() {
constexpr ll mod = 2019;
ll L, R;
cin >> L >> R;
ll d = R - L;
if (d >= 2019) {
printf("0\n");
return 0;
}
ll ans = 2020;
for (ll i = L; i < R; ++i) {
for (ll j = L + 1; j <= R; ++j) {
ll r = (i * j) % mod;
if (r < 0)
r = (r + mod) % mod;
ans = min(ans, r);
}
}
printf("%lld\n", ans);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,495 | 788,496 | u774438048 | cpp |
p02983 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int L, R, val;
cin >> L >> R;
if (R - L > 4050) {
cout << 1 << endl;
} else {
int ans = INT_MAX;
vector<int> arr;
for (int i = L; i <= R; i++) {
arr.push_back(i % 2019);
}
for (int i = 0; i < arr.size(); i++)
for (int j = 1; j < arr.size(); j++)
ans = min(ans, (arr[i] * arr[j]) % 2019);
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
int main() {
int L, R, val;
cin >> L >> R;
if (R - L > 2020) {
cout << 0 << endl;
} else {
int ans = INT_MAX;
vector<int> arr;
for (int i = L; i <= R; i++) {
arr.push_back(i % 2019);
}
for (int i = 0; i < arr.size(); i++)
for (int j = i + 1; j < arr.size(); j++)
ans = min(ans, (arr[i] * arr[j]) % 2019);
cout << ans << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change",
"control_flow.loop.for.initializer.change"
] | 788,501 | 788,500 | u067694854 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod = 1000000007;
const int MAX_N = 1000; // n の最大値
// nCk を取得
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (double)(n - i);
res /= (double)(k - i);
}
return res;
}
int main() {
ll l, r;
cin >> l >> r;
ll a = 2020;
if (r - l > 2020) {
cout << 0 << endl;
} else {
for (ll i = l; i <= r; i++) {
for (ll k = l; k <= r; k++) {
a = min((i % 2019) * (k % 2019) % 2019, a);
}
}
cout << a << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod = 1000000007;
const int MAX_N = 1000; // n の最大値
// nCk を取得
double nCk(int n, int k) {
double res = 1.0;
for (int i = 0; i < n; i++) {
res *= 0.5;
}
for (int i = 0; i < k; i++) {
res *= (double)(n - i);
res /= (double)(k - i);
}
return res;
}
int main() {
ll l, r;
cin >> l >> r;
ll a = 2020;
if (r - l > 2020) {
cout << 0 << endl;
} else {
for (ll i = l; i <= r; i++) {
for (ll k = i + 1; k <= r; k++) {
a = min((i % 2019) * (k % 2019) % 2019, a);
}
}
cout << a << endl;
}
}
| [
"control_flow.loop.for.initializer.change"
] | 788,506 | 788,507 | u722640678 | cpp |
p02983 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
ll c = 2019;
cin >> l >> r;
ll ans = 0;
if (l - r < c) {
l = l % c;
r = r % c;
if (l < r) {
ans = c;
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++)
ans = min(ans, (i * j) % c);
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
ll c = 2019;
cin >> l >> r;
ll ans = 0;
if (r - l < c) {
l = l % c;
r = r % c;
if (l < r) {
ans = c;
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++)
ans = min(ans, (i * j) % c);
}
}
}
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 788,516 | 788,517 | u012298376 | cpp |
p02983 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
ll c = 2019;
cin >> l >> r;
ll ans = 0;
if (l - r < c) {
l = l % c;
r = r % c;
if (l < r) {
ans = c;
for (int i = l; i < r - 1; i++) {
for (int j = i + 1; j < r; j++)
ans = min(ans, (i * j) % c);
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll l, r;
ll c = 2019;
cin >> l >> r;
ll ans = 0;
if (r - l < c) {
l = l % c;
r = r % c;
if (l < r) {
ans = c;
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++)
ans = min(ans, (i * j) % c);
}
}
}
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 788,518 | 788,517 | u012298376 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int l, r, MOD = 2019, min = 50000000000, i, j;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if (min > (i % MOD) * (j % MOD)) {
min = (i % MOD) * (j % MOD) % MOD;
}
if (min == 0) {
cout << min << endl;
return 0;
break;
}
}
}
cout << min << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int l, r, MOD = 2019, min = 50000000000, i, j;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if (min > (i % MOD) * (j % MOD) % MOD) {
min = (i % MOD) * (j % MOD) % MOD;
}
if (min == 0) {
cout << min << endl;
return 0;
break;
}
}
}
cout << min << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 788,531 | 788,532 | u806320475 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int l, r, MOD = 2019, min = 50000000000, i, j;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if (min > (i % MOD) * (j % MOD)) {
min = (i % MOD) * (j % MOD);
}
if (min == 0) {
cout << min << endl;
return 0;
break;
}
}
}
cout << min << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int l, r, MOD = 2019, min = 50000000000, i, j;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if (min > (i % MOD) * (j % MOD) % MOD) {
min = (i % MOD) * (j % MOD) % MOD;
}
if (min == 0) {
cout << min << endl;
return 0;
break;
}
}
}
cout << min << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 788,533 | 788,532 | u806320475 | cpp |
p02983 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019)
cout << 0;
else {
int mini = 2020 * 2020;
repi(i, l, r) {
repi(j, i + 1, r + 1) mini =
min(mini, ((i % 2019) * ((i + 1) % 2019)) % 2019);
}
cout << mini;
}
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019)
cout << 0;
else {
int mini = 2020 * 2020;
repi(i, l, r) {
repi(j, i + 1, r + 1) mini = min(mini, ((i % 2019) * (j % 2019)) % 2019);
}
cout << mini;
}
} | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 788,543 | 788,544 | u151236434 | cpp |
p02983 | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = a; i > n; i--)
#define lrep(i, a, n) for (long int i = a; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
int main() {
long int L, R;
int ans = 3000;
int cnt = 0;
long int mem = -1;
cin >> L >> R;
lrep(i, L, R) lrep(j, i + 1, R + 1) {
int tmp = ((i * j) % 2019);
ans = min(ans, tmp);
if (mem != tmp) {
cnt++;
mem = tmp;
}
if (cnt == 2019) {
cout << 0 << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = a; i > n; i--)
#define lrep(i, a, n) for (long int i = a; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
int main() {
long int L, R;
int ans = 3000;
int cnt = 0;
long int mem = -1;
cin >> L >> R;
lrep(i, L, R) lrep(j, i + 1, R + 1) {
int tmp = ((i * j) % 2019);
ans = min(ans, tmp);
if (mem != tmp) {
cnt++;
mem = tmp;
}
if (ans == 0) {
cout << 0 << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 788,547 | 788,548 | u829260400 | cpp |
p02983 | #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
unsigned long long l, r;
cin >> l >> r;
unsigned long long mi = INT_MAX, i = 0, j = 0;
if (r / 2019 - l / 2019 != 0)
cout << 0 << endl;
else {
l %= 2019;
r %= 2019;
while (l + i != r) {
j = l + i;
while (j != r) {
j++;
mi = min((l + i) % 2019 * j % 2019 % 2019, mi);
}
i++;
}
}
cout << mi << endl;
}
| #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
unsigned long long l, r;
cin >> l >> r;
unsigned long long mi = INT_MAX, i = 0, j = 0;
if (r / 2019 - l / 2019 != 0)
cout << 0 << endl;
else {
l %= 2019;
r %= 2019;
while (l + i != r) {
j = l + i;
while (j != r) {
j++;
mi = min((l + i) % 2019 * j % 2019 % 2019, mi);
}
i++;
}
cout << mi << endl;
}
}
| [] | 788,550 | 788,551 | u919983664 | cpp |
p02983 | #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
unsigned long long l, r;
cin >> l >> r;
unsigned long long mi = INT_MAX, i = 0, j = 0;
if (r / 2019 - l / 2019 != 0)
cout << 0 << endl;
else {
l %= 2019;
r %= 2019;
while (l + i != r) {
j = l + i;
while (j != r) {
j++;
mi = min((l + i) * j % 2019, mi);
}
i++;
}
}
cout << mi << endl;
}
| #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
unsigned long long l, r;
cin >> l >> r;
unsigned long long mi = INT_MAX, i = 0, j = 0;
if (r / 2019 - l / 2019 != 0)
cout << 0 << endl;
else {
l %= 2019;
r %= 2019;
while (l + i != r) {
j = l + i;
while (j != r) {
j++;
mi = min((l + i) % 2019 * j % 2019 % 2019, mi);
}
i++;
}
cout << mi << endl;
}
}
| [
"assignment.change"
] | 788,552 | 788,551 | u919983664 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, m, n) for (ll i = m; i > n; i--)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x, y) min<ll>(x, y)
#define tmax(x, y, z) lmax((x), lmax((y), (z)))
#define tmin(x, y, z) lmin((x), lmin((y), (z)))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define ZERO(a) memset(a, 0, sizeof(a))
const ll INF = 1LL << 60;
const ll MM = 1000000000;
const ll MOD = MM + 7;
const ll MMM = 9223372036854775807; // 2^63 -1
#define ADD(a, b) a = (a + ll(b)) % MOD
#define MUL(a, b) a = (a * ll(b)) % MOD
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll x, ll y) { return x / GCD(x, y) * y; }
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;
}
template <typename A, size_t N, typename T>
void FILL(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
// struct edge{ ll from, to, cost; };
// struct edge{ ll to, cost; };
// using Graph = vector<vector<ll>>; // 重み無し
// using Graph = vector<edge>; // 辺
// using Graph = vector<vector<edge>>; // 重み付き
ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
ll ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
ll l, r;
cin >> l >> r;
if ((r - l + 1) >= 2019) {
cout << 0 << endl;
return 0;
}
// if(l%2019 > r%2019){
// cout << 0 << endl;
// return 0;
// }
if (l / 2019 != r / 2019) {
cout << 0 << endl;
return 0;
}
ll ans = INF;
Rep(i, l, r) {
Rep(j, i + 1, r + 1) { chmin(ans, l * r % 2019); }
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, m, n) for (ll i = m; i > n; i--)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x, y) min<ll>(x, y)
#define tmax(x, y, z) lmax((x), lmax((y), (z)))
#define tmin(x, y, z) lmin((x), lmin((y), (z)))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define ZERO(a) memset(a, 0, sizeof(a))
const ll INF = 1LL << 60;
const ll MM = 1000000000;
const ll MOD = MM + 7;
const ll MMM = 9223372036854775807; // 2^63 -1
#define ADD(a, b) a = (a + ll(b)) % MOD
#define MUL(a, b) a = (a * ll(b)) % MOD
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll x, ll y) { return x / GCD(x, y) * y; }
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;
}
template <typename A, size_t N, typename T>
void FILL(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
// struct edge{ ll from, to, cost; };
// struct edge{ ll to, cost; };
// using Graph = vector<vector<ll>>; // 重み無し
// using Graph = vector<edge>; // 辺
// using Graph = vector<vector<edge>>; // 重み付き
ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
ll ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
ll l, r;
cin >> l >> r;
if ((r - l + 1) >= 2019) {
cout << 0 << endl;
return 0;
}
// if(l%2019 > r%2019){
// cout << 0 << endl;
// return 0;
// }
if (l / 2019 != r / 2019) {
cout << 0 << endl;
return 0;
}
ll ans = INF;
Rep(i, l, r) {
Rep(j, i + 1, r + 1) { chmin(ans, i * j % 2019); }
}
cout << ans << endl;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 788,563 | 788,564 | u535010493 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r, ans = 2e9;
cin >> l >> r;
if (r - l + 1 <= 2050) {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << '\n';
} else {
cout << 2 << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r, ans = 2e9;
cin >> l >> r;
if (r - l + 1 <= 2019) {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << '\n';
} else {
cout << 0 << '\n';
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 788,565 | 788,566 | u816631826 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int year1, year2;
cin >> year1 >> year2;
int min = 2020;
// 2000 5000
// 2020 4040
// 4038
if (year2 - year1 >= 2019) {
min = 0;
} else {
for (long long int i = year1; i <= year2; i++) {
for (long long int j = year1 + 1; j <= year2; j++) {
int s;
s = (i % 2019) * (j % 2019) % 2019;
if (s < min) {
min = s;
}
}
}
}
cout << min << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int year1, year2;
cin >> year1 >> year2;
int min = 2020;
// 2000 5000
// 2020 4040
// 4038
if (year2 - year1 >= 2019) {
min = 0;
} else {
for (long long int i = year1; i <= year2; i++) {
for (long long int j = i + 1; j <= year2; j++) {
long long int s;
s = ((i % 2019) * (j % 2019)) % 2019;
if (s < min) {
min = s;
}
}
}
}
cout << min << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,569 | 788,570 | u353919145 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
r = min(l + 2019, r);
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
ans = min(ans, (i * 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() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
r = min(l + 2019, r);
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,572 | 788,573 | u005006157 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue> //priority_queue 优先队列
#include <set> //multiset set<int>::reverse_iterator rit; for(rit=s.rbegin();rit!=s.rend();rit++)
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mod 1000000007
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
const db eps = 1e-6;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5 + 5;
using namespace std;
ll t, n, m, x, y, ans;
int main() {
scanf("%lld%lld", &n, &m);
if (m - n >= 2019)
printf("0\n");
else {
ll minn = inf;
for (ll i = n; i < m; i++) {
for (ll j = i + 1; j < m; j++) {
minn = min(minn, ((i % 2019) * (j % 2019)) % 2019);
}
}
printf("%lld\n", minn);
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue> //priority_queue 优先队列
#include <set> //multiset set<int>::reverse_iterator rit; for(rit=s.rbegin();rit!=s.rend();rit++)
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mod 1000000007
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
const db eps = 1e-6;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5 + 5;
using namespace std;
ll t, n, m, x, y, ans;
int main() {
scanf("%lld%lld", &n, &m);
if (m - n >= 2019)
printf("0\n");
else {
ll minn = inf;
for (ll i = n; i < m; i++) {
for (ll j = i + 1; j <= m; j++) {
minn = min(minn, ((i % 2019) * (j % 2019)) % 2019);
}
}
printf("%lld\n", minn);
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 788,580 | 788,581 | u018679195 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
ll L, R;
cin >> L >> R;
/*
ll sa = R - L;
L %= 2019;
R %= 2019;
if (L == 0 || L == 2018) cout << 0 << endl;
else if (sa < 2019 - L) cout << (L * (L + 1)) % 2019 << endl;
else cout << 0 << endl;
*/
int ans = 2018;
R = min(R, L + 4038);
for (ll i = 1; 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)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
ll L, R;
cin >> L >> R;
/*
ll sa = R - L;
L %= 2019;
R %= 2019;
if (L == 0 || L == 2018) cout << 0 << endl;
else if (sa < 2019 - L) cout << (L * (L + 1)) % 2019 << endl;
else cout << 0 << endl;
*/
int ans = 2018;
R = min(R, L + 4038);
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;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 788,586 | 788,587 | u437633151 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll ans = 2018;
bool fin = false;
ll L, R;
cin >> L >> R;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j < R + 1; j++) {
ll mod = (i * j) % 2019;
if (mod < ans)
ans = mod;
if (ans = 0) {
fin = true;
break;
}
}
if (fin)
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll ans = 2018;
bool fin = false;
ll L, R;
cin >> L >> R;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j < R + 1; j++) {
ll mod = (i * j) % 2019;
if (mod < ans)
ans = mod;
if (ans == 0) {
fin = true;
break;
}
}
if (fin)
break;
}
cout << ans << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 788,599 | 788,600 | u678961336 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF (1LL << 60)
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#define SZ(x) ((int)(x).size())
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define pb push_back
int main() {
ll L, R;
cin >> L >> R;
ll m = 2018;
if ((R - L) % 2019 == 0)
_PS(0);
else {
REP(i, L % 2019, L % 2019 + (R - L) % 2019) {
REP(j, i + 1, L % 2019 + (R - L) % 2019 + 1) {
m = MIN((i * j) % 2019, m);
}
}
_PS(m);
}
return 0;
}
/*
*/ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF (1LL << 60)
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#define SZ(x) ((int)(x).size())
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define pb push_back
int main() {
ll L, R;
cin >> L >> R;
ll m = INF;
if ((R - L) >= 2019)
_PS(0);
else {
REP(i, L % 2019, L % 2019 + (R - L) % 2019) {
REP(j, i + 1, L % 2019 + (R - L) % 2019 + 1) {
m = MIN((i * j) % 2019, m);
}
}
_PS(m);
}
return 0;
}
/*
*/ | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 788,612 | 788,613 | u768347697 | cpp |
p02983 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int n, d, k, sa, res = 9999, l, r;
long long int used[100005] = {}, x[11][11];
queue<long long int> qu[100005];
int main() {
const long long int mod = 1000000007, INF = 99999999999999;
map<long long int, long long int> mp;
string str[2005], tmp;
cout << fixed << setprecision(10);
cin >> l >> r;
for (long long int i = l; i <= r; i++) {
if (i % 2019 == 0) {
cout << 0;
return 0;
}
}
for (long long int i = l; i <= r; i++) {
for (long long int j = l + 1; j <= r; j++) {
res = min(res, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << res;
}
| #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int n, d, k, sa, res = 9999, l, r;
long long int used[100005] = {}, x[11][11];
queue<long long int> qu[100005];
int main() {
const long long int mod = 1000000007, INF = 99999999999999;
map<long long int, long long int> mp;
string str[2005], tmp;
cout << fixed << setprecision(10);
cin >> l >> r;
for (long long int i = l; i <= r; i++) {
if (i % 2019 == 0) {
cout << 0;
return 0;
}
}
for (long long int i = l; i <= r; i++) {
for (long long int j = i + 1; j <= r; j++) {
res = min(res, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << res;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,618 | 788,619 | u018872912 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll ans = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = (i * j) % 2019;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll ans = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| [
"call.add",
"call.arguments.change"
] | 788,624 | 788,625 | u850165979 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define intll int long long
#define rep(i, n) for (intll i = 0; i < (int)(n); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
intll l, r;
cin >> l >> r;
intll ans = INF;
for (int i = l; i < min(r, l + 2020); i++) {
for (int j = i + 1; j < min(r, l + 2020); j++) {
intll now = (i % 2019) * (j % 2019) % 2019;
ans = min(ans, now);
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define intll int long long
#define rep(i, n) for (intll i = 0; i < (int)(n); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
intll l, r;
cin >> l >> r;
intll ans = INF;
for (int i = l; i < min(r, l + 2020); i++) {
for (int j = i + 1; j <= min(r, l + 2020); j++) {
intll now = (i % 2019) * (j % 2019) % 2019;
ans = min(ans, now);
}
}
cout << ans;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,634 | 788,635 | u260907804 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll L, R;
cin >> L >> R;
vector<ll> V;
for (ll i = L; i <= R; i++) {
V.push_back(i % 2019);
if (i % 2019 == 0)
break;
}
ll min_value = 2020;
for (int i = 0; i < V.size(); i++) {
for (int j = i + 1; j < V.size(); j++) {
min_value = min((V[i] * V[j]) % 2019, min_value);
}
}
cout << min_value << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll L, R;
cin >> L >> R;
vector<ll> V;
for (ll i = L; i <= R; i++) {
V.push_back(i % 2019);
if (i % 2019 == 0 && i != 0)
break;
}
ll min_value = 2020;
for (int i = 0; i < V.size(); i++) {
for (int j = i + 1; j < V.size(); j++) {
min_value = min((V[i] * V[j]) % 2019, min_value);
}
}
cout << min_value << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 788,642 | 788,643 | u418892821 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define p_q priority_queue
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define MAX 1000000001
int main() {
ll l, r;
cin >> l >> r;
ll len = r - l + 1;
if (len >= 2019) {
cout << 0 << endl;
} else {
ll value;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
value = min(value, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << value << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define p_q priority_queue
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define MAX 1000000001
int main() {
ll l, r;
cin >> l >> r;
ll len = r - l + 1;
if (len >= 2019) {
cout << 0 << endl;
} else {
ll value = 99999999999;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
value = min(value, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << value << endl;
}
} | [
"variable_declaration.value.change"
] | 788,663 | 788,664 | u830237447 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
const int INF = 1000000001;
int R, L;
int ans = INT_MAX;
int main() {
cin >> R >> L;
if (R - L >= 2018) {
ans = 0;
} else {
int r = R % 2019;
int l = L % 2019;
if (r >= l) {
ans = 0;
} else {
for (int i = r; i < l; i++) {
for (int j = i + 1; j <= l; j++) {
ans = min(ans, (i * j) % 2019);
}
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
const int INF = 1000000001;
int R, L;
int ans = INT_MAX;
int main() {
cin >> R >> L;
if (L - R >= 2018) {
ans = 0;
} else {
int r = R % 2019;
int l = L % 2019;
if (r >= l) {
ans = 0;
} else {
for (int i = r; i < l; i++) {
for (int j = i + 1; j <= l; j++) {
ans = min(ans, (i * j) % 2019);
}
}
}
}
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 788,665 | 788,666 | u317379170 | cpp |
p02983 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 2019;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int L, R;
cin >> L >> R;
int diff = L - R;
L %= 2019;
R %= 2019;
if (L == 0 || L + diff >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
rep(i, L, R) {
rep(j, i + 1, R + 1) { ans = min(ans, (i * j) % 2019); }
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 2019;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int L, R;
cin >> L >> R;
int diff = R - L;
L %= 2019;
R %= 2019;
if (L == 0 || L + diff >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
rep(i, L, R) {
rep(j, i + 1, R + 1) { ans = min(ans, (i * j) % 2019); }
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 788,669 | 788,670 | u955627293 | cpp |
p02983 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
typedef long long int ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < signed(n); i++)
#define EREP(i, n) for (int i = 1; i <= signed(n); i++)
#define ALL(a) (a).begin(), (a).end()
using std::abs;
using std::cin;
using std::cout;
using std::endl;
using std::max;
using std::min;
using std::string;
using std::vector;
//#define EVEL 1
#ifdef EVEL
#define DEB(X) cout << #X << ":" << X << " ";
#define TF(f) f ? cout << "true " : cout << "false ";
#define END cout << "\n";
#else
#define DEB(X) \
{}
#define TF(f) \
{}
#define END \
{}
#endif
const int MOD = 1000000007;
const ll INF = 5000000000000;
// typedef std::pair<int, int> P;
struct edge {
int to;
double cost;
};
#define VMAX 1010
ll N, M, K;
ll A, B, C;
ll P[11];
ll ans;
char S[100];
int main() {
cin >> A >> B;
ans = 2019;
for (ll i = A; i <= A + 2019; i++) {
if (i > B)
break;
for (ll j = i; j <= A + 2019; j++) {
if (j > B)
break;
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
typedef long long int ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < signed(n); i++)
#define EREP(i, n) for (int i = 1; i <= signed(n); i++)
#define ALL(a) (a).begin(), (a).end()
using std::abs;
using std::cin;
using std::cout;
using std::endl;
using std::max;
using std::min;
using std::string;
using std::vector;
//#define EVEL 1
#ifdef EVEL
#define DEB(X) cout << #X << ":" << X << " ";
#define TF(f) f ? cout << "true " : cout << "false ";
#define END cout << "\n";
#else
#define DEB(X) \
{}
#define TF(f) \
{}
#define END \
{}
#endif
const int MOD = 1000000007;
const ll INF = 5000000000000;
// typedef std::pair<int, int> P;
struct edge {
int to;
double cost;
};
#define VMAX 1010
ll N, M, K;
ll A, B, C;
ll P[11];
ll ans;
char S[100];
int main() {
cin >> A >> B;
ans = 2019;
for (ll i = A; i <= A + 2019; i++) {
if (i > B)
break;
for (ll j = i + 1; j <= A + 2019; j++) {
if (j > B)
break;
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 788,703 | 788,704 | u549743442 | cpp |
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++)
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2018;
for (int i = L; i < R; i++) {
for (int j = L + 1; j <= R; j++)
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,726 | 788,727 | u868132236 | cpp |
p02983 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数名;
priority_queue<型, vector<型>, greater<型>> 変数名;*/
// copy(v1.begin(), v1.end(), back_inserter(v2));
using namespace std;
int gcd(int a, int b) {
int c;
if (a < b) {
c = a;
a = b;
b = c;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int sort_greater(int m, int n) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
cout << a[i];
}
return 0;
}
int bubblesort(int a[], int n) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = 1;
sw += 1;
}
}
}
return sw;
}
int a_z() {
for (int i = 0; i <= ('Z' - 'A'); i++) {
cout << (char)('A' + i);
}
return 0;
}
int selecttionsort(int a[], int n) {
int t, sw = 0, minj;
for (int i = 0; i < n - 1; i++) {
minj = i;
for (int j = 0; j < n - 1; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
t = a[i];
a[i] = a[minj];
a[minj] = t;
if (i != minj)
sw += 1;
}
return sw;
}
bool is_prime(int x) {
if (x <= 1)
return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
map<string, int> memo;
using P = pair<int, int>;
struct Clock {
int hour, minute, second;
void set(int h, int m, int s) {
hour = h;
minute = m;
second = s;
}
string to_str() {
string h, m, s;
h = to_string(hour);
m = to_string(minute);
s = to_string(second);
if (h.size() < 2)
h = "0" + h;
if (m.size() < 2)
m = "0" + m;
if (s.size() < 2)
s = "0" + s;
return h + ":" + m + ":" + s;
}
void shift(int diff_second) {
int h, m;
h = diff_second / 3600;
m = diff_second / 60;
diff_second %= 60;
second += diff_second;
}
};
/*void dfs(int v, int p = -1) {
for (int u : to[v]) {
if (u == p) continue;
ans[u] += ans[v];
dfs(u, v);
}
}*/
int main() {
// sort(a.begin(),a.end());
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (ll i = 1; 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 <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数名;
priority_queue<型, vector<型>, greater<型>> 変数名;*/
// copy(v1.begin(), v1.end(), back_inserter(v2));
using namespace std;
int gcd(int a, int b) {
int c;
if (a < b) {
c = a;
a = b;
b = c;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int sort_greater(int m, int n) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
cout << a[i];
}
return 0;
}
int bubblesort(int a[], int n) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = 1;
sw += 1;
}
}
}
return sw;
}
int a_z() {
for (int i = 0; i <= ('Z' - 'A'); i++) {
cout << (char)('A' + i);
}
return 0;
}
int selecttionsort(int a[], int n) {
int t, sw = 0, minj;
for (int i = 0; i < n - 1; i++) {
minj = i;
for (int j = 0; j < n - 1; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
t = a[i];
a[i] = a[minj];
a[minj] = t;
if (i != minj)
sw += 1;
}
return sw;
}
bool is_prime(int x) {
if (x <= 1)
return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
map<string, int> memo;
using P = pair<int, int>;
struct Clock {
int hour, minute, second;
void set(int h, int m, int s) {
hour = h;
minute = m;
second = s;
}
string to_str() {
string h, m, s;
h = to_string(hour);
m = to_string(minute);
s = to_string(second);
if (h.size() < 2)
h = "0" + h;
if (m.size() < 2)
m = "0" + m;
if (s.size() < 2)
s = "0" + s;
return h + ":" + m + ":" + s;
}
void shift(int diff_second) {
int h, m;
h = diff_second / 3600;
m = diff_second / 60;
diff_second %= 60;
second += diff_second;
}
};
/*void dfs(int v, int p = -1) {
for (int u : to[v]) {
if (u == p) continue;
ans[u] += ans[v];
dfs(u, v);
}
}*/
int main() {
// sort(a.begin(),a.end());
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;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 788,748 | 788,749 | u545938555 | cpp |
p02983 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define PI 3.141592653
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ(x) ((int)(x).size()) // size() unsigned -> int
#define DescSort(a) sort(a.begin(), a.end(), std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main() {
ll l, r, minv = INF;
cin >> l >> r;
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
ll mod = (i * j) % 2019;
if (mod == 0) {
cout << "0" << endl;
return 0;
} else {
minv = min(minv, mod);
}
}
}
cout << minv << endl;
return 0;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define PI 3.141592653
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ(x) ((int)(x).size()) // size() unsigned -> int
#define DescSort(a) sort(a.begin(), a.end(), std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main() {
ll l, r, minv = INF;
cin >> l >> r;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
ll mod = (i * j) % 2019;
if (mod == 0) {
cout << "0" << endl;
return 0;
} else {
minv = min(minv, mod);
}
}
}
cout << minv << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,752 | 788,753 | u817523595 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (ll) v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
ll MOD = 1e9 + 7;
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll L, R;
cin >> L >> R;
ll ans = 2019;
if (R - L >= 2019)
print(0);
else {
for (ll i = L; i <= R; ++i) {
for (ll j = L; j <= R; ++j) {
if (j > i)
chmin(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
}
print(ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (ll) v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
ll MOD = 1e9 + 7;
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll L, R;
cin >> L >> R;
ll ans = 2019;
if (R - L >= 2019)
ans = 0;
else {
for (ll i = L; i <= R; ++i) {
for (ll j = L; j <= R; ++j) {
if (j > i)
chmin(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
}
print(ans);
return 0;
} | [
"call.arguments.change"
] | 788,756 | 788,757 | u281168735 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (ll) v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
ll MOD = 1e9 + 7;
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll L, R;
cin >> L >> R;
ll ans = 2019;
if (R - L >= 2019)
print(0);
else {
for (ll i = L; i <= R; ++i) {
for (ll j = L; j <= R; ++j) {
if (j > i)
chmin(ans, (i % 2019) * (j % 2019) % 2019);
}
}
}
print(ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (ll) v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
ll MOD = 1e9 + 7;
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll L, R;
cin >> L >> R;
ll ans = 2019;
if (R - L >= 2019)
ans = 0;
else {
for (ll i = L; i <= R; ++i) {
for (ll j = L; j <= R; ++j) {
if (j > i)
chmin(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
}
print(ans);
return 0;
} | [
"call.arguments.change"
] | 788,758 | 788,757 | u281168735 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define SUM(c) accumulate((c).begin(), (c).end(), 0)
#define ALL(a) (a).begin(), (a).end()
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
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();
}
template <class T> T maxt(T x, T y) {
if (x > y)
return x;
else
return y;
}
template <class T> T mint(T x, T y) {
if (x > y)
return y;
else
return x;
}
// sort(v.rbegin(), v.rend(), [](auto& x, auto& y){return x[1] < y[1];});
// cout << fixed << setprecision(10) << ans << defaultfloat << endl;
//小数出力
double print_double(double d) { printf("%.10f", d); }
long long m = 1e9 + 7, mod = 1e9 + 7;
//逆元 a/b の modをとるとき -> a*modinv(b)%mod
long long modinv(long long a, long long m = 1e9 + 7) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
//約数列挙
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
// Union Find
struct UnionFind {
vector<int> par; // 親ノード
vector<int> rank; // ランク
UnionFind(int n = 1) { init(n); }
void init(int n = 1) {
par.resize(n);
rank.resize(n);
for (int i = 0; i < n; ++i)
par[i] = i, rank[i] = 0;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
return par[x] = r;
}
}
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 (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
return true;
}
};
ll combination_mod(int n, int k) {
k = mint(k, n - k);
ll ans = 1;
if (n == 0 || k == 0)
return ans;
rep(i, k) {
ans = ans * (n - i) % mod;
ans = ans * modinv(i + 1) % mod;
}
return ans;
}
struct edge {
int from; //出発点
int to; //到達点
int cost; //移動コスト
};
//ベルマンフォード法
vector<ll> bellman_ford(vector<edge> edges, int V, int E, int r,
ll INF = 100000000000) {
vector<ll> cost_to(V, INF);
cost_to[r] = 0;
rep(i, V) {
rep(j, E) {
edge e = edges[j];
if (cost_to[e.from] == INF)
continue;
if (cost_to[e.to] > cost_to[e.from] + e.cost) {
cost_to[e.to] = cost_to[e.from] + e.cost;
if (i == V - 1) {
printf("NEGATIVE CYCLE\n");
return {};
}
}
}
}
return cost_to;
}
// combination
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll _pow(ll a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
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;
if (L / 2019 < R / 2019)
cout << 0;
else {
ll ans = 2019;
FOR(i, L % 2019, R % 2019 + 1) FOR(j, L % 2019 + 1, R % 2019 + 1) {
chmin(ans, (ll)i * j % 2019);
}
cout << ans;
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define SUM(c) accumulate((c).begin(), (c).end(), 0)
#define ALL(a) (a).begin(), (a).end()
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
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();
}
template <class T> T maxt(T x, T y) {
if (x > y)
return x;
else
return y;
}
template <class T> T mint(T x, T y) {
if (x > y)
return y;
else
return x;
}
// sort(v.rbegin(), v.rend(), [](auto& x, auto& y){return x[1] < y[1];});
// cout << fixed << setprecision(10) << ans << defaultfloat << endl;
//小数出力
double print_double(double d) { printf("%.10f", d); }
long long m = 1e9 + 7, mod = 1e9 + 7;
//逆元 a/b の modをとるとき -> a*modinv(b)%mod
long long modinv(long long a, long long m = 1e9 + 7) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
//約数列挙
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
// Union Find
struct UnionFind {
vector<int> par; // 親ノード
vector<int> rank; // ランク
UnionFind(int n = 1) { init(n); }
void init(int n = 1) {
par.resize(n);
rank.resize(n);
for (int i = 0; i < n; ++i)
par[i] = i, rank[i] = 0;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
return par[x] = r;
}
}
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 (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
return true;
}
};
ll combination_mod(int n, int k) {
k = mint(k, n - k);
ll ans = 1;
if (n == 0 || k == 0)
return ans;
rep(i, k) {
ans = ans * (n - i) % mod;
ans = ans * modinv(i + 1) % mod;
}
return ans;
}
struct edge {
int from; //出発点
int to; //到達点
int cost; //移動コスト
};
//ベルマンフォード法
vector<ll> bellman_ford(vector<edge> edges, int V, int E, int r,
ll INF = 100000000000) {
vector<ll> cost_to(V, INF);
cost_to[r] = 0;
rep(i, V) {
rep(j, E) {
edge e = edges[j];
if (cost_to[e.from] == INF)
continue;
if (cost_to[e.to] > cost_to[e.from] + e.cost) {
cost_to[e.to] = cost_to[e.from] + e.cost;
if (i == V - 1) {
printf("NEGATIVE CYCLE\n");
return {};
}
}
}
}
return cost_to;
}
// combination
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll _pow(ll a, ll b) {
ll ans = 1;
rep(i, b) ans *= a;
return ans;
}
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;
if (L / 2019 < R / 2019)
cout << 0;
else {
ll ans = 2019;
FOR(i, L % 2019, R % 2019 + 1) FOR(j, i + 1, R % 2019 + 1) {
chmin(ans, (ll)i * j % 2019);
}
cout << ans;
}
cout << endl;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 788,769 | 788,770 | u335278042 | cpp |
p02983 | ///見ました
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (long long i = l; i <= r; i++) {
for (long long j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
}
| ///見ました
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (long long i = l; i < r; i++) {
for (long long j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,775 | 788,776 | u028906014 | cpp |
p02983 | ///見ました
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
}
| ///見ました
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (long long i = l; i < r; i++) {
for (long long j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 788,777 | 788,776 | u028906014 | cpp |
p02983 | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main() {
LL l, r;
cin >> l >> r;
/*l=l%2019;
r=r%2019;
if(r<=l){r=r+2019;}*/
while (r > l + 2019) {
r = r - 2019;
}
LL min = 2019;
for (LL i = l; i <= r; i++) {
for (LL j = i; j <= r; j++) {
if (((i * j) % 2019) < min) {
min = ((i * j) % 2019);
}
}
}
cout << min << endl;
return 0;
} | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main() {
LL l, r;
cin >> l >> r;
while (r > l + 4038) {
r = r - 2019;
}
LL min = 2019;
for (LL i = l; i < r; i++) {
for (LL j = i + 1; j <= r; j++) {
if (((i * j) % 2019) < min) {
min = ((i * j) % 2019);
}
}
}
cout << min << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 788,780 | 788,781 | u992779443 | cpp |
p02983 | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main() {
LL l, r;
cin >> l >> r;
/*l=l%2019;
r=r%2019;
if(r<=l){r=r+2019;}*/
while (r > l + 2019) {
r = r - 2019;
}
LL min = 2019;
for (LL i = l; i < r; i++) {
for (LL j = i + 1; j <= r; j++) {
if (((i * j) % 2019) < min) {
min = ((i * j) % 2019);
}
}
}
cout << min << endl;
return 0;
} | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main() {
LL l, r;
cin >> l >> r;
while (r > l + 4038) {
r = r - 2019;
}
LL min = 2019;
for (LL i = l; i < r; i++) {
for (LL j = i + 1; j <= r; j++) {
if (((i * j) % 2019) < min) {
min = ((i * j) % 2019);
}
}
}
cout << min << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 788,782 | 788,781 | u992779443 | cpp |
p02983 | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main() {
LL l, r;
cin >> l >> r;
/*l=l%2019;
r=r%2019;
if(r<=l){r=r+2019;}*/
while (r > l + 2019) {
r = r - 2019;
}
LL min = 2019;
for (LL i = l; i < r; i++) {
for (LL j = i + 1; j <= r; j++) {
if (((i * j) % 2019) < min) {
min = ((i * j) % 2019);
}
if (min == 0) {
break;
}
}
if (min == 0) {
break;
}
}
cout << min << endl;
return 0;
} | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main() {
LL l, r;
cin >> l >> r;
while (r > l + 4038) {
r = r - 2019;
}
LL min = 2019;
for (LL i = l; i < r; i++) {
for (LL j = i + 1; j <= r; j++) {
if (((i * j) % 2019) < min) {
min = ((i * j) % 2019);
}
if (min == 0) {
break;
}
}
if (min == 0) {
break;
}
}
cout << min << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 788,783 | 788,784 | u992779443 | cpp |
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
signed main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
for (int i = l; i <= r; ++i) {
for (int j = l; j <= r; ++j) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
signed main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
for (int i = l; i <= r; ++i) {
for (int j = l; j < i; ++j) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 788,785 | 788,786 | u491256431 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
int main() {
int l, r, ans = 10000;
cin >> l >> r;
if (r - l >= 2018)
ans = 0;
else {
l %= 2019;
r %= 2019;
if (r < l)
r += 2019;
for (int i = l; i < r; i++) {
for (int j = i + 1; j < r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
}
cout << ans;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
int main() {
int l, r, ans = 10000;
cin >> l >> r;
if (r - l >= 2018)
ans = 0;
else {
l %= 2019;
r %= 2019;
if (r < l)
r += 2019;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
}
cout << ans;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 788,796 | 788,797 | u088751997 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
int ans = 100000;
// lとrの間に2019の倍数があるか否か
if ((l - 1) / 2019 + 1 <= r / 2019)
cout << 0 << endl;
else {
int len = r - l + 1;
vector<ll> mod(len);
rep(i, len) mod.at(i) = (l + i) % 2019;
rep(i, len) {
for (int j = i; j < len; j++) {
int tmp = mod.at(i) * mod.at(j) % 2019;
ans = min(ans, tmp);
}
}
}
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 rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
int ans = 100000;
// lとrの間に2019の倍数があるか否か
if ((l - 1) / 2019 + 1 <= r / 2019)
cout << 0 << endl;
else {
int len = r - l + 1;
vector<ll> mod(len);
rep(i, len) mod.at(i) = (l + i) % 2019;
rep(i, len) {
for (int j = i + 1; j < len; j++) {
int tmp = (mod.at(i) * mod.at(j)) % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"assignment.change",
"call.add",
"call.arguments.change"
] | 788,808 | 788,809 | u779216084 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
int ans = 100000;
// lとrの間に2019の倍数があるか否か
if ((l - 1) / 2019 + 1 <= r / 2019)
cout << 0 << endl;
else {
int len = r - l + 1;
vector<ll> mod(len);
rep(i, len) mod.at(i) = (l + i) % 2019;
rep(i, len - 1) {
for (int j = i + 1; j < len; j++) {
int tmp = mod.at(i) * mod.at(j) % 2019;
ans = min(ans, tmp);
}
}
}
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 rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
int ans = 100000;
// lとrの間に2019の倍数があるか否か
if ((l - 1) / 2019 + 1 <= r / 2019)
cout << 0 << endl;
else {
int len = r - l + 1;
vector<ll> mod(len);
rep(i, len) mod.at(i) = (l + i) % 2019;
rep(i, len) {
for (int j = i + 1; j < len; j++) {
int tmp = (mod.at(i) * mod.at(j)) % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
return 0;
}
| [
"expression.operation.binary.remove",
"call.add",
"call.arguments.change"
] | 788,810 | 788,809 | u779216084 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S) \
vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 2019
#define MAX 510000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
lli gcd(lli num1, lli num2) {
return num2 != 0 ? gcd(num2, num1 % num2) : num1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
lli A, B, C, D, E, F, N, M, K, L, X, Y, Z, H, W, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N >> M;
if (M % mod <= N % mod)
Out(0);
else {
M %= mod;
N %= mod;
sum = INF;
rep(i, N, M) rep(j, i + 1, M + 1) chmin(sum, (i * j) % mod);
Out(sum);
}
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S) \
vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 2019
#define MAX 510000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
lli gcd(lli num1, lli num2) {
return num2 != 0 ? gcd(num2, num1 % num2) : num1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
lli A, B, C, D, E, F, N, M, K, L, X, Y, Z, H, W, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N >> M;
if (M / mod != N / mod)
Out(0);
else {
M %= mod;
N %= mod;
sum = INF;
rep(i, N, M) rep(j, i + 1, M + 1) chmin(sum, (i * j) % mod);
Out(sum);
}
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 788,846 | 788,847 | u618604643 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
;
int main() {
long long int A, B = 999999999999, C, L, R;
cin >> L >> R;
if (R - L > 2018)
A = 0;
else {
L %= 2019;
R %= 2019;
if (L >= R)
A = 0;
else {
for (int i = L; i < R; i++) {
for (int j = i + 1; j < R + 1; j++) {
A = i * j % 2019;
if (B > A)
B = A;
}
}
}
}
cout << B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
;
int main() {
long long int A, B = 999999999999, C, L, R;
cin >> L >> R;
if (R - L > 2018)
B = 0;
else {
L %= 2019;
R %= 2019;
if (L >= R)
B = 0;
else {
for (int i = L; i < R; i++) {
for (int j = i + 1; j < R + 1; j++) {
A = i * j % 2019;
if (B > A)
B = A;
}
}
}
}
cout << B << endl;
}
| [
"assignment.variable.change",
"identifier.change"
] | 788,848 | 788,849 | u618604643 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll l, r, a;
in2(l, r);
if (r - l > 2019) {
out(1);
memi;
return 0;
}
a = 2019;
rep2(i, l, r) {
rep2(j, i + 1, r + 1) { a = min(a, i * j % 2019); }
}
out(a);
memi;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll l, r, a;
in2(l, r);
if (r - l > 2019) {
out(0);
memi;
return 0;
}
a = 2019;
rep2(i, l, r) {
rep2(j, i + 1, r + 1) { a = min(a, i * j % 2019); }
}
out(a);
memi;
} | [
"literal.number.change",
"call.arguments.change"
] | 788,856 | 788,857 | u917049698 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t l, r, res = (1 << 29);
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0;
return 0;
}
l %= 2019;
r %= 2019;
if (l >= r) {
cout << 0;
return 0;
}
for (int64_t i = l; i <= r; i++) {
for (int64_t j = i + 1; j <= r; j++) {
res = min(res, i * j);
}
}
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t l, r, res = (1 << 29);
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0;
return 0;
}
l %= 2019;
r %= 2019;
if (l >= r) {
cout << 0;
return 0;
}
for (int64_t i = l; i <= r; i++) {
for (int64_t j = i + 1; j <= r; j++) {
res = min(res, i * j % 2019);
}
}
cout << res;
return 0;
} | [
"assignment.change"
] | 788,865 | 788,866 | u204536668 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n) for (int i = n; 0 < i; i--)
#define print(out) cout << out << "\n";
#define mod 1000000007
const int INF = 1e8;
typedef pair<int, int> P;
int main() {
ll L, R, R2, ans = 1e15;
cin >> L >> R;
R2 = min(L + 2019, R);
for (ll i = L; i < R2 + 1; i++) {
for (ll j = i + 1; j < R2 + 1; j++) {
ans = min(ans, i * j) % 2019;
}
}
print(ans)
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n) for (int i = n; 0 < i; i--)
#define print(out) cout << out << "\n";
#define mod 1000000007
const int INF = 1e8;
typedef pair<int, int> P;
int main() {
ll L, R, R2, ans = 2018;
cin >> L >> R;
R2 = min(L + 2019, R);
for (ll i = L; i < R2 + 1; i++) {
for (ll j = i + 1; j < R2 + 1; j++) {
ans = min(ans, (i * j) % 2019);
}
}
print(ans)
}
| [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 788,867 | 788,868 | u526459074 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * g / b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
const long double PI = 3.14159265359;
const int MAX_N = 100010;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 1 << endl;
return 0;
}
int ans = INF;
for (int i = l;; i++) {
if (i - 3 >= r)
break;
for (int j = i + 1; j <= r; j++) {
chmin(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * g / b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
const long double PI = 3.14159265359;
const int MAX_N = 100010;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = INF;
for (int i = l;; i++) {
if (i - 3 >= r)
break;
for (int j = i + 1; j <= r; j++) {
chmin(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 788,875 | 788,876 | u809967037 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define PB push_back
#define endl "\n"
#define mod 1000000007
typedef long long LL;
#define int long long
typedef long double LD;
typedef vector<int> VI;
inline LL add(LL x, LL y) {
x += y;
if (x >= mod)
x -= mod;
return x;
}
inline LL moduloMultiplication(LL x, LL y) {
return (x % mod * 1LL * y % mod) % mod;
}
inline LL power(LL a, LL b) {
LL x = 1 % mod;
while (b) {
if (b & 1)
x = moduloMultiplication(x, a);
a = moduloMultiplication(a, a);
b >>= 1;
}
return x % mod;
}
inline LL inv(LL a) { return power(a, mod - 2) % mod; }
LL gcd(LL a, LL b) {
if (!a)
return b % mod;
return gcd(b % a, a) % mod;
}
signed main() {
fastio;
int l, r;
cin >> l >> r;
int ans = LLONG_MAX;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
if (ans > ((i % 2019) * (j % 2019)) % 2019) {
ans = ((i % 2019) * (j % 2019)) % 2019;
}
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans % 2019 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define PB push_back
#define endl "\n"
#define mod 1000000007
typedef long long LL;
#define int long long
typedef long double LD;
typedef vector<int> VI;
inline LL add(LL x, LL y) {
x += y;
if (x >= mod)
x -= mod;
return x;
}
inline LL moduloMultiplication(LL x, LL y) {
return (x % mod * 1LL * y % mod) % mod;
}
inline LL power(LL a, LL b) {
LL x = 1 % mod;
while (b) {
if (b & 1)
x = moduloMultiplication(x, a);
a = moduloMultiplication(a, a);
b >>= 1;
}
return x % mod;
}
inline LL inv(LL a) { return power(a, mod - 2) % mod; }
LL gcd(LL a, LL b) {
if (!a)
return b % mod;
return gcd(b % a, a) % mod;
}
signed main() {
fastio;
int l, r;
cin >> l >> r;
int ans = LLONG_MAX;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
if (ans > ((i % 2019) * (j % 2019)) % 2019) {
ans = ((i % 2019) * (j % 2019)) % 2019;
}
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans % 2019 << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,879 | 788,880 | u057226835 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define PB push_back
#define endl "\n"
#define mod 1000000007
typedef long long LL;
#define int long long
typedef long double LD;
typedef vector<int> VI;
inline LL add(LL x, LL y) {
x += y;
if (x >= mod)
x -= mod;
return x;
}
inline LL moduloMultiplication(LL x, LL y) {
return (x % mod * 1LL * y % mod) % mod;
}
inline LL power(LL a, LL b) {
LL x = 1 % mod;
while (b) {
if (b & 1)
x = moduloMultiplication(x, a);
a = moduloMultiplication(a, a);
b >>= 1;
}
return x % mod;
}
inline LL inv(LL a) { return power(a, mod - 2) % mod; }
LL gcd(LL a, LL b) {
if (!a)
return b % mod;
return gcd(b % a, a) % mod;
}
signed main() {
fastio;
int l, r;
cin >> l >> r;
int ans = LLONG_MAX;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
if (ans > ((i % 2019) * (j % 2019)) % 2019) {
ans = ((i % 2019) * (j % 2019)) % 2019;
}
if (ans == 0)
break;
}
if (!ans)
break;
}
cout << ans % 2019 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define PB push_back
#define endl "\n"
#define mod 1000000007
typedef long long LL;
#define int long long
typedef long double LD;
typedef vector<int> VI;
inline LL add(LL x, LL y) {
x += y;
if (x >= mod)
x -= mod;
return x;
}
inline LL moduloMultiplication(LL x, LL y) {
return (x % mod * 1LL * y % mod) % mod;
}
inline LL power(LL a, LL b) {
LL x = 1 % mod;
while (b) {
if (b & 1)
x = moduloMultiplication(x, a);
a = moduloMultiplication(a, a);
b >>= 1;
}
return x % mod;
}
inline LL inv(LL a) { return power(a, mod - 2) % mod; }
LL gcd(LL a, LL b) {
if (!a)
return b % mod;
return gcd(b % a, a) % mod;
}
signed main() {
fastio;
int l, r;
cin >> l >> r;
int ans = LLONG_MAX;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
if (ans > ((i % 2019) * (j % 2019)) % 2019) {
ans = ((i % 2019) * (j % 2019)) % 2019;
}
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans % 2019 << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 788,881 | 788,880 | u057226835 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int nm = 2 * 1e9 + 10;
int main() {
ll l, r;
cin >> l >> r;
ll m = nm;
ll ans = 2019;
ll modl = l % 2019;
ll modr = r % 2019;
if (modl > modr)
ans = 0;
else {
for (int i = modl; i < modr; i++) {
for (int j = i + 1; j <= modr; j++) {
ans = min(ans, i * j % (ll)2019);
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int nm = 2 * 1e9 + 10;
int main() {
ll l, r;
cin >> l >> r;
ll m = nm;
ll ans = 2019;
ll modl = l % 2019;
ll modr = r % 2019;
if (r / 2019 > l / 2019)
ans = 0;
else {
for (int i = modl; i < modr; i++) {
for (int j = i + 1; j <= modr; j++) {
ans = min(ans, i * j % (ll)2019);
}
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 788,882 | 788,883 | u989306199 | cpp |
p02983 | #define rep(i, n) for (ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll mod_l = l % 2019;
ll div_l = l / 2019;
ll mod_r = r % 2019;
ll div_r = r / 2019;
ll ans = 2018;
if (div_r > div_l) {
ans = 0;
} else {
for (int i = mod_l; i < mod_r; i++) {
for (int j = i + 1; j < mod_r; j++) {
ans = min(ans, i * j % (ll)2019);
}
}
}
cout << ans << endl;
return 0;
}
| #define rep(i, n) for (ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll mod_l = l % 2019;
ll div_l = l / 2019;
ll mod_r = r % 2019;
ll div_r = r / 2019;
ll ans = 2018;
if (div_r > div_l) {
ans = 0;
} else {
for (int i = mod_l; i < mod_r; i++) {
for (int j = i + 1; j <= mod_r; j++) {
ans = min(ans, i * j % (ll)2019);
}
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 788,884 | 788,885 | u518206537 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define fir first
#define sec second
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define ll long long
#define ld long double
#define lp(i, n) for (int i = 0; (int)i < n; i++)
#define loop(i, x, n) for (int i = x; (int)i <= n; i++)
#define isPowerOfTwo(s) (!(s & (s - 1)))
#define vll vector<ll>
typedef vector<int> vi;
typedef deque<int> de;
void origi() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
}
void tiranga() {
ll l, r, dif = 0;
cin >> l >> r;
dif = r - l;
if (dif >= 2019)
cout << 0;
else {
int Min = INT_MAX;
loop(i, l, r - 1) {
loop(j, i + 1, r) Min = min(Min, (((i % 2019) * (j * 2019)) % 2019));
}
cout << Min;
}
}
int main() {
#ifndef ONLINE_JUDGE.
// freopen("input.txt", "r", stdin);
#else
#endif
origi();
tiranga();
// cout << sumOfDig(123654);
// genLarge(10, 10);
// genSmall(10);
} | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define fir first
#define sec second
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define ll long long
#define ld long double
#define lp(i, n) for (int i = 0; (int)i < n; i++)
#define loop(i, x, n) for (int i = x; (int)i <= n; i++)
#define isPowerOfTwo(s) (!(s & (s - 1)))
#define vll vector<ll>
typedef vector<int> vi;
typedef deque<int> de;
void origi() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
}
void tiranga() {
ll l, r, dif = 0;
cin >> l >> r;
dif = r - l;
if (dif >= 2019)
cout << 0;
else {
int Min = INT_MAX;
loop(i, l, r - 1) {
loop(j, i + 1, r) Min = min(Min, (((i % 2019) * (j % 2019)) % 2019));
}
cout << Min;
}
}
int main() {
#ifndef ONLINE_JUDGE.
// freopen("input.txt", "r", stdin);
#else
#endif
origi();
tiranga();
// cout << sumOfDig(123654);
// genLarge(10, 10);
// genSmall(10);
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 788,888 | 788,889 | u360892275 | cpp |
p02983 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2018) {
cout << 0 << endl;
return 0;
}
int l = L % 2019;
int r;
if (R % 2019 < l)
r = R % 2019 + 2019;
else
r = R % 2019;
int result = 2019;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
int x;
x = i * (j % 2019);
result = min(result, x);
}
}
cout << result << endl;
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2018) {
cout << 0 << endl;
return 0;
}
int l = L % 2019;
int r;
if (R % 2019 < l)
r = R % 2019 + 2019;
else
r = R % 2019;
int result = 2019;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
int x;
x = i * (j % 2019) % 2019;
result = min(result, x);
}
}
cout << result << endl;
}
| [
"assignment.change"
] | 788,892 | 788,893 | u455266724 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
scanf("%lld %lld", &l, &r);
for (int i = l; i <= r; ++i)
if (i % 2019 == 0) {
puts("0");
return 0;
}
int mn = 2018;
for (int i = (l % 2019); i <= (r % 2019); ++i) {
for (int j = i; j <= (r % 2019); ++j) {
mn = min((i * j) % 2019, mn);
}
}
cout << mn << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
scanf("%lld %lld", &l, &r);
for (int i = l; i <= r; ++i)
if (i % 2019 == 0) {
puts("0");
return 0;
}
int mn = 2018;
for (int i = (l % 2019); i <= (r % 2019); ++i) {
for (int j = i + 1; j <= (r % 2019); ++j) {
mn = min((i * j) % 2019, mn);
}
}
cout << mn << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 788,902 | 788,903 | u388682543 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, e) for (int x = 0; x <= e; x++)
#define in_arr(n) \
loop(i, 0, n - 1) { cin >> a[i]; }
#define out_arr(n) \
loop(i, 0, n - 1) { cout << a[i]; }
const int N = 1e5 + 5;
const int INF = 1 << 30;
const int MOD = 2019;
inline void boost() {
cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
}
int main() {
boost();
ll l, r;
cin >> l >> r;
if ((r / MOD) != (l / MOD)) {
cout << 0;
return 0;
}
l %= MOD;
r %= MOD;
ll mn = INF;
ll s = min(l, r);
ll e = max(l, r);
for (ll i = s; s <= e; ++s) {
for (ll j = i + 1; j <= e; ++j) {
mn = min(mn, (i * j) % MOD);
}
}
cout << mn;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, e) for (int x = 0; x <= e; x++)
#define in_arr(n) \
loop(i, 0, n - 1) { cin >> a[i]; }
#define out_arr(n) \
loop(i, 0, n - 1) { cout << a[i]; }
const int N = 1e5 + 5;
const int INF = 1 << 30;
const int MOD = 2019;
inline void boost() {
cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
}
int main() {
boost();
ll l, r;
cin >> l >> r;
if ((r / MOD) != (l / MOD)) {
cout << 0;
return 0;
}
l %= MOD;
r %= MOD;
ll mn = INF;
ll s = min(l, r);
ll e = max(l, r);
for (ll i = s; i <= e; ++i) {
for (ll j = i + 1; j <= e; ++j) {
mn = min(mn, (i * j) % MOD);
}
}
cout << mn;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 788,912 | 788,911 | u341811631 | cpp |
p02983 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int l, r, ans = 2020;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
} else {
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, ((i % 2019) * (j % 2918)) % 2019);
}
}
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int l, r, ans = 2020;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
} 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;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 788,918 | 788,919 | u075296067 | cpp |
p02983 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int L, R;
cin >> L >> R;
ll Ans = 1e18;
for (ll i = L; i <= min(L + 2020, R); i++) {
for (ll j = L + 1; j <= min(L + 2020, R); j++) {
Ans = min(Ans, (i * j) % 2019);
}
}
cout << Ans;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int L, R;
cin >> L >> R;
ll Ans = 1e18;
for (ll i = L; i <= min(L + 4020, R); i++) {
for (ll j = i + 1; j <= min(L + 4020, R); j++) {
Ans = min(Ans, (i * j) % 2019);
}
}
cout << Ans;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 788,930 | 788,931 | u365917065 | cpp |
p02983 | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REPR(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), v.end());
typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 29);
const ll LINF = 1e18;
const double PI = acos(-1);
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
vvi V(2020);
REP(i, 2020) {
REP(j, 2020) { V[i].push_back((i * j) % 2019); }
}
vi A;
for (int i = L; i <= R; i++) {
A.push_back(i % 2019);
}
so(A);
int ans = 2018;
REP(i, SZ(A)) {
REP(j, i) { chmin(ans, A[i] * A[j]); }
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REPR(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), v.end());
typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 29);
const ll LINF = 1e18;
const double PI = acos(-1);
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
vvi V(2020);
REP(i, 2020) {
REP(j, 2020) { V[i].push_back((i * j) % 2019); }
}
vi A;
for (int i = L; i <= R; i++) {
A.push_back(i % 2019);
}
so(A);
int ans = 2018;
REP(i, SZ(A)) {
REP(j, i) { chmin(ans, (A[i] * A[j]) % 2019); }
}
cout << ans << endl;
return 0;
}
| [
"call.arguments.change",
"call.arguments.add"
] | 788,943 | 788,944 | u137332130 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS constexpr int M = 2019;
int l, r;
cin >> l >> r;
int ans = 0;
if (r - l >= M) {
ans = 0;
} else {
int lm = l % M;
int rm = r % M;
if (lm >= rm) {
ans = 0;
} else {
ans = M;
FOR(i, lm, rm - 1) {
FOR(j, lm + 1, rm) {
int tmp = i * j % M;
if (ans > tmp)
ans = tmp;
}
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS constexpr int M = 2019;
int l, r;
cin >> l >> r;
int ans = 0;
if (r - l >= M) {
ans = 0;
} else {
int lm = l % M;
int rm = r % M;
if (lm >= rm) {
ans = 0;
} else {
ans = M;
FOR(i, lm, rm) {
FOR(j, lm + 1, rm + 1) {
int tmp = i * j % M;
// cerr << tmp << endl;
if (ans > tmp)
ans = tmp;
}
}
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 788,957 | 788,958 | u330661451 | cpp |
p02983 | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751L
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": ";
for1(i, size) {
if (i != 0) {
cerr << ' ';
}
cerr << v[i];
}
cerr << '\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
ll divup(ll nume, ll deno) {
assert(nume >= 0);
assert(deno > 0);
return (nume + deno - 1) / deno;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void vin(vector<T> &v, ll len) {
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
cin >> h;
in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
void solve() {
ll L, R;
in(L, R);
if (R - L >= 2019) {
print(0);
}
ll ans = INF;
for2(i, L, R + 1) {
for2(j, i + 1, R + 1) { chmin(ans, i * j % 2019); }
}
print(ans);
}
//---------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
}
| #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751L
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": ";
for1(i, size) {
if (i != 0) {
cerr << ' ';
}
cerr << v[i];
}
cerr << '\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
ll divup(ll nume, ll deno) {
assert(nume >= 0);
assert(deno > 0);
return (nume + deno - 1) / deno;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void vin(vector<T> &v, ll len) {
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
cin >> h;
in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
void solve() {
ll L, R;
in(L, R);
if (R - L >= 2019) {
print(0);
return;
}
ll ans = INF;
for2(i, L, R + 1) {
for2(j, i + 1, R + 1) { chmin(ans, i * j % 2019); }
}
print(ans);
}
//---------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
}
| [
"control_flow.return.add"
] | 788,979 | 788,980 | u426683236 | cpp |
p02983 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll mod = 2019;
ll L, R;
cin >> L >> R;
R = min(L + mod, R);
ll ans = 2019;
for (ll i = L; i <= R; i++)
for (ll j = L + 1; j <= R; j++) {
ans = min(ans, (i * j) % mod);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll mod = 2019;
ll L, R;
cin >> L >> R;
R = min(L + mod, R);
ll ans = 2019;
for (ll i = L; i <= R; i++)
for (ll j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % mod);
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 788,989 | 788,990 | u119098168 | cpp |
p02983 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 2019;
ll mpow(ll x,
ll n) { // x^n(mod) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// 2分累乗法だから早い
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
ll inv_mod(ll a) { return mpow(a, mod - 2); }
bool square(ll a) {
ll n = (ll)sqrt(a);
return a == n * n;
}
int digitsum(ll N, int a) {
if (N == 0)
return 0;
int ret = 0;
ret += digitsum(N / a, a) + N % a;
return ret;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }; // xとyの最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } // xとyの最小公倍数
vector<ll> splitint(string n, int a) {
int Len = n.length();
if (a < 0 || Len < a)
return {-1, -1};
string left, right;
if (a != 0)
left = n.substr(0, a);
if (a != Len)
right = n.substr(a);
return {stoll(left), stoll(right)};
}
template <ll mod> class mint {
private:
ll _num;
mint set(ll num) {
_num = num % mod;
return *this;
}
public:
mint() { _num = 0; }
mint(ll num) { _num = num % mod; }
mint(const mint &cp) { _num = cp._num; }
mint operator=(ll x) { return set(x % mod); }
mint operator+(ll x) { return mint<mod>(_num + (x % mod)); }
mint operator-(ll x) { return mint<mod>(_num - (x % mod)); }
mint operator*(ll x) { return mint<mod>(_num * (x % mod)); }
mint operator/(ll x) { return mint<mod>(_num * inv_mod(x)); }
mint operator+=(ll x) { return set(_num + (x % mod)); }
mint operator-=(ll x) { return set(_num - (x % mod)); }
mint operator*=(ll x) { return set(_num * (x % mod)); }
mint operator/=(ll x) { return set(_num * inv_mod(x)); }
mint operator+(mint x) { return mint<mod>(_num + x._num); }
mint operator-(mint x) { return mint<mod>(_num - x._num); }
mint operator*(mint x) { return mint<mod>(_num * x._num); }
mint operator/(mint x) { return mint<mod>(_num * inv_mod(x._num)); }
mint operator+=(mint x) { return set(_num + x._num); }
mint operator-=(mint x) { return set(_num - x._num); }
mint operator*=(mint x) { return set(_num * x._num); }
mint operator/=(mint x) { return set(_num * inv_mod(x._num)); }
friend mint operator+(ll x, mint m) { return mint<mod>(m._num + (x % mod)); }
friend mint operator-(ll x, mint m) { return mint<mod>(m._num - (x % mod)); }
friend mint operator*(ll x, mint m) { return mint<mod>(m._num * (x % mod)); }
friend mint operator/(ll x, mint m) { return mint<mod>(inv_mod(m._num) * x); }
explicit operator ll() { return _num; }
explicit operator int() { return _num; }
friend ostream &operator<<(ostream &os, const mint<mod> &x) {
os << x._num;
return os;
}
friend istream &operator>>(istream &is, mint<mod> &x) {
int val;
is >> val;
x.set(val);
return is;
}
};
class UnionFind { // UnionFind木
private:
vector<int> Parent;
public:
UnionFind(int N) {
Parent.resize(N);
REP(i, N) Parent[i] = -1;
}
int root(int A) {
if (Parent[A] < 0)
return A;
else
return Parent[A] = root(Parent[A]);
}
int size(int A) { return -Parent[root(A)]; }
bool connect(int A, int B) {
A = root(A);
B = root(B);
if (A == B)
return false;
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
class Factorial { //階乗とその逆元を求めて計算に利用するクラス
private:
vector<ll> fac;
vector<ll> ifac;
public:
Factorial(ll N) {
fac.push_back(1);
REP(i, N) fac.push_back(fac[i] * (i + 1) % mod);
ifac.resize(N + 1);
ifac[N] = inv_mod(fac[N]);
REP(i, N) ifac[N - 1 - i] = (ifac[N - i] * (N - i)) % mod;
}
ll fact(ll a) { return fac[a]; }
ll ifact(ll a) { return ifac[a]; }
ll cmb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
ll tmp = ifact(a - b) * ifact(b) % mod;
return tmp * fac[a] % mod;
}
ll per(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
return fac[a] * ifac[a - b] % mod;
}
};
class SOSU {
private:
vector<ll> Prime_Number;
public:
SOSU(int N) {
set<ll> arr;
REP(i, N - 1) arr.insert(i + 2);
while (int n = *arr.begin()) {
if (n > sqrt(N))
break;
Prime_Number.push_back(n);
rep(i, 1, N / n + 1) arr.erase(n * i);
}
ITR(itr, arr) Prime_Number.push_back(*itr);
}
ll operator[](int i) { return Prime_Number[i]; }
int count() { return Prime_Number.size(); }
bool isPrime(int q) { return binary_search(All(Prime_Number), q); }
};
struct Solutions {
ll napsack(int kinds, int MAX_W, vector<ll> weight, vector<ll> cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll unlimited_napsack(int kinds, int MAX_W, vector<ll> weight,
vector<ll> cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll Partition_Func(int n, int k) {
vector<vector<ll>> dp(k + 1, vector<ll>(n + 1, 0));
dp[0][0] = 1;
rep(i, 1, k + 1) REP(j, n + 1) {
if (j - i >= 0)
dp[i][j] = (dp[i][j - i] + dp[i - 1][j]);
else
dp[i][j] = dp[i - 1][j];
}
return dp[k][n];
}
int LCS(string s, string t) {
int n = s.length(), m = s.length();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
REP(i, n) REP(j, m) {
if (s[i] == t[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
return dp[n][m];
}
int LIS(vector<ll> a) {
int n = a.size();
ll INF = 1 << 28;
vector<ll> dp(n + 1, INF);
REP(i, n) * lower_bound(All(dp), a[i]) = a[i];
int k = lower_bound(All(dp), INF) - dp.begin();
return k;
}
};
struct edge {
int from;
int to;
ll cost;
void push(int a, int b, int c) {
from = a;
to = b;
cost = c;
}
};
int main() {
ll L, R;
cin >> L >> R;
if (L - R >= mod - 1) {
cout << 0 << endl;
return 0;
}
L %= mod;
R %= mod;
if (L >= R) {
cout << 0 << endl;
return 0;
}
mint<mod> ans = L * R;
rep(i, L, R) rep(j, i + 1, R + 1) { ans = min((ll)ans, i * j % mod); }
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 2019;
ll mpow(ll x,
ll n) { // x^n(mod) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// 2分累乗法だから早い
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
ll inv_mod(ll a) { return mpow(a, mod - 2); }
bool square(ll a) {
ll n = (ll)sqrt(a);
return a == n * n;
}
int digitsum(ll N, int a) {
if (N == 0)
return 0;
int ret = 0;
ret += digitsum(N / a, a) + N % a;
return ret;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }; // xとyの最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } // xとyの最小公倍数
vector<ll> splitint(string n, int a) {
int Len = n.length();
if (a < 0 || Len < a)
return {-1, -1};
string left, right;
if (a != 0)
left = n.substr(0, a);
if (a != Len)
right = n.substr(a);
return {stoll(left), stoll(right)};
}
template <ll mod> class mint {
private:
ll _num;
mint set(ll num) {
_num = num % mod;
return *this;
}
public:
mint() { _num = 0; }
mint(ll num) { _num = num % mod; }
mint(const mint &cp) { _num = cp._num; }
mint operator=(ll x) { return set(x % mod); }
mint operator+(ll x) { return mint<mod>(_num + (x % mod)); }
mint operator-(ll x) { return mint<mod>(_num - (x % mod)); }
mint operator*(ll x) { return mint<mod>(_num * (x % mod)); }
mint operator/(ll x) { return mint<mod>(_num * inv_mod(x)); }
mint operator+=(ll x) { return set(_num + (x % mod)); }
mint operator-=(ll x) { return set(_num - (x % mod)); }
mint operator*=(ll x) { return set(_num * (x % mod)); }
mint operator/=(ll x) { return set(_num * inv_mod(x)); }
mint operator+(mint x) { return mint<mod>(_num + x._num); }
mint operator-(mint x) { return mint<mod>(_num - x._num); }
mint operator*(mint x) { return mint<mod>(_num * x._num); }
mint operator/(mint x) { return mint<mod>(_num * inv_mod(x._num)); }
mint operator+=(mint x) { return set(_num + x._num); }
mint operator-=(mint x) { return set(_num - x._num); }
mint operator*=(mint x) { return set(_num * x._num); }
mint operator/=(mint x) { return set(_num * inv_mod(x._num)); }
friend mint operator+(ll x, mint m) { return mint<mod>(m._num + (x % mod)); }
friend mint operator-(ll x, mint m) { return mint<mod>(m._num - (x % mod)); }
friend mint operator*(ll x, mint m) { return mint<mod>(m._num * (x % mod)); }
friend mint operator/(ll x, mint m) { return mint<mod>(inv_mod(m._num) * x); }
explicit operator ll() { return _num; }
explicit operator int() { return _num; }
friend ostream &operator<<(ostream &os, const mint<mod> &x) {
os << x._num;
return os;
}
friend istream &operator>>(istream &is, mint<mod> &x) {
int val;
is >> val;
x.set(val);
return is;
}
};
class UnionFind { // UnionFind木
private:
vector<int> Parent;
public:
UnionFind(int N) {
Parent.resize(N);
REP(i, N) Parent[i] = -1;
}
int root(int A) {
if (Parent[A] < 0)
return A;
else
return Parent[A] = root(Parent[A]);
}
int size(int A) { return -Parent[root(A)]; }
bool connect(int A, int B) {
A = root(A);
B = root(B);
if (A == B)
return false;
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
class Factorial { //階乗とその逆元を求めて計算に利用するクラス
private:
vector<ll> fac;
vector<ll> ifac;
public:
Factorial(ll N) {
fac.push_back(1);
REP(i, N) fac.push_back(fac[i] * (i + 1) % mod);
ifac.resize(N + 1);
ifac[N] = inv_mod(fac[N]);
REP(i, N) ifac[N - 1 - i] = (ifac[N - i] * (N - i)) % mod;
}
ll fact(ll a) { return fac[a]; }
ll ifact(ll a) { return ifac[a]; }
ll cmb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
ll tmp = ifact(a - b) * ifact(b) % mod;
return tmp * fac[a] % mod;
}
ll per(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
return fac[a] * ifac[a - b] % mod;
}
};
class SOSU {
private:
vector<ll> Prime_Number;
public:
SOSU(int N) {
set<ll> arr;
REP(i, N - 1) arr.insert(i + 2);
while (int n = *arr.begin()) {
if (n > sqrt(N))
break;
Prime_Number.push_back(n);
rep(i, 1, N / n + 1) arr.erase(n * i);
}
ITR(itr, arr) Prime_Number.push_back(*itr);
}
ll operator[](int i) { return Prime_Number[i]; }
int count() { return Prime_Number.size(); }
bool isPrime(int q) { return binary_search(All(Prime_Number), q); }
};
struct Solutions {
ll napsack(int kinds, int MAX_W, vector<ll> weight, vector<ll> cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll unlimited_napsack(int kinds, int MAX_W, vector<ll> weight,
vector<ll> cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll Partition_Func(int n, int k) {
vector<vector<ll>> dp(k + 1, vector<ll>(n + 1, 0));
dp[0][0] = 1;
rep(i, 1, k + 1) REP(j, n + 1) {
if (j - i >= 0)
dp[i][j] = (dp[i][j - i] + dp[i - 1][j]);
else
dp[i][j] = dp[i - 1][j];
}
return dp[k][n];
}
int LCS(string s, string t) {
int n = s.length(), m = s.length();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
REP(i, n) REP(j, m) {
if (s[i] == t[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
return dp[n][m];
}
int LIS(vector<ll> a) {
int n = a.size();
ll INF = 1 << 28;
vector<ll> dp(n + 1, INF);
REP(i, n) * lower_bound(All(dp), a[i]) = a[i];
int k = lower_bound(All(dp), INF) - dp.begin();
return k;
}
};
struct edge {
int from;
int to;
ll cost;
void push(int a, int b, int c) {
from = a;
to = b;
cost = c;
}
};
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= mod - 1) {
cout << 0 << endl;
return 0;
}
L %= mod;
R %= mod;
if (L >= R) {
cout << 0 << endl;
return 0;
}
mint<mod> ans = L * R;
rep(i, L, R) rep(j, i + 1, R + 1) { ans = min((ll)ans, i * j % mod); }
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 788,993 | 788,994 | u203033720 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#define LIM 2000000000
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll L, R, mul, m = 2019 * 2020;
cin >> L >> R;
R = R < L + 2019 ? R : L + 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
mul = ((i % 2019) * (j % 2910)) % 2019;
m = min(m, mul);
}
}
cout << m << endl;
}
| #include <algorithm>
#include <iostream>
#define LIM 2000000000
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll L, R, mul, m = 2020;
cin >> L >> R;
R = R < L + 2019 ? R : L + 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
mul = ((i % 2019) * (j % 2019)) % 2019;
m = min(m, mul);
}
}
cout << m << endl;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 789,027 | 789,028 | u803684095 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#define LIM 2000000000
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll L, R, mul, m = LIM + 10;
cin >> L >> R;
R = R < L + 2019 ? R : L + 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
mul = ((i % 2019) * (j % 2910)) % 2019;
m = min(m, mul);
}
}
cout << m << endl;
}
| #include <algorithm>
#include <iostream>
#define LIM 2000000000
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main(void) {
ll L, R, mul, m = 2020;
cin >> L >> R;
R = R < L + 2019 ? R : L + 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
mul = ((i % 2019) * (j % 2019)) % 2019;
m = min(m, mul);
}
}
cout << m << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change"
] | 789,029 | 789,028 | u803684095 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define RFOR(i, a, n) for (ll i = (ll)a; i >= n; --i)
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FOR(i, 1, n + 1)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPN(i, n) RFOR(i, n, 1)
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a & b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll &a, ll m) {
a = (a % m + m) % m;
return a;
}
ll modinv(ll a, ll m) {
ll x, y;
extGCD(a, m, x, y);
return mod(x, m);
}
ll modadd(ll &a, ll b) {
mod(a, MOD);
mod(b, MOD);
a += b;
return mod(a, MOD);
}
ll modsub(ll &a, ll b) { return modadd(a, -b); }
ll modmulti(ll &a, ll b) {
mod(a, MOD);
mod(b, MOD);
a *= b;
return mod(a, MOD);
}
ll moddiv(ll &a, ll b) {
mod(a, MOD);
a *= modinv(b, MOD);
return mod(a, MOD);
}
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;
}
// a,bの最大公約数
inline ll gcd(ll a, ll b) {
ll temp;
while (a % b != 0) {
temp = a;
a %= b;
b = temp;
}
return b;
}
// a,bの最小公倍数
inline ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
const int MAX_N = 1e5 + 10;
int main() {
int mod = 2019;
int L, R;
cin >> L >> R;
if (R - L >= mod - 1) {
cout << 0 << endl;
} else {
ll l = L % mod;
ll d = (R - L);
ll result = INF;
for (ll i = l; i <= l + d; ++i) {
for (ll j = l + 1; j <= l + d; ++j) {
ll x = i % mod;
ll y = j % mod;
chmin(result, (x * y) % mod);
}
}
cout << result << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define RFOR(i, a, n) for (ll i = (ll)a; i >= n; --i)
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FOR(i, 1, n + 1)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPN(i, n) RFOR(i, n, 1)
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a & b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll &a, ll m) {
a = (a % m + m) % m;
return a;
}
ll modinv(ll a, ll m) {
ll x, y;
extGCD(a, m, x, y);
return mod(x, m);
}
ll modadd(ll &a, ll b) {
mod(a, MOD);
mod(b, MOD);
a += b;
return mod(a, MOD);
}
ll modsub(ll &a, ll b) { return modadd(a, -b); }
ll modmulti(ll &a, ll b) {
mod(a, MOD);
mod(b, MOD);
a *= b;
return mod(a, MOD);
}
ll moddiv(ll &a, ll b) {
mod(a, MOD);
a *= modinv(b, MOD);
return mod(a, MOD);
}
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;
}
// a,bの最大公約数
inline ll gcd(ll a, ll b) {
ll temp;
while (a % b != 0) {
temp = a;
a %= b;
b = temp;
}
return b;
}
// a,bの最小公倍数
inline ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
const int MAX_N = 1e5 + 10;
int main() {
int mod = 2019;
int L, R;
cin >> L >> R;
if (R - L >= mod) {
cout << 0 << endl;
} else {
ll l = L % mod;
ll d = (R - L);
ll result = INF;
for (ll i = l; i <= l + d; ++i) {
for (ll j = i + 1; j <= l + d; ++j) {
ll x = i % mod;
ll y = j % mod;
chmin(result, (x * y) % mod);
}
}
cout << result << endl;
}
}
| [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,038 | 789,039 | u835629653 | cpp |
p02983 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1000000007;
void solve() {
ll L, R;
cin >> L >> R;
ll ans = INF;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
ans = min(ans, (i % 2019) * (j % 2019));
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(12);
solve();
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1000000007;
void solve() {
ll L, R;
cin >> L >> R;
ll ans = INF;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019LL);
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(12);
solve();
return 0;
}
| [
"call.arguments.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 789,040 | 789,041 | u346180161 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i <= r; i++) {
if (i % 2019 == 0) {
cout << 0 << endl;
return 0;
}
}
int ans = 3000;
for (int i = l % 2019; i < r % 2019; i++) {
for (int j = i + 1; j <= r % 2019; j++) {
ans = min(ans, i * j % 2018);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i <= r; i++) {
if (i % 2019 == 0) {
cout << 0 << endl;
return 0;
}
}
int ans = 3000;
for (int i = l % 2019; i < r % 2019; i++) {
for (int j = i + 1; j <= r % 2019; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
return 0;
} | [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 789,061 | 789,062 | u648009244 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 2019;
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l > 2019)
cout << 0;
else {
int m = 2020;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
m = min(((i % mod) * (j % mod)) % mod, m);
}
}
cout << m;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 2019;
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l > 2018)
cout << 0;
else {
int m = 2020;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
m = min(((i % mod) * (j % mod)) % mod, m);
}
}
cout << m;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,088 | 789,089 | u243407720 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 2019;
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l > 2018)
cout << 0;
else {
int m = 2020;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
m = min(((i % mod) * (j % mod)) % mod, m);
}
}
cout << m;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 2019;
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l > 2018)
cout << 0;
else {
int m = 2020;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
m = min(((i % mod) * (j % mod)) % mod, m);
}
}
cout << m;
}
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,090 | 789,089 | u243407720 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i % mod) * (j % mod));
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, ((i % mod) * (j % mod)) % mod);
}
}
cout << ans << endl;
return 0;
} | [
"call.arguments.change",
"call.arguments.add"
] | 789,111 | 789,112 | u430209651 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, (i % mod) * (j % mod) % mod);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, ((i % mod) * (j % mod)) % mod);
}
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 789,113 | 789,112 | u430209651 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, (i % mod) * (j % mod));
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + 2 * 2019);
const int mod = 2019;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, ((i % mod) * (j % mod)) % mod);
}
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 789,114 | 789,112 | u430209651 | cpp |
p02983 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define cina(s, n, a) \
for (int i = s; i < n; i++) \
cin >> a[i]
#define couta(n, a) \
for (int i = 0; i < n; i++) \
cout << a[i] << ' '
#define copy(s, n, a, b) \
for (int i = s; i < n; i++) \
b[i] = a[i]
#define yesno(ok) cout << (ok ? "YES" : "NO")
#define mod(a, b) (b + (a % b)) % b
#define MOD (int)1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef std::vector<int> vi;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
typedef std::vector<pii> vpii;
using namespace std;
void solve() {
ll x, y;
cin >> x >> y;
if (abs(x - y) > 2019) {
cout << 2;
} else {
ll ans = INT_MAX;
for (ll i = x; i <= y; i++) {
for (ll j = x; j <= y; j++) {
if (i != j)
ans = min(ans, (i * j) % 2019);
}
}
cout << ans;
}
}
int main() {
ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int q = 1;
// cin >> q;
for (int i = 1; i <= q; i++) {
solve();
}
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define cina(s, n, a) \
for (int i = s; i < n; i++) \
cin >> a[i]
#define couta(n, a) \
for (int i = 0; i < n; i++) \
cout << a[i] << ' '
#define copy(s, n, a, b) \
for (int i = s; i < n; i++) \
b[i] = a[i]
#define yesno(ok) cout << (ok ? "YES" : "NO")
#define mod(a, b) (b + (a % b)) % b
#define MOD (int)1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef std::vector<int> vi;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
typedef std::vector<pii> vpii;
using namespace std;
void solve() {
ll x, y;
cin >> x >> y;
if (abs(x - y) > 2019) {
cout << 0;
} else {
ll ans = INT_MAX;
for (ll i = x; i <= y; i++) {
for (ll j = x; j <= y; j++) {
if (i != j)
ans = min(ans, (i * j) % 2019);
}
}
cout << ans;
}
}
int main() {
ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int q = 1;
// cin >> q;
for (int i = 1; i <= q; i++) {
solve();
}
}
| [
"literal.number.change",
"io.output.change"
] | 789,133 | 789,134 | u024616993 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, ans = 2020;
cin >> a >> b;
for (ll i = a; i < min(a + 2019, b); i++) {
for (ll j = i + 1; i < min(i + 2020, b); i++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, ans = 2020;
cin >> a >> b;
for (ll i = a; i <= min(a + 2019, b); i++) {
for (ll j = i + 1; j <= min(i + 2020, b); j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change"
] | 789,136 | 789,137 | u780122303 | cpp |
p02983 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------------------------
#include <random>
int main(void) {
ll l, r;
ll ans = 9999999999999999;
cin >> l >> r;
for (ll i = l; i <= r; i++) {
for (ll j = l; j < i; j++) {
ans = min(ans, (i % 2019) * (j % 2019));
if (ans == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------------------------
#include <random>
int main(void) {
ll l, r;
ll ans = 9999999999999999;
cin >> l >> r;
for (ll i = l; i <= r; i++) {
for (ll j = l; j < i; j++) {
ans = min(ans, (i * j) % 2019);
if (ans == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << ans << endl;
}
| [
"call.arguments.change"
] | 789,138 | 789,139 | u118340517 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cerr << #a << " = " << a << endl;
template <typename T> void setmax(T &x, T y) { x = max(x, y); }
template <typename T> void setmin(T &x, T y) { x = min(x, y); }
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int l, r;
cin >> l >> r;
if (r - l > 2020) {
cout << 0;
return 0;
}
int ans = INF;
FOR(i, l, r) FOR(j, i + 1, r + 1) setmax(ans, (int)(i * (LL)j % 2019));
cout << ans;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cerr << #a << " = " << a << endl;
template <typename T> void setmax(T &x, T y) { x = max(x, y); }
template <typename T> void setmin(T &x, T y) { x = min(x, y); }
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int l, r;
cin >> l >> r;
if (r - l > 2020) {
cout << 0;
return 0;
}
int ans = INF;
FOR(i, l, r) FOR(j, i + 1, r + 1) setmin(ans, (int)(i * (LL)j % 2019));
cout << ans;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| [
"identifier.change",
"call.function.change"
] | 789,153 | 789,154 | u761582382 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1000000007;
const ll LINF = 1e13;
const ll LLINF = 1e18;
const ll ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x; // for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいい
return is;
}
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
if (ans > ((i * j) % 2019)) {
ans = ((i * j) % 2019);
if (ans == 0)
break;
}
}
if (ans == 0)
break;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1000000007;
const ll LINF = 1e13;
const ll LLINF = 1e18;
const ll ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x; // for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいい
return is;
}
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
if (ans > ((i * j) % 2019)) {
ans = ((i * j) % 2019);
if (ans == 0)
break;
}
}
if (ans == 0)
break;
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,155 | 789,156 | u134810655 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1000000007;
const ll LINF = 1e13;
const ll LLINF = 1e18;
const ll ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x; // for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいい
return is;
}
int main() {
ll l, r;
cin >> l >> r;
ll ans = LLINF;
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
if (ans > ((i * j) % 2019)) {
ans = ((i * j) % 2019);
if (ans == 0)
break;
}
}
if (ans == 0)
break;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1000000007;
const ll LINF = 1e13;
const ll LLINF = 1e18;
const ll ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x; // for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいい
return is;
}
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
if (ans > ((i * j) % 2019)) {
ans = ((i * j) % 2019);
if (ans == 0)
break;
}
}
if (ans == 0)
break;
}
cout << ans << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,158 | 789,156 | u134810655 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
constexpr long long int mod = 2019;
if (r - l >= mod) {
cout << 0 << endl;
} else {
long long int ans = (l % mod) * ((l + 1) % mod) % mod;
for (int i = l; l < r; l++) {
for (int j = i + 1; j <= r; j++) {
long long int t = ((i % mod) * (j % mod)) % mod;
if (t < ans)
ans = t;
}
}
cout << ans << endl;
}
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
constexpr long long int mod = 2019;
if (r - l >= mod) {
cout << 0 << endl;
} else {
long long int ans = ((l % mod) * ((l + 1) % mod)) % mod;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
long long int t = ((i % mod) * (j % mod)) % mod;
if (t < ans)
ans = t;
}
}
cout << ans << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 789,173 | 789,174 | u251410638 | cpp |
p02983 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll LINF = 1e18 + 5;
constexpr int mod = 2019;
int l, r;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
pii ans = mp(0, 0);
cin >> l >> r;
int minn = INF;
for (int i = l; i <= min(r, l + 2019); i++)
for (int j = i + 1; j <= min(r, l + 2019); j++)
if ((i % 2019) * (j % 2019) < minn)
minn = (i % 2019) * (j % 2019), ans = mp(i, j);
cout << minn;
return 0;
}
| #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll LINF = 1e18 + 5;
constexpr int mod = 2019;
int l, r;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
pii ans = mp(0, 0);
cin >> l >> r;
int minn = INF;
for (int i = l; i <= min(r, l + 2019); i++)
for (int j = i + 1; j <= min(r, l + 2019); j++)
if ((i % 2019) * (j % 2019) % mod < minn)
minn = (i % 2019) * (j % 2019) % mod, ans = mp(i, j);
cout << minn;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 789,175 | 789,176 | u047655753 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, ans = 2018;
cin >> l >> r;
r = min(r, l + 2018);
for (long long i = l; i <= r; ++i) {
for (long long j = l + 1; j <= r; ++j) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, ans = 2018;
cin >> l >> r;
r = min(r, l + 2018);
for (long long i = l; i <= r; ++i) {
for (long long j = i + 1; j <= r; ++j) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,185 | 789,186 | u801916231 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int L, R;
cin >> L >> R;
int minnum = 3000;
if (R - L >= 2018)
cout << 0;
else {
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++) {
minnum = min(minnum, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << minnum;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int L, R;
cin >> L >> R;
int minnum = 3000;
if (R - L >= 2018)
cout << 0;
else {
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
minnum = min(minnum, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << minnum;
}
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,189 | 789,190 | u697090185 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int L, R;
cin >> L >> R;
int minnum = 3000;
if (R - L >= 2018)
cout << 0;
else {
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++) {
minnum = min(minnum, (i % 2019) * (j % 2019));
}
}
cout << minnum;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int L, R;
cin >> L >> R;
int minnum = 3000;
if (R - L >= 2018)
cout << 0;
else {
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
minnum = min(minnum, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << minnum;
}
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 789,191 | 789,190 | u697090185 | cpp |
p02983 | #include <bits/stdc++.h>
//#pragma GCC optimize "-O3"
typedef unsigned long long ull;
typedef unsigned int ui;
typedef unsigned short us;
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll infll = (1ull << 63) - 1;
const int inf = (1ull << 31) - 1;
int l, r, ans = inf;
int main() {
// freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(18);
cin >> l >> r;
if (r - l >= 2018)
cout << "0";
l %= 2019;
r %= 2019;
int t = r - l + 1;
if (t < 0)
t += 2019;
int a[t];
for (int i = 0; i < t; i++)
a[i] = (i + l) % 2019;
for (int i = 0; i < t; i++)
for (int j = i + 1; j < t; j++)
ans = min(ans, (a[i] * a[j]) % 2019);
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
//#pragma GCC optimize "-O3"
typedef unsigned long long ull;
typedef unsigned int ui;
typedef unsigned short us;
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll infll = (1ull << 63) - 1;
const int inf = (1ull << 31) - 1;
int l, r, ans = inf;
int main() {
// freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(18);
cin >> l >> r;
if (r - l >= 2018)
cout << "0";
else {
l %= 2019;
r %= 2019;
int t = r - l + 1;
if (t < 0)
t += 2019;
int a[t];
for (int i = 0; i < t; i++)
a[i] = (i + l) % 2019;
for (int i = 0; i < t; i++)
for (int j = i + 1; j < t; j++)
ans = min(ans, (a[i] * a[j]) % 2019);
cout << ans;
}
return 0;
}
| [
"control_flow.branch.else.add"
] | 789,198 | 789,199 | u162126904 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 10000000000000;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll m = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = l; j <= r; j++) {
m = min(m, i * j % 2019);
}
}
cout << m << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 10000000000000;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
ll m = 2018;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
m = min(m, i * j % 2019);
}
}
cout << m << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 789,200 | 789,201 | u950411977 | cpp |
p02983 | #include <cstdio>
int main() {
long long int a, b, i, ss = 10000, s, j;
scanf("%lld%lld", &a, &b);
if (b / 2019 > a / 2019)
printf("0\n");
else {
for (i = a; i < b; i++)
for (j = i + 1; j < b; j++) {
s = (i * j) % 2019;
if (s < ss)
ss = s;
}
printf("%lld", ss);
}
} | #include <cstdio>
int main() {
long long int a, b, i, ss = 10000, s, j;
scanf("%lld%lld", &a, &b);
if (b / 2019 > a / 2019)
printf("0\n");
else {
for (i = a; i < b; i++)
for (j = i + 1; j <= b; j++) {
s = (i * j) % 2019;
if (s < ss)
ss = s;
}
printf("%lld", ss);
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 789,210 | 789,211 | u083959835 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
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;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
ll l, r;
ll ans = 2019;
cin >> l >> r;
if (r - l >= 100000) {
cout << 0 << endl;
} else {
for (ll i = l; i < r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
min(ans, i * j % 2019);
}
}
cout << 2019 << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
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;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
ll l, r;
ll ans = 2019;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
} else {
for (ll i = l; i < r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
chmin(ans, i * j % 2019);
}
}
cout << ans << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 789,214 | 789,215 | u926242698 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
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;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
ll l, r;
ll ans = 2019;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
} else {
for (ll i = l; i < r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
min(ans, i * j % 2019);
}
}
cout << 2019 << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
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;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
ll l, r;
ll ans = 2019;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
} else {
for (ll i = l; i < r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
chmin(ans, i * j % 2019);
}
}
cout << ans << endl;
}
}
| [
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 789,216 | 789,215 | u926242698 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
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;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
ll l, r;
ll ans = 2019;
cin >> l >> r;
if (r - l >= 100000) {
cout << 0 << endl;
} else {
for (ll i = l; i < r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
min(ans, i * j % 2019);
}
}
cout << 2019 << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
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;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
ll l, r;
ll ans = 2019;
cin >> l >> r;
if (r - l >= 100000) {
cout << 0 << endl;
} else {
for (ll i = l; i < r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
chmin(ans, i * j % 2019);
}
}
cout << ans << endl;
}
}
| [
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 789,214 | 789,217 | u926242698 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
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;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
ll l, r;
ll ans = 2019;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
} else {
for (ll i = l; i < r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
min(ans, i * j % 2019);
}
}
cout << 2019 << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
#define put2darr(arr, row, col) \
rep(i, row) { \
rep(j, col) { printf("%18d", arr[i][j]); } \
cout << endl; \
}
using namespace std;
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;
}
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
int main() {
ll l, r;
ll ans = 2019;
cin >> l >> r;
if (r - l >= 100000) {
cout << 0 << endl;
} else {
for (ll i = l; i < r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
chmin(ans, i * j % 2019);
}
}
cout << ans << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 789,216 | 789,217 | u926242698 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 4038);
// long long ans = 1e18;
long long ans = 2018;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <= R; j++) {
long long a1 = i % 2019;
long long a2 = j % 2019;
ans = min((a1 * a2) % 2019, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long a1 = i % 2019;
long long a2 = j % 2019;
ans = min((a1 * a2) % 2019, ans);
}
}
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.initializer.change"
] | 789,228 | 789,229 | u455366471 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
// long long ans = 1e18;
long long ans = 2018;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <= R; j++) {
long long a1 = i % 2019;
long long a2 = j % 2019;
ans = min((a1 * a2) % 2019, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long a1 = i % 2019;
long long a2 = j % 2019;
ans = min((a1 * a2) % 2019, ans);
}
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,230 | 789,229 | u455366471 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 4038);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <= R; j++) {
long long a1 = i % 2019;
long long a2 = j % 2019;
ans = min((a1 * a2) % 2019, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long a1 = i % 2019;
long long a2 = j % 2019;
ans = min((a1 * a2) % 2019, ans);
}
}
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 789,231 | 789,229 | u455366471 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <= R; j++) {
long long a1 = i % 2019;
long long a2 = j % 2019;
ans = min((a1 * a2) % 2019, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long a1 = i % 2019;
long long a2 = j % 2019;
ans = min((a1 * a2) % 2019, ans);
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,232 | 789,229 | u455366471 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = L + 1; j <= R; j++) {
long long a1 = i;
long long a2 = j;
ans = min((a1 * a2) % 2019, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
long long L, R;
int main() {
cin >> L >> R;
R = min(R, L + 2019);
long long ans = 1e18;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long a1 = i % 2019;
long long a2 = j % 2019;
ans = min((a1 * a2) % 2019, ans);
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 789,233 | 789,229 | u455366471 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.