problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02982 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int X[N][D];
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= D; j++) {
cin >> X[i][j];
}
}
int counter = 0;
for (int i = 1; i < N; i++) {
for (int j = i + 1; j <= N; j... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int X[11][11];
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= D; j++) {
cin >> X[i][j];
}
}
int counter = 0;
for (int i = 1; i < N; i++) {
for (int j = i + 1; j <= N;... | replace | 7 | 8 | 7 | 8 | 0 | |
p02982 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | replace | 24 | 25 | 24 | 25 | 0 | |
p02982 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool isSquare(int n) {
int a = (int)sqrt(n);
return a * a == n;
}
void solve() {
int n, d;
cin >> n >> d;
vector<vector<int>> v(n, vector<int>(d));
for (int i = 0; i < n; ++i)
for (int j = 0; j < d; ++j)
cin >> v[i][j];
int r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool isSquare(int n) {
int a = (int)sqrt(n);
return a * a == n;
}
void solve() {
int n, d;
cin >> n >> d;
vector<vector<int>> v(n, vector<int>(d));
for (int i = 0; i < n; ++i)
for (int j = 0; j < d; ++j)
cin >> v[i][j];
int r... | replace | 21 | 22 | 21 | 22 | TLE | |
p02982 | C++ | Runtime Error | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
int main() {
int n = ri();
int d = ri();
int a[n][d];
for (int i = 0; i < n... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
int main() {
int n = ri();
int d = ri();
int a[n][d];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++)
a[i][j] = ri();
}
int res = 0;
for (in... | delete | 0 | 3 | 0 | 0 | 0 | |
p02982 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> X(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X.at(i).at(j);
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < i; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> X(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X.at(i).at(j);
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < i; j++) {
... | replace | 17 | 18 | 17 | 18 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02982 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> x[i][j];
}
}
int cnt = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < i; ++j) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < d; ++j) {
cin >> x[i][j];
}
}
int cnt = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < i; ++j) {
i... | replace | 9 | 10 | 9 | 10 | 0 | |
p02982 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, D;
cin >> N >> D;
vector<vector<double>> point(N, vector<double>(D, 0));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> point[i][j];
}
}
int ans = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, D;
cin >> N >> D;
vector<vector<double>> point(N, vector<double>(D, 0));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> point[i][j];
}
}
int ans = 0;
... | replace | 19 | 21 | 19 | 21 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using lint = int64_t;
using namespace std;
const lint mod = 2019;
int main() {
lint L, R;
cin >> L >> R;
lint ans = 9e18;
for (lint i = L; i < R; i++) {
for (lint j = i + 1; j <= R; j++) {
if (i >= j)
continue;
ans = min(ans, i * j % mod);
... | #include <algorithm>
#include <iostream>
using lint = int64_t;
using namespace std;
const lint mod = 2019;
int main() {
lint L, R;
cin >> L >> R;
lint ans = 9e18;
for (lint i = L; i <= min(L + 2020, R); i++) {
for (lint j = max(L, max((lint)0, R - 2020)); j <= R; j++) {
if (i >= j)
continue... | replace | 12 | 14 | 12 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | replace | 308 | 309 | 308 | 309 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <climits>
#include <iostream>
using namespace std;
int main() {
long L, R;
cin >> L >> R;
long minimum = LONG_MAX;
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
if ((i * j) % 2019 < minimum) {
minimum = (i * j) % 2019;
}
}
}
cout << minimum << end... | #include <climits>
#include <iostream>
using namespace std;
int main() {
long L, R;
cin >> L >> R;
long minimum = LONG_MAX;
if (R - L > 2019) {
minimum = 0;
} else {
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
if ((i * j) % 2019 < minimum) {
minimum = ... | replace | 9 | 13 | 9 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int l, r;
cin >> l >> r;
ll result = INT_MAX;
for (int i = l; (i < r && i <= (l + 2019)); ++i) {
for (int j = i + 1; j <= r && j <= (j + 2019); ++j)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int l, r;
cin >> l >> r;
ll result = INT_MAX;
for (int i = l; (i < r && i <= (l + 2019)); ++i) {
for (int j = i + 1; j <= r && j <= (i + 1 + 2019); ... | replace | 15 | 16 | 15 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
const int INF = 1001001001;
int main() {
ll l, r;
cin >> l >> r;
r = min(l + 2019, r);
ll ans = INF;
for (ll i = l; i <= r; i++) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
const int INF = 1001001001;
int main() {
ll l, r;
cin >> l >> r;
r = min(l + 2019, r);
ll ans = INF;
for (ll i = l; i <= r; i++) {
... | replace | 15 | 17 | 15 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
unsigned int L, R;
cin >> L >> R;
unsigned int m = 2019;
for (unsigned int i = L; i < R; i++) {
for (unsigned int j = i + 1; j <= R; j++) {
unsigned int d = ((i % 2019) * (j... | #include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
unsigned int L, R;
cin >> L >> R;
unsigned int m = 2019;
for (unsigned int i = L; i < R && i <= L + 2019; i++) {
for (unsigned int j = i + 1; j <= R && i <= j + 2019; j++) {
... | replace | 13 | 15 | 13 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
int n, m, ans = 2019 * 2019;
int main() {
cin >> n >> m;
for (int i = n; i < m; i++)
for (int o = i + 1; o <= m; o++)
ans = min(ans, ((i % 2019) * (o % 2019) % 2019));
cout << ans << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int n, m, ans = 2019 * 2019;
int main() {
cin >> n >> m;
if (m - n >= 2019)
cout << 0 << endl;
else {
for (int i = n; i < m; i++)
for (int o = i + 1; o <= m; o++)
ans = min(ans, ((i % 2019) * (o % 2019) % 2019));
cout << ans << e... | replace | 6 | 10 | 6 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#inclu... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#inclu... | insert | 72 | 72 | 72 | 74 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
constexpr int MOD = 2019;
int main() {
int L, R;
std::cin >> L >> R;
if (R - L > (MOD + 10) * (MOD + 10)) {
R = L + (MOD + 10) * (MOD + 10);
}
int min = MOD;
for (int i = L; i <= R; ++i) {
for (int j = i + 1; j <= R; ++j) {
int r = ((i % MOD) * (j % M... | #include <algorithm>
#include <iostream>
constexpr int MOD = 2019;
int main() {
int L, R;
std::cin >> L >> R;
if (R - L > MOD + 10) {
R = L + MOD + 10;
}
int min = MOD;
for (int i = L; i <= R; ++i) {
for (int j = i + 1; j <= R; ++j) {
int r = ((i % MOD) * (j % MOD)) % MOD;
min = std::m... | replace | 8 | 10 | 8 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int l, r;
cin >> l >> r;
Int min = pow(10, 18);
for (Int ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int l, r;
cin >> l >> r;
Int min = pow(10, 18);
for (Int ... | replace | 21 | 24 | 21 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | /*
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long long l, r;
int ans = 2019;
cin >> l >> r;
vector<bool> a(2019, false);
for (int i = l; i <= r; i++)
a[i % 2019] = true;
for... | /*
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
long long l, r;
int ans = 2019;
cin >> l >> r;
vector<bool> a(2019, false);
if (r - l < 2019) {
for (int i = l; i <= r; i++)
a... | replace | 18 | 22 | 18 | 25 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long L, R;
cin >> L >> R;
long ans = 2147483647;
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
if (i % 2019 == 0) {
cout << 0;
return 0;
}
if (i * j % 2019 < ans) {
ans = i * j % 2019;
... | #include <iostream>
using namespace std;
int main() {
long L, R;
cin >> L >> R;
long ans = 2147483647;
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
if (j % 2019 == 0) {
cout << 0;
return 0;
}
if (i * j % 2019 < ans) {
ans = i * j % 2019;
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define endl "\n"
using namespace std;
long long int l, r, i, j, a;
int main() {
cin >> l >> r;
int x = ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define endl "\n"
using namespace std;
long long int l, r, i, j, a;
int main() {
cin >> l >> r;
int x = ... | replace | 29 | 31 | 29 | 32 | TLE | |
p02983 | C++ | Time Limit Exceeded | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | replace | 87 | 89 | 87 | 89 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#incl... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#incl... | insert | 39 | 39 | 39 | 40 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll ans = 2018;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll ans = 2018;
... | replace | 18 | 19 | 18 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long L, R;
cin >> L >> R;
long answer = L * R;
if (!(L * R < 2019)) {
for (long i = L; i < R; i++) {
for (long j = L + 1; j <= R; j++) {
long mod = (i * j) % 2019;
if (answer > mod) {
answer = mod;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long L, R;
cin >> L >> R;
long answer = L * R;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
if (!(L * R < 2019)) {
for (long i = L; i < R; i++) {
for (long j = L + 1; j <= R; j++) {
long mod = (i * j) % 2019;
... | insert | 7 | 7 | 7 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long int l;
long long int r;
long long int a, b;
long long int n = 0;
int min = 10000000;
cin >> l >> r;
for (a = l; a < r; a++) {
for (b = l + 1; b < r + 1; b++) {
n = a * b % 2019;
if (n < min) {
min = n;
... | #include <iostream>
using namespace std;
int main(void) {
long long int l;
long long int r;
long long int a, b;
long long int n = 0;
int min = 10000000;
cin >> l >> r;
if (r - l > 2020) {
cout << "0" << endl;
return 0;
}
for (a = l; a < r; a++) {
for (b = l + 1; b < r + 1; b++) {
... | insert | 11 | 11 | 11 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
long long l, r, ans = 2020, a[2020];
int main(int argc, char const *argv[]) {
scanf("%lld%lld", &l, &r);
for (long long i = l; i <= r; ++i) {
memset(a, 0, sizeof(a));
for (long long j = i + 1;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
long long l, r, ans = 2020, a[2020];
int main(int argc, char const *argv[]) {
scanf("%lld%lld", &l, &r);
if (l / 2019 != r / 2019) {
printf("0\n");
return 0;
}
for (long long i = l; i <= r... | insert | 9 | 9 | 9 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int d = r - l;
int ans = 2019;
for (int i = 0; i < d; i++) {
for (int j = i + 1; j <= d; j++) {
int x = (l + i) % 2019;
int y = (l + j) % 2019;
ans = min(ans, (x * y) % 2019);
}
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int d = min(2019, (r - l));
int ans = 2019;
for (int i = 0; i < d; i++) {
for (int j = i + 1; j <= d; j++) {
int x = (l + i) % 2019;
int y = (l + j) % 2019;
ans = min(ans, (x * y) % 2019);
}
}
c... | replace | 6 | 7 | 6 | 7 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
ll P = 2019;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
if (r - l > 2019) {
cout... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
ll P = 2019;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
if (r - l > 2019) {
cout... | insert | 19 | 19 | 19 | 20 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vii = vector<vi>;
int main() {
long long int l, r;
cin >> l >> r;
bool flag = false;
int m = 2019;
if (l - r + 1 >= 2019) {
m = 0;
flag = true;
}
if (!fl... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vii = vector<vi>;
int main() {
long long int l, r;
cin >> l >> r;
bool flag = false;
int m = 2019;
if (l - r + 1 >= 2019) {
m = 0;
flag = true;
}
if (!fl... | insert | 30 | 30 | 30 | 32 | TLE | |
p02983 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
#include <bits/stdc++.h>
// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i, n) for (long long i = 0, i##_len = (n); i < i##_len; i++)
#define RANGE(i, is, ie) \
... | #pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
#include <bits/stdc++.h>
// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i, n) for (long long i = 0, i##_len = (n); i < i##_len; i++)
#define RANGE(i, is, ie) \
... | replace | 69 | 70 | 69 | 70 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long int l, r;
long int min = 3000;
cin >> l >> r;
for (long int i = l; i <= r - 1; i++) {
for (long int j = i + 1; j <= r; j++) {
int tmp = (i * j) % 2019;
if (tmp < min) {
min = tmp;
}
}
}
cout << min << endl;
... | #include <iostream>
using namespace std;
int main() {
long int l, r;
long int min = 3000;
cin >> l >> r;
for (long int i = l; i <= r - 1; i++) {
for (long int j = i + 1; j <= r; j++) {
int tmp = (i * j) % 2019;
if (tmp < min) {
min = tmp;
}
if (min == 0) {
break;
... | insert | 16 | 16 | 16 | 22 | TLE | |
p02983 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
const long long INF = 200000000000000;
double pi = 3... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
const long long INF = 200000000000000;
double pi = 3... | replace | 72 | 73 | 72 | 73 | 1 | |
p02983 | C++ | Time Limit Exceeded | // nlather (Nishant Raj Lather)
// Chrollo_Lucifer
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_up... | // nlather (Nishant Raj Lather)
// Chrollo_Lucifer
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_up... | replace | 60 | 63 | 60 | 61 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long min = 2020;
for (long long i = l; i <= r; i++) {
long long tmp = i % 2019;
if (tmp < min)
min = tmp;
}
if (min == 0) {
cout << 0 << endl;
return 0;
}
long long start = l % 2019;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long min = 2020;
for (long long i = l; i <= r; i++) {
long long tmp = i % 2019;
if (tmp < min)
min = tmp;
if (min == 0)
break;
}
if (min == 0) {
cout << 0 << endl;
return 0;
}
... | insert | 12 | 12 | 12 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long mind = 1e9;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j < r + 1; j++) {
mind = min(((i * j) % 2019), mind);
if (mind == 0)
break;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long mind = 2018;
if (r - l > 2019) {
cout << 0 << endl;
return 0;
}
for (long long i = l % 2019; i < r % 2019; i++) {
for (long long j = i + 1; j <= r % 2019; j++) ... | replace | 8 | 11 | 8 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | replace | 85 | 87 | 85 | 87 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <climits> // LLONG_MAX, LLONG_MIN, INT_MIN, INT_MAX
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <util... | #include <algorithm>
#include <assert.h>
#include <climits> // LLONG_MAX, LLONG_MIN, INT_MIN, INT_MAX
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <util... | insert | 43 | 43 | 43 | 47 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | replace | 58 | 59 | 58 | 59 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define REP(i, m, n) for (ll(i) = (m), i_len = (n); (i) < (i_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define REP(i, m, n) for (ll(i) = (m), i_len = (n); (i) < (i_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#def... | replace | 25 | 30 | 25 | 30 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
//-----------------------------------------------
int mod = 2019;
//------------------------------------------------
int main() {
int l, r, ans, a;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
//-----------------------------------------------
int mod = 2019;
//------------------------------------------------
int main() {
int l, r, ans, a;
... | insert | 14 | 14 | 14 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | replace | 72 | 73 | 72 | 73 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, l, r) for (int i = (l), i##R = (r); i <= i##R; i++)
#define DOR(i, r, l) for (int i = (r), i##L = (l); i >= i##L; i--)
#define loop(i, n) for (int i = 0, i##R = (n); i < i##R; i++)
#define sf scanf
#define pf printf
#define mms(a, x) memset(a, x, sizeof a)
using namespace std;
ty... | #include <bits/stdc++.h>
#define FOR(i, l, r) for (int i = (l), i##R = (r); i <= i##R; i++)
#define DOR(i, r, l) for (int i = (r), i##L = (l); i >= i##L; i--)
#define loop(i, n) for (int i = 0, i##R = (n); i < i##R; i++)
#define sf scanf
#define pf printf
#define mms(a, x) memset(a, x, sizeof a)
using namespace std;
ty... | replace | 21 | 22 | 21 | 22 | TLE | |
p02983 | C++ | Time Limit Exceeded | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (LL a = b; a <= c; ++a)
#define rl(a, b, c) for (LL a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespace... | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (LL a = b; a <= c; ++a)
#define rl(a, b, c) for (LL a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespace... | insert | 20 | 20 | 20 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | replace | 25 | 26 | 25 | 26 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> //setprecsion
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#i... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> //setprecsion
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#i... | replace | 66 | 68 | 66 | 68 | TLE | |
p02983 | C++ | Time Limit Exceeded | /* long long or int */
/* xx 396*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll l, r;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> l >> r;
if (l - r + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 2019;
for (ll i = l; i < r; i++) ... | /* long long or int */
/* xx 396*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll l, r;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 2019;
for (ll i = l; i < r; i++) ... | replace | 15 | 16 | 15 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
using namespace std;
int main() {
ll l, r;
cin >> l >> r;
ll ml... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
using namespace std;
int main() {
ll l, r;
cin >> l >> r;
ll ml... | insert | 22 | 22 | 22 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
const int MOD = 2019;
int L, R;
int main() {
cin ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
const int MOD = 2019;
int L, R;
int main() {
cin ... | replace | 18 | 19 | 18 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long Min = 2018;
if (L - R < 2019) {
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
Min = min(Min, (i * j) % 2019);
}
}
printf("%lld", Min)... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long Min = 2018;
if (R - L < 2019) {
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
Min = min(Min, (i * j) % 2019);
}
}
printf("%lld", Min)... | replace | 7 | 8 | 7 | 8 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, min = 2018;
cin >> l >> r;
for (int i = l; i <= r - 1; i++) {
for (int j = r; j >= l + 1; j--) {
int left = i, right = j;
left %= 2019;
right %= 2019;
if (left * right % 2019 < min)
min = left * right % 2019... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, min = 2018;
cin >> l >> r;
for (int i = l; i <= r - 1; i++) {
for (int j = r; j >= l + 1; j--) {
if (min == 0)
break;
int left = i, right = j;
left %= 2019;
right %= 2019;
if (left * right % 2019 < min... | insert | 9 | 9 | 9 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>... | replace | 58 | 59 | 58 | 59 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin... | replace | 23 | 25 | 23 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) ... | delete | 59 | 60 | 59 | 59 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int min = 99999;
for (int i = L; i <= R - 1; i++) {
for (int j = i + 1; j <= R && j < i + 2050; j++) {
int a = i % 2019;
int b = j % 2019;
if ((a * b) % 2019 < min)
min = (a * b) % 2019;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int min = 99999;
for (int i = L; i <= R - 1 && i < L + 2050; i++) {
for (int j = i + 1; j <= R && j < i + 2050; j++) {
int a = i % 2019;
int b = j % 2019;
if ((a * b) % 2019 < min)
min = (a * b) % ... | replace | 7 | 8 | 7 | 8 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < n + 1; ++i)
#include <string>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
R = min(R, R + 4038);
int ans = 2018;
for (long long i = L; i < R; ++i) {
for (long long j = i + 1; j <= R; ++j) {
int x = i * j % 2019;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < n + 1; ++i)
#include <string>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
R = min(R, L + 4038);
int ans = 2018;
for (long long i = L; i < R; ++i) {
for (long long j = i + 1; j <= R; ++j) {
int x = i * j % 2019;
... | replace | 8 | 9 | 8 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
bool m[2020] = {};
int main() {
int l, r;
cin >> l >> r;
for (int i = l; i <= r; i++) {
m[i % 2019] = true;
}
int ans = INF;
for (int i = 0; i < 2019; i++) {
if (!m[i])
continue;
for (int j = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
bool m[2020] = {};
int main() {
int l, r;
cin >> l >> r;
if (2019 * (l / 2019) + 2019 <= r) {
r %= 2019;
r += 2019;
l %= 2019;
} else {
r %= 2019;
l %= 2019;
}
for (int i = l; i <= r; i++) {
... | insert | 8 | 8 | 8 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | /**
* author: yuya1234
* created: 10.07.2020 16:33:27
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) fo... | /**
* author: yuya1234
* created: 10.07.2020 16:33:27
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) fo... | replace | 32 | 33 | 32 | 39 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <math.h>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e18, flag;
int main() {
ll l, r;
cin >> l >> r;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll flag = (... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <math.h>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e18, flag;
int main() {
ll l, r;
cin >> l >> r;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll flag = (... | insert | 20 | 20 | 20 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort(all(x))
#define sep ' '
#define endl '\n'
#define tab '\t'
#define X first
#define Y second
#define fast_io ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort(all(x))
#define sep ' '
#define endl '\n'
#define tab '\t'
#define X first
#define Y second
#define fast_io ... | replace | 30 | 31 | 30 | 31 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
long long int ans = 2019;
for (long long int i = l; i < r; ++i) {
for (long long int j = i + 1; j <= r; ++j) {
ans = min((i * j) % 2019, ans);
if (ans == 0)
break;
}
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
long long int ans = 2019;
for (long long int i = l; i < r; ++i) {
for (long long int j = i + 1; j <= r && j < l + 2019; ++j) {
ans = min((i * j) % 2019, ans);
if (ans == 0)
break;
}
}
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main() {
long long int L, R, sum, i, j, tmp, tmp_i, tmp_j, min;
scanf("%lld %lld", &L, &R);
min = (L % 2019) * (R % 2019) % 2019;
for (i = L; i < R; i++) {
for (j = i + 1; j <= R; j++) {
tmp_i = i % 2019;
tmp_... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main() {
long long int L, R, sum, i, j, tmp, tmp_i, tmp_j, min;
scanf("%lld %lld", &L, &R);
min = (L % 2019) * (R % 2019) % 2019;
for (i = L; i < R; i++) {
for (j = i + 1; j <= R; j++) {
tmp_i = i % 2019;
tmp_... | insert | 21 | 21 | 21 | 25 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ans = 2018;
r = min(r, l + 4038); // rのサイズが小さくなるため通常ループで計算可能になる
for (ll i = l; i < r + 1; i++) {
for (ll ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ans = 2018;
r = min(r, l + 4038); // rのサイズが小さくなるため通常ループで計算可能になる
for (ll i = l; i < r + 1; i++) {
for (ll ... | replace | 14 | 15 | 14 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
// #pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fal... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
// #pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fal... | replace | 35 | 36 | 35 | 36 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | replace | 54 | 56 | 54 | 58 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long ans = 9223372036854775807;
long long mod = 2019;
for (int i = l; ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long ans = 9223372036854775807;
long long mod = 2019;
for (int i = l; ... | insert | 20 | 20 | 20 | 26 | TLE | |
p02983 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
#define rem... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
#define rem... | replace | 39 | 41 | 39 | 42 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll l, r;
cin >> l >> r;
ll ans = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(an... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll l, r;
cin >> l >> r;
ll ans = 2019;
if (r - l >= 2019) {
ans = 0;
} else {
for (ll i = l; i <= r; i++) {
f... | replace | 18 | 21 | 18 | 25 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using V = vector<int>;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using V = vector<int>;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >... | replace | 19 | 23 | 19 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1e9;
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1e9;
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
... | insert | 15 | 15 | 15 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | insert | 40 | 40 | 40 | 42 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
using namespace std;
int L, R, now_min;
now_min = 2019;
cin >> L >> R;
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
now_min = min(((i % 2019) * (j % 2019)) % 2019, now_min);
if (now_min == 0) {
break;
}
}
}
cout << now_... | #include <iostream>
int main() {
using namespace std;
int L, R, now_min;
now_min = 2019;
cin >> L >> R;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
now_min = min(((i % 2019) * (j % 2019)) % 2019, now_min);
... | insert | 6 | 6 | 6 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | replace | 126 | 127 | 126 | 135 | TLE | |
p02983 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | replace | 60 | 63 | 60 | 61 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
long long l, r;
int main() {
ios::sync_with_stdio(false);
cin >> l >> r;
int min1 = (1 << 30);
for (long long i = l; i <= r; i++)
for (long long j = i + 1; j <= r; j++) {
if (min1 > i % 2019 * (j % 2019) % 2019)
min1... | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
long long l, r;
int main() {
ios::sync_with_stdio(false);
cin >> l >> r;
int min1 = (1 << 30);
int l1 = l % 2019, r1 = r % 2019;
if (l / 2019 != r / 2019) {
cout << "0";
return 0;
} else {
for (long long i = l; i <= r;... | replace | 9 | 15 | 9 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
i... | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
i... | insert | 24 | 24 | 24 | 25 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 100100100;
ll cnt = 0;
bool flag = false;
if (r - l < 1000000) {
for (ll i = l; i < r; i++) {
for (ll j... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 100100100;
ll cnt = 0;
bool flag = false;
if (r - l < 100000) {
for (ll i = l; i < r; i++) {
for (ll j ... | replace | 12 | 13 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, t, res = 2020;
cin >> a >> b;
b = min(b, b + 2019);
for (long i = a; i <= b; i++) {
for (long j = i + 1; j <= b; j++) {
t = (i * j) % 2019;
res = min(t, res);
}
}
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, t, res = 2020;
cin >> a >> b;
b = min(b, a + 2019);
for (long i = a; i <= b; i++) {
for (long j = i + 1; j <= b; j++) {
t = (i * j) % 2019;
res = min(t, res);
}
}
cout << res;
return 0;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <limits>
int main() {
long long L, R;
std::cin >> L >> R;
const long long mod = 2019;
auto ret = std::numeric_limits<long long>::max();
for (long long i = L; i < R; ++i) {
const auto i_mod = i % mod;
const auto j_max = std::min(R, i + mod);
for... | #include <algorithm>
#include <iostream>
#include <limits>
int main() {
long long L, R;
std::cin >> L >> R;
const long long mod = 2019;
auto ret = std::numeric_limits<long long>::max();
const auto i_max = std::min(R, L + mod - 1);
for (long long i = L; i < i_max; ++i) {
const auto i_mod = i % mod;
... | replace | 11 | 12 | 11 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
scanf("%d%d", &l, &r);
if (l - r + 1 >= 2020)
printf("0");
else {
int ans = 2019;
for (int i = l; i <= r; i++)
for (int j = i + 1; j <= r; j++)
if (((i % 2019) * (j % 2019)) % 2019 < ans)
ans = ((i % 2019) *... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
scanf("%d%d", &l, &r);
if (r - l + 1 >= 2020)
printf("0");
else {
int ans = 2019;
for (int i = l; i <= r; i++)
for (int j = i + 1; j <= r; j++)
if (((i % 2019) * (j % 2019)) % 2019 < ans)
ans = ((i % 2019) *... | replace | 5 | 6 | 5 | 6 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
for (ll i = l; i <= r - 1; ++i) {
for (ll j = l + 1; j <= r; ++j) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2020;
if (r - l >= 2019) {
r = l + 2019;
}
for (ll i = l; i <= r - 1; ++i) {
for (ll j = l + 1; j <= r; ++j) {
ans = min(ans, i * ... | insert | 10 | 10 | 10 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
ll l, r;
cin >> l >> r;
set<int> mods;
for (ll i = l; i <= r; i++) {
mods.insert(i % 2019);
}
vector<int> m;
for (auto itr = mods.begin(); itr != mods.end(); itr++) {
m.push_back(*itr);
}
int ans = 2020;
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
ll l, r;
cin >> l >> r;
set<int> mods;
for (ll i = l; i <= r; i++) {
int mod = i % 2019;
mods.insert(mod);
if (mods.size() >= 2019)
break;
}
vector<int> m;
for (auto itr = mods.begin(); itr != mods.end(); i... | replace | 10 | 11 | 10 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) begin(x), end(x)
#defi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define all(x) begin(x), end(x)
#defi... | replace | 42 | 44 | 42 | 44 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
// #define int long long int
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
// #define int long long int
using namespace std;
... | replace | 21 | 22 | 21 | 22 | TLE | |
p02983 | C++ | Time Limit Exceeded | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(long long n); // 数字の桁数を取得する。
string up... | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(long long n); // 数字の桁数を取得する。
string up... | replace | 49 | 50 | 49 | 50 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2019;
for (int i = L; i < R && i - L <= 2019; i++) {
for (int j = i + 1; j <= R && j - R <= 2019; j++) {
ans = min(ans, (ll)i * j % 2019);
}
}
cout << ans << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2019;
for (int i = L; i < R && i - L <= 2019; i++) {
for (int j = i + 1; j <= R && j - L <= 2019; j++) {
ans = min(ans, (ll)i * j % 2019);
}
}
cout << ans << endl;
return 0;
... | replace | 11 | 12 | 11 | 12 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 2019
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2999999999;
for (int i = L; i < R; i++) {
for (int j = L + 1; j <= R; j++) {
ll tmp = ((i % MOD) * (j % MOD)) % MOD;
ans = min(ans, tmp);
if (ans == 0)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 2019
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2999999999;
for (int i = L; i < R; i++) {
for (int j = L + 1; j <= R; j++) {
ll tmp = ((i % MOD) * (j % MOD)) % MOD;
ans = min(ans, tmp);
if (ans == 0)... | insert | 19 | 19 | 19 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 2019;
int main() {
int l, r;
cin >> l >> r;
long long ans = mod;
if (l - r >= mod) {
ans = 0;
} else {
for (long long i = l; i <= r; i++) {
fo... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 2019;
int main() {
int l, r;
cin >> l >> r;
long long ans = mod;
if (r - l >= mod) {
ans = 0;
} else {
for (long long i = l; i <= r; i++) {
fo... | replace | 15 | 16 | 15 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | /**
������������ Author : Avi J Patel ������������
������������ University : DA-IICT ������������
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define N 100000
#define ff first
#define ss sec... | /**
������������ Author : Avi J Patel ������������
������������ University : DA-IICT ������������
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define N 100000
#define ff first
#define ss sec... | insert | 45 | 45 | 45 | 52 | TLE | |
p02983 | C++ | Time Limit Exceeded | // A Naive recursive C++ program to find minimum of coins
// to make a given change V
#include <bits/stdc++.h>
using namespace std;
int main() {
long int l, r;
cin >> l >> r;
int a[2019] = {0};
for (long int i = l; i <= r; i++)
a[i % 2019]++;
int min1 = INT_MAX;
// cout<<a[4]<<" "<<a[5]<<endl;
if (a[... | // A Naive recursive C++ program to find minimum of coins
// to make a given change V
#include <bits/stdc++.h>
using namespace std;
int main() {
long int l, r;
cin >> l >> r;
int a[2019] = {0};
for (long int i = l; i <= min(r, l + 2020); i++)
a[i % 2019]++;
int min1 = INT_MAX;
// cout<<a[4]<<" "<<a[5]<... | replace | 8 | 9 | 8 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | replace | 33 | 34 | 33 | 34 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using Map = map<ll, ll>;
using T = tuple<ll, ll, ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout << v << endl
#define first(v) get<0>(v)
#define second(v) get<1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using Map = map<ll, ll>;
using T = tuple<ll, ll, ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout << v << endl
#define first(v) get<0>(v)
#define second(v) get<1... | insert | 36 | 36 | 36 | 40 | TLE | |
p02983 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define CHAL_BC_APNE_BAAP_KO_MAT_SIKHA \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define CHAL_BC_APNE_BAAP_KO_MAT_SIKHA \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | delete | 12 | 16 | 12 | 12 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long ans = 1e9;
if (r < l + 2019) {
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans)
ans = (i * j) % 2019;
// cout<<ans;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long ans = 1e9;
if (r < l + 2019) {
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < ans)
ans = (i * j) % 2019;
// cout<<ans;
... | replace | 15 | 16 | 15 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
inline int max(int a, int b) {
if (b > a)
swap(a, b);
return a;
}
inline int min(int... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
inline int max(int a, int b) {
if (b > a)
swap(a, b);
return a;
}
inline int min(int... | replace | 29 | 31 | 29 | 32 | TLE | |
p02983 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T... | replace | 29 | 34 | 29 | 36 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a... | replace | 107 | 108 | 107 | 108 | TLE | |
p02983 | C++ | Time Limit Exceeded | // #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long L, R;
// vector<int> vp;
// int vp[12][12];
cin >> L >> R;
// for (int j=0; j<N; j++){
// for (int i=0; i<D; i++){
// cin >> vp[j][i];
// }
// }
long long res = 2020;
long long mod2019;
... | // #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long L, R;
// vector<int> vp;
// int vp[12][12];
cin >> L >> R;
// for (int j=0; j<N; j++){
// for (int i=0; i<D; i++){
// cin >> vp[j][i];
// }
// }
long long res = 2020;
long long mod2019;
... | insert | 30 | 30 | 30 | 32 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, o) for (int i = 0; i < (o); i++)
#define rep_s(i, o) for (int i = 1; i < (o); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, o) for (int i = 0; i < (o); i++)
#define rep_s(i, o) for (int i = 1; i < (o); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) ... | insert | 40 | 40 | 40 | 45 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <istream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main() {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <istream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main() {
... | replace | 25 | 26 | 25 | 26 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
long long L, R;
std::cin >> L >> R;
int min = 2018 * 2018;
if (L - R >= 2019) {
std::cout << 0 << std::endl;
return 0;
} else {
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
int l = i % 2019;
int r = j % 2019;
int... | #include <iostream>
int main() {
long long L, R;
std::cin >> L >> R;
int min = 2018 * 2018;
if (R - L >= 2019) {
std::cout << 0 << std::endl;
return 0;
} else {
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
int l = i % 2019;
int r = j % 2019;
int... | replace | 7 | 8 | 7 | 8 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.