problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long long int l, r;
int ama = 2020000;
cin >> l >> r;
if (r - l <= 2019)
cout << 0 << endl;
else {
l = l % 2019;
r = r % 2019;
if (l < r) {
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
ama = min((i * j) % 2019, ama);
if (ama == 0)
break;
}
}
} else if (l > r) {
for (int i = r; i <= l - 1; i++) {
for (int j = i + 1; j <= l; j++) {
ama = min((i * j) % 2019, ama);
if (ama == 0)
break;
}
}
} else {
int i = l, j = r;
ama = min((i * j) % 2019, ama);
}
}
cout << ama << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long long int l, r;
int ama = 2020000;
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else {
l = l % 2019;
r = r % 2019;
if (l < r) {
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
ama = min((i * j) % 2019, ama);
if (ama == 0)
break;
}
}
} else if (l > r) {
for (int i = r; i <= l - 1; i++) {
for (int j = i + 1; j <= l; j++) {
ama = min((i * j) % 2019, ama);
if (ama == 0)
break;
}
}
} else {
int i = l, j = r;
ama = min((i * j) % 2019, ama);
}
cout << ama << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,677 | 790,676 | u098700286 | cpp |
p02983 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define INF (1 << 30) - 1
#define LLINF (1LL << 61) - 1
// #define int ll
using namespace std;
const int MOD = 1000000007;
const int MAX = 510000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r, ans = INF;
cin >> l >> r;
if (l / 2019 != r / 2019) {
ans = 0;
} else {
l %= 2019;
r %= 2019;
rep2(i, l, r - 1) {
rep2(j, i + 1, r + 1) { ans = min(ans, i * j % 2019); }
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define INF (1 << 30) - 1
#define LLINF (1LL << 61) - 1
// #define int ll
using namespace std;
const int MOD = 1000000007;
const int MAX = 510000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r, ans = INF;
cin >> l >> r;
if (l / 2019 != r / 2019) {
ans = 0;
} else {
l %= 2019;
r %= 2019;
rep2(i, l, r) {
rep2(j, i + 1, r + 1) { ans = min(ans, i * j % 2019); }
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 790,678 | 790,679 | u241367243 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
ans = min(ans, (i % 2019) * (j % 2019));
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2020;
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;
}
| [
"assignment.change"
] | 790,680 | 790,681 | u559765551 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
}
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
ans = min(ans, (i % 2019) * (j % 2019));
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2020;
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;
}
| [
"control_flow.return.add",
"control_flow.return.0.add",
"assignment.change"
] | 790,682 | 790,681 | u559765551 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
int Lmod = L % 2019;
int Rmod = R % 2019;
int ans = 2019;
if ((R - L) >= 2018) {
ans = 0;
} else if (Lmod > Rmod) {
ans = 0;
} else {
for (int i = Lmod; i < Rmod; i++) {
for (int j = Lmod; j < Rmod; j++) {
if (i != j) {
ans = min(ans, (i * j) % 2019);
}
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
int Lmod = L % 2019;
int Rmod = R % 2019;
int ans = 2019;
if ((R - L) >= 2018) {
ans = 0;
} else if (Lmod > Rmod) {
ans = 0;
} else {
for (int i = Lmod; i <= Rmod; i++) {
for (int j = Lmod; j <= Rmod; j++) {
if (i != j) {
ans = min(ans, (i * j) % 2019);
}
}
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,683 | 790,684 | u661125964 | cpp |
p02983 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000;
const int MOD = (int)1e9 + 7;
signed main() {
int l, r;
cin >> l >> r;
int L = l % 2019;
int R = r % 2019;
int minV = INF;
if (r - l > 2019) {
cout << 0 << "\n";
}
if (L >= R)
R += 2019;
for (int i = L; i < R + 1; i++) {
for (int j = i + 1; j < R + 1; j++) {
int mod = (i * j) % 2019;
minV = min(minV, mod);
}
}
cout << minV << "\n";
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000;
const int MOD = (int)1e9 + 7;
signed main() {
int l, r;
cin >> l >> r;
int L = l % 2019;
int R = r % 2019;
int minV = INF;
if (r - l >= 2019) {
cout << 0 << "\n";
return 0;
}
if (L >= R)
R += 2019;
for (int i = L; i < R + 1; i++) {
for (int j = i + 1; j < R + 1; j++) {
int mod = (i * j) % 2019;
minV = min(minV, mod);
}
}
cout << minV << "\n";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 790,685 | 790,686 | u422029490 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define mod 2019
// long int min(long int a,long int b)
long int solve(long int l, long int r) {
vector<long int> m;
long int ans = INT_MAX;
for (long int i = l; i <= min(l + 2019, r) + 1; i++) {
for (long int j = i + 1; j <= min(l + 2019, r) + 1; j++)
ans = min(ans, i * j % mod);
}
return ans;
}
int main() {
long int l, r;
cin >> l >> r;
cout << solve(l, r);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 2019
// long int min(long int a,long int b)
long int solve(long int l, long int r) {
vector<long int> m;
long int ans = INT_MAX;
for (long int i = l; i <= min(l + 2019, r); i++) {
for (long int j = i + 1; j <= min(l + 2019, r); j++)
ans = min(ans, (i * j) % mod);
}
return ans;
}
int main() {
long int l, r;
cin >> l >> r;
cout << solve(l, r);
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"call.arguments.change"
] | 790,691 | 790,692 | u453299312 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long ans = 0;
long long L_by_2019 = L / 2019;
long long R_by_2019 = R / 2019;
if (L_by_2019 < R_by_2019) {
ans = 0;
} else {
ans = 2019;
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j < R; j++) {
if (ans > (i * j) % 2019) {
ans = (i * j) % 2019;
}
}
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long ans = 0;
long long L_by_2019 = L / 2019;
long long R_by_2019 = R / 2019;
if (L_by_2019 < R_by_2019) {
ans = 0;
} else {
ans = 2019;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
if (ans > (i * j) % 2019) {
ans = (i * j) % 2019;
}
}
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,697 | 790,698 | u430797067 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int L, R;
long long int lm, rm, ans;
ans = 2019;
cin >> L >> R;
lm = L % 2019;
rm = R % 2019;
if (rm - lm > 2018) {
ans = 0;
} else if (lm > rm) {
ans = 0;
}
if (ans != 0) {
for (int i = lm; i <= rm - 1; ++i) {
for (int j = i + 1; j <= rm; ++j) {
ans = ans < ((i * j) % 2019) ? ans : ((i * j) % 2019);
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int L, R;
long long int lm, rm, ans;
ans = 2019;
cin >> L >> R;
lm = L % 2019;
rm = R % 2019;
if (R - L > 2018) {
ans = 0;
} else if (lm > rm) {
ans = 0;
}
if (ans != 0) {
for (int i = lm; i <= rm - 1; ++i) {
for (int j = i + 1; j <= rm; ++j) {
ans = ans < ((i * j) % 2019) ? ans : ((i * j) % 2019);
}
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 790,705 | 790,706 | u431042158 | cpp |
p02983 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 5e18;
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;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 5e18;
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;
}
| [] | 790,707 | 790,708 | u054652697 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= l2 + diff - 1; j++) {
j2 = j % 2019;
for (i = j + 1; i <= j + diff; i++) {
i2 = i % 2019;
rival = (j2 * i2) % 2019;
if (ans > rival) {
ans = rival;
}
if (ans == 0) {
break;
}
}
if (ans == 0) {
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= l2 + diff - 1; j++) {
j2 = j % 2019;
for (i = j + 1; i <= l2 + diff; i++) {
i2 = i % 2019;
rival = (j2 * i2) % 2019;
if (ans > rival) {
ans = rival;
}
if (ans == 0) {
break;
}
}
if (ans == 0) {
break;
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 790,719 | 790,720 | u018807058 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= j + diff - 1; j++) {
j2 = j % 2019;
for (i = j + 1; i <= j + diff; i++) {
i2 = i % 2019;
rival = (j2 * i2) % 2019;
if (ans > rival) {
ans = rival;
}
if (ans == 0) {
break;
}
}
if (ans == 0) {
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= l2 + diff - 1; j++) {
j2 = j % 2019;
for (i = j + 1; i <= l2 + diff; i++) {
i2 = i % 2019;
rival = (j2 * i2) % 2019;
if (ans > rival) {
ans = rival;
}
if (ans == 0) {
break;
}
}
if (ans == 0) {
break;
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 790,721 | 790,720 | u018807058 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= diff - 1; j++) {
j2 = j % 2019;
for (i = j + 1; i <= diff; i++) {
i2 = i % 2019;
rival = (j2 * i2) % 2019;
if (ans > rival) {
ans = rival;
}
if (ans == 0) {
break;
}
}
if (ans == 0) {
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= l2 + diff - 1; j++) {
j2 = j % 2019;
for (i = j + 1; i <= l2 + diff; i++) {
i2 = i % 2019;
rival = (j2 * i2) % 2019;
if (ans > rival) {
ans = rival;
}
if (ans == 0) {
break;
}
}
if (ans == 0) {
break;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change"
] | 790,722 | 790,720 | u018807058 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
} else {
vector<long> num(r - l + 1);
for (long i = 0; i < r - l + 1; i++) {
num[i] = (l + i) % 2019;
}
long ans = 5000000;
for (long i = 0; i < r - l; i++) {
for (long j = 1; j < r - l + 1; j++) {
ans = min(ans, num[i] * num[j]);
}
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
} else {
vector<long> num(r - l + 1);
for (long i = 0; i < r - l + 1; i++) {
num[i] = (l + i) % 2019;
}
long ans = 5000000;
for (long i = 0; i < r - l; i++) {
for (long j = 1; j < r - l + 1; j++) {
ans = min(ans, (num[i] * num[j]) % 2019);
}
}
cout << ans << endl;
}
}
| [
"call.arguments.change",
"call.arguments.add"
] | 790,723 | 790,724 | u637284188 | cpp |
p02983 | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) memset((n), -1, sizeof(n))
#define unset unordered_set
#define ii pair<int, int>
#define vii vector<ii>
#define F first
#define S second
#define PB push_back
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define bitcount(n) __builtin_popcountll(n)
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U> &l, const std::pair<T, U> &r) {
return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void); // type for conciseness
const long long ZERO = 0LL;
const long long INF64 = 1e18;
const int INF32 = 1e9;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0L);
const double EPS = static_cast<double>(1e-9);
typedef long long ll;
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("namenum.in", "r", stdin); freopen("namenum.out",
// "w", stdout); }
void input() {}
// global parameters here:
void solve() {
int l, r;
cin >> l >> r;
if (r - l > 700) {
cout << 0 << endl;
return;
}
int minV = INT_MAX;
FORE(i, l, r) {
int mm1 = (i % 2019);
FORE(j, l + 1, r) {
int mm2 = j % 2019;
minV = min(minV, (mm1 * mm2) % 2019);
// cout << mm1 << ", " << mm2 << ", " << mm1*mm2%2019 << ", " <<
//minV << endl;
}
}
cout << minV << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// int t, test=0; cin >> t;
// while(t--)
{ solve(); }
// auto endProgram = chrono::steady_clock::now();
return 0;
}
| /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) memset((n), -1, sizeof(n))
#define unset unordered_set
#define ii pair<int, int>
#define vii vector<ii>
#define F first
#define S second
#define PB push_back
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define bitcount(n) __builtin_popcountll(n)
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U> &l, const std::pair<T, U> &r) {
return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void); // type for conciseness
const long long ZERO = 0LL;
const long long INF64 = 1e18;
const int INF32 = 1e9;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0L);
const double EPS = static_cast<double>(1e-9);
typedef long long ll;
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("namenum.in", "r", stdin); freopen("namenum.out",
// "w", stdout); }
void input() {}
// global parameters here:
void solve() {
int l, r;
cin >> l >> r;
if (r - l > 700) {
cout << 0 << endl;
return;
}
int minV = INT_MAX;
FORE(i, l, r) {
int mm1 = (i % 2019);
FORE(j, i + 1, r) {
int mm2 = j % 2019;
minV = min(minV, (mm1 * mm2) % 2019);
}
}
cout << minV << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// int t, test=0; cin >> t;
// while(t--)
{ solve(); }
// auto endProgram = chrono::steady_clock::now();
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,735 | 790,736 | u210484769 | cpp |
p02983 | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) memset((n), -1, sizeof(n))
#define unset unordered_set
#define ii pair<int, int>
#define vii vector<ii>
#define F first
#define S second
#define PB push_back
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define bitcount(n) __builtin_popcountll(n)
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U> &l, const std::pair<T, U> &r) {
return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void); // type for conciseness
const long long ZERO = 0LL;
const long long INF64 = 1e18;
const int INF32 = 1e9;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0L);
const double EPS = static_cast<double>(1e-9);
typedef long long ll;
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("namenum.in", "r", stdin); freopen("namenum.out",
// "w", stdout); }
void input() {}
// global parameters here:
void solve() {
int l, r;
cin >> l >> r;
if (r - l > 2020) {
cout << 0 << endl;
return;
}
int minV = INT_MAX;
FORE(i, l, r) {
int mm1 = (i % 2019);
FORE(j, l + 1, r) {
int mm2 = j % 2019;
minV = min(minV, (mm1 * mm2) % 2019);
}
}
cout << minV << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// int t, test=0; cin >> t;
// while(t--)
{ solve(); }
// auto endProgram = chrono::steady_clock::now();
return 0;
}
| /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) memset((n), -1, sizeof(n))
#define unset unordered_set
#define ii pair<int, int>
#define vii vector<ii>
#define F first
#define S second
#define PB push_back
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define bitcount(n) __builtin_popcountll(n)
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U> &l, const std::pair<T, U> &r) {
return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void); // type for conciseness
const long long ZERO = 0LL;
const long long INF64 = 1e18;
const int INF32 = 1e9;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0L);
const double EPS = static_cast<double>(1e-9);
typedef long long ll;
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("namenum.in", "r", stdin); freopen("namenum.out",
// "w", stdout); }
void input() {}
// global parameters here:
void solve() {
int l, r;
cin >> l >> r;
if (r - l > 700) {
cout << 0 << endl;
return;
}
int minV = INT_MAX;
FORE(i, l, r) {
int mm1 = (i % 2019);
FORE(j, i + 1, r) {
int mm2 = j % 2019;
minV = min(minV, (mm1 * mm2) % 2019);
}
}
cout << minV << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// int t, test=0; cin >> t;
// while(t--)
{ solve(); }
// auto endProgram = chrono::steady_clock::now();
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,737 | 790,736 | u210484769 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SREP(i, s) for (int i = 0; i < (s.size()); i++)
#define SORT(v, n) sort(v, v + n);
#define GSORT(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VGSORT(v) sort(v.begin(), v.end(), greater<int>());
#define REV(a) reverse(begin(a), end(a));
ll gcd(ll x, ll y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return (x * y / gcd(x, y)); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
////////////////////////////////////////////
ll l, r;
cin >> l >> r;
ll mint = 2 * 1e9 + 1;
bool a = 0;
bool b = 0;
ll ans = 2 * 1e9 + 1;
if (r - l > 2019)
r = l + 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i; i <= r; i++) {
if (i != j)
mint = min(mint, (i * j) % 2019);
}
}
cout << mint << endl;
/////////////////////////////////////////////
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SREP(i, s) for (int i = 0; i < (s.size()); i++)
#define SORT(v, n) sort(v, v + n);
#define GSORT(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VGSORT(v) sort(v.begin(), v.end(), greater<int>());
#define REV(a) reverse(begin(a), end(a));
ll gcd(ll x, ll y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return (x * y / gcd(x, y)); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
////////////////////////////////////////////
ll l, r;
cin >> l >> r;
ll mint = 2 * 1e9 + 1;
bool a = 0;
bool b = 0;
ll ans = 2 * 1e9 + 1;
if (r - l > 2019)
r = l + 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i; j <= r; j++) {
if (i != j)
mint = min(mint, (i * j) % 2019);
}
}
cout << mint << endl;
/////////////////////////////////////////////
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 790,743 | 790,744 | u398211442 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
/*int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, B);*/
/*int N, D;
cin >> N >> D;
int x[15][15];
int ans = 0;
rep(i, N)rep(j, D)cin >> x[i + 1][j + 1];
for (int i = 1; i < N; i++) {
for (int j = i + 1; j <= N; j++) {
double d = 0;
for (int k = 1; k <= D; k++) {
d += pow(x[i][k] - x[j][k], 2);
}
d = sqrt(d);
if (d == floor(d))ans++;
}
}
cout << ans;*/
ll L, R;
cin >> L >> R;
ll ans = 1e10;
if (R / 3 - L / 3 >= 1 && R / 673 - L - 673 >= 1) {
ans = 0;
cout << ans;
return 0;
}
if (ans != 0) {
for (int i = L % 2019; i < R % 2019; i++) {
for (int j = i + 1; j <= R % 2019; j++) {
ll x = i * j % 2019;
if (ans > x)
ans = x;
if (ans == 0)
break;
}
}
cout << ans;
}
/*int N;
cin >> N;
ll a[100005];
rep(i, N)cin >> a[i + 1];
ll ans[100005];
for (int i = 1; i <= N - 2; i++) {
}*/
return 0;
} | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
/*int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, B);*/
/*int N, D;
cin >> N >> D;
int x[15][15];
int ans = 0;
rep(i, N)rep(j, D)cin >> x[i + 1][j + 1];
for (int i = 1; i < N; i++) {
for (int j = i + 1; j <= N; j++) {
double d = 0;
for (int k = 1; k <= D; k++) {
d += pow(x[i][k] - x[j][k], 2);
}
d = sqrt(d);
if (d == floor(d))ans++;
}
}
cout << ans;*/
ll L, R;
cin >> L >> R;
ll ans = 1e10;
if (R / 3 - L / 3 >= 1 && R / 673 - L / 673 >= 1) {
ans = 0;
cout << ans;
return 0;
}
if (ans != 0) {
for (int i = L % 2019; i < R % 2019; i++) {
for (int j = i + 1; j <= R % 2019; j++) {
ll x = (i * j) % 2019;
if (ans > x)
ans = x;
if (ans == 0)
break;
}
}
cout << ans;
}
/*int N;
cin >> N;
ll a[100005];
rep(i, N)cin >> a[i + 1];
ll ans[100005];
for (int i = 1; i <= N - 2; i++) {
}*/
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 790,747 | 790,748 | u556660175 | 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;
int main() {
long long l, r;
cin >> l >> r;
long long mod = 2019;
bool frag = false;
long long minNum = -1;
for (long long i = l; i < r + 1; i++) {
if (i % mod == 0) {
frag = true;
break;
}
}
if (!frag) {
for (long long i = l; i < r + 1; i++) {
for (long long j = i + 1; j < r + 1; j++) {
if (minNum == -1) {
minNum = (i % mod) * (j % mod) % mod;
} else {
min(minNum, (i % mod) * (j % mod) % mod);
}
}
}
}
if (frag) {
cout << 0 << endl;
} else {
cout << minNum << endl;
}
} | #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;
int main() {
long long l, r;
cin >> l >> r;
long long mod = 2019;
bool frag = false;
long long minNum = -1;
for (long long i = l; i < r + 1; i++) {
if (i % mod == 0) {
frag = true;
break;
}
}
if (!frag) {
for (long long i = l; i < r + 1; i++) {
for (long long j = i + 1; j < r + 1; j++) {
if (minNum == -1) {
minNum = (i % mod) * (j % mod) % mod;
} else {
minNum = min(minNum, (i % mod) * (j % mod) % mod);
}
}
}
}
if (frag) {
cout << 0 << endl;
} else {
cout << minNum << endl;
}
} | [
"assignment.change"
] | 790,782 | 790,783 | u205912769 | cpp |
p02983 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
int P[10010];
void init(int n) {
for (int i = 0; i < n; ++i)
P[i] = i;
}
int root(int a) {
if (P[a] == a)
return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a, int b) {
return root(a) == root(b); //代表元を求める
}
void unite(int a, int b) { P[root(a)] = root(b); } //対set,グラフ？
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
ll f[2001];
// int n,k とかしておく
ll pw(ll x, ll y) { // euclidの互除法より
ll a = 1;
while (y) {
if (y & 1) { //奇数なら
a = a * x % mod;
}
x = x * x % mod;
y /= 2;
}
return a;
}
ll modinv(ll x) { //逆元を求める
return pw(x, mod - 2);
}
ll comb(int n, int r) {
if (n < r) {
return 0;
}
return f[n] * modinv(f[r]) % mod * modinv(f[n - r]) % mod;
} //対combination
int main() {
int l, r;
int ans = 2018;
cin >> l >> r;
if (l - r >= 2019) {
cout << 0 << endl;
return 0;
}
l = l % 2019;
r = r % 2019;
if (r < l) {
r += 2019;
}
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
int P[10010];
void init(int n) {
for (int i = 0; i < n; ++i)
P[i] = i;
}
int root(int a) {
if (P[a] == a)
return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a, int b) {
return root(a) == root(b); //代表元を求める
}
void unite(int a, int b) { P[root(a)] = root(b); } //対set,グラフ？
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
ll f[2001];
// int n,k とかしておく
ll pw(ll x, ll y) { // euclidの互除法より
ll a = 1;
while (y) {
if (y & 1) { //奇数なら
a = a * x % mod;
}
x = x * x % mod;
y /= 2;
}
return a;
}
ll modinv(ll x) { //逆元を求める
return pw(x, mod - 2);
}
ll comb(int n, int r) {
if (n < r) {
return 0;
}
return f[n] * modinv(f[r]) % mod * modinv(f[n - r]) % mod;
} //対combination
int main() {
int l, r;
int ans = 2018;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
l = l % 2019;
r = r % 2019;
if (r < l) {
r += 2019;
}
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 790,799 | 790,800 | u300866293 | cpp |
p02983 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
int P[10010];
void init(int n) {
for (int i = 0; i < n; ++i)
P[i] = i;
}
int root(int a) {
if (P[a] == a)
return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a, int b) {
return root(a) == root(b); //代表元を求める
}
void unite(int a, int b) { P[root(a)] = root(b); } //対set,グラフ？
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
ll f[2001];
// int n,k とかしておく
ll pw(ll x, ll y) { // euclidの互除法より
ll a = 1;
while (y) {
if (y & 1) { //奇数なら
a = a * x % mod;
}
x = x * x % mod;
y /= 2;
}
return a;
}
ll modinv(ll x) { //逆元を求める
return pw(x, mod - 2);
}
ll comb(int n, int r) {
if (n < r) {
return 0;
}
return f[n] * modinv(f[r]) % mod * modinv(f[n - r]) % mod;
} //対combination
int main() {
int l, r;
int ans = 2018;
cin >> l >> r;
if (l - r > 2019) {
cout << 0 << endl;
return 0;
}
l = l % 2019;
r = r % 2019;
if (r < l) {
r += 2019;
}
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
int P[10010];
void init(int n) {
for (int i = 0; i < n; ++i)
P[i] = i;
}
int root(int a) {
if (P[a] == a)
return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a, int b) {
return root(a) == root(b); //代表元を求める
}
void unite(int a, int b) { P[root(a)] = root(b); } //対set,グラフ？
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
ll f[2001];
// int n,k とかしておく
ll pw(ll x, ll y) { // euclidの互除法より
ll a = 1;
while (y) {
if (y & 1) { //奇数なら
a = a * x % mod;
}
x = x * x % mod;
y /= 2;
}
return a;
}
ll modinv(ll x) { //逆元を求める
return pw(x, mod - 2);
}
ll comb(int n, int r) {
if (n < r) {
return 0;
}
return f[n] * modinv(f[r]) % mod * modinv(f[n - r]) % mod;
} //対combination
int main() {
int l, r;
int ans = 2018;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
l = l % 2019;
r = r % 2019;
if (r < l) {
r += 2019;
}
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 790,801 | 790,800 | u300866293 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = 2019;
for (int i = a; i < min(b, a + 2019); i++) {
for (int j = i + 1; j < min(b, a + 2019 + 1); j++) {
c = min(c, i % 2019 * (j % 2019) % 2019);
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = 2019;
for (int i = a; i < min(b, a + 2019); i++) {
for (int j = i + 1; j < min(b + 1, a + 2019 + 1); j++) {
c = min(c, i % 2019 * (j % 2019) % 2019);
}
}
cout << c << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 790,802 | 790,803 | u322177979 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
bool modx(lint l, lint r, lint x) {
if (l % x + (r - l) >= x || l % x == 0 || r % x == 0) {
return true;
}
return false;
}
int main() {
int l, r;
cin >> l >> r;
int lm, rm;
lm = l % 2019;
rm = r % 2019;
int ans = 0;
if (modx(l, r, 2019)) {
ans = 0;
} else if (modx(l, r, 673) && modx(l, r, 3)) {
ans = 0;
} else {
FOR(i, lm, rm + 1) {
FOR(j, i + 1, rm + 1) { ans = min((i * j) % 2019, ans); }
}
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
bool modx(lint l, lint r, lint x) {
if (l % x + (r - l) >= x || l % x == 0 || r % x == 0) {
return true;
}
return false;
}
int main() {
int l, r;
cin >> l >> r;
int lm, rm;
lm = l % 2019;
rm = r % 2019;
int ans = 2019;
if (modx(l, r, 2019)) {
ans = 0;
} else if (modx(l, r, 673) && modx(l, r, 3)) {
ans = 0;
} else {
FOR(i, lm, rm + 1) {
FOR(j, i + 1, rm + 1) { ans = min((i * j) % 2019, ans); }
}
}
cout << ans << "\n";
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 790,817 | 790,818 | u517411077 | cpp |
p02983 | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = unsigned long long;
const long long INF = 1LL << 60;
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;
}
ll min(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
int main(void) {
ll L, R;
cin >> L >> R;
ll ans = 3000;
if (L / 2019 != R / 2019)
ans = 0;
else {
for (int i = L; i < L + 2019 - 1; i++) {
if (i > R)
break;
// cout << i << endl;
for (int j = i + 1; j < L + 2019; j++) {
if (j > R)
break;
ans = min((i % 2019) * (j % 2019), ans);
// if(ans == 0) cout << i << ' ' << j << endl;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = unsigned long long;
const long long INF = 1LL << 60;
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;
}
ll min(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
int main(void) {
ll L, R;
cin >> L >> R;
ll ans = 3000;
if (L / 2019 != R / 2019)
ans = 0;
else {
for (int i = L; i < L + 2019 - 1; i++) {
if (i > R)
break;
// cout << i << endl;
for (int j = i + 1; j < L + 2019; j++) {
if (j > R)
break;
ans = min(((i % 2019) * (j % 2019)) % 2019, ans);
// if(ans == 0) cout << i << ' ' << j << endl;
}
}
}
cout << ans << endl;
}
| [
"call.arguments.change",
"assignment.change"
] | 790,819 | 790,820 | u720721463 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, ans = 2019;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0;
} else {
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;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, ans = 2019;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0;
} else {
for (int i = l; i <= r - 1; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
cout << ans << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 790,821 | 790,822 | u249546633 | cpp |
p02983 | #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
long long int anser = 2020 * 2020;
long long int ans;
for (int i = a; i < b && i < a + 2020; i++) {
for (int j = a + 1; j < b && j < a + 2020; j++) {
ans = ((i % 2019) * (j % 2019)) % 2019;
if (ans == 0) {
cout << ans << endl;
return 0;
} else {
if (ans < anser) {
anser = ans;
}
}
}
}
cout << anser << endl;
return 0;
} | #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
long long int anser = 2020 * 2020;
long long int ans;
for (int i = a; (i < b && i < a + 2020); i++) {
for (int j = a + 1; (j <= b && j < a + 2020); j++) {
ans = ((i % 2019) * (j % 2019)) % 2019;
if (ans == 0) {
cout << ans << endl;
return 0;
} else {
if (ans < anser) {
anser = ans;
}
}
}
}
cout << anser << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 790,825 | 790,826 | u048128931 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (long long(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = max((a), (b))
#define chmin(a, b) a = min((a), (b))
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define inf 1000000000
#define llinf 1000000000000000
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
int main() {
ll l, r;
cin >> l >> r;
r = min(r + 1, l + 5000);
ll ans = inf;
reps(i, l, r) {
reps(j, l + 1, r) {
// cout<<(int)((ll)i*(ll)j%2019)<<endl;
ans = min(ans, (i * j % 2019));
// cout<<i<<" "<<j<<" "<<ans<<endl;
// chmin(ans,(int)((ll)i*(ll)j%2019));
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (long long(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = max((a), (b))
#define chmin(a, b) a = min((a), (b))
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define inf 1000000000
#define llinf 1000000000000000
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
int main() {
ll l, r;
cin >> l >> r;
r = min(r + 1, l + 5000);
ll ans = inf;
reps(i, l, r) {
reps(j, i + 1, r) {
// cout<<i<<" "<<j<<endl;
// cout<<(int)((ll)i*(ll)j%2019)<<endl;
ans = min(ans, (i * j % 2019));
// cout<<i<<" "<<j<<" "<<ans<<endl;
// chmin(ans,(int)((ll)i*(ll)j%2019));
}
}
cout << ans << endl;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,829 | 790,830 | u943094398 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (long long(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = max((a), (b))
#define chmin(a, b) a = min((a), (b))
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define inf 1000000000
#define llinf 1000000000000000
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
int main() {
ll l, r;
cin >> l >> r;
r = min(r + 1, l + 2019);
ll ans = inf;
reps(i, l, r) {
reps(j, l + 1, r) {
// cout<<(int)((ll)i*(ll)j%2019)<<endl;
ans = min(ans, (i * j % 2019));
// cout<<i<<" "<<j<<" "<<ans<<endl;
// chmin(ans,(int)((ll)i*(ll)j%2019));
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (long long(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = max((a), (b))
#define chmin(a, b) a = min((a), (b))
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define inf 1000000000
#define llinf 1000000000000000
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
int main() {
ll l, r;
cin >> l >> r;
r = min(r + 1, l + 5000);
ll ans = inf;
reps(i, l, r) {
reps(j, i + 1, r) {
// cout<<i<<" "<<j<<endl;
// cout<<(int)((ll)i*(ll)j%2019)<<endl;
ans = min(ans, (i * j % 2019));
// cout<<i<<" "<<j<<" "<<ans<<endl;
// chmin(ans,(int)((ll)i*(ll)j%2019));
}
}
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 790,831 | 790,830 | u943094398 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
ll l, r;
cin >> l >> r;
ll imn = min(r - 1, l + 2030);
ll ans = INF;
for (ll i = l; i <= imn; i++) {
ll jmn = min(r, i + 2030);
for (ll j = i + 1; j <= jmn; j++) {
ll tmp = (i % 2019) * (j % 2019);
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
ll l, r;
cin >> l >> r;
ll imn = min(r - 1, l + 2030);
ll ans = INF;
for (ll i = l; i <= imn; i++) {
ll jmn = min(r, i + 2030);
for (ll j = i + 1; j <= jmn; j++) {
ll tmp = (i % 2019) * (j % 2019);
ans = min(ans, tmp % 2019);
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 790,834 | 790,835 | u214304095 | cpp |
p02983 | #include <cmath>
#include <iostream>
using namespace std;
long long int l, r;
long long int mn = 0x3f3f3f3f;
int main() {
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else if (r - l == 1)
cout << (l * r) % 2019 << endl;
else {
for (long long int i = l; i < r - 1; i++) {
for (long long int j = l + 1; j < r; j++) {
mn = min(mn, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << mn << endl;
}
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
long long int l, r;
long long int mn = 0x3f3f3f3f;
int main() {
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else if (r - l == 1)
cout << (l * r) % 2019 << endl;
else {
for (long long int i = l; i < r; i++) {
for (long long int j = i + 1; j <= r; j++) {
mn = min(mn, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << mn << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,840 | 790,841 | u817334641 | cpp |
p02983 | #include <cmath>
#include <iostream>
using namespace std;
long long int l, r;
long long int mn = 0x3f3f3f3f;
int main() {
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else if (r - l == 1)
cout << ((l * r) % 2019) << endl;
else {
for (long long int i = l; i < r - 1; i++) {
for (long long int j = l + 1; j < r; j++) {
mn = min(mn, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << mn << endl;
}
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
long long int l, r;
long long int mn = 0x3f3f3f3f;
int main() {
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else if (r - l == 1)
cout << (l * r) % 2019 << endl;
else {
for (long long int i = l; i < r; i++) {
for (long long int j = i + 1; j <= r; j++) {
mn = min(mn, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << mn << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,842 | 790,841 | u817334641 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 2019;
ll a[2] = {3, 673};
int main() {
ll L, R;
cin >> L >> R;
if (R - L + 1 >= mod) {
cout << 0 << endl;
return 0;
}
if (R - L == 1) {
cout << R * L % mod << endl;
return 0;
}
ll b = L % a[1] == 0 ? L : L + (a[1] - L % a[1]);
ll c = L % a[0] == 0 ? L : L + (a[0] - L % a[0]);
// 673の倍数が範囲外
if (b > R) {
ll ret = 2019;
for (int i = L; i <= R; ++i) {
for (int j = i + 1; j < R; ++j) {
ret = min(i * j % mod, ret);
}
}
cout << ret << endl;
return 0;
// if(c<=R){
// b = c != L ? L : L + 1;
// for (ll i = b + 1; i <= R; ++i) {
// if (c != i && (b * c % mod > c * i % mod))
// b = i;
// }
// }else {
// b = L % mod > R % mod ? R : L;
// c = b != L ? L : L + 1;
// for (ll i = c + 1; i <= R; ++i) {
// if (b != i && (b * c % mod > b * i % mod))
// c = i;
// }
// }
} else {
if (b == c || c > R) {
c = b != L ? L : L + 1;
for (ll i = b - a[0] >= 0 ? b - a[0] : 0; i < b + a[0] + 1; ++i) {
if (L <= i && R >= i && b != i && (b * c % mod > b * i % mod))
c = i;
}
}
}
cout << b * c % mod << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 2019;
ll a[2] = {3, 673};
int main() {
ll L, R;
cin >> L >> R;
if (R - L + 1 >= mod) {
cout << 0 << endl;
return 0;
}
if (R - L == 1) {
cout << R * L % mod << endl;
return 0;
}
ll b = L % a[1] == 0 ? L : L + (a[1] - L % a[1]);
ll c = L % a[0] == 0 ? L : L + (a[0] - L % a[0]);
// 673の倍数が範囲外
if (b > R) {
ll ret = mod;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ret = min(i * j % mod, ret);
}
}
cout << ret << endl;
return 0;
// if(c<=R){
// b = c != L ? L : L + 1;
// for (ll i = b + 1; i <= R; ++i) {
// if (c != i && (b * c % mod > c * i % mod))
// b = i;
// }
// }else {
// b = L % mod > R % mod ? R : L;
// c = b != L ? L : L + 1;
// for (ll i = c + 1; i <= R; ++i) {
// if (b != i && (b * c % mod > b * i % mod))
// c = i;
// }
// }
} else {
if (b == c || c > R) {
c = b != L ? L : L + 1;
for (ll i = b - a[0] >= 0 ? b - a[0] : 0; i < b + a[0] + 1; ++i) {
if (L <= i && R >= i && b != i && (b * c % mod > b * i % mod))
c = i;
}
}
}
cout << b * c % mod << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,852 | 790,851 | u084968244 | cpp |
p02983 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
int c = 2019;
cin >> a >> b;
if (b / 2019 != a / 2019) {
cout << 0 << endl;
return 0;
}
a %= 2019;
b %= 2019;
for (int i = a; i < b; i++)
for (int j = i + 1; j <= b; j++) {
int d = (a * b) % 2019;
if (d < c)
c = d;
}
cout << c << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
int c = 2019;
cin >> a >> b;
if (b / 2019 != a / 2019) {
cout << 0 << endl;
return 0;
}
a %= 2019;
b %= 2019;
for (int i = a; i < b; i++)
for (int j = i + 1; j <= b; j++) {
int d = (i * j) % 2019;
if (c > d)
c = d;
}
cout << c << endl;
} | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 790,862 | 790,863 | u300590099 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b + 1; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >= 2018)
mini = 0;
cout << mini << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >= 2018)
mini = 0;
cout << mini << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 790,899 | 790,900 | u594803920 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b + 1; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >= 2019)
mini = 0;
cout << mini << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >= 2018)
mini = 0;
cout << mini << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 790,901 | 790,900 | u594803920 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b + 1; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (b - a >= 2019)
mini = 0;
cout << mini << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >= 2018)
mini = 0;
cout << mini << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 790,902 | 790,900 | u594803920 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r >= l + 2019) {
cout << 0;
return 0;
}
long long mini = 1000000000;
for (long long i = l; i <= r; i += 1) {
for (long long j = l + 1; j <= r; j += 1) {
long long val = i * j;
val %= 2019;
mini = min(mini, val);
}
}
cout << mini;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r >= l + 2019) {
cout << 0;
return 0;
}
long long mini = 1000000000;
for (long long i = l; i <= r; i += 1) {
for (long long j = i + 1; j <= r; j += 1) {
long long val = i * j;
val %= 2019;
mini = min(mini, val);
}
}
cout << mini;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 790,903 | 790,904 | u689442090 | cpp |
p02983 | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
const ll mod = 1e9 + 7;
const ll inf = 1e18;
int main() {
ll l, r;
cin >> l >> r;
ll sum = inf;
for (auto i = l; l < r; l++) {
for (auto j = i + 1; j <= r; j++) {
sum = min(sum, i * j % 2019);
if (sum == 0)
break;
}
if (sum == 0)
break;
}
cout << sum << endl;
}
| #include <algorithm>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
const ll mod = 1e9 + 7;
const ll inf = 1e18;
int main() {
ll l, r;
cin >> l >> r;
ll sum = inf;
for (auto i = l; i < r; i++) {
for (auto j = i + 1; j <= r; j++) {
sum = min(sum, i * j % 2019);
if (sum == 0)
break;
}
if (sum == 0)
break;
}
cout << sum << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 790,905 | 790,906 | u841421760 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
// Repetitions
#define FOR(i, a, n) for (ll i = ((ll)a); i < ((ll)n); ++i)
#define FORR(i, s, g) for (ll i = ((ll)s - 1); i >= ((ll)g); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
// Container Utils
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SORTALL(v) sort(ALL(v))
#define SZ(a) int((a).size())
#define CLR(a) memset((a), 0, sizeof(a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
// For Debug
#define DMP(x) cerr << #x << " = " << (x) << endl;
#define DBG(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// Aliases
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
// I/O Asynchronizing
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
inline bool is_in(const int x, const int a, const int b) {
return a <= x && x <= b;
}
int main() {
ll l, r, ans;
cin >> l >> r;
int m = INT_MAX;
if (r - l >= 2019) {
m = 0;
} else {
l %= 2019;
r %= 2019;
if (l >= r) {
m = 0;
} else {
FOR(i, l, r + 1) {
FOR(j, l + 1, r + 1) { m = min(m, (int)((i * j) % 2019)); }
}
}
}
cout << m << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// Repetitions
#define FOR(i, a, n) for (ll i = ((ll)a); i < ((ll)n); ++i)
#define FORR(i, s, g) for (ll i = ((ll)s - 1); i >= ((ll)g); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
// Container Utils
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SORTALL(v) sort(ALL(v))
#define SZ(a) int((a).size())
#define CLR(a) memset((a), 0, sizeof(a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
// For Debug
#define DMP(x) cerr << #x << " = " << (x) << endl;
#define DBG(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// Aliases
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
// I/O Asynchronizing
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
inline bool is_in(const int x, const int a, const int b) {
return a <= x && x <= b;
}
int main() {
ll l, r, ans;
cin >> l >> r;
int m = INT_MAX;
if (r - l >= 2019) {
m = 0;
} else {
l %= 2019;
r %= 2019;
if (l >= r) {
m = 0;
} else {
FOR(i, l, r + 1) {
FOR(j, i + 1, r + 1) { m = min(m, (int)((i * j) % 2019)); }
}
}
}
cout << m << endl;
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,907 | 790,908 | u203062059 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, D;
cin >> L >> D;
if (D - L >= 2018) {
cout << 0;
return 0;
}
int min = 2018;
int l = L % 2019;
int d = D % 2019;
if (d - l <= 0) {
cout << 0;
return 0;
}
for (int i = 0; i < (d - l); i++) {
for (int j = i + 1; j <= (d - l); j++) {
if (((l + i) * (d + j)) % 2019 <= min)
min = ((l + i) * (d + j)) % 2019;
}
}
cout << min;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, D;
cin >> L >> D;
if (D - L >= 2018) {
cout << 0;
return 0;
}
int min = 2018;
int l = L % 2019;
int d = D % 2019;
if (d - l <= 0) {
cout << 0;
return 0;
}
for (int i = 0; i < (d - l); i++) {
for (int j = i + 1; j <= (d - l); j++) {
if (((l + i) * (l + j)) % 2019 <= min)
min = ((l + i) * (l + j)) % 2019;
}
}
cout << min;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 790,925 | 790,926 | u947426792 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, D;
cin >> L >> D;
if (D - L >= 2018) {
cout << 0;
return 0;
}
int min = 2018;
int l = L % 2019;
int d = D % 2019;
if (d - l <= 0) {
cout << 0;
return 0;
}
for (int i = 0; i <= (d - l); i++) {
for (int j = i + 1; j <= (d - l); j++) {
if (((l + i) * (d + j)) % 2019 <= min)
min = ((l + i) * (d + j)) % 2019;
}
}
cout << min;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, D;
cin >> L >> D;
if (D - L >= 2018) {
cout << 0;
return 0;
}
int min = 2018;
int l = L % 2019;
int d = D % 2019;
if (d - l <= 0) {
cout << 0;
return 0;
}
for (int i = 0; i < (d - l); i++) {
for (int j = i + 1; j <= (d - l); j++) {
if (((l + i) * (l + j)) % 2019 <= min)
min = ((l + i) * (l + j)) % 2019;
}
}
cout << min;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 790,927 | 790,926 | u947426792 | cpp |
p02983 | // include
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
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();
}
// change
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// math
template <class T> inline T sqr(T x) { return x * x; }
template <class T> inline T nCr(T n, T r) {
T num = 1;
for (int i = 1; i <= r; ++i) {
num *= (n - i + 1) / i;
}
return num;
}
template <class T> inline T nPr(T n, T r) {
r = n - r;
T sum = 1;
int i;
for (i = n; i >= r + 1; --i)
sum *= i;
return sum;
}
template <class T> inline T facctorial(T k) {
T sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
// numeric
template <class T> inline T gcd(T a, T b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
template <class T> inline T lcm(T a, T b) { return a * b / gcd(a, b); }
// typedef
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
constexpr double EPS = 1e-10;
const double PI = acos(-1.0);
constexpr LL INF = 1e10;
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int main() {
LL L, R;
cin >> L >> R;
for (int i = L; i <= R; ++i) {
if (i % 2019 == 0) {
cout << 0 << endl;
return 0;
}
}
L %= 2019;
R %= 2019;
int ans;
ans = L * R % 2019;
for (int i = L; i <= R; ++i) {
for (int j = L + 1; j <= R; ++j) {
if ((i * j) % 2019 < ans) {
ans = (i * j) % 2019;
}
}
}
cout << ans << endl;
} | // include
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
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();
}
// change
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// math
template <class T> inline T sqr(T x) { return x * x; }
template <class T> inline T nCr(T n, T r) {
T num = 1;
for (int i = 1; i <= r; ++i) {
num *= (n - i + 1) / i;
}
return num;
}
template <class T> inline T nPr(T n, T r) {
r = n - r;
T sum = 1;
int i;
for (i = n; i >= r + 1; --i)
sum *= i;
return sum;
}
template <class T> inline T facctorial(T k) {
T sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
// numeric
template <class T> inline T gcd(T a, T b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
template <class T> inline T lcm(T a, T b) { return a * b / gcd(a, b); }
// typedef
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
constexpr double EPS = 1e-10;
const double PI = acos(-1.0);
constexpr LL INF = 1e10;
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int main() {
LL L, R;
cin >> L >> R;
for (int i = L; i <= R; ++i) {
if (i % 2019 == 0) {
cout << 0 << endl;
return 0;
}
}
L %= 2019;
R %= 2019;
int ans;
ans = L * R % 2019;
for (int i = L; i < R; ++i) {
for (int j = L + 1; j <= R; ++j) {
if (((i * j) % 2019) < ans) {
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",
"control_flow.branch.if.condition.change"
] | 790,932 | 790,933 | u946378574 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1000000007
// P pa(114,514); ,vector<P>vec(N,0);
// vector<vector<int>> vec(縦, vector<int>(横));
#define REP(i, N) for (int i = 0; i < N; i++)
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
while (b % a != 0) {
b %= a;
swap(a, b);
}
return a;
}
int kaijou(int n) {
int a = 1;
if (n == 0) {
return 1;
}
REP(i, n) { a *= i + 1; }
return a;
}
int ncr(int n, int r) {
int a;
if (n < 0 || r < 0 || n < r) {
return 0;
}
a = kaijou(n) / kaijou(r) / kaijou(n - r);
return a;
}
// cout << setprecision(123);
int main() {
ll L, R, ans = inf;
ll aaa;
cin >> L >> R;
bool ok = false;
if (R - L >= 672)
cout << 0 << endl;
else {
for (int i = L; i < R + 1; i++) {
for (int j = i; j < R + 1; j++) {
aaa = i * j;
ans = min(ans, aaa % 2019);
if (ans == 0) {
ok = true;
break;
}
}
if (ok) {
break;
}
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1000000007
// P pa(114,514); ,vector<P>vec(N,0);
// vector<vector<int>> vec(縦, vector<int>(横));
#define REP(i, N) for (int i = 0; i < N; i++)
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
while (b % a != 0) {
b %= a;
swap(a, b);
}
return a;
}
int kaijou(int n) {
int a = 1;
if (n == 0) {
return 1;
}
REP(i, n) { a *= i + 1; }
return a;
}
int ncr(int n, int r) {
int a;
if (n < 0 || r < 0 || n < r) {
return 0;
}
a = kaijou(n) / kaijou(r) / kaijou(n - r);
return a;
}
// cout << setprecision(123);
int main() {
ll L, R, ans = inf;
ll aaa;
cin >> L >> R;
bool ok = false;
if (R - L >= 672)
cout << 0 << endl;
else {
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j < R + 1; j++) {
aaa = i * j;
ans = min(ans, aaa % 2019);
if (ans == 0) {
ok = true;
break;
}
}
if (ok) {
break;
}
}
cout << ans << endl;
}
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 790,949 | 790,950 | u503022110 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll l, r;
cin >> l >> r;
ll i = l % 2019;
ll j = r % 2019;
ll ans = INT_MAX;
if ((r - l + 1) >= 2019) {
cout << 0 << endl;
return 0;
} else {
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll l, r;
cin >> l >> r;
ll i = l % 2019;
ll j = r % 2019;
ll ans = INT_MAX;
if ((r - l + 1) >= 2019) {
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 << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 790,958 | 790,959 | u482090956 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll l, r;
cin >> l >> r;
ll i = l % 2019;
ll j = r % 2019;
ll ans = INT_MAX;
if ((r - l + 1) >= 2019) {
cout << 0 << endl;
} else {
for (ll i = l; i <= r; i++) {
for (ll j = l + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll l, r;
cin >> l >> r;
ll i = l % 2019;
ll j = r % 2019;
ll ans = INT_MAX;
if ((r - l + 1) >= 2019) {
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 << endl;
}
| [
"control_flow.return.add",
"control_flow.return.0.add",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 790,960 | 790,959 | u482090956 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int l, r;
cin >> l >> r;
if (r - l + 1 > 2050) {
cout << 0 << endl;
} else {
ll mi = 2019 * 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
mi = min(mi, (i % 2019) * (j % 2019));
}
}
cout << mi << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
ll l, r;
cin >> l >> r;
if (r - l + 1 > 2050) {
cout << 0 << endl;
} else {
ll mi = 2019 * 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
mi = min(mi, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << mi << endl;
}
return 0;
} | [
"variable_declaration.type.change",
"call.arguments.change",
"call.arguments.add"
] | 790,965 | 790,966 | u376817785 | cpp |
p02983 | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
// cout << l << ' ' << r << endl;
ans = min(ans, (l * r) % MOD);
}
}
}
// cout << 2020*2021%MOD << endl;
cout << ans << endl;
} | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
// cout << l << ' ' << r << endl;
ans = min(ans, (l * r) % MOD);
}
}
cout << ans << endl;
}
// cout << 2020*2021%MOD << endl;
} | [] | 790,975 | 790,976 | u693133807 | cpp |
p02983 | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
// cout << l << ' ' << r << endl;
ans = min(ans, (l * r) % MOD);
}
}
}
// cout << 2020*2021%MOD << endl;
cout << ans << endl;
} | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
// cout << l << ' ' << r << endl;
ans = min(ans, (l * r) % MOD);
}
}
cout << ans << endl;
}
// cout << 2020*2021%MOD << endl;
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 790,977 | 790,976 | u693133807 | cpp |
p02983 | #include <iostream>
using namespace std;
const int MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
// cout << l << ' ' << r << endl;
ans = min(ans, (l * r) % MOD);
}
}
}
// cout << 2020*2021%MOD << endl;
cout << ans << endl;
} | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
// cout << l << ' ' << r << endl;
ans = min(ans, (l * r) % MOD);
}
}
cout << ans << endl;
}
// cout << 2020*2021%MOD << endl;
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 790,978 | 790,976 | u693133807 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (b - a >= 2019)
cout << "0" << '\n';
else {
int ans = 2018;
for (long long i = a + 1; i <= b; i++) {
for (long long j = a; j <= i; j++) {
if ((i * j) % 2019 < ans)
ans = (i * j) % 2019;
}
}
cout << ans << '\n';
}
} | #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (b - a >= 2019)
cout << "0" << '\n';
else {
int ans = 2018;
for (long long i = a + 1; i <= b; i++) {
for (long long j = a; j < i; j++) {
if ((i * j) % 2019 < ans)
ans = (i * j) % 2019;
}
}
cout << ans << '\n';
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,979 | 790,980 | u477734611 | cpp |
p02983 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define vi(a, n) vector<int> a(n)
#define vs(a, n) vector<string> a(n)
#define vc(a, n) vector<char> a(n)
#define psb(a) push_back(a)
#define ppb pop_back()
#define erc(S, i) S.erase(S.begin() + i)
#define ers(S, i, j) S.erase(S.begin() + i, S.begin() + j)
#define sp(n) cout << setprecision(n) << fixed
#define fst(s) s.at(0)
#define lst(s) s.at(s.len - 1)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main() {
int L, R;
cin >> L >> R;
int ans;
if (R / 2019 == L / 2019) {
L %= 2019;
R %= 2019;
ans = L * (L + 1) % 2019;
rng(i, L, R) {
rng(j, i + 1, R + 1) { ans = min(ans, i * j); }
}
// cout << "true" << endl;
} else {
ans = 0;
// cout << "false" << endl;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define vi(a, n) vector<int> a(n)
#define vs(a, n) vector<string> a(n)
#define vc(a, n) vector<char> a(n)
#define psb(a) push_back(a)
#define ppb pop_back()
#define erc(S, i) S.erase(S.begin() + i)
#define ers(S, i, j) S.erase(S.begin() + i, S.begin() + j)
#define sp(n) cout << setprecision(n) << fixed
#define fst(s) s.at(0)
#define lst(s) s.at(s.len - 1)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main() {
int L, R;
cin >> L >> R;
int ans;
if (R / 2019 == L / 2019) {
L %= 2019;
R %= 2019;
ans = L * (L + 1) % 2019;
rng(i, L, R) {
rng(j, i + 1, R + 1) { ans = min(ans, i * j % 2019); }
}
// cout << "true" << endl;
} else {
ans = 0;
// cout << "false" << endl;
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 790,981 | 790,982 | u676578971 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
const ll M = 2019;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll ans = M - 1;
for (ll l = L; l <= min(R, L + M - 1); l++) {
for (ll r = L + 1; r <= min(R, L + M - 1); r++) {
ans = min(ans, (l * r) % M);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
const ll M = 2019;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll ans = M - 1;
for (ll l = L; l <= min(R, L + M - 1); l++) {
for (ll r = l + 1; r <= min(R, L + M - 1); r++) {
ans = min(ans, (l * r) % M);
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 790,987 | 790,988 | u637771514 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define all(x) (x).begin(), (x).end()
using LL = long long;
using LD = long double;
using pii = pair<int, int>;
using vii = vector<pii>;
const int INF = 1e18;
const int MOD = 2019;
const int N = 1e5 + 5;
int32_t main() {
// ios::sync_with_stdio(false); cin.tie(nullptr);
int l, r;
cin >> l >> r;
int ans = MOD * MOD;
for (int i = l; i < min(r, 2 * MOD); i++) {
for (int j = i + 1; j < min(r, 2 * MOD); j++) {
ans = min(ans, (i % MOD) * (j % MOD) % MOD);
}
}
cout << ans << "\n";
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define all(x) (x).begin(), (x).end()
using LL = long long;
using LD = long double;
using pii = pair<int, int>;
using vii = vector<pii>;
const int INF = 1e18;
const int MOD = 2019;
const int N = 1e5 + 5;
int32_t main() {
// ios::sync_with_stdio(false); cin.tie(nullptr);
int l, r;
cin >> l >> r;
int ans = MOD * MOD;
for (int i = l; i < min(r, l + 2 * MOD); i++) {
for (int j = i + 1; j <= min(r, l + 2 * MOD); j++) {
ans = min(ans, (i % MOD) * (j % MOD) % MOD);
}
}
cout << ans << "\n";
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 790,997 | 790,996 | u192295874 | cpp |
p02983 | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int MOD = 1000000007;
// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};
// debug
//--------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// IO accelerate
//--------------------------------------------
struct InitIO {
InitIO() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
} init_io;
// template
//--------------------------------------------
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : "\t");
}
return os;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
for (int i = 0; i < vv.size(); ++i) {
s << vv[i] << endl;
}
return s;
}
// main code
int main(int argc, char const *argv[]) {
LL l, r;
cin >> l >> r;
LL m = 2019;
for (LL i = l; i <= r; i++) {
if (i % m == 0) {
cout << 0 << endl;
return 0;
}
}
LL ans = 2019;
for (LL i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, ((l % m) * ((j) % m)) % m);
}
}
cout << ans << endl;
return 0;
}
| // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int MOD = 1000000007;
// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};
// debug
//--------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// IO accelerate
//--------------------------------------------
struct InitIO {
InitIO() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
} init_io;
// template
//--------------------------------------------
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : "\t");
}
return os;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
for (int i = 0; i < vv.size(); ++i) {
s << vv[i] << endl;
}
return s;
}
// main code
int main(int argc, char const *argv[]) {
LL l, r;
cin >> l >> r;
LL m = 2019;
for (LL i = l; i <= r; i++) {
if (i % m == 0) {
cout << 0 << endl;
return 0;
}
}
LL ans = 2019;
for (LL i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, ((i % m) * ((j) % m)) % m);
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,998 | 790,999 | u150376070 | cpp |
p02983 | #include <bits/stdc++.h>
#ifndef LOCAL
#pragma GCC optimize(3)
#endif
#define ls (rt << 1)
#define rs (rt << 1) | 1
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1e6 + 100;
const int mod = 1e9 + 7;
ll loc[100][30];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ll l, r;
cin >> l >> r;
if (r - l > 3000) {
cout << 0 << endl;
} else {
ll ans = inf;
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, 1LL * i % 2019 * j % 2019);
}
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#ifndef LOCAL
#pragma GCC optimize(3)
#endif
#define ls (rt << 1)
#define rs (rt << 1) | 1
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1e6 + 100;
const int mod = 1e9 + 7;
ll loc[100][30];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ll l, r;
cin >> l >> r;
if (r - l > 3000) {
cout << 0 << endl;
} else {
ll ans = inf;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, 1LL * i % 2019 * (j % 2019) % 2019);
}
}
cout << ans << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,000 | 791,001 | u924249565 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans = 2018;
cin >> a >> b;
if (b - a >= 2019)
puts("0");
else {
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans = 2018;
cin >> a >> b;
if (b - a >= 2019)
puts("0");
else {
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
}
return 0;
} | [] | 791,002 | 791,003 | u432702669 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int l, r;
int main() {
scanf("%d %d", &l, &r);
if (r - l + 1 >= 2019)
printf("0");
else {
int minn = 2020;
for (int i = l; i < r - 1; i++) {
for (int j = i + 1; j < r; j++) {
minn = min(minn, ((i % 2019) * (j % 2019)) % 2019);
}
}
printf("%d", minn);
}
}
| #include <bits/stdc++.h>
using namespace std;
int l, r;
int main() {
scanf("%d %d", &l, &r);
if (r - l + 1 >= 2019)
printf("0");
else {
int minn = 2020;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
minn = min(minn, ((i % 2019) * (j % 2019)) % 2019);
}
}
printf("%d", minn);
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,006 | 791,007 | u076783581 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019)
cout << 0 << endl;
ll res = numeric_limits<ll>::max();
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
res = min(res, (i * j) % 2019);
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019)
cout << 0 << endl;
else {
ll res = numeric_limits<ll>::max();
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
res = min(res, (i * j) % 2019);
}
}
cout << res << endl;
}
return 0;
} | [
"control_flow.branch.else.add"
] | 791,008 | 791,009 | u235057691 | cpp |
p02983 | //#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// namespace mp = boost::multiprecision;
// using llll = mp::cpp_int;
// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)
// using Real = mp::number<mp::cpp_dec_float<1024>>;
using ll = long long;
const double EPS = 1e-10;
const ll MOD = 7 + (1e+9);
int main() {
ll l, r;
cin >> l >> r;
vector<ll> v;
for (ll i = l; i <= r && (i - l) < 2019 * 2; i++) {
v.push_back(i % 2019);
}
sort(v.begin(), v.end());
ll n = v.size();
ll ans = 2019;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < n; j++) {
ans = min(ans, v[0] * v[1] % 2019);
}
}
cout << ans << endl;
}
| //#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// namespace mp = boost::multiprecision;
// using llll = mp::cpp_int;
// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)
// using Real = mp::number<mp::cpp_dec_float<1024>>;
using ll = long long;
const double EPS = 1e-10;
const ll MOD = 7 + (1e+9);
int main() {
ll l, r;
cin >> l >> r;
vector<ll> v;
for (ll i = l; i <= r && (i - l) < 2019 * 2; i++) {
v.push_back(i % 2019);
}
sort(v.begin(), v.end());
ll n = v.size();
ll ans = 2019;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < n; j++) {
ans = min(ans, v[i] * v[j] % 2019);
}
}
cout << ans << endl;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,014 | 791,015 | u569367525 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
LL l, r;
cin >> l >> r;
LL ans = LINF;
for (LL i = l; i <= min(l + 2019LL, r); i++) {
for (LL j = l + 1; j <= min(l + 2019LL, r); j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
LL l, r;
cin >> l >> r;
LL ans = LINF;
for (LL i = l; i < min(l + 2019LL, r); i++) {
for (LL j = l + 1; j <= min(l + 2019LL, r); j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,038 | 791,039 | u640323045 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define range(i, n, m) for (ll i = n; i < m; i++)
#define rrange(i, n, m) for (ll i = n - 1; i = > m; i--)
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vp vector<pair<ll, ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define First first
#define Second second.first
#define Third second.second
//#define MOD 998244353
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
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;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll min = 2019;
R = R - (ll)(L / 2019) * 2019;
L = L - (ll)(L / 2019) * 2019;
if (R >= 2019) {
cout << 0 << endl;
} else if (L == 0) {
cout << 0 << endl;
} else {
range(i, L, R) {
range(k, i + 1, R) { chmin(min, (i * k) % 2019); }
}
cout << min << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define range(i, n, m) for (ll i = n; i < m; i++)
#define rrange(i, n, m) for (ll i = n - 1; i = > m; i--)
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vp vector<pair<ll, ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define First first
#define Second second.first
#define Third second.second
//#define MOD 998244353
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
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;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll min = 2019;
R = R - (ll)(L / 2019) * 2019;
L = L - (ll)(L / 2019) * 2019;
if (R >= 2019) {
cout << 0 << endl;
} else if (L == 0) {
cout << 0 << endl;
} else {
range(i, L, R + 1) {
range(k, i + 1, R + 1) { chmin(min, (i * k) % 2019); }
}
cout << min << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 791,042 | 791,043 | u991974907 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ll l, r;
cin >> l >> r;
if (l / 2019 < r / 2019) {
cout << 0;
return 0;
}
l %= 2019;
r %= 2019;
ll m = 1e+9;
for (int i = l; i < r - 1; i++) {
for (int j = i + 1; j < r; j++) {
m = ((i * j) % 2019 < m) ? ((i * j) % 2019) : m;
}
}
cout << m;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ll l, r;
cin >> l >> r;
if (l / 2019 < r / 2019) {
cout << 0;
return 0;
}
l %= 2019;
r %= 2019;
ll m = 1e+9;
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1; j <= r; j++) {
m = ((i * j) % 2019 < m) ? ((i * j) % 2019) : m;
}
}
cout << m;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,044 | 791,045 | u129667379 | cpp |
p02983 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, k, cc[50000][20], dd[500000], a, b;
char s[500000];
int main() {
scanf("%d%d", &n, &a);
if (n - a >= 2018)
printf("0\n");
else {
n %= 2019;
a %= 2019;
m = 2019;
if (n > a)
printf("0\n");
else {
for (int i = n; i <= a; i++) {
for (int j = i + 1; j <= a; j++)
m = min(m, (i * j) % 2019);
}
printf("%d\n", m);
}
}
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, k, cc[50000][20], dd[500000], a, b;
char s[500000];
int main() {
scanf("%d%d", &n, &a);
if (a - n >= 2018)
printf("0\n");
else {
n %= 2019;
a %= 2019;
m = 2019;
if (n > a)
printf("0\n");
else {
for (int i = n; i <= a; i++) {
for (int j = i + 1; j <= a; j++)
m = min(m, (i * j) % 2019);
}
printf("%d\n", m);
}
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 791,050 | 791,051 | u704549083 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
#define MOD 1000000007
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;
}
//
// struct Node{
// vint children;
// ll index;
// ll prop;
// };
// struct edge{ll to; ll cost;};
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
// ll X,Y,Z,K;
// ll pmax = 30000000000;
// vint A,B,C;
// void comb(vector<vector <long long int> > &v){
// for(int i = 0;i <v.size(); i++){
// v[i][0]=1;
// v[i][i]=1;
// }
// for(int k = 1;k <v.size();k++){
// for(int j = 1;j<k;j++){
// v[k][j]=((v[k-1][j-1]+v[k-1][j])%MOD);
// }
// }
// }
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 510000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { //最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll my_pow(ll x, ll y) {
ll rtn = 1;
rep(i, y) rtn *= x;
return rtn;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
ll arr[55556];
vint primes;
//エラトステネスの篩
void Eratosthenes() {
ll N = 55556;
for (ll i = 0; i < N; i++) {
arr[i] = 1;
}
for (ll i = 2; i < sqrt(N); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) < N; j++) {
arr[i * (j + 2)] = 0;
}
}
}
for (ll i = 2; i < N; i++) {
if (arr[i] && i % 5 == 1) {
primes.pb(i);
// cout << i << endl;
}
}
}
// ll depth[1000000];
// vpint tree[100010];
//
//
// void dfs(ll v, ll p, ll d){
// depth[v] = d;
// for(auto e:tree[v]){
// if(e.fi == p) continue;
// dfs(e.fi, v, d+e.se);
// }
// }
// const ll cmb_max = 100;
// ll cmb[cmb_max][cmb_max];
// void cmb_init(){
// cmb[1][0] = cmb[1][1] = 1;
// repf(i,2,cmb_max){
// rep(j,i+1){
// if(j==0 || j==i) cmb[i][j] = 1;
// else{
// cmb[i][j] = cmb[i-1][j-1]+cmb[i-1][j];
// }
// }
// }
// }
int main() {
cout << fixed << setprecision(10);
ll L, R;
cin >> L >> R;
ll ans = ((R % 2019) * (L % 2019)) % 2019;
for (ll i = L; i <= min(R - 1, L + 2019); i++) {
for (ll j = i + 1; j <= min(R - 1, L + 2019 + 1); j++) {
chmin(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
}
//
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
#define MOD 1000000007
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;
}
//
// struct Node{
// vint children;
// ll index;
// ll prop;
// };
// struct edge{ll to; ll cost;};
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
// ll X,Y,Z,K;
// ll pmax = 30000000000;
// vint A,B,C;
// void comb(vector<vector <long long int> > &v){
// for(int i = 0;i <v.size(); i++){
// v[i][0]=1;
// v[i][i]=1;
// }
// for(int k = 1;k <v.size();k++){
// for(int j = 1;j<k;j++){
// v[k][j]=((v[k-1][j-1]+v[k-1][j])%MOD);
// }
// }
// }
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 510000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { //最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll my_pow(ll x, ll y) {
ll rtn = 1;
rep(i, y) rtn *= x;
return rtn;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
ll arr[55556];
vint primes;
//エラトステネスの篩
void Eratosthenes() {
ll N = 55556;
for (ll i = 0; i < N; i++) {
arr[i] = 1;
}
for (ll i = 2; i < sqrt(N); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) < N; j++) {
arr[i * (j + 2)] = 0;
}
}
}
for (ll i = 2; i < N; i++) {
if (arr[i] && i % 5 == 1) {
primes.pb(i);
// cout << i << endl;
}
}
}
// ll depth[1000000];
// vpint tree[100010];
//
//
// void dfs(ll v, ll p, ll d){
// depth[v] = d;
// for(auto e:tree[v]){
// if(e.fi == p) continue;
// dfs(e.fi, v, d+e.se);
// }
// }
// const ll cmb_max = 100;
// ll cmb[cmb_max][cmb_max];
// void cmb_init(){
// cmb[1][0] = cmb[1][1] = 1;
// repf(i,2,cmb_max){
// rep(j,i+1){
// if(j==0 || j==i) cmb[i][j] = 1;
// else{
// cmb[i][j] = cmb[i-1][j-1]+cmb[i-1][j];
// }
// }
// }
// }
int main() {
cout << fixed << setprecision(10);
ll L, R;
cin >> L >> R;
ll ans = ((R % 2019) * (L % 2019)) % 2019;
for (ll i = L; i <= min(R - 1, L + 2019); i++) {
for (ll j = i + 1; j <= min(R, L + 2019 + 1); j++) {
chmin(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
}
//
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 791,052 | 791,053 | u644070128 | cpp |
p02983 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 2019;
signed main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
l %= mod;
r %= mod;
if (r < l)
r += mod;
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = l + 1; j <= r; ++j) {
ans = min(ans, (i * j) % mod);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 2019;
signed main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
l %= mod;
r %= mod;
if (r < l)
r += mod;
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
ans = min(ans, (i * j) % mod);
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,054 | 791,055 | u698760125 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define MOD 1000000007
#define PI 3.14159265359
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
typedef tree<pii,null_type,less
<pii>,rb_tree_tag,tree_order_statistics_node_update>ind_set;
*/
///*X.find_by_order("index")
/// X.order_of_key("key")
#define deb(x) cerr << #x << " : " << x << "\n";
#ifndef local
#define deb(x) ;
#endif
///----------------------------------------------------------------------------------
int a, b;
void solve() {
cin >> a >> b;
if (b - a < 5000) {
int ans = (a * b) % 2019;
rep(i, a, b) { rep(j, i + 1, b) ans = min(ans, (i * j) % 2019); }
cout << ans << "\n";
return;
}
cout << "0\n";
return;
a %= 2019;
b %= 2019;
if (a > b)
swap(a, b);
int ans = (a * b) % 2019;
rep(i, a, b) { rep(j, i, b) ans = min(ans, (i * j) % 2019); }
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef local
/// freopen("input.txt","r",stdin);
/// freopen("output.txt","w",stdout);
clock_t qwertyuiop = clock();
#endif
int t = 1;
/// cin>>t;
rep(a, 0, t) {
/// cout<<"Case #"<<a+1<<": ";
solve();
}
#ifdef local
{
qwertyuiop = clock() - qwertyuiop;
double time_taken = ((double)qwertyuiop) / CLOCKS_PER_SEC;
cerr << fixed << setprecision(5) << "\n\nTime Taken : " << time_taken
<< " seconds\n";
}
#endif
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define MOD 1000000007
#define PI 3.14159265359
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
typedef tree<pii,null_type,less
<pii>,rb_tree_tag,tree_order_statistics_node_update>ind_set;
*/
///*X.find_by_order("index")
/// X.order_of_key("key")
#define deb(x) cerr << #x << " : " << x << "\n";
#ifndef local
#define deb(x) ;
#endif
///----------------------------------------------------------------------------------
int a, b;
void solve() {
cin >> a >> b;
if (b - a < 5000) {
int ans = (a * b) % 2019;
rep(i, a, b + 1) { rep(j, i + 1, b + 1) ans = min(ans, (i * j) % 2019); }
cout << ans << "\n";
return;
}
cout << "0\n";
return;
a %= 2019;
b %= 2019;
if (a > b)
swap(a, b);
int ans = (a * b) % 2019;
rep(i, a, b) { rep(j, i, b) ans = min(ans, (i * j) % 2019); }
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef local
/// freopen("input.txt","r",stdin);
/// freopen("output.txt","w",stdout);
clock_t qwertyuiop = clock();
#endif
int t = 1;
/// cin>>t;
rep(a, 0, t) {
/// cout<<"Case #"<<a+1<<": ";
solve();
}
#ifdef local
{
qwertyuiop = clock() - qwertyuiop;
double time_taken = ((double)qwertyuiop) / CLOCKS_PER_SEC;
cerr << fixed << setprecision(5) << "\n\nTime Taken : " << time_taken
<< " seconds\n";
}
#endif
} | [
"assignment.change"
] | 791,058 | 791,059 | u953587543 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll p, q;
cin >> p >> q;
ll ans = 1e16;
if (q - p >= 2019)
cout << 0;
else {
for (ll i = p; i <= q; i++) {
for (ll j = p + 1; j <= q; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll p, q;
cin >> p >> q;
ll ans = 1e16;
if (q - p >= 2019)
cout << 0;
else {
for (ll i = p; i <= q; i++) {
for (ll j = i + 1; j <= q; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans;
}
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,066 | 791,067 | u221372861 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll p, q;
cin >> p >> q;
ll ans = 1e16;
if (q - p >= 2019)
cout << 0;
else {
for (ll i = p; i <= q; i++) {
for (ll j = p + 1; j <= q; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll p, q;
cin >> p >> q;
ll ans = 1e16;
if (q - p >= 2019)
cout << 0;
else {
for (ll i = p; i <= q; i++) {
for (ll j = i + 1; j <= q; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans;
}
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,068 | 791,067 | u221372861 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
#define ve vector
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vvi vector<vector<int>>
typedef long long ll;
const ll INF = LLONG_MAX - 100;
const ll mod = 1e9 + 7;
const int MAX_N = 2e5 + 5;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
int fac[MAX_N], inv[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
void DEBUG(vector<int> a) {
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
}
void EMP(int x) { cout << "!!!" << x << "!!!" << endl; }
ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
ll POW(ll a, ll b, bool usemod = true) {
ll c = 1LL;
while (b > 0) {
if (b & 1LL) {
if (!usemod)
c *= a;
else
c = a * c % mod;
}
if (!usemod)
a *= a;
else
a = a * a % mod;
b >>= 1LL;
}
return c;
}
void _nCr() {
fac[0] = 1LL;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1LL] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
void PRI(ll n) {
bool a[n + 1LL];
for (int i = 0; i < n + 1LL; i++) {
a[i] = 1LL;
}
for (int i = 2; i < n + 1LL; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
template <typename T> T chmin(T &a, T b) {
if (a > b)
a = b;
return a;
}
template <typename T> T chmax(T &a, T b) {
if (a < b)
a = b;
return b;
}
bool solve() {
int l, r;
cin >> l >> r;
int dif = r - l;
if (dif > 2019) {
cout << 0 << endl;
return 0;
}
l %= 2019;
r = l + dif;
int ans = INF;
FOR(i, l, r + 1) {
FOR(j, i + 1, r + 1) { ans = min(ans, i * j % mod); }
}
cout << ans << endl;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
#define ve vector
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vvi vector<vector<int>>
typedef long long ll;
const ll INF = LLONG_MAX - 100;
const ll mod = 1e9 + 7;
const int MAX_N = 2e5 + 5;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
int fac[MAX_N], inv[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
void DEBUG(vector<int> a) {
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
}
void EMP(int x) { cout << "!!!" << x << "!!!" << endl; }
ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
ll POW(ll a, ll b, bool usemod = true) {
ll c = 1LL;
while (b > 0) {
if (b & 1LL) {
if (!usemod)
c *= a;
else
c = a * c % mod;
}
if (!usemod)
a *= a;
else
a = a * a % mod;
b >>= 1LL;
}
return c;
}
void _nCr() {
fac[0] = 1LL;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1LL] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
void PRI(ll n) {
bool a[n + 1LL];
for (int i = 0; i < n + 1LL; i++) {
a[i] = 1LL;
}
for (int i = 2; i < n + 1LL; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
template <typename T> T chmin(T &a, T b) {
if (a > b)
a = b;
return a;
}
template <typename T> T chmax(T &a, T b) {
if (a < b)
a = b;
return b;
}
bool solve() {
int l, r;
cin >> l >> r;
int dif = r - l;
if (dif > 2019) {
cout << 0 << endl;
return 0;
}
l %= 2019;
r = l + dif;
int ans = INF;
FOR(i, l, r + 1) {
FOR(j, i + 1, r + 1) { ans = min(ans, i * j % 2019); }
}
cout << ans << endl;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,090 | 791,091 | u764234894 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
int n, d;
long long x[30][30];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int l, r;
long long res = 1000000000000000000;
cin >> l >> r;
if (r - l + 1 >= 2019)
cout << 0 << endl;
else {
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
long long tmp = (i % 2019) * (j % 2019);
tmp %= 2019;
res = min(res, tmp);
}
}
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
int n, d;
long long x[30][30];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int l, r;
long long res = 1000000000000000000;
cin >> l >> r;
if (r - l + 1 >= 2019)
cout << 0 << endl;
else {
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
long long tmp = (i % 2019) * (j % 2019);
tmp %= 2019;
res = min(res, tmp);
}
}
cout << res << endl;
}
return 0;
}
| [] | 791,092 | 791,093 | u432617434 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, R;
cin >> L >> R;
int mmin = 2020;
for (int i = L; i <= min(L + 2030, R); i++) {
for (int j = i + 1; j < min(i + 2030, R); j++) {
int val = 1LL * i * j % 2019;
mmin = min(mmin, val);
}
}
cout << mmin << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, R;
cin >> L >> R;
int mmin = 2020;
for (int i = L; i <= min(L + 2030, R); i++) {
for (int j = i + 1; j <= min(i + 2030, R); j++) {
int val = 1LL * i * j % 2019;
mmin = min(mmin, val);
}
}
cout << mmin << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,094 | 791,095 | u305757380 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
ostream &operator<<(ostream &out, string str) {
for (char c : str)
cout << c;
return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class T>
auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
out << "{";
for (auto it = a.begin(); it != a.end(); it = next(it))
out << (it != a.begin() ? ", " : "") << *it;
return out << "}";
}
void dump() { cerr << "\n"; }
template <class T, class... Ts> void dump(T a, Ts... x) {
cerr << a << ", ";
dump(x...);
}
#ifdef DEBUG
#define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) false
#endif
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define ST first
#define ND second
template <class T> int size(T &&a) { return a.size(); }
using LL = long long;
using PII = pair<int, int>;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int l, r;
cin >> l >> r;
int mod = 2019;
LL ans = 1e18;
LL lmod = l % mod;
for (LL i = l; l < r; l++) {
LL imod = i % mod;
if (i != l && imod == lmod)
break;
for (LL j = i + 1; j <= r; j++) {
LL jmod = j % mod;
if (j != (i + 1) && jmod == (i + 1) % mod)
break;
ans = min(ans, imod * jmod % mod);
}
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
ostream &operator<<(ostream &out, string str) {
for (char c : str)
cout << c;
return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class T>
auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
out << "{";
for (auto it = a.begin(); it != a.end(); it = next(it))
out << (it != a.begin() ? ", " : "") << *it;
return out << "}";
}
void dump() { cerr << "\n"; }
template <class T, class... Ts> void dump(T a, Ts... x) {
cerr << a << ", ";
dump(x...);
}
#ifdef DEBUG
#define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) false
#endif
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define ST first
#define ND second
template <class T> int size(T &&a) { return a.size(); }
using LL = long long;
using PII = pair<int, int>;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int l, r;
cin >> l >> r;
int mod = 2019;
LL ans = 1e18;
LL lmod = l % mod;
for (LL i = l; i < r; i++) {
LL imod = i % mod;
if (i != l && imod == lmod)
break;
for (LL j = i + 1; j <= r; j++) {
LL jmod = j % mod;
if (j != (i + 1) && jmod == (i + 1) % mod)
break;
ans = min(ans, (imod * jmod) % mod);
}
}
cout << ans << "\n";
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,096 | 791,097 | u765393825 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
long long m = 1000000000;
for (long long i = l; i < r + 1; i++) {
for (long long j = l + 1; j < r + 1; j++) {
long long tmp = ((i % 2019) * (j % 2019)) % 2019;
if (m > tmp) {
m = tmp;
}
}
}
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
long long m = 1000000000;
for (long long i = l; i < r + 1; i++) {
for (long long j = i + 1; j < r + 1; j++) {
long long tmp = ((i % 2019) * (j % 2019)) % 2019;
if (m > tmp) {
m = tmp;
}
}
}
cout << m << endl;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,105 | 791,106 | u679245300 | cpp |
p02983 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int mod = 2019;
int l, r;
cin >> l >> r;
if (r - l <= 2019) {
cout << 0 << endl;
return 0;
}
l = l % mod;
r = r % mod;
if (l >= r) {
cout << 0 << endl;
return 0;
}
int min = 3000;
for (int i = l; i < r; i++) {
for (int k = i + 1; k <= r; k++) {
int res = (i * k) % mod;
if (res < min) {
min = res;
}
}
}
cout << min << endl;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int mod = 2019;
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
l = l % mod;
r = r % mod;
if (l >= r) {
cout << 0 << endl;
return 0;
}
int min = 3000;
for (int i = l; i < r; i++) {
for (int k = i + 1; k <= r; k++) {
int res = (i * k) % mod;
if (res < min) {
min = res;
}
}
}
cout << min << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,127 | 791,128 | u639426108 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#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 REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
#define CINT(...) \
int __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
ll __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef unsigned long long ul;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double PI = atan(1.0) * 4.0;
// const int MOD = 998244353;
const ll LINF = 9e18;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
vector<vector<double>> x;
signed main() {
LCIN(L, R);
if (R - L + 1 >= 2019) {
cout << 0 << "\n";
} else {
ll ans = 2019;
FOR(i, L, R + 1) FOR(j, i + 1, R + 1) { ans = min(ans, (i * j) % MOD); }
cout << ans << "\n";
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#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 REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
#define CINT(...) \
int __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
ll __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef unsigned long long ul;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double PI = atan(1.0) * 4.0;
// const int MOD = 998244353;
const ll LINF = 9e18;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
vector<vector<double>> x;
signed main() {
LCIN(L, R);
if (R - L >= 4038) {
cout << 0 << "\n";
} else {
ll ans = 2019;
FOR(i, L, R + 1) FOR(j, i + 1, R + 1) { ans = min(ans, (i * j) % 2019); }
cout << ans << "\n";
}
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,131 | 791,132 | u139031151 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int mod = 2019;
int L, R;
Scd2(L, R);
int ans = INF;
int l = L % mod;
int r = R % mod;
if (l + 2019 <= r)
ans = 0;
if (l >= r)
ans = 0;
else {
Repe(i, r + 1, l) Repe(j, r + 1, i + 1) ans = min(ans, i * j % mod);
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int mod = 2019;
int L, R;
Scd2(L, R);
int ans = INF;
int l = L % mod;
int r = R % mod;
if (L + 2019 <= R)
ans = 0;
if (l >= r)
ans = 0;
else {
Repe(i, r + 1, l) Repe(j, r + 1, i + 1) ans = min(ans, i * j % mod);
}
printf("%d\n", ans);
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 791,133 | 791,134 | u550398291 | cpp |
p02983 | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1e9 + 1;
const ll LLINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
int main() {
ll L, R;
cin >> L >> R;
if (L / 2019 < R / 2019) {
cout << 0 << endl;
return 0;
}
ll mi = INF;
for (ll i = L; i <= R; i++) {
for (ll j = L + 1; j <= R; j++) {
mi = min(mi, i * j % 2019);
}
}
cout << mi << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1e9 + 1;
const ll LLINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
int main() {
ll L, R;
cin >> L >> R;
if (L / 2019 < R / 2019) {
cout << 0 << endl;
return 0;
}
ll mi = INF;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
mi = min(mi, (i * j) % 2019);
}
}
cout << mi << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,135 | 791,136 | u262288723 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_INT2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod + 10)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r)
res = min<int>(res, (ll)i * j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
//
// //vector<int> a(n);
// //FOR (i,0,n)
// // is >> a[i];
//
// //int res = 0;
// //os << res;
// return 0;
//}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_LL2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r + 1)
res = min<int>(res, (ll)i * j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
////abc133_d
// int main()
| [
"identifier.change",
"call.function.change",
"expression.operation.binary.remove",
"assignment.change"
] | 791,137 | 791,138 | u956947269 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_INT2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r)
res = min<int>(res, (ll)i * j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
//
// //vector<int> a(n);
// //FOR (i,0,n)
// // is >> a[i];
//
// //int res = 0;
// //os << res;
// return 0;
//}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_LL2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r + 1)
res = min<int>(res, (ll)i * j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
////abc133_d
// int main()
| [
"identifier.change",
"call.function.change",
"assignment.change"
] | 791,139 | 791,138 | u956947269 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_LL2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod + 10)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r)
res = min<int>(res, (ll)i * (ll)j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
//
// //vector<int> a(n);
// //FOR (i,0,n)
// // is >> a[i];
//
// //int res = 0;
// //os << res;
// return 0;
//}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c - WA on 5 tests. Why???
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_LL2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod + 10)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r + 1)
res = min<int>(res, (ll)i * j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
////abc133_d
// int main()
| [
"assignment.change"
] | 791,140 | 791,141 | u956947269 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_INT2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod + 10)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r)
res = min<int>(res, (ll)i * j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
//
// //vector<int> a(n);
// //FOR (i,0,n)
// // is >> a[i];
//
// //int res = 0;
// //os << res;
// return 0;
//}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c - WA on 5 tests. Why???
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_LL2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod + 10)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r + 1)
res = min<int>(res, (ll)i * j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
////abc133_d
// int main()
| [
"identifier.change",
"call.function.change",
"assignment.change"
] | 791,137 | 791,141 | u956947269 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_INT2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r)
res = min<int>(res, (ll)i * j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
//
// //vector<int> a(n);
// //FOR (i,0,n)
// // is >> a[i];
//
// //int res = 0;
// //os << res;
// return 0;
//}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define FOR_REV(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define FOR_EACH(it, a) \
for (remove_reference<decltype(a)>::type::iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_REV(it, a) \
for (remove_reference<decltype(a)>::type::reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
#define FOR_EACH_CONST(it, a) \
for (remove_reference<decltype(a)>::type::const_iterator it = (a).begin(); \
it != (a).end(); ++it)
#define FOR_EACH_CONST_REV(it, a) \
for (remove_reference<decltype(a)>::type::const_reverse_iterator it = \
(a).rbegin(); \
it != (a).rend(); ++it)
template <class T> inline T sqr(T v) { return v * v; }
template <class T> inline int sign(T v) {
return v == 0 ? 0 : (v > 0 ? 1 : -1);
}
template <class T> inline int get_bit(T v, int bit_index) {
return (v >> bit_index) & 1;
} // return {0,1}
template <class T> inline T gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
#define IN_INT(a) \
int a; \
is >> a;
#define IN_INT2(a, b) \
int a, b; \
is >> a >> b;
#define IN_INT3(a, b, c) \
int a, b, c; \
is >> a >> b >> c;
#define IN_INT4(a, b, c, d) \
int a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_LL(a) \
ll a; \
is >> a;
#define IN_LL2(a, b) \
ll a, b; \
is >> a >> b;
#define IN_LL3(a, b, c) \
ll a, b, c; \
is >> a >> b >> c;
#define IN_LL4(a, b, c, d) \
ll a, b, c, d; \
is >> a >> b >> c >> d;
#define IN_STR(s) \
string s; \
is >> s;
//////////////////////////////////////////////////////////////////////////
bool io_interactive = true;
istream &input() {
ios_base::sync_with_stdio(false);
if (io_interactive)
return cin;
#ifdef INPUT_FROM_FILE
static ifstream is("AtCoder/input.txt");
return is;
#endif
if (!io_interactive)
cin.tie(NULL);
return cin;
}
ostream &output() {
cout << setprecision(15);
if (!io_interactive)
cout.tie(NULL);
return cout;
}
template <typename T>
void init_v2(vector<vector<T>> &v, int lx, int ly, const T &val = T()) {
v.resize(lx);
FOR(i, 0, lx)
v[i].resize(ly, val);
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//
////a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(a,b);
// cout<<a*b-a-b+1;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,m,q);
// vector<vector<int>> t,s;
// init_v2(t,n,n,0);
// init_v2(s,n,n,0);
// FOR (i,0,m)
// {
// IN_INT2(l,r);
// ++t[l-1][r-1];
// }
//
// FOR (i,0,q)
// {
// IN_INT2(l,r);
// --r;
// --l;
// os<<s[r][r]-s[r][l]-s[l][r]-s[l][l];
// }
//
// //os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// IN_INT3(a,b,t);
// os<<b*(t/a);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// int res = 0;
// FOR (i,0,n)
// {
// IN_INT(c);
// res+=max(a[i]-c,0);
// }
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_c
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT(n);
// unordered_set<int> s0,s1;
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// s0.insert(0);
// int g = a[0];
// FOR (i,1,n)
// {
// s1.clear();
// s1.insert(g);
// FOR_EACH (it,s0)
// s1.insert(gcd(*it,a[i]));
// g = gcd(g,a[i]);
// swap(s0,s1);
// }
// os << max(*max_element(ALL(s0)),g);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc125_d
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
// //IN_INT(n);
// //vector<int> a(n);
// //int neg = 0;
// //FOR (i,0,n)
// //{
// // is >> a[i];
// // if (a[i]<0)
// // ++neg;
// // a[i]=abs(a[i]);
// //}
// //ll s = accumulate(ALL(a),0ll);
// //if (neg&1)
// // s-=*min_element(ALL(a))<<1;
// //os<<s;
// IN_INT(n);
// vector<int> a(n);
// FOR (i,0,n)
// is >> a[i];
// pair<ll,ll> s0(a[0],-a[0]);
// FOR (i,2,n)
// {
// pair<ll,ll> s1;
// s1.first = max(s0.first+a[i-1], s0.second-a[i-1]);
// s1.second = max(s0.first-a[i-1], s0.second+a[i-1]);
// s0 = s1;
// }
// os << max(s0.first+a[n-1], s0.second-a[n-1]);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_a
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT3(n,a,b);
// os << min(n*a,b);
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
////abc133_b
// int main()
//{
// io_interactive = false;
// istream& is = input();
// ostream& os = output();
//
// IN_INT2(n,d);
// vector<vector<int>> ps;
// init_v2(ps,n,d);
//
// FOR (i,0,n)
// FOR (j,0,d)
// is >> ps[i][j];
//
// int res = 0;
// FOR (i,0,n)
// FOR (j,0,i)
// {
// int s = 0;
// FOR (l,0,d)
// s += sqr(ps[i][l]-ps[j][l]);
// if (is_square(s))
// ++res;
// }
//
//
// os << res;
// return 0;
//}
//////////////////////////////////////////////////////////////////////////
// abc133_c - WA on 5 tests. Why???
int main() {
io_interactive = false;
istream &is = input();
ostream &os = output();
IN_LL2(l, r);
int mod = 2019, res = mod;
if (r - l >= mod + 10)
res = 0;
else
FOR(i, l, r)
FOR(j, i + 1, r + 1)
res = min<int>(res, (ll)i * j % mod);
os << res;
return 0;
}
//////////////////////////////////////////////////////////////////////////
////abc133_d
// int main()
| [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 791,139 | 791,141 | u956947269 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// find_by_order(k) - k is the kth element of the multiset
// order_of_key(k) - Number of elements striclty samller than k
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b;
cin >> a >> b;
if (a == b) {
cout << ((a % 2019) * (a % 2019)) % 2019;
return 0;
}
ll x, y;
if ((b - a) >= 2019) {
cout << "0" << endl;
return 0;
}
x = a % 2019;
y = b % 2019;
ll ans = 1e18;
if (x > y) {
cout << "0" << endl;
return 0;
}
for (int i = x; i < y - 1; i++) {
for (int j = i + 1; j < y; j++) {
ans = min(ans, (i * j) % (ll)2019);
if (ans == 0) {
// cout<<i<<endl;
break;
}
}
if (ans == 0)
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// find_by_order(k) - k is the kth element of the multiset
// order_of_key(k) - Number of elements striclty samller than k
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b;
cin >> a >> b;
if (a == b) {
cout << ((a % 2019) * (a % 2019)) % 2019;
return 0;
}
ll x, y;
if ((b - a) >= 2019) {
cout << "0" << endl;
return 0;
}
x = a % 2019;
y = b % 2019;
ll ans = 1e18;
if (x > y) {
cout << "0" << endl;
return 0;
}
for (int i = x; i <= y - 1; i++) {
for (int j = i + 1; j <= y; j++) {
ans = min(ans, (i * j) % (ll)2019);
if (ans == 0) {
// cout<<i<<endl;
break;
}
}
if (ans == 0)
break;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,145 | 791,146 | u966097196 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
int L, R, ans = 2019;
cin >> L >> R;
FOR(i, L, R) {
FOR(j, i + 1, R + 1) {
ans = min(ans, (i % 2019) * (j % 2019));
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
int L, R, ans = 2019;
cin >> L >> R;
FOR(i, L, R) {
FOR(j, i + 1, R + 1) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
return 0;
}
| [
"call.arguments.change",
"call.arguments.add"
] | 791,149 | 791,150 | u276588887 | cpp |
p02983 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r, mi = 2019;
cin >> l >> r;
if (r - l >= 2019)
cout << "0";
else
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
if (((i % 2019) * (j % 2019)) % 2019 < mi)
mi = ((i % 2019) * (j % 2019)) % 2019;
}
}
cout << mi;
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r, mi = 2019;
cin >> l >> r;
if (r - l >= 2019)
cout << "0";
else {
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
if (((i % 2019) * (j % 2019)) % 2019 < mi)
mi = ((i % 2019) * (j % 2019)) % 2019;
}
}
cout << mi;
}
return 0;
}
| [] | 791,151 | 791,152 | u730298763 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int ans = 2019;
int l, r;
if (R - L + 1 >= 2019)
cout << 0 << endl;
else {
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
l = i % 2019;
r = j % 2019;
ans = min(ans, (l * r) % 2019);
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
int ans = 2019;
int l, r;
if (R - L + 1 >= 2019)
cout << 0 << endl;
else {
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
l = i % 2019;
r = j % 2019;
ans = min(ans, (l * r) % 2019);
}
}
cout << ans << endl;
}
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 791,153 | 791,154 | u055447809 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <unordered_set>
using namespace std;
constexpr size_t kMod = 2019;
int main() {
size_t L, R;
cin >> L >> R;
if ((L % kMod == 0) || (R - L) >= 2019) {
cout << 0 << endl;
return 0;
}
if (R - L == 1) {
cout << (L * R) % kMod << endl;
return 0;
}
size_t result = kMod - 1;
for (size_t i = L; i < R - 1; i++) {
if (i % kMod == 0) {
cout << 0 << endl;
return 0;
}
for (size_t j = L + 1; j < R; j++) {
if (i >= j)
continue;
if (j % kMod == 0) {
cout << 0 << endl;
return 0;
}
size_t r = (i * j) % kMod;
if (r <= result)
result = r;
if (result == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << result << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <unordered_set>
using namespace std;
constexpr size_t kMod = 2019;
int main() {
size_t L, R;
cin >> L >> R;
if ((L % kMod == 0) || (R - L) >= kMod) {
cout << 0 << endl;
return 0;
}
if (R - L == 1) {
cout << (L * R) % kMod << endl;
return 0;
}
size_t result = kMod - 1;
for (size_t i = L; i <= R - 1; i++) {
if (i % kMod == 0) {
cout << 0 << endl;
return 0;
}
for (size_t j = L + 1; j <= R; j++) {
if (i >= j)
continue;
if (j % kMod == 0) {
cout << 0 << endl;
return 0;
}
size_t r = (i * j) % kMod;
if (r <= result)
result = r;
if (result == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << result << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,175 | 791,176 | u840713046 | cpp |
p02983 | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 11111111111;
const int c_mINF = -11111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_Dy[4] = {1, -1, 0, 0};
int main() {
int L, R;
scanf("%d%d", &L, &R);
if (L / 2019 < R / 2019)
printf("0");
int Lm = L % 2019;
int Rm = R % 2019;
int ans = 2019;
for (int i = Lm; i <= Rm; i++)
for (int j = 1; i + j <= Rm; j++) {
// printf("%d,%d\n",i,i+j);
if ((i * (i + j)) % 2019 < ans)
ans = (i * (i + j)) % 2019;
}
printf("%d", ans);
}
/* 提出前の確認事項
・デバッグ用の関数は＜＜コメント化＞＞しているか？
・すべての＜＜入力例＞＞は試したか？
・＜＜限界値分析＞＞はしたか？
・＜＜出力の改行＞＞の有無は確認したか？
↓
＜＜提出先＞＞に注意して提出！！
*/ | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 11111111111;
const int c_mINF = -11111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_Dy[4] = {1, -1, 0, 0};
int main() {
int L, R;
scanf("%d%d", &L, &R);
if (L / 2019 < R / 2019)
printf("0");
else {
int Lm = L % 2019;
int Rm = R % 2019;
int ans = 2019;
for (int i = Lm; i <= Rm; i++)
for (int j = 1; i + j <= Rm; j++) {
// printf("%d,%d\n",i,i+j);
if ((i * (i + j)) % 2019 < ans)
ans = (i * (i + j)) % 2019;
}
printf("%d", ans);
}
}
/* 提出前の確認事項
・デバッグ用の関数は＜＜コメント化＞＞しているか？
・すべての＜＜入力例＞＞は試したか？
・＜＜限界値分析＞＞はしたか？
・＜＜出力の改行＞＞の有無は確認したか？
↓
＜＜提出先＞＞に注意して提出！！
*/ | [
"control_flow.branch.else.add"
] | 791,181 | 791,182 | u433195318 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
int inputValue() {
int a;
cin >> a;
return a;
};
void inputArray(int *p, int a){rep(i, a){cin >> p[i];
}
}
;
void inputVector(vector<int> *p, int a) {
rep(i, a) {
int input;
cin >> input;
p->push_back(input);
}
}
template <typename T> void output(T a, int precision) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
int main(int argc, const char *argv[]) {
int L = inputValue();
int R = inputValue();
int ans = 2019;
int LD = L / 2019;
int RD = R / 2019;
int LM = L % 2019;
int RM = R % 2019;
if (LD != RD) {
ans = 0;
} else {
repd(i, LM, RM) {
repd(j, i + 1, RM + 1) {
int val = i * j;
ans = min(val, ans);
}
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
int inputValue() {
int a;
cin >> a;
return a;
};
void inputArray(int *p, int a){rep(i, a){cin >> p[i];
}
}
;
void inputVector(vector<int> *p, int a) {
rep(i, a) {
int input;
cin >> input;
p->push_back(input);
}
}
template <typename T> void output(T a, int precision) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
int main(int argc, const char *argv[]) {
int L = inputValue();
int R = inputValue();
int ans = 2019;
int LD = L / 2019;
int RD = R / 2019;
int LM = L % 2019;
int RM = R % 2019;
if (LD != RD) {
ans = 0;
} else {
repd(i, LM, RM) {
repd(j, i + 1, RM + 1) {
int val = i * j % 2019;
ans = min(val, ans);
}
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 791,188 | 791,189 | u413763374 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
#define FOR(i, n) for (int i = 1; (i) <= (n); ++(i))
#define dump(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define int long long
//#define lint long long
const int INF = 1e18;
const int MOD = 1e9 + 7;
// const lint LINF = 1e18;
const double eps = 0.000000001; //もとの値の10^(-16)まで
using namespace std;
// typedef pair<int, int> P;
// priority_queue< P, vector<P>, greater<P> >
// q;//ダイクストラの時、greaterで小さい順
signed main() {
int l, r;
cin >> l >> r;
int l2 = l % 2019;
int r2 = r % 2019;
if (l - r >= 2018) {
cout << 0 << endl;
return 0;
}
if (l2 < r2) {
int ans = INF;
for (int i = l2; i < r2; i++) {
for (int j = i + 1; j <= r2; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
} else if (l2 == r2) {
cout << l2 * r2 % 2019 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
#define FOR(i, n) for (int i = 1; (i) <= (n); ++(i))
#define dump(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define int long long
//#define lint long long
const int INF = 1e18;
const int MOD = 1e9 + 7;
// const lint LINF = 1e18;
const double eps = 0.000000001; //もとの値の10^(-16)まで
using namespace std;
// typedef pair<int, int> P;
// priority_queue< P, vector<P>, greater<P> >
// q;//ダイクストラの時、greaterで小さい順
signed main() {
int l, r;
cin >> l >> r;
int l2 = l % 2019;
int r2 = r % 2019;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
if (l2 < r2) {
int ans = INF;
for (int i = l2; i < r2; i++) {
for (int j = i + 1; j <= r2; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
} else if (l2 == r2) {
cout << l2 * r2 % 2019 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 791,190 | 791,191 | u697232864 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int L, R, mod_min = 1000000;
int c = 0;
cin >> L >> R;
for (int i = L; i < R; i++) {
for (int j = i + 1; j < R + 1; j++) {
if (c >= 2039190)
break;
if (((i % 2019) * (j % 2019)) % 2019 < mod_min) {
mod_min = (i % 2019) * (j % 2019);
}
c++;
}
}
cout << mod_min << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int L, R, mod_min = 1000000;
int c = 0;
cin >> L >> R;
for (int i = L; i < R; i++) {
for (int j = i + 1; j < R + 1; j++) {
if (c >= 2039190)
break;
if (((i % 2019) * (j % 2019)) % 2019 < mod_min) {
mod_min = ((i % 2019) * (j % 2019)) % 2019;
}
c++;
}
}
cout << mod_min << endl;
return 0;
} | [
"assignment.change"
] | 791,200 | 791,201 | u719183609 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int res = 2019;
if (R - L >= 2019) {
cout << 0 << endl;
} else {
int N = R - L + 1;
vector<int> cands;
for (long long i = L; i <= R; ++i) {
cands.push_back(i % 2019);
}
for (int i = 0; i < N - 1; ++i) {
for (int j = i + 1; j < N; ++j) {
res = min(res, (cands.at(i) * cands.at(j)) % 2019);
}
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int res = 2019;
if (R - L >= 2019) {
res = 0;
} else {
int N = R - L + 1;
vector<int> cands;
for (long long i = L; i <= R; ++i) {
cands.push_back(i % 2019);
}
for (int i = 0; i < N - 1; ++i) {
for (int j = i + 1; j < N; ++j) {
res = min(res, (cands.at(i) * cands.at(j)) % 2019);
}
}
}
cout << res << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 791,204 | 791,205 | u785773061 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#define Mat vector<vector<ll>>
#define Arr vector<ll>
#define Matd vector<vector<ld>>
#define Arrd vector<ld>
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll l, r;
cin >> l >> r;
ll i = (l + 2018LL) / 2019LL * 2019LL;
if (i <= r)
return cout << 0, 0;
ll ans = LLONG_MAX;
ll u = min(r + 1, l + 2019);
fori(j, l, u) fori(k, l + 1, u) ans =
min(ans, (((j % 2019LL) * (k % 2019LL)) % 2019LL));
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#define Mat vector<vector<ll>>
#define Arr vector<ll>
#define Matd vector<vector<ld>>
#define Arrd vector<ld>
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll l, r;
cin >> l >> r;
ll i = (l + 2018LL) / 2019LL * 2019LL;
if (i <= r)
return cout << 0, 0;
ll ans = LLONG_MAX;
ll u = min(r + 1, l + 2019);
fori(j, l, u) fori(k, j + 1, u) ans =
min(ans, (((j % 2019LL) * (k % 2019LL)) % 2019LL));
cout << ans;
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,217 | 791,218 | u282860133 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll l, r;
cin >> l >> r;
if (l % 2019 == 0 || r % 2019 == 0 || l == 0) {
cout << 0;
return 0;
}
if (r / 2019 - l / 2019 > 0) {
cout << 0;
return 0;
}
ll m = mod;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j < r; j++) {
if ((i * j) % 2019 < m) {
m = (i * j) % 2019;
}
}
}
cout << m % 2019;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll l, r;
cin >> l >> r;
if (l % 2019 == 0 || r % 2019 == 0 || l == 0) {
cout << 0;
return 0;
}
if (r / 2019 - l / 2019 > 0) {
cout << 0;
return 0;
}
ll m = mod;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < m) {
m = (i * j) % 2019;
}
}
}
cout << m % 2019;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,225 | 791,226 | u666625234 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTG(c) sort((c).begin(), (c).end(), greater<int>());
#define fi first
#define se second
#define INF (1e9)
typedef pair<int, int> P;
typedef vector<int> vi;
vector<int> divisors(int n) {
vector<int> res;
for (int i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
res.push_back(i);
if (n / i == i)
continue;
}
return res;
}
int L, R;
signed main() {
cin >> L >> R;
int a = L % 2019;
int b = R % 2019;
int ans = 0;
if (L + 2019 <= R) {
ans = 0;
} else if (L + 2019 > R and a < b) {
int m = a * b;
rep(i, a, b + 1) {
rep(j, a + 1, b + 1) {
int n = i * j % 2019;
if (n < m)
m = n;
}
}
ans = m;
} else if (L + 2019 > R and a >= b) {
ans = 0;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTG(c) sort((c).begin(), (c).end(), greater<int>());
#define fi first
#define se second
#define INF (1e9)
typedef pair<int, int> P;
typedef vector<int> vi;
vector<int> divisors(int n) {
vector<int> res;
for (int i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
res.push_back(i);
if (n / i == i)
continue;
}
return res;
}
int L, R;
signed main() {
cin >> L >> R;
int a = L % 2019;
int b = R % 2019;
int ans = 0;
if (L + 2019 <= R) {
ans = 0;
} else if (L + 2019 > R and a < b) {
int m = a * b;
rep(i, a, b) {
rep(j, i + 1, b + 1) {
int n = i * j % 2019;
if (n < m)
m = n;
}
}
ans = m;
} else if (L + 2019 > R and a >= b) {
ans = 0;
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,242 | 791,243 | u961528573 | cpp |
p02983 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
int main(int argc, char *argv[]) {
int l, r;
scanf("%d%d", &l, &r);
int a = l / 2019;
int b = r / 2019;
if (a != b) {
printf("0\n");
return 0;
}
l = l % 2019;
r = r % 2019;
assert(l < r);
if (l == 0) {
printf("0\n");
return 0;
}
int ans = INF;
int i, j;
for (i = l; i <= r; i++) {
for (j = l + 1; j <= r; j++) {
int val = (i * j) % 2019;
ans = MIN(ans, val);
}
}
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
int main(int argc, char *argv[]) {
int l, r;
scanf("%d%d", &l, &r);
int a = l / 2019;
int b = r / 2019;
if (a != b) {
printf("0\n");
return 0;
}
l = l % 2019;
r = r % 2019;
assert(l < r);
if (l == 0) {
printf("0\n");
return 0;
}
int ans = INF;
int i, j;
for (i = l; i <= r; i++) {
for (j = i + 1; j <= r; j++) {
int val = i * j % 2019;
ans = MIN(ans, val);
}
}
printf("%d\n", ans);
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,260 | 791,261 | u209713918 | cpp |
p02983 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
int main(int argc, char *argv[]) {
int l, r;
scanf("%d%d", &l, &r);
int a = l / 2019;
int b = r / 2019;
if (a != b) {
printf("0\n");
return 0;
}
l = l % 2019;
r = r % 2019;
assert(l < r);
if (l == 0) {
printf("0\n");
return 0;
}
int ans = INF;
int i, j;
for (i = l; i <= r; i++) {
for (j = l + 1; j <= r; j++) {
int val = i * j % 2019;
ans = MIN(ans, val);
}
}
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
int main(int argc, char *argv[]) {
int l, r;
scanf("%d%d", &l, &r);
int a = l / 2019;
int b = r / 2019;
if (a != b) {
printf("0\n");
return 0;
}
l = l % 2019;
r = r % 2019;
assert(l < r);
if (l == 0) {
printf("0\n");
return 0;
}
int ans = INF;
int i, j;
for (i = l; i <= r; i++) {
for (j = i + 1; j <= r; j++) {
int val = i * j % 2019;
ans = MIN(ans, val);
}
}
printf("%d\n", ans);
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,262 | 791,261 | u209713918 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void FastInputOutput() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
inline int D() {
int t;
scanf("%d", &t);
return t;
}
inline ll LLD() {
ll t;
scanf("%lld", &t);
return t;
}
inline ll power(ll x, ll p, ll m) {
ll res = 1;
while (p) {
if (p & 1)
res = ((res % m) * (x % m)) % m;
x = ((x % m) * (x % m)) % m;
p >>= 1;
}
return res % m;
}
long double ModLog(long double base, long double x) {
return (logl(x) / logl(base));
}
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
const int N = 2e3 * 2e3 + 5;
vector<int> a[20];
int n, d;
bool calc(int f, int s) {
ll sum = 0;
for (int i = 0; i < d; ++i) {
ll part = a[f][i] - a[s][i];
sum += (part * part);
}
ll sq = sqrtl((long double)sum);
return sq * sq == sum;
}
int main() {
ll l = D(), r = D();
r = l + 2022;
ll mn = INT_MAX;
for (ll i = l; i <= r; ++i) {
for (ll j = i + 1; j <= r; ++j) {
mn = min(mn, (i * j) % 2019);
}
}
printf("%lld", mn);
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
void FastInputOutput() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
inline int D() {
int t;
scanf("%d", &t);
return t;
}
inline ll LLD() {
ll t;
scanf("%lld", &t);
return t;
}
inline ll power(ll x, ll p, ll m) {
ll res = 1;
while (p) {
if (p & 1)
res = ((res % m) * (x % m)) % m;
x = ((x % m) * (x % m)) % m;
p >>= 1;
}
return res % m;
}
long double ModLog(long double base, long double x) {
return (logl(x) / logl(base));
}
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
const int N = 2e3 * 2e3 + 5;
vector<int> a[20];
int n, d;
bool calc(int f, int s) {
ll sum = 0;
for (int i = 0; i < d; ++i) {
ll part = a[f][i] - a[s][i];
sum += (part * part);
}
ll sq = sqrtl((long double)sum);
return sq * sq == sum;
}
int main() {
ll l = D(), r = D();
r = min(l + 2022, r);
ll mn = INT_MAX;
for (ll i = l; i <= r; ++i) {
for (ll j = i + 1; j <= r; ++j) {
mn = min(mn, (i * j) % 2019);
}
}
printf("%lld", mn);
}
| [
"call.add",
"call.arguments.add"
] | 791,289 | 791,290 | u841802158 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
constexpr int MOD = 1000000007;
int main() {
lint L, R;
cin >> L >> R;
lint minx = (1 << 9);
lint z = min(L + 4039, R + 1);
FOR(i, L, z) {
FOR(j, i + 1, z) {
lint x = (i % 2019) * (j % 2019) % 2019;
if (x < minx)
minx = x;
}
}
cout << minx << endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
constexpr int MOD = 1000000007;
int main() {
lint L, R;
cin >> L >> R;
lint minx = (1 << 20);
lint z = min(L + 4039, R + 1);
FOR(i, L, z) {
FOR(j, i + 1, z) {
lint x = (i % 2019) * (j % 2019) % 2019;
if (x < minx)
minx = x;
}
}
cout << minx << endl;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 791,293 | 791,294 | u914173586 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
constexpr int MOD = 1000000007;
int main() {
int L, R;
cin >> L >> R;
int minx = (1 << 9);
int z = min(L + 4038, R + 1);
FOR(i, L, z) {
FOR(j, i + 1, z) {
int x = (i % 2019) * (j % 2019) % 2019;
if (x < minx)
minx = x;
}
}
cout << minx << endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
constexpr int MOD = 1000000007;
int main() {
lint L, R;
cin >> L >> R;
lint minx = (1 << 20);
lint z = min(L + 4039, R + 1);
FOR(i, L, z) {
FOR(j, i + 1, z) {
lint x = (i % 2019) * (j % 2019) % 2019;
if (x < minx)
minx = x;
}
}
cout << minx << endl;
} | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,295 | 791,294 | u914173586 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.