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 8
values |
|---|---|---|---|---|---|---|---|
p02983 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n = 2019;
int x, y;
cin >> x >> y;
if (y - x >= n - 1) {
cout << 0;
return;
}
int res = 2018;
for (int i = x; i <= y; i++) {
for (int j = x + 1; j <= y; j++) {
int u = i % n, v = j % n;
int tmp = u * v % n;
re... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n = 2019;
int x, y;
cin >> x >> y;
if (y - x >= n - 1) {
cout << 0;
return;
}
int res = 2018;
for (int i = x; i <= y; i++) {
for (int j = i + 1; j <= y; j++) {
int u = i % n, v = j % n;
int tmp = u * v % n;
re... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,304 | 791,305 | u031986221 | cpp |
p02983 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define mod 201... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define mod 201... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,306 | 791,307 | u824132304 | cpp |
p02983 | #include <bits/stdc++.h>
#include <cmath>
#include <stdlib.h>
using namespace std;
int main() {
long int L, R;
cin >> L >> R;
long int ans = 2019;
long int l = (L - 1) / 2019, r = R / 2019;
if (r > l)
ans = 0;
else {
long int Lm = L % 2019, Rm = R % 2019;
for (int i = Lm; i < Rm; i++) {
f... | #include <bits/stdc++.h>
#include <cmath>
#include <stdlib.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long ans = 2019;
long long l = (L - 1) / 2019, r = R / 2019;
if (r > l)
ans = 0;
else {
long long Lm = L % 2019, Rm = R % 2019;
for (int i = Lm; i < Rm; i++) {
... | [
"variable_declaration.type.primitive.change",
"assignment.change"
] | 791,310 | 791,311 | u951952491 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define inf 0x7ffff... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define inf 0x7ffff... | [
"assignment.change"
] | 791,316 | 791,317 | u742987397 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
map<long long, long long> mp;
for (long long i = L; i <= min(L + 4038, R); i++) {
mp[i % 2019]++;
}
long long x = 2019;
for (auto p : mp) {
if (p.second == 2) {
x = min(x, p.first * p.first);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
map<long long, long long> mp;
for (long long i = L; i <= min(L + 4038, R); i++) {
mp[i % 2019]++;
}
long long x = 2019;
for (auto p : mp) {
if (p.second == 2) {
x = min(x, p.first * p.first % 2019);
... | [
"assignment.change"
] | 791,318 | 791,319 | u546943614 | cpp |
p02983 | /*
8b d8 888888888888 88b d88 ad88888ba
Y8, ,8P 88 ,d 888b d888 d8"
"8b Y8, ,8P 88 88 88`8b d8'88 ""
a8P "8aa8" ,adPPYba, 88 88 88 8b,dPPYba, 88 88
,adP... | /*
8b d8 888888888888 88b d88 ad88888ba
Y8, ,8P 88 ,d 888b d888 d8"
"8b Y8, ,8P 88 88 88`8b d8'88 ""
a8P "8aa8" ,adPPYba, 88 88 88 8b,dPPYba, 88 88
,adP... | [
"call.arguments.change",
"call.arguments.add"
] | 791,320 | 791,321 | u267710757 | cpp |
p02983 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#include <boost/lexical_cast.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define mp make_pair
#define endl '\n'
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#include <boost/lexical_cast.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define mp make_pair
#define endl '\n'
... | [
"control_flow.loop.for.condition.change"
] | 791,322 | 791,323 | u258323901 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define FOR(INDEX, START, END) for (LL INDEX = (START); INDEX < (END); ++INDEX)
#define REP(INDEX, COUNT) for (LL INDEX = 0; INDEX < (COUNT); ++INDEX)
int main() {
LL L, R;
cin >> L >> R;
LL ans = -1;
FOR(i, L, min<>(L + 2020, R)) {
LL m... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define FOR(INDEX, START, END) for (LL INDEX = (START); INDEX < (END); ++INDEX)
#define REP(INDEX, COUNT) for (LL INDEX = 0; INDEX < (COUNT); ++INDEX)
int main() {
LL L, R;
cin >> L >> R;
LL ans = -1;
FOR(i, L, min<>(L + 2020, R)) {
LL m... | [
"assignment.change"
] | 791,328 | 791,329 | u658243311 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L;
cin >> R;
long A;
A = 2019;
for (long i = L; i < min(L + 2019, R); i++) {
for (long j = L + 1; j < min(L + 2020, R); j++) {
if (i != j) {
A = min(A, i % 2019 * j % 2019);
}
}
}
cout << A;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L;
cin >> R;
long A;
A = 2019;
for (long i = L; i < min(L + 2019, R); i++) {
for (long j = L + 1; j < min(L + 2020, R + 1); j++) {
if (i != j) {
A = min(A, i % 2019 * j % 2019);
}
}
}
cout <<... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 791,336 | 791,337 | u628597699 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
inline void prep() {
cin.tie(0);
cin.sync_with_stdio(0);
};
// printf("%.12lf\n",mid);
// __builtin_popcount(int) count 1's in binary
// get decimal pert of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*/
// round = (int)(num+.5)
in... | #include <bits/stdc++.h>
using namespace std;
inline void prep() {
cin.tie(0);
cin.sync_with_stdio(0);
};
// printf("%.12lf\n",mid);
// __builtin_popcount(int) count 1's in binary
// get decimal pert of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*/
// round = (int)(num+.5)
in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,338 | 791,339 | u381394404 | cpp |
p02983 | // Written By NewbieChd
#include <algorithm>
#include <cctype>
#include <cstdio>
using namespace std;
const int BUF = 1000000;
char buf[BUF], *p1, *p2;
inline char getChar() {
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, BUF, stdin), p1 == p2)
? EOF
: *p1++;
}
inline int read() {
r... | // Written By NewbieChd
#include <algorithm>
#include <cctype>
#include <cstdio>
using namespace std;
const int BUF = 1000000;
char buf[BUF], *p1, *p2;
inline char getChar() {
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, BUF, stdin), p1 == p2)
? EOF
: *p1++;
}
inline int read() {
r... | [
"assignment.change"
] | 791,340 | 791,341 | u305668100 | cpp |
p02983 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 2019;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
vector<ll> num;
for (ll i = L; i <= min(L + 5000, R); i++) {
num.push_back(i % MOD);
}
ll ans = 2019;
for (int i = 0... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 2019;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
vector<ll> num;
for (ll i = L; i <= min(L + 5000, R); i++) {
num.push_back(i % MOD);
}
ll ans = 2019;
for (int i = 0... | [
"control_flow.loop.for.initializer.change"
] | 791,358 | 791,359 | u134519179 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typed... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repn(i, n) for (ll i = 0; i <= (ll)(n); i++)
typed... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 791,363 | 791,364 | u317711717 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
int ans = 2018;
if (r - l + 1 <= 2019) {
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = m... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
int ans = 2018;
if (r - l + 1 <= 2019) {
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = m... | [
"call.arguments.change"
] | 791,379 | 791,380 | u155344619 | 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> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
template <class T>
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (a % b == 0)
ret... | #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> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
template <class T>
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (a % b == 0)
ret... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,381 | 791,382 | u944316525 | cpp |
p02983 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int l, r, ans = 999999999;
cin >> l >> r;
for (int i = l; i <= r && i <= i + 2500; i++)
for (int j = i + 1; j <= r && j <= j + 2500; j++)
ans = min(ans, (i % 2019) * (j % 2019));
cout << ans << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int l, r, ans = 999999999;
cin >> l >> r;
for (int i = l; i <= r && i <= l + 2500; i++)
for (int j = i + 1; j <= r && j <= l + 2500; j++)
ans = min(ans, ((i % 2019) * (j % 2019) % 2019));
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,387 | 791,386 | u230078189 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int L, R, kake, ans = 2222;
cin >> L >> R;
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++) {
kake... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int L, R, kake, ans = 2222;
cin >> L >> R;
for (long long int i = L; i <= R; i++) {
for (long long int j = i + 1; j <= ... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"expression.operation.binary.change"
] | 791,390 | 791,391 | u444349080 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int m = ((L % 2019) * (R % 2019)) % 2019;
for (int i = L; i < min(L + 2019, R); i++) {
int l = i % 2019;
for (int j = i + 1; j < min(i + 2019, R + 1); j++) {
int r = j % 2019;
m = min(m, l * r);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int m = ((L % 2019) * (R % 2019)) % 2019;
for (int i = L; i < min(L + 2019, R); i++) {
int l = i % 2019;
for (int j = i + 1; j < min(i + 2019, R + 1); j++) {
int r = j % 2019;
m = min(m, (l * r) % 2019);
... | [
"call.arguments.change",
"call.arguments.add"
] | 791,392 | 791,393 | u157677852 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.end(), target)
#def... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.end(), target)
#def... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,396 | 791,397 | u785975381 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 10... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 10... | [
"call.arguments.add"
] | 791,400 | 791,401 | u051493691 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#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() {... | #include <algorithm>
#include <cmath>
#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() {... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 791,404 | 791,405 | u530223066 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
in... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 791,410 | 791,411 | u220212997 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
signed main() {
Int l, r;
cin >> l >> r;
if (r - l >= 55) {
cout << 0 << endl;
} else {
Int min = 2019;
for (Int i = l; i < r; i++) {
for (Int j = i + 1; j <= r; j++) {
Int tmp = (i * j) % 2019;
if (min > t... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
signed main() {
Int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
} else {
Int min = 2019;
for (Int i = l; i < r; i++) {
for (Int j = i + 1; j <= r; j++) {
Int tmp = (i * j) % 2019;
if (min >... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 791,428 | 791,429 | u148215098 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int a[4500];
int main() {
int l, r;
cin >> l >> r;
int x = min(r - l + 1, 4038);
for (int i = 1; i <= x; i++) {
a[i] = (i - 1 + l) % 2019;
}
int minn = 9999;
for (int i = 1; i <= x; i++) {
for (int j = i + 1; j <= x; j++) {
// cout<<"i:"<<i<<"j... | #include <bits/stdc++.h>
using namespace std;
int a[4500];
int main() {
int l, r;
cin >> l >> r;
int x = min(r - l + 1, 4038);
for (int i = 1; i <= x; i++) {
a[i] = (i - 1 + l) % 2019;
}
int minn = 9999;
for (int i = 1; i <= x; i++) {
for (int j = i + 1; j <= x; j++) {
// cout<<"i:"<<i<<"j... | [
"call.arguments.change",
"call.arguments.add"
] | 791,430 | 791,431 | u261868146 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int l, m, n, r, p, s = 2019;
cin >> l >> m;
n = m % 2019;
r = l % 2019;
if (((m - l) > 2019) || (n < r)... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int l, m, n, r, p, s = 2019;
cin >> l >> m;
n = m % 2019;
r = l % 2019;
if (((m - l) > 2019) || (n < r)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,442 | 791,443 | u468506413 | cpp |
p02983 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int L, R;
cin >> L >> R;
int ans = LINF;
if (R - L > 2020)
cout << 0 << endl;
else {
for (int ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int L, R;
cin >> L >> R;
int ans = LINF;
if (R - L > 2020)
cout << 0 << endl;
else {
for (int ... | [] | 791,444 | 791,445 | u942774736 | cpp |
p02983 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,461 | 791,462 | u190907730 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
//#define MOD 1000000007
#define MOD 2019
int main() {
ll L, R;
cin >> L >> R;
ll ans, r, l;
if (R - L >= MOD) {
ans = 0;
} else {
r = R % MOD;
l = L % MOD;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
//#define MOD 1000000007
#define MOD 2019
int main() {
ll L, R;
cin >> L >> R;
ll ans, r, l;
if (R - L >= MOD) {
ans = 0;
} else {
r = R % MOD;
l = L % MOD;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,466 | 791,467 | u878967567 | cpp |
p02983 | #include <iostream>
#include <limits>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
int a1 = numeric_limits<int>::max();
for (long long int i = l; i < min(r, l + 2019); ++i) {
for (long long int j = l + 1; j <= min(r, l + 2019); ++j) {
int a = (i % 2019) * (j % 2019);
if... | #include <iostream>
#include <limits>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
int a1 = numeric_limits<int>::max();
for (long long int i = l; i < min(r, l + 2018); ++i) {
for (long long int j = l + 1; j <= min(r, l + 2018); ++j) {
int a = (i % 2019) * (j % 2019) % 2019;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,476 | 791,477 | u488731967 | cpp |
p02983 | #include <stdio.h>
int main() {
int l, r;
scanf("%d %d", &l, &r);
int l_quot = l / 2019, l_remain = l % 2019;
int r_quot = r / 2019, r_remain = r % 2019;
// l_quot <= r_quot
// l_remain < r_remain??
int min = (l_remain * r_remain) % 2019;
if (l_quot == r_quot) {
for (int i = l_remain; i < r_remain... | #include <stdio.h>
int main() {
int l, r;
scanf("%d %d", &l, &r);
int l_quot = l / 2019, l_remain = l % 2019;
int r_quot = r / 2019, r_remain = r % 2019;
// l_quot <= r_quot
// l_remain < r_remain??
int min = (l_remain * r_remain) % 2019;
if (l_quot == r_quot) {
for (int i = l_remain; i < r_remain... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 791,480 | 791,481 | u805668940 | cpp |
p02983 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int l, r;
scanf("%d %d", &l, &r);
ll ans = LLONG_MAX;
for (ll i = l; i <= l + 2019 && i <= r; i++)
for (ll j = l + 1; j - l <= 2020 && j <= r; j++) {
// if (ans > i * j % 2019)
// printf("%lld %lld %lld\n", i, j... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int l, r;
scanf("%d %d", &l, &r);
ll ans = LLONG_MAX;
for (ll i = l; i <= l + 2019 && i <= r; i++)
for (ll j = i + 1; j - l <= 2020 && j <= r; j++) {
// if (ans > i * j % 2019)
// printf("%lld %lld %lld\n", i, j... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,484 | 791,485 | u516461055 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
int main() {
LL l, r;
cin >> l >> r;
LL min1, min2;
min1 = min2 = 2020;
LL res = BIG_NUM;
int rW = min(r, l + 2020);
for (LL i = l; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
int main() {
LL l, r;
cin >> l >> r;
LL min1, min2;
min1 = min2 = 2020;
LL res = BIG_NUM;
int rW = min(r, l + 2020);
for (LL i = l; ... | [
"call.arguments.change",
"call.arguments.add"
] | 791,486 | 791,487 | u400497478 | cpp |
p02983 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll L, R;
const ll mod = 2019;
cin >>... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll L, R;
const ll mod = 2019;
cin >>... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,488 | 791,489 | u017293723 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
if (L % 2019 == 0 || (L / 2019 != R / 2019)) {
cout << 0 << endl;
} else {
ll ans = 1e18;
for (ll i = L; i <= R; i++) {
for (ll j = L + 1; j <= R; j++) {
ll sum = i * j % 2019;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
if (L % 2019 == 0 || (L / 2019 != R / 2019)) {
cout << 0 << endl;
} else {
ll ans = 1e18;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
ll sum = i * j % 2019;
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,506 | 791,507 | u646566089 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
template <class T> inline void read(T &x) {
x = 0;
char c = getchar();
bool f = 0;
for (; !isdigit(c); c = getchar())
f ^= c == '-';
for (; isdigit(c); c = getchar())
x = x * 10 + (c ^ 48);
x = f ? -x : x;
}
template <class T> inl... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
template <class T> inline void read(T &x) {
x = 0;
char c = getchar();
bool f = 0;
for (; !isdigit(c); c = getchar())
f ^= c == '-';
for (; isdigit(c); c = getchar())
x = x * 10 + (c ^ 48);
x = f ? -x : x;
}
template <class T> inl... | [
"assignment.change"
] | 791,510 | 791,511 | u083092461 | cpp |
p02983 | /* C */
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MOD 2019
int main() {
long long int l, r;
cin >> l >> r;
long long int mini = 2147483647;
if (l / MOD == r / MOD) {
l = l % MOD, r = r % MOD;
for (long long int i = l; i < r; ++i) {
... | /* C */
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MOD 2019
int main() {
long long int l, r;
cin >> l >> r;
long long int mini = 2019;
if (l / MOD == r / MOD) {
l = l % MOD, r = r % MOD;
for (long long int i = l; i < r; ++i) {
for ... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change",
"assignment.change"
] | 791,514 | 791,515 | u147762850 | cpp |
p02983 | /*****************************************************
*****************************************************/
#include <bits/stdc++.h>
#define MAX 9223372036854775807
#define endl "\n"
#define ll long long
#define int long long
#define pb push_back
#define pf push_front
#define F first
#define S second
#define ppf po... | /*****************************************************
*****************************************************/
#include <bits/stdc++.h>
#define MAX 9223372036854775807
#define endl "\n"
#define ll long long
#define int long long
#define pb push_back
#define pf push_front
#define F first
#define S second
#define ppf po... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,516 | 791,517 | u483366732 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll l, r;
cin >> l >> r;
ll ans = INF;
for (ll i = l; i < l + 2100 && i <= r; i++) {
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll l, r;
cin >> l >> r;
ll ans = INF;
for (ll i = l; i < l + 2100 && i < r; i++) {
for (... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 791,520 | 791,521 | u561186440 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll l, r;
cin >> l >> r;
ll ans = INF;
for (ll i = l; i < l + 2100 && i <= r; i++) {
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll l, r;
cin >> l >> r;
ll ans = INF;
for (ll i = l; i < l + 2100 && i < r; i++) {
for (... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change"
] | 791,522 | 791,521 | u561186440 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = LLONG_MAX;
int main() {
ll l, r;
cin >> l >> r;
ll mi = INF;
if (r - l == 1) {
cout << (l * r) % 2019 << endl;
} else if ((r / 2019 - (l - 1) / 2019) > 0) {
cout << 0 << endl;
} else {
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = LLONG_MAX;
int main() {
ll l, r;
cin >> l >> r;
ll mi = INF;
if (r - l == 1) {
cout << (l * r) % 2019 << endl;
} else if ((r / 2019 - (l - 1) / 2019) > 0) {
cout << 0 << endl;
} else {
for... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,531 | 791,532 | u850894780 | cpp |
p02983 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,545 | 791,546 | u239493918 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,547 | 791,548 | u756088996 | cpp |
p02983 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,553 | 791,554 | u764076797 | cpp |
p02983 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<in... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,557 | 791,558 | u956400481 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019)
cout << 0;
else {
ll m = 2019 * 2019;
for (ll i = L; i < R; i++)
for (ll j = i + 1; j < R; j++)
m = min(m, i * j % 2... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019)
cout << 0;
else {
ll m = 2018;
for (ll i = L; i <= R; i++)
for (ll j = i + 1; j <= R; j++)
m = min(m, i * j % 2019);... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,562 | 791,563 | u441296840 | cpp |
p02983 | #include <bits/stdc++.h>
#define il inline
#define vd void
typedef long long ll;
il ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int main() {
#ifdef XZZSB
freopen("... | #include <bits/stdc++.h>
#define il inline
#define vd void
typedef long long ll;
il ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int main() {
#ifdef XZZSB
freopen("... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,585 | 791,586 | u713368169 | cpp |
p02983 | #include <bits/stdc++.h>
#define il inline
#define vd void
typedef long long ll;
il ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int main() {
#ifdef XZZSB
freopen("... | #include <bits/stdc++.h>
#define il inline
#define vd void
typedef long long ll;
il ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int main() {
#ifdef XZZSB
freopen("... | [
"assignment.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,587 | 791,586 | u713368169 | cpp |
p02983 | #include <bits/stdc++.h>
#define fo(i, w, n) for (int i = (int)w; i < (int)n; i++)
#define qi queue<int>
#define vi vector<int>
#define ll long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<int, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define fi first
#... | #include <bits/stdc++.h>
#define fo(i, w, n) for (int i = (int)w; i < (int)n; i++)
#define qi queue<int>
#define vi vector<int>
#define ll long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<int, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define fi first
#... | [
"assignment.change"
] | 791,601 | 791,602 | u535589138 | cpp |
p02983 | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define ms multiset
#define pb push_back
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define pq priority_queue
#define umap unordered_ma... | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define ms multiset
#define pb push_back
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define pq priority_queue
#define umap unordered_ma... | [
"call.arguments.change",
"call.arguments.add"
] | 791,605 | 791,606 | u896034488 | cpp |
p02983 | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define ms multiset
#define pb push_back
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define pq priority_queue
#define umap unordered_ma... | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define ms multiset
#define pb push_back
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define pq priority_queue
#define umap unordered_ma... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"call.arguments.change",
"call.arguments.add"
] | 791,607 | 791,606 | u896034488 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll l, r;
int main() {
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 1e18;
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 ll;
ll l, r;
int main() {
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 1e18;
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"
] | 791,612 | 791,613 | u011129112 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,618 | 791,619 | u109256064 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,620 | 791,619 | u109256064 | cpp |
p02983 | #include <bits/stdc++.h>
// this code is written by Itst
using namespace std;
int main() {
int L, R;
cin >> L >> R;
if (R - L > 2019) {
puts("0");
return 0;
}
long long Mn = 1e9;
for (int i = L; i <= R; ++i)
for (int j = L + 1; j <= R; ++j)
Mn = min(Mn, 1ll * i * j % 2019);
cout << Mn <... | #include <bits/stdc++.h>
// this code is written by Itst
using namespace std;
int main() {
int L, R;
cin >> L >> R;
if (R - L > 2019) {
puts("0");
return 0;
}
long long Mn = 1e9;
for (int i = L; i <= R; ++i)
for (int j = i + 1; j <= R; ++j)
Mn = min(Mn, 1ll * i * j % 2019);
cout << Mn <... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,630 | 791,631 | u563201135 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"call.arguments.change"
] | 791,632 | 791,633 | u294531924 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | [
"call.arguments.change"
] | 791,636 | 791,637 | u874644572 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
us... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
us... | [
"control_flow.loop.for.initializer.change"
] | 791,638 | 791,639 | u798339690 | cpp |
p02983 | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
const long long MOD = 2019;
int main() {
long long l, r;
cin >> l >> r;
// l*(l+1) ~ (r-1)*r
long long ans = 0;
long long tmp;
if (r - l >= MOD || l == 0) {
ans = 0;
} else {
for (long long i = l; i < r; ++i) {
fo... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
const long long MOD = 2019;
int main() {
long long l, r;
cin >> l >> r;
// l*(l+1) ~ (r-1)*r
long long ans = 0;
long long tmp;
if (r - l >= MOD || l == 0) {
ans = 0;
} else {
for (long long i = l; i < r; ++i) {
fo... | [
"assignment.change"
] | 791,640 | 791,641 | u207460172 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
ll L, R;
cin >> L >> R;
if (R - L > 2019)
cout << 0 << endl;
else {
ll ans = INF;
for (ll i = L; i < R; i+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
ll L, R;
cin >> L >> R;
if (R - L > 2019)
cout << 0 << endl;
else {
ll ans = INF;
for (ll i = L; i < R; i+... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,642 | 791,643 | u730271001 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
ll L, R;
cin >> L >> R;
if (R - L > 2019)
cout << 0 << endl;
else {
ll ans = INF;
for (ll i = L; i < R; i+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
ll L, R;
cin >> L >> R;
if (R - L > 2019)
cout << 0 << endl;
else {
ll ans = INF;
for (ll i = L; i < R; i+... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 791,644 | 791,643 | u730271001 | cpp |
p02983 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 791,647 | 791,648 | u824337972 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll MOD = 2019;
int main() {
int l, r;
cin >> l >> r;
ll ans = 2018;
for (int i = l; i < min(r, l + 2019); i++)
for (int j = i + 1; j < min(r, l + 2019); j++)
ans = min(ans, (i * ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll MOD = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
for (ll i = l; i <= min(r, l + 2019); i++)
for (ll j = i + 1; j <= min(r, l + 2019); j++)
ans = min(ans, (i * j... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,651 | 791,650 | u052247353 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll const MOD = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans;
for (ll i = l; i <= min(r, l + 2019); i++)
for (ll j = i + 1; j <= min(r, l + 2019); j++)
ans = min(ans, (i * j) % MOD... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll MOD = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
for (ll i = l; i <= min(r, l + 2019); i++)
for (ll j = i + 1; j <= min(r, l + 2019); j++)
ans = min(ans, (i * j... | [
"variable_declaration.value.change"
] | 791,652 | 791,650 | u052247353 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll const MOD = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans;
for (ll i = l; i <= min(r, l + 2019); i++)
for (ll j = i + 1; j <= min(r, l + 2019); j++)
ans = min(ans, (i * j) % MOD... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll const MOD = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
for (ll i = l; i <= min(r, l + 2019); i++)
for (ll j = i + 1; j <= min(r, l + 2019); j++)
ans = min(ans, (i * j... | [
"variable_declaration.value.change"
] | 791,652 | 791,653 | u052247353 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll const MOD = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans;
for (ll i = l; i <= min(r, l + 2019); i++)
for (ll j = l; j <= min(r, l + 2019); j++)
ans = min(ans, (i * j) % MOD);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll const MOD = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
for (ll i = l; i <= min(r, l + 2019); i++)
for (ll j = i + 1; j <= min(r, l + 2019); j++)
ans = min(ans, (i * j... | [
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 791,654 | 791,653 | u052247353 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | [
"identifier.change",
"expression.operation.binary.change"
] | 791,662 | 791,663 | u568652083 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, big = 2020, minn;
cin >> a >> b;
for (long long int i = a; i <= b; i++) {
for (long long int j = i + 1; j <= b; j++) {
minn = min(minn, (i * j) % 2019);
if (minn == 0) {
cout << 0;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, big = 2020, minn = 10000;
cin >> a >> b;
for (long long int i = a; i <= b; i++) {
for (long long int j = i + 1; j <= b; j++) {
minn = min(minn, (i * j) % 2019);
if (minn == 0) {
cout << 0;
return 0;
... | [
"variable_declaration.value.change"
] | 791,683 | 791,684 | u368383065 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, big = 2019, minn;
cin >> a >> b;
for (long long int i = a; i <= b; i++) {
for (long long int j = i + 1; j <= b; j++) {
minn = min(minn, (i * j) % 2019);
if (minn == 0) {
cout << 0;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, big = 2020, minn = 10000;
cin >> a >> b;
for (long long int i = a; i <= b; i++) {
for (long long int j = i + 1; j <= b; j++) {
minn = min(minn, (i * j) % 2019);
if (minn == 0) {
cout << 0;
return 0;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 791,685 | 791,684 | u368383065 | cpp |
p02983 | #ifdef loc
#include "codes/loc_debug.h"
#else
#include <bits/stdc++.h>
#define pr(...)
#define pra(a, n)
#define praa(a, n, m)
#define prl()
#endif
using namespace std;
typedef long long ll;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (... | #ifdef loc
#include "codes/loc_debug.h"
#else
#include <bits/stdc++.h>
#define pr(...)
#define pra(a, n)
#define praa(a, n, m)
#define prl()
#endif
using namespace std;
typedef long long ll;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,694 | 791,695 | u393245399 | cpp |
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
ll result = 2020;
for (ll i = L; i < min(R, L + 2019); ++i) {
for (ll j = i + 1; j < min(R, L + 2019); ++j) {
result = min(result, (i * j) % 2019);
}
}
cout << result << e... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
ll result = 2020;
for (ll i = L; i < min(R, L + 2019); ++i) {
for (ll j = i + 1; j <= min(R, L + 2019); ++j) {
result = min(result, (i * j) % 2019);
}
}
cout << result <<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,698 | 791,699 | u207665007 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll MOD1 = 2019;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll L, R... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll MOD1 = 2019;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll L, R... | [
"control_flow.return.add",
"control_flow.return.0.add",
"assignment.variable.change",
"assignment.change",
"assignment.add"
] | 791,702 | 791,703 | u831873811 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll MOD1 = 2019;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll L, R... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll MOD1 = 2019;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll L, R... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 791,706 | 791,707 | u831873811 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll MOD1 = 2019;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll L, R... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll MOD1 = 2019;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll L, R... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 791,702 | 791,709 | u831873811 | cpp |
p02983 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
typedef long long ll;
const int N = 5 * (1e5) + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
int mn = 2019;
if (l - r + 1 >= 2019) {
cout << 0;
return 0;
}
l = l % 2019;
r = r % 2019;
... | #include <bits/stdc++.h>
//#define int long long
using namespace std;
typedef long long ll;
const int N = 5 * (1e5) + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
int mn = 2019;
if (r - l + 1 >= 2019) {
cout << 0;
return 0;
}
l = l % 2019;
r = r % 2019;
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 791,712 | 791,713 | u887528589 | cpp |
p02983 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
typedef long long ll;
const int N = 5 * (1e5) + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
int mn = 2019;
if (l - r >= 2019) {
cout << 0;
return 0;
}
l = l % 2019;
r = r % 2019;
if (... | #include <bits/stdc++.h>
//#define int long long
using namespace std;
typedef long long ll;
const int N = 5 * (1e5) + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
int mn = 2019;
if (r - l + 1 >= 2019) {
cout << 0;
return 0;
}
l = l % 2019;
r = r % 2019;
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 791,714 | 791,713 | u887528589 | cpp |
p02983 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod (long long int)(2019)
#define pb push_back
#define ll long long int
using namespace std;
typedef pair<int, int> pii;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 6... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod (long long int)(2019)
#define pb push_back
#define ll long long int
using namespace std;
typedef pair<int, int> pii;
int main() {
ll l, r;
cin >> l >> r;
if (r - l + 1 ... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.add",
"literal.number.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 791,715 | 791,716 | u733823138 | cpp |
p02983 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod (long long int)(2019)
#define pb push_back
#define ll long long int
using namespace std;
typedef pair<int, int> pii;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod (long long int)(2019)
#define pb push_back
#define ll long long int
using namespace std;
typedef pair<int, int> pii;
int main() {
ll l, r;
cin >> l >> r;
if (r - l + 1 ... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 791,717 | 791,716 | u733823138 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l > 2019) {
ans = 0;
} else {
ll i, j;
ans = 2020;
int f = 0;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans)
ans = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l >= 2018) {
ans = 0;
} else {
ll i, j;
ans = 2020;
int f = 0;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans)
ans =... | [] | 791,718 | 791,719 | u228402731 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l > 2019) {
ans = 0;
} else {
ll i, j;
ans = 2020;
int f = 0;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans)
ans = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l >= 2019) {
ans = 0;
} else {
ll i, j;
ans = 2020;
int f = 0;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans)
ans =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,718 | 791,720 | u228402731 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l > 2019) {
ans = 0;
} else {
ll i, j;
ans = 2020;
int f = 0;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans)
ans = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll l, r, ans;
cin >> l >> r;
if (r - l > 2019) {
ans = 0;
} else {
ll i, j;
ans = 2020;
int f = 0;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans)
ans = ... | [] | 791,718 | 791,721 | u228402731 | cpp |
p02983 | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define int long long
using namespace std;
main() {
// freopen("input.txt","rt",stdin);
int l, r;
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << "0" << endl;
} else {
int mi = 2019;
for (int i = l; i < r; i++) {
for (int j = i + 1... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define int long long
using namespace std;
main() {
// freopen("input.txt","rt",stdin);
int l, r;
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << "0" << endl;
} else {
int mi = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,722 | 791,723 | u217859995 | cpp |
p02983 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 791,726 | 791,727 | u874996917 | cpp |
p02983 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 791,728 | 791,727 | u874996917 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MD 1000000007
#define INF 1ll << 60
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MD 1000000007
#define INF 1ll << 60
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
ll ... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 791,732 | 791,733 | u287060310 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MD 1000000007
#define INF 1ll << 60
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MD 1000000007
#define INF 1ll << 60
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
ll ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 791,734 | 791,733 | u287060310 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 791,740 | 791,741 | u698883164 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l / 2019 != r / 2019) {
cout << 0 << endl;
return 0;
} else {
int mod_l = l % 2019, mod_r = r % 2019, result = 2019;
for (int i = mod_l; i < mod_r - 1; i++) {
for (int j = i + 1; j < mod_r + 1; j++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l / 2019 != r / 2019) {
cout << 0 << endl;
return 0;
} else {
int mod_l = l % 2019, mod_r = r % 2019, result = 2019;
for (int i = mod_l; i < mod_r; i++) {
for (int j = i + 1; j < mod_r + 1; j++) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 791,742 | 791,743 | u040700157 | cpp |
p02983 | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namesp... | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, n, m) for (int i = (int)(n); i < int(m); i++)
using namesp... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 791,744 | 791,745 | u165374901 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int L, R;
c... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int L, R;
c... | [
"control_flow.branch.if.condition.change"
] | 791,773 | 791,774 | u394973531 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, R;
cin >> L >> R;
R = min(R, 2019);
int res = 100000;
bool flag = false;
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
int ans = i * j % 2019;
if (ans < res)
res = ans;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, R;
cin >> L >> R;
R = min(R, L + 4038);
int res = 100000;
bool flag = false;
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
int ans = i * j % 2019;
if (ans < res)
res = ans;
}
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.change"
] | 791,787 | 791,786 | u590000849 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, R;
cin >> L >> R;
R = min(R, 673);
int res = 100000;
bool flag = false;
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
int ans = i * j % 2019;
if (ans < res)
res = ans;
}
}
c... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, R;
cin >> L >> R;
R = min(R, L + 4038);
int res = 100000;
bool flag = false;
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
int ans = i * j % 2019;
if (ans < res)
res = ans;
}
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.change"
] | 791,788 | 791,786 | u590000849 | cpp |
p02983 |
#include <iostream>
using namespace std;
static const int mod = 2019;
int main() {
long long l, r;
cin >> l >> r;
long long cnt = 0;
long long ans = 2018;
r = min(r, l + mod * 2);
for (long long i = l; i < r; i++) {
for (long long j = l + 1; j < r; j++) {
long long x = i * j % mod;
ans = m... |
#include <iostream>
using namespace std;
static const int mod = 2019;
int main() {
long long l, r;
cin >> l >> r;
long long cnt = 0;
long long ans = 2018;
r = min(r, l + mod);
for (long long i = l; i <= r - 1; i++) {
for (long long j = l + 1; j <= r; j++) {
long long x = i * j % mod;
ans =... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 791,789 | 791,790 | u085230936 | cpp |
p02983 |
#include <iostream>
using namespace std;
static const int mod = 2019;
int main() {
long long l, r;
cin >> l >> r;
long long cnt = 0;
long long ans = 2018;
r = min(r, l + mod * 2);
for (long long i = l; i < r; i++) {
for (long long j = l + 1; j < r; j++) {
long long x = i * j % mod;
ans = m... |
#include <iostream>
using namespace std;
static const int mod = 2019;
int main() {
long long l, r;
cin >> l >> r;
long long cnt = 0;
long long ans = 2018;
r = min(r, l + mod * 2);
for (long long i = l; i <= r - 1; i++) {
for (long long j = l + 1; j <= r; j++) {
long long x = i * j % mod;
a... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 791,789 | 791,791 | u085230936 | cpp |
p02983 |
#include <iostream>
using namespace std;
static const int mod = 2019;
int main() {
long long l, r;
cin >> l >> r;
long long cnt = 0;
long long ans = 2018;
r = min(r, l + mod * 2);
for (long long i = l; i < r; i++) {
for (long long j = l + 1; i < r; i++) {
long long x = i * j % mod;
ans = m... |
#include <iostream>
using namespace std;
static const int mod = 2019;
int main() {
long long l, r;
cin >> l >> r;
long long cnt = 0;
long long ans = 2018;
r = min(r, l + mod * 2);
for (long long i = l; i <= r - 1; i++) {
for (long long j = l + 1; j <= r; j++) {
long long x = i * j % mod;
a... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one",
"identifier.change"
] | 791,792 | 791,791 | u085230936 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<int>;
using A = array<int, 2>;
using P = pair<int, int>;
constexpr int MOD{1000000000 + 7};
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
constexpr array<int, 4> dx{1, 0, -1, 0}, dy{0, 1, 0, -1};
int gcd(int a, int b) { return b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<int>;
using A = array<int, 2>;
using P = pair<int, int>;
constexpr int MOD{1000000000 + 7};
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
constexpr array<int, 4> dx{1, 0, -1, 0}, dy{0, 1, 0, -1};
int gcd(int a, int b) { return b... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,803 | 791,804 | u076506345 | cpp |
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
typedef long long ll;
ll l, r;
int ans = 2018;
cin >> l >> r;
r = min(r, l + 2019);
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(x, ans);
}
cout << ans << end... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
typedef long long ll;
ll l, r;
int ans = 2018;
cin >> l >> r;
r = min(r, l + 2019);
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(x, ans);
}
}
cout << ans << en... | [] | 791,807 | 791,808 | u611560534 | cpp |
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
typedef long long ll;
ll l, r;
int ans = 2018;
cin >> l >> r;
r = min(r, l + 4038);
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(x, ans);
}
cout << ans << end... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
typedef long long ll;
ll l, r;
int ans = 2018;
cin >> l >> r;
r = min(r, l + 2019);
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int x = i * j % 2019;
ans = min(x, ans);
}
}
cout << ans << en... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,809 | 791,808 | u611560534 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MOD 2019
int main(void) {
long long L, R;
cin >> L >> R;
R = min(R, L + MOD * 2);
long long ans = MOD;
long long i, j;
for (i = L; i <= R; i++) {
for (j = L + 1; j <= R; j++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MOD 2019
int main(void) {
long long L, R;
cin >> L >> R;
R = min(R, L + MOD * 2);
long long ans = MOD;
long long i, j;
for (i = L; i <= R; i++) {
for (j = i + 1; j <= R; j++) {
... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,810 | 791,811 | u330913290 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MOD 2019
int main(void) {
long long L, R;
cin >> L >> R;
R = min(R, L + MOD * 2);
int ans = MOD;
int i, j;
for (i = L; i <= R; i++) {
for (j = L + 1; j <= R; j++) {
ans = m... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MOD 2019
int main(void) {
long long L, R;
cin >> L >> R;
R = min(R, L + MOD * 2);
long long ans = MOD;
long long i, j;
for (i = L; i <= R; i++) {
for (j = i + 1; j <= R; j++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,812 | 791,811 | u330913290 | cpp |
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int L, r, i, j;
cin >> L >> r;
int x = 0;
int min = 2020;
for (i = L; i <= r; i++) {
if (i % 2019 == 0) {
min = 0;
break;
}
for (j = L + 1; j <= r; j++) {
if (j % 2019 == 0) {
min = 0;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int L, r, i, j;
cin >> L >> r;
int x = 0;
int min = 2020;
for (i = L; i <= r; i++) {
if (i % 2019 == 0) {
min = 0;
break;
}
for (j = i + 1; j <= r; j++) {
if (j % 2019 == 0) {
min = 0;
... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,820 | 791,821 | u199184624 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.