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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02983 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cout << v[i] << " "
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct Edge {
ll from, to, cost;
};
struct node {
ll cost, to;
bool friend operator>(node a, node b) { return a.cost > b.cost; }
};
ll mod(ll a, ll mod) {
ll res = a % mod;
if (res < 0)
res = res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, a % b);
}
bool is_prime(ll n) {
ll i = 2;
if (n == 1)
return false;
if (n == 2)
return true;
bool res = true;
while (i * i < n) {
if (n % i == 0) {
res = false;
}
i = i + 1;
}
// if(i==1)res = false;
if (n % i == 0)
res = false;
return res;
}
/**************************************
** A main function starts from here **
***************************************/
int main() {
ll L, R;
cin >> L >> R;
if (L - R >= 2019) {
cout << 0;
} else {
ll ans = 100000;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans;
}
return 0;
}
| #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cout << v[i] << " "
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct Edge {
ll from, to, cost;
};
struct node {
ll cost, to;
bool friend operator>(node a, node b) { return a.cost > b.cost; }
};
ll mod(ll a, ll mod) {
ll res = a % mod;
if (res < 0)
res = res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, a % b);
}
bool is_prime(ll n) {
ll i = 2;
if (n == 1)
return false;
if (n == 2)
return true;
bool res = true;
while (i * i < n) {
if (n % i == 0) {
res = false;
}
i = i + 1;
}
// if(i==1)res = false;
if (n % i == 0)
res = false;
return res;
}
/**************************************
** A main function starts from here **
***************************************/
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0;
} else {
ll ans = 100000;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans;
}
return 0;
}
| replace | 78 | 79 | 78 | 79 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const ll MOD = (ll)(2019);
ll l, r;
ll ans;
int main(void) {
// Here your code !
scanf("%lld %lld", &l, &r);
ans = INF;
for (ll i = l; i <= min(r - 1, i + MOD - 1); ++i) {
for (ll j = i + 1LL; j <= min(r, j + MOD - 1); ++j) {
ans = min(ans, (i * j) % MOD);
}
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const ll MOD = (ll)(2019);
ll l, r;
ll ans;
int main(void) {
// Here your code !
scanf("%lld %lld", &l, &r);
ans = INF;
for (ll i = l; i <= l + MOD - 1; ++i) {
for (ll j = i + 1LL; j <= i + MOD - 1; ++j) {
if (i >= r || j > r)
continue;
ans = min(ans, (i * j) % MOD);
}
}
printf("%lld\n", ans);
return 0;
}
| replace | 20 | 22 | 20 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define MAX 1000000007
using namespace std;
int main() {
speed_up ll l, r;
cin >> l >> r;
ll out = MAX;
rep(i, l, r) { rep(j, i + 1, r + 1) out = min(out, (i * j) % 2019); }
cout << out;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define MAX 1000000007
using namespace std;
int main() {
speed_up ll l, r;
cin >> l >> r;
ll out = MAX;
for (ll i = l; i < r && out; i++) {
for (ll j = i + 1; j <= r && out; j++)
out = min(out, (i * j) % 2019);
}
cout << out;
return 0;
} | replace | 15 | 16 | 15 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
/*
sort(sp.begin(), sp.end(), [](PAIR l, PAIR r){
return l.first<r.first || (l.first==r.first && l.second > r.second);
});
*/
typedef long long ll;
#define fi first
#define se second
using Graph = vector<vector<int>>;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2029;
for (ll i = l; i <= min(l + 2019, r); i++) {
for (ll j = i + 1; j <= (i + 2019, r); j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
/*
sort(sp.begin(), sp.end(), [](PAIR l, PAIR r){
return l.first<r.first || (l.first==r.first && l.second > r.second);
});
*/
typedef long long ll;
#define fi first
#define se second
using Graph = vector<vector<int>>;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2029;
for (ll i = l; i <= min(l + 2019, r); i++) {
for (ll j = i + 1; j <= min(i + 2019, r); j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
return 0;
} | replace | 77 | 78 | 77 | 78 | TLE | |
p02983 | C++ | Time Limit Exceeded | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define ARR(array) for (int i = 0; i < array.size(); i++)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 1000000007
#define SIZE 10005
#define PI 3.14159265358979323846
ll euclidean_gcd(ll a, ll b) {
if (a < b)
euclidean_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
double input() {
ll a;
cin >> a;
return a;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll ans = 2018;
FOR(i, a, b + 1) FOR(j, a, b + 1) {
if (i == j)
continue;
if (!(i * j)) {
cout << 0 << endl;
return 0;
}
ans = min((ll)i * (ll)j % 2019, ans);
}
cout << ans << endl;
}
| #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define ARR(array) for (int i = 0; i < array.size(); i++)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 1000000007
#define SIZE 10005
#define PI 3.14159265358979323846
ll euclidean_gcd(ll a, ll b) {
if (a < b)
euclidean_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
double input() {
ll a;
cin >> a;
return a;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll ans = 2018;
FOR(i, a, b + 1) FOR(j, i + 1, b + 1) {
if (!(j % 2019) || !(i % 2019)) {
cout << 0 << endl;
return 0;
}
ans = min((ll)i * (ll)j % 2019, ans);
}
cout << ans << endl;
}
| replace | 126 | 130 | 126 | 128 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS constexpr int M = 2019;
int l, r;
cin >> l >> r;
int ans = 0;
if (r - l >= M) {
ans = 0;
} else {
int lm = l % M;
int rm = r % M;
if (lm >= rm) {
ans = 0;
} else {
ans = M;
FOR(i, lm, rm) {
FOR(j, lm + 1, rm + 1) {
int tmp = i * j % M;
cerr << tmp << endl;
if (ans > tmp)
ans = tmp;
}
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS constexpr int M = 2019;
int l, r;
cin >> l >> r;
int ans = 0;
if (r - l >= M) {
ans = 0;
} else {
int lm = l % M;
int rm = r % M;
if (lm >= rm) {
ans = 0;
} else {
ans = M;
FOR(i, lm, rm) {
FOR(j, lm + 1, rm + 1) {
int tmp = i * j % M;
// cerr << tmp << endl;
if (ans > tmp)
ans = tmp;
}
}
}
}
cout << ans << endl;
return 0;
}
| replace | 31 | 32 | 31 | 32 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 2019;
void solve(long long L, long long R) {
long long ans = 1000000000;
for (long long i = L; i <= R - 1; i++) {
for (long long j = i + 1; j <= R; j++) {
if (ans > (i * j) % MOD)
ans = (i * j) % MOD;
if (ans == 0)
break;
}
}
cout << ans << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long L;
scanf("%lld", &L);
long long R;
scanf("%lld", &R);
solve(L, R);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 2019;
void solve(long long L, long long R) {
long long ans = 1e9;
if (R - L > 2019) {
cout << 0 << endl;
return;
}
for (long long i = L; i <= R - 1; i++) {
for (long long j = i + 1; j <= R; j++) {
if (ans > (i * j) % MOD)
ans = (i * j) % MOD;
if (ans == 0)
break;
}
}
cout << ans << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long L;
scanf("%lld", &L);
long long R;
scanf("%lld", &R);
solve(L, R);
return 0;
}
| replace | 6 | 7 | 6 | 12 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100010
#define INF 10000000000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define IN(a) cin >> (a)
#define OUT(a) cout << (a) << endl
typedef pair<int, int> P;
const int MAX = 1000000;
const int MOD = 1000000007;
int main() {
int l, r;
cin >> l >> r;
int ans = 0;
if (l - r < 2019) {
ans = 1000000;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, ((j % 2019) * (i % 2019)) % 2019);
}
}
}
OUT(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100010
#define INF 10000000000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define IN(a) cin >> (a)
#define OUT(a) cout << (a) << endl
typedef pair<int, int> P;
const int MAX = 1000000;
const int MOD = 1000000007;
int main() {
int l, r;
cin >> l >> r;
int ans = 0;
if (r - l < 2019) {
ans = 1000000;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, ((j % 2019) * (i % 2019)) % 2019);
}
}
}
OUT(ans);
return 0;
} | replace | 17 | 18 | 17 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = a; i <= (int)(b); i++)
int main() {
int l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
return 0;
}
int ans = 1001001001;
repi(i, l, r - 1) repi(j, i + 1, r) {
int m;
i %= 2019;
j %= 2019;
m = (i * j) % 2019;
ans = min(ans, m);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = a; i <= (int)(b); i++)
int main() {
int l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
return 0;
}
int ans = 1001001001;
repi(i, l, r - 1) repi(j, i + 1, r) {
int mi, mj, m;
mi = i % 2019;
mj = j % 2019;
m = (mi * mj) % 2019;
ans = min(ans, m);
}
cout << ans << endl;
return 0;
}
| replace | 16 | 20 | 16 | 20 | TLE | |
p02983 | C++ | Time Limit Exceeded | /* When Talent doesn't work, Hard work beats Talent*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define Fast_D cout << fixed << setprecision(13);
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define nl "\n"
#define int long long
#define double long double
#define all(v) v.begin(), v.end()
#define scanstr(s) \
cin >> ws; \
getline(cin, s);
#define debug(x, i, j) \
cout << #x << " " << #i << " " << #j << " " << x << " " << i << " " << j \
<< endl
const double PI = 3.141592653589793;
void solve() {
int l, r;
cin >> l >> r;
if (l - r >= 2019) {
cout << "0";
return;
}
int ans = 2020;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans;
}
int32_t main() {
FastIO;
Fast_D;
int T;
T = 1;
while (T--)
solve();
return 0;
}
| /* When Talent doesn't work, Hard work beats Talent*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define Fast_D cout << fixed << setprecision(13);
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define nl "\n"
#define int long long
#define double long double
#define all(v) v.begin(), v.end()
#define scanstr(s) \
cin >> ws; \
getline(cin, s);
#define debug(x, i, j) \
cout << #x << " " << #i << " " << #j << " " << x << " " << i << " " << j \
<< endl
const double PI = 3.141592653589793;
void solve() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << "0";
return;
}
int ans = 2020;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans;
}
int32_t main() {
FastIO;
Fast_D;
int T;
T = 1;
while (T--)
solve();
return 0;
}
| replace | 33 | 34 | 33 | 34 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define Imax 2147483647
#define ll long long
#define asort(a) sort(a.begin(), a.end());
using namespace ::std;
int jo(ll int jxo, ll int jyo) { // 累乗
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { // char大文字化
return (toxbig - 0x20);
}
char tolow(char toxlow) { // char小文字化
return (toxlow + 0x20);
}
int ctoi(char cctoi) { // char->int
if ('0' <= cctoi && cctoi <= '9')
return (cctoi - '0');
return -1;
}
int gcd(int gcad, int gcbd) { // 最大公約数
if (gcad < gcbd)
return gcd(gcbd, gcad);
int gcrd;
while ((gcrd = gcad % gcbd)) {
gcad = gcbd;
gcbd = gcrd;
}
return gcbd;
}
int lcm(int lcam, int lcbm) { // 最小公倍数
return (lcam * lcbm) / gcd(lcam, lcbm);
}
int main() {
ll int L, R;
cin >> L >> R;
ll int min = Imax;
int md;
rep(i, L, R + 1) {
if (i > L + 2020)
break;
rep(j, i + 1, R + 1) {
if (j > R + 2020)
break;
md = (i * j) % 2019;
if (md < min)
min = md;
}
}
cout << min;
}
// int *p = new int[N];
// vector<int> 変数名(要素数);
// sort(変数名.begin(),変数名.end());//昇順ソート
// vector<vector<int>> 変数名(左の個数, vector<int>(右の個数));
//
| #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define Imax 2147483647
#define ll long long
#define asort(a) sort(a.begin(), a.end());
using namespace ::std;
int jo(ll int jxo, ll int jyo) { // 累乗
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { // char大文字化
return (toxbig - 0x20);
}
char tolow(char toxlow) { // char小文字化
return (toxlow + 0x20);
}
int ctoi(char cctoi) { // char->int
if ('0' <= cctoi && cctoi <= '9')
return (cctoi - '0');
return -1;
}
int gcd(int gcad, int gcbd) { // 最大公約数
if (gcad < gcbd)
return gcd(gcbd, gcad);
int gcrd;
while ((gcrd = gcad % gcbd)) {
gcad = gcbd;
gcbd = gcrd;
}
return gcbd;
}
int lcm(int lcam, int lcbm) { // 最小公倍数
return (lcam * lcbm) / gcd(lcam, lcbm);
}
int main() {
ll int L, R;
cin >> L >> R;
ll int min = Imax;
int md;
rep(i, L, R + 1) {
if (i > L + 2020)
break;
rep(j, i + 1, R + 1) {
if (j > i + 2020)
break;
md = (i * j) % 2019;
if (md < min)
min = md;
}
}
cout << min;
}
// int *p = new int[N];
// vector<int> 変数名(要素数);
// sort(変数名.begin(),変数名.end());//昇順ソート
// vector<vector<int>> 変数名(左の個数, vector<int>(右の個数));
//
| replace | 57 | 58 | 57 | 58 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long ll;
int a[N], n, m, sum, ans, l, r;
char s[N];
int main() {
int ans = 2019;
scanf("%d%d", &l, &r);
for (int i = l; i < min(l + 2019, r + 1); i++) {
for (int j = i + 1; j < min(j + 2019, r + 1); j++) {
int curr = ((ll)i * j) % 2019;
ans = min(curr, ans);
}
}
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long ll;
int a[N], n, m, sum, ans, l, r;
char s[N];
int main() {
int ans = 2019;
scanf("%d%d", &l, &r);
for (int i = l; i < min(l + 2019, r + 1); i++) {
for (int j = i + 1; j < min(i + 2019, r + 1); j++) {
int curr = ((ll)i * j) % 2019;
ans = min(curr, ans);
}
}
printf("%d\n", ans);
}
| replace | 16 | 17 | 16 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 1 << 30;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ll tmp = i * j % 2019;
ans = min(ans, tmp);
if (tmp == 0)
break;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 1 << 30;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ll tmp = i * j % 2019;
ans = min(ans, tmp);
if (tmp == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << ans << endl;
} | replace | 17 | 19 | 17 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <cstring>
#include <iostream>
#include <map> // pair
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define all(x) (x).begin(), (x).end()
const ll mod = 1e9 + 7;
const int INF = 1e9;
const ll INFLONG = 1e18;
int main() {
ll l, r;
cin >> l >> r;
int minimum = 2019;
for (ll i = l; i <= r && minimum != 0; i++) {
for (ll j = i + 1; j <= r; j++) {
if ((i * j) % 2019 < minimum) {
minimum = (i * j) % 2019;
}
}
}
cout << minimum;
}
| #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <cstring>
#include <iostream>
#include <map> // pair
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define all(x) (x).begin(), (x).end()
const ll mod = 1e9 + 7;
const int INF = 1e9;
const ll INFLONG = 1e18;
int main() {
ll l, r;
cin >> l >> r;
int minimum = 2019;
for (ll i = l; i <= r && minimum != 0; i++) {
for (ll j = i + 1; j <= r && j - i <= 2019; j++) {
if ((i * j) % 2019 < minimum) {
minimum = (i * j) % 2019;
}
}
}
cout << minimum;
}
| replace | 39 | 40 | 39 | 40 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define repd(i, a, b) for (int i = a; i < int(b); i++)
#define rep(i, n) repd(i, 0, n)
#define VARNAME(v) #v
using P = pair<int, int>;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;
constexpr ll INF = 1e16;
#pragma region tmp
constexpr double EPS = 1e-10;
constexpr double PI = 3.141592653589793;
const string endn = "\n";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
template <class T1, class T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &o) {
out << "(" << o.first << ", " << o.second << ")";
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &o) {
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (itr + 1 != o.end() ? " " : "");
return out;
}
template <class T> ostream &operator<<(ostream &out, const deque<T> &o) {
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (itr + 1 != o.end() ? " " : "");
return out;
}
template <class T> ostream &operator<<(ostream &out, const set<T> &o) {
out << "{";
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (next(itr, 1) != o.end() ? "," : "");
out << "}";
return out;
}
template <class T> ostream &operator<<(ostream &out, const multiset<T> &o) {
out << "{";
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (next(itr, 1) != o.end() ? "," : "");
out << "}";
return out;
}
template <class T, class U>
ostream &operator<<(ostream &out, const map<T, U> &o) {
out << "{";
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (next(itr, 1) != o.end() ? " " : "");
out << "}";
return out;
}
template <class T, class U>
ostream &operator<<(ostream &out, const multimap<T, U> &o) {
out << "{";
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (next(itr, 1) != o.end() ? " " : "");
out << "}";
return out;
}
template <class T> ostream &operator<<(ostream &out, queue<T> o) {
while (!o.empty())
out << o.front() << (o.size() > 0 ? " " : ""), o.pop();
return out;
}
template <class T, class U>
ostream &operator<<(ostream &out, priority_queue<T, vector<T>, U> o) {
while (!o.empty())
out << o.top() << (o.size() > 0 ? " " : ""), o.pop();
return out;
}
template <class T> ostream &operator<<(ostream &out, stack<T> o) {
while (!o.empty())
out << o.top() << (o.size() > 0 ? " " : ""), o.pop();
return out;
}
template <class T> inline bool chmin(T &a, T b) {
if (a >= b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a <= b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, initializer_list<T> b) {
T c = min(b);
if (a > c) {
a = c;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, initializer_list<T> b) {
T c = max(b);
if (a < c) {
a = c;
return 1;
}
return 0;
}
inline int mrep(int &a, int M = MOD) {
a %= M;
return a = (a < 0 ? a + M : a);
}
inline int add(int &a, int b, int M = MOD) {
return a = (mrep(a, M) + mrep(b, M)) % M;
}
inline int mul(int &a, int b, int M = MOD) {
return a = (mrep(a, M) * mrep(b, M)) % M;
}
inline int add(int &a, initializer_list<int> b, int M = MOD) {
return a = (mrep(a, M) + accumulate(b.begin(), b.end(), (int)0,
[&M](int acc, int i) {
return (acc + mrep(i, M)) % M;
})) %
M;
}
inline int mul(int &a, initializer_list<int> b, int M = MOD) {
return a = (mrep(a, M) * accumulate(b.begin(), b.end(), (int)1,
[&M](int acc, int i) {
return (acc * mrep(i, M)) % M;
})) %
M;
}
inline int modpow(int b, int e, int M = MOD) {
int ret = 1;
while (e > 0) {
if (e % 2)
mul(ret, b, M);
mul(b, b, M);
e /= 2;
};
return ret;
}
inline int modinv(int a, int M = MOD) {
int b = M, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return mrep(u, M);
}
template <class T> inline void print(T a) { cout << a << endl; }
template <class T> inline void print(vector<T> a, int n) {
chmin(n, int(a.size()));
rep(i, n) cout << a[i] << (i != n - 1 ? " " : "\n");
}
template <class T, size_t SIZE> inline void print(T (&a)[SIZE], int n = SIZE) {
chmin(n, int(SIZE));
rep(i, n) cout << a[i] << (i != n - 1 ? " " : "\n");
}
inline string yesno(bool b) { return (b ? "Yes" : "No"); }
#pragma #endregion tmp
signed main() {
int l, r;
cin >> l >> r;
if (l - r > 2019) {
cout << 0 << endl;
} else {
int ans = INF;
repd(i, l, r) {
repd(j, i + 1, r + 1) { chmin(ans, i * j % 2019LL); }
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define repd(i, a, b) for (int i = a; i < int(b); i++)
#define rep(i, n) repd(i, 0, n)
#define VARNAME(v) #v
using P = pair<int, int>;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;
constexpr ll INF = 1e16;
#pragma region tmp
constexpr double EPS = 1e-10;
constexpr double PI = 3.141592653589793;
const string endn = "\n";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
template <class T1, class T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &o) {
out << "(" << o.first << ", " << o.second << ")";
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &o) {
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (itr + 1 != o.end() ? " " : "");
return out;
}
template <class T> ostream &operator<<(ostream &out, const deque<T> &o) {
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (itr + 1 != o.end() ? " " : "");
return out;
}
template <class T> ostream &operator<<(ostream &out, const set<T> &o) {
out << "{";
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (next(itr, 1) != o.end() ? "," : "");
out << "}";
return out;
}
template <class T> ostream &operator<<(ostream &out, const multiset<T> &o) {
out << "{";
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (next(itr, 1) != o.end() ? "," : "");
out << "}";
return out;
}
template <class T, class U>
ostream &operator<<(ostream &out, const map<T, U> &o) {
out << "{";
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (next(itr, 1) != o.end() ? " " : "");
out << "}";
return out;
}
template <class T, class U>
ostream &operator<<(ostream &out, const multimap<T, U> &o) {
out << "{";
for (auto itr = o.begin(); itr != o.end(); itr++)
out << *itr << (next(itr, 1) != o.end() ? " " : "");
out << "}";
return out;
}
template <class T> ostream &operator<<(ostream &out, queue<T> o) {
while (!o.empty())
out << o.front() << (o.size() > 0 ? " " : ""), o.pop();
return out;
}
template <class T, class U>
ostream &operator<<(ostream &out, priority_queue<T, vector<T>, U> o) {
while (!o.empty())
out << o.top() << (o.size() > 0 ? " " : ""), o.pop();
return out;
}
template <class T> ostream &operator<<(ostream &out, stack<T> o) {
while (!o.empty())
out << o.top() << (o.size() > 0 ? " " : ""), o.pop();
return out;
}
template <class T> inline bool chmin(T &a, T b) {
if (a >= b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a <= b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, initializer_list<T> b) {
T c = min(b);
if (a > c) {
a = c;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, initializer_list<T> b) {
T c = max(b);
if (a < c) {
a = c;
return 1;
}
return 0;
}
inline int mrep(int &a, int M = MOD) {
a %= M;
return a = (a < 0 ? a + M : a);
}
inline int add(int &a, int b, int M = MOD) {
return a = (mrep(a, M) + mrep(b, M)) % M;
}
inline int mul(int &a, int b, int M = MOD) {
return a = (mrep(a, M) * mrep(b, M)) % M;
}
inline int add(int &a, initializer_list<int> b, int M = MOD) {
return a = (mrep(a, M) + accumulate(b.begin(), b.end(), (int)0,
[&M](int acc, int i) {
return (acc + mrep(i, M)) % M;
})) %
M;
}
inline int mul(int &a, initializer_list<int> b, int M = MOD) {
return a = (mrep(a, M) * accumulate(b.begin(), b.end(), (int)1,
[&M](int acc, int i) {
return (acc * mrep(i, M)) % M;
})) %
M;
}
inline int modpow(int b, int e, int M = MOD) {
int ret = 1;
while (e > 0) {
if (e % 2)
mul(ret, b, M);
mul(b, b, M);
e /= 2;
};
return ret;
}
inline int modinv(int a, int M = MOD) {
int b = M, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return mrep(u, M);
}
template <class T> inline void print(T a) { cout << a << endl; }
template <class T> inline void print(vector<T> a, int n) {
chmin(n, int(a.size()));
rep(i, n) cout << a[i] << (i != n - 1 ? " " : "\n");
}
template <class T, size_t SIZE> inline void print(T (&a)[SIZE], int n = SIZE) {
chmin(n, int(SIZE));
rep(i, n) cout << a[i] << (i != n - 1 ? " " : "\n");
}
inline string yesno(bool b) { return (b ? "Yes" : "No"); }
#pragma #endregion tmp
signed main() {
int l, r;
cin >> l >> r;
if (r - l > 2100) {
cout << 0 << endl;
} else {
int ans = INF;
repd(i, l, r) {
repd(j, i + 1, r + 1) { chmin(ans, i * j % 2019LL); }
}
cout << ans << endl;
}
}
| replace | 170 | 171 | 170 | 171 | TLE | |
p02983 | C++ | Time Limit Exceeded | /**
* created: 04 July 2019 20:06:43
**/
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vii;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vll;
#define PB push_back
#define PPB pop_back
#define all(c) c.begin(), c.end()
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define INFLL 2000000000000000007
#define INF 2000000007
#define MOD 1000000007
#define TRACE
#ifdef TRACE
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) \
cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
#else
#define trace1(x)
#define trace2(x, y)
#define trace3(x, y, z)
#define trace4(a, b, c, d)
#define trace5(a, b, c, d, e)
#define trace6(a, b, c, d, e, f)
#endif
void optimizeIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
// //AUTHOR: Kaushalesh Shukla
//=========================================================================================================
int main() {
optimizeIO();
int tt = 1;
// cin>>tt;
while (tt--) {
ll l, r;
cin >> l >> r;
if (r - l + 1 > 2019) {
cout << 0;
}
set<ll> s;
rep(i, l, r + 1) {
rep(j, i + 1, r + 1) { s.insert(((i % 2019) * (j % 2019)) % 2019); }
}
cout << *s.begin();
}
return 0;
}
| /**
* created: 04 July 2019 20:06:43
**/
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vii;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vll;
#define PB push_back
#define PPB pop_back
#define all(c) c.begin(), c.end()
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define INFLL 2000000000000000007
#define INF 2000000007
#define MOD 1000000007
#define TRACE
#ifdef TRACE
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) \
cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
#else
#define trace1(x)
#define trace2(x, y)
#define trace3(x, y, z)
#define trace4(a, b, c, d)
#define trace5(a, b, c, d, e)
#define trace6(a, b, c, d, e, f)
#endif
void optimizeIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
// //AUTHOR: Kaushalesh Shukla
//=========================================================================================================
int main() {
optimizeIO();
int tt = 1;
// cin>>tt;
while (tt--) {
ll l, r;
cin >> l >> r;
if (r - l + 1 > 2019) {
cout << 0;
return 0;
}
set<ll> s;
rep(i, l, r + 1) {
rep(j, i + 1, r + 1) { s.insert(((i % 2019) * (j % 2019)) % 2019); }
}
cout << *s.begin();
}
return 0;
}
| insert | 72 | 72 | 72 | 73 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(ALL(x)), (x).end())
#define SORT(x) sort(ALL(x))
#define REV(x) reverse(ALL(x))
#define foreach(it, x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define debug(x) cerr << #x << "=" << (x) << endl
#define gett() cerr << "Time:" << clock() << "ms." << endl
#define ri(x) scanf("%d", &x)
#define rl(x) scanf("%lld", &x)
#define rlcfpoj(x) scanf("%I64d", &x)
#define pi(x) printf("%d", x)
#define pl(x) printf("%lld", x)
#define plcfpoj(x) printf("%I64d", x)
#define lfd() printf("\n")
#define sp() printf(" ")
int l, r;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin >> l >> r;
if (l - r >= 2019) { // 夹了1个2019
cout << 0 << endl;
return 0;
}
int res = 1e9;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
int ti = i % 2019;
int tj = j % 2019;
res = min(res, (ti * tj) % 2019);
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(ALL(x)), (x).end())
#define SORT(x) sort(ALL(x))
#define REV(x) reverse(ALL(x))
#define foreach(it, x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define debug(x) cerr << #x << "=" << (x) << endl
#define gett() cerr << "Time:" << clock() << "ms." << endl
#define ri(x) scanf("%d", &x)
#define rl(x) scanf("%lld", &x)
#define rlcfpoj(x) scanf("%I64d", &x)
#define pi(x) printf("%d", x)
#define pl(x) printf("%lld", x)
#define plcfpoj(x) printf("%I64d", x)
#define lfd() printf("\n")
#define sp() printf(" ")
int l, r;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin >> l >> r;
if (r - l >= 2019) { // 夹了1个2019
cout << 0 << endl;
return 0;
}
int res = 1e9;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
int ti = i % 2019;
int tj = j % 2019;
res = min(res, (ti * tj) % 2019);
}
}
cout << res << endl;
return 0;
}
| replace | 23 | 24 | 23 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r - 1)
cout << (l * r) % 2019 << endl;
else if (l - r >= 673)
cout << "0" << endl;
else {
long long min = INT_MAX;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
long long l = ((i % 2019) * (j % 2019)) % 2019;
if (min > l)
min = l;
}
}
cout << min << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r - 1)
cout << (l * r) % 2019 << endl;
else if (r - l >= 673)
cout << "0" << endl;
else {
long long min = INT_MAX;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
long long l = ((i % 2019) * (j % 2019)) % 2019;
if (min > l)
min = l;
}
}
cout << min << endl;
}
return 0;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
} else {
ll ans = 1000000000000;
for (ll i = l; i <= r; i++) {
for (ll k = l; k <= r; i++) {
ans = min(ans, (i % 2019) * (k % 2019) % 2019);
}
}
cout << ans << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
} else {
ll ans = 1000000000000;
for (ll i = l; i <= r; i++) {
for (ll k = i + 1; k <= r; k++) {
ans = min(ans, (i % 2019) * (k % 2019) % 2019);
}
}
cout << ans << endl;
}
} | replace | 34 | 35 | 34 | 35 | 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 result = l * (l + 1) % 2019;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
long long v = (i * j) % 2019;
if (result > v) {
result = v;
}
}
}
cout << result << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long result = l * (l + 1) % 2019;
for (long long i = l; i <= r && i <= l + 2019; i++) {
for (long long j = i + 1; j <= r && j <= i + 2019; j++) {
long long v = (i * j) % 2019;
if (result > v) {
result = v;
}
}
}
cout << result << endl;
return 0;
}
| replace | 11 | 13 | 11 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long l, r;
long long minn = 1e16;
int main() {
cin >> l >> r;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
long long ANS = ((i % 2019) * (j % 2019)) % 2019;
if (ANS < minn)
minn = ANS;
}
}
cout << minn << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long l, r;
long long minn = 1e16;
int main() {
cin >> l >> r;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
long long ANS = ((i % 2019) * (j % 2019)) % 2019;
if (ANS < minn)
minn = ANS;
if (minn == 0) {
cout << minn << endl;
return 0;
}
}
}
cout << minn << endl;
return 0;
} | insert | 13 | 13 | 13 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ans = 2018;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int num = i * j % 2019;
ans = min(ans, num);
if (ans == 0)
break;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ans = 2018;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int num = i * j % 2019;
ans = min(ans, num);
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
return 0;
}
| insert | 16 | 16 | 16 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll l, r;
cin >> l >> r;
ll i_max = min(r - 1, l + 2019);
ll j_max = min(r, r + 2019 + 1);
int ans = 2019;
for (ll i = l; i <= i_max; ++i) {
for (ll j = i + 1; j <= j_max; ++j) {
if ((i * j) % 2019 < ans) {
ans = (i * j) % 2019;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll l, r;
cin >> l >> r;
ll i_max = min(r - 1, l + 2019);
ll j_max = min(r, i_max + 1);
int ans = 2019;
for (ll i = l; i <= i_max; ++i) {
for (ll j = i + 1; j <= j_max; ++j) {
if ((i * j) % 2019 < ans) {
ans = (i * j) % 2019;
}
}
}
cout << ans << endl;
return 0;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02983 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define max(x, y) (x > y ? x : y)
#define min(x, y) (x < y ? x : y)
int main() {
long long int L, R;
long long int ans = 1000000000000;
scanf("%lld%lld", &L, &R);
for (long long int i = L; i < R; i++) {
for (long long int j = i + 1; j <= R; j++) {
if ((i * j) % 2019 < ans)
ans = (i * j) % 2019;
if ((i * j) % 2019 < (i * (j + 1)) % 2019)
j += (2019 - (i * j) % 2019) - 1;
else
j += ((i * j) % 2019) / (((i * j) % 2019 - (i * (j + 1)) % 2019));
}
}
printf("%lld\n", ans);
} | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define max(x, y) (x > y ? x : y)
#define min(x, y) (x < y ? x : y)
int main() {
long long int L, R;
long long int ans = 1000000000000;
scanf("%lld%lld", &L, &R);
for (long long int i = L; i < R; i++) {
for (long long int j = i + 1; j <= R; j++) {
if ((i * j) % 2019 < ans)
ans = (i * j) % 2019;
if (ans == 0) {
printf("0\n");
return 0;
}
}
}
printf("%lld\n", ans);
} | replace | 19 | 23 | 19 | 23 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
ll min = 100000000000;
int ans;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
ans = i * j % 2019;
if (ans < min) {
min = ans;
}
if (ans == 0)
break;
}
}
cout << min << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
ll min = 100000000000;
int ans;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
ans = i * j % 2019;
if (ans < min) {
min = ans;
}
if (ans == 0) {
cout << min << endl;
return 0;
}
}
}
cout << min << endl;
return 0;
}
| replace | 19 | 21 | 19 | 23 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<int, vector<int>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
}
int ans = INF;
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
int t = (i % 2019) * (j % 2019) % 2019;
ans = min(ans, t);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<int, vector<int>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = INF;
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
int t = (i % 2019) * (j % 2019) % 2019;
ans = min(ans, t);
}
}
cout << ans << endl;
return 0;
} | insert | 26 | 26 | 26 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll L, R;
ll min = 1e+9;
cin >> L >> R;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
ll mod = i * j;
while (mod > 2019) {
mod -= 2019;
}
if (min > mod)
min = mod;
}
}
cout << min << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll L, R;
ll min = 1e+9;
cin >> L >> R;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
ll mod = (i * j) % 2019;
if (mod == 0) {
cout << mod << endl;
return 0;
}
if (min > mod)
min = mod;
}
}
cout << min << endl;
return 0;
}
| replace | 9 | 12 | 9 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 990589
// 4076361
const int mod = 2019;
int a[990589 + 10];
int main() {
int l, r;
cin >> l >> r;
int n1 = l / mod;
int n2 = r / mod;
// if(r%mod==0) n2--;
int qq = 0;
// a[qq++]=n*mod;
if (n1 == n2) {
// printf("%d %d\n",(l%mod),((l+1)%mod));
// int woc[2019];
// int a1=l+(l+1);
// int a2=r*(r-1);
// int www=a1/2019;
// if(a1%2019!=0) www++;
// int www2=a2/2019;
//// if(a2%2019!=0)
// for(int i=www;i<=www2;i++)
// {
//
// if((www*2019)%)
// }
// cout<<((l%mod)*((l+1)%mod))%mod<<endl;
long long int minn = 0x3f3f3f3f;
// cout<<l<<r<<endl;
for (long long int i = l; i < r; i++) {
for (long long int j = i + 1; j <= r; j++) {
// cout<<(i*j)%mod<<endl;
// getchar();
minn = min(minn, (i * j) % mod);
if (minn == 0)
cout << i << j << endl;
}
}
cout << minn << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
// 990589
// 4076361
const int mod = 2019;
int a[990589 + 10];
int main() {
int l, r;
cin >> l >> r;
int n1 = l / mod;
int n2 = r / mod;
// if(r%mod==0) n2--;
int qq = 0;
// a[qq++]=n*mod;
if (n1 == n2) {
// printf("%d %d\n",(l%mod),((l+1)%mod));
// int woc[2019];
// int a1=l+(l+1);
// int a2=r*(r-1);
// int www=a1/2019;
// if(a1%2019!=0) www++;
// int www2=a2/2019;
//// if(a2%2019!=0)
// for(int i=www;i<=www2;i++)
// {
//
// if((www*2019)%)
// }
// cout<<((l%mod)*((l+1)%mod))%mod<<endl;
long long int minn = 0x3f3f3f3f;
// cout<<l<<r<<endl;
for (long long int i = l; i < r; i++) {
for (long long int j = i + 1; j <= r; j++) {
// cout<<(i*j)%mod<<endl;
// getchar();
minn = min(minn, (i * j) % mod);
// if(minn==0) cout<<i<<j<<endl;
}
}
cout << minn << endl;
} else {
cout << 0 << endl;
}
} | replace | 37 | 39 | 37 | 38 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
inline ll ceil_ll(ll x, ll y) { return (x + y - 1) / y; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << setprecision(8) << setiosflags(ios::fixed);
ll L, R;
cin >> L >> R;
ll min_v = 2018;
for (ll i = L; i < L + 2019 && i < R; ++i) {
for (ll j = i + 1; j < j + 2020 && j <= R; ++j) {
min_v = min(min_v, (i * j) % 2019);
}
}
cout << min_v << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
inline ll ceil_ll(ll x, ll y) { return (x + y - 1) / y; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << setprecision(8) << setiosflags(ios::fixed);
ll L, R;
cin >> L >> R;
ll min_v = 2018;
for (ll i = L; i < L + 2019 && i < R; ++i) {
for (ll j = i + 1; j < i + 2020 && j <= R; ++j) {
min_v = min(min_v, (i * j) % 2019);
}
}
cout << min_v << endl;
return 0;
}
| replace | 19 | 20 | 19 | 20 | TLE | |
p02983 | C++ | Time Limit Exceeded | /*author: hyperion_1724
date:
*/
// Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// Required namespaces
using namespace std;
using namespace __gnu_pbds;
// Required defines
#define READ(X) cin >> X;
#define READV(X) \
long long X; \
cin >> X;
#define READAR(A, N) \
long long A[N]; \
for (int i = 0; i < N; i++) { \
cin >> A[i]; \
}
#define rz(A, N) A.resize(N);
#define sz(X) (long long)(X.size())
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define endl '\n'
#define trav(x, A) for (auto &x : A)
#define veci vector<int>
#define vecl vector<long long>
#define FORI(a, b, c) for (int a = b; a < c; a++)
#define FORD(a, b, c) for (int a = b; a > c; a--)
// Required typedefs
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, greater<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set1;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
// Required Constants
const long long inf = (long long)1e18;
const long long MOD = (long long)(1e9 + 7);
const long long INIT = (long long)(1e6 + 1);
// Required Functions
ll power(ll x, ll y) {
if (y == 0)
return 1;
ll p = power(x, y / 2) % MOD;
p = (p * p) % MOD;
return (y % 2 == 0) ? p : (x * p) % MOD;
}
ll modInverse(ll a) { return power(a, MOD - 2); }
// Work
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
READV(L);
READV(R);
ll ch = -(R / 2019) - ((L - 1) / 2019);
if (ch > 0) {
cout << 0 << endl;
} else {
ll ans = inf;
FORI(i, L, R) {
FORI(j, i + 1, R + 1) {
ans = min(ans, (ll)((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
}
return 0;
} | /*author: hyperion_1724
date:
*/
// Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// Required namespaces
using namespace std;
using namespace __gnu_pbds;
// Required defines
#define READ(X) cin >> X;
#define READV(X) \
long long X; \
cin >> X;
#define READAR(A, N) \
long long A[N]; \
for (int i = 0; i < N; i++) { \
cin >> A[i]; \
}
#define rz(A, N) A.resize(N);
#define sz(X) (long long)(X.size())
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define endl '\n'
#define trav(x, A) for (auto &x : A)
#define veci vector<int>
#define vecl vector<long long>
#define FORI(a, b, c) for (int a = b; a < c; a++)
#define FORD(a, b, c) for (int a = b; a > c; a--)
// Required typedefs
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, greater<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set1;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
// Required Constants
const long long inf = (long long)1e18;
const long long MOD = (long long)(1e9 + 7);
const long long INIT = (long long)(1e6 + 1);
// Required Functions
ll power(ll x, ll y) {
if (y == 0)
return 1;
ll p = power(x, y / 2) % MOD;
p = (p * p) % MOD;
return (y % 2 == 0) ? p : (x * p) % MOD;
}
ll modInverse(ll a) { return power(a, MOD - 2); }
// Work
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
READV(L);
READV(R);
ll ch = (R / 2019) - ((L - 1) / 2019);
if (ch > 0) {
cout << 0 << endl;
} else {
ll ans = inf;
FORI(i, L, R) {
FORI(j, i + 1, R + 1) {
ans = min(ans, (ll)((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
}
return 0;
} | replace | 80 | 81 | 80 | 81 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int l, r, i, j, ans = 2019;
cin >> l >> r;
for (i = l; i < r; i++)
for (j = i + 1; j <= r; j++)
ans = min((i * j) % 2019, ans);
cout << ans;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int l, r, i, j, ans = 2019;
cin >> l >> r;
if (r - l > 2018)
ans = 0;
else {
l = l % 2019;
r = r % 2019;
if (l > r)
ans = 0;
else
for (i = l; i < r; i++)
for (j = i + 1; j <= r; j++)
ans = min((i * j) % 2019, ans);
}
cout << ans;
return 0;
} | replace | 6 | 9 | 6 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef pair<ll, ll> P;
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 4038);
ll ans = 2018;
for (ll i = L; i <= R; L++) {
for (ll k = i + 1; k <= R; k++) {
ll x = i * k % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef pair<ll, ll> P;
int main() {
ll L, R;
cin >> L >> R;
R = min(R, L + 4038);
ll ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll k = i + 1; k <= R; k++) {
ll x = i * k % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return 0;
}
| replace | 26 | 27 | 26 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll m = min(l + 4038, r);
ll x = 1000100010;
ll res = 2019;
for (ll i = l; i <= r; ++i) {
for (ll j = i + 1; j <= r; ++j) {
ll x = i * j % 2019;
res = min(res, x);
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll m = min(l + 4038, r);
ll x = 1000100010;
ll res = 2019;
for (ll i = l; i <= m; ++i) {
for (ll j = i + 1; j <= m; ++j) {
ll x = i * j % 2019;
res = min(res, x);
}
}
cout << res << endl;
return 0;
} | replace | 9 | 11 | 9 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R, ans = 2e9, tmp;
vector<int> v(3000, 0);
cin >> L >> R;
for (int i = L; i <= R; i++) {
tmp = i % 2019;
v[tmp]++;
}
for (int i = 0; i <= 2019; i++) {
for (int j = 0; j <= 2019; j++) {
if (v[i] == 0 || v[j] == 0)
continue;
else if (i == j && v[i] == 1)
continue;
tmp = (i * j) % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R, ans = 2e9, tmp;
vector<int> v(3000, 0);
cin >> L >> R;
if (R - L > 3000) {
cout << 0 << endl;
return 0;
}
for (int i = L; i <= R; i++) {
tmp = i % 2019;
v[tmp]++;
}
for (int i = 0; i <= 2019; i++) {
for (int j = 0; j <= 2019; j++) {
if (v[i] == 0 || v[j] == 0)
continue;
else if (i == j && v[i] == 1)
continue;
tmp = (i * j) % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
| insert | 7 | 7 | 7 | 12 | TLE | |
p02983 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
VI G[100010];
int reached[100010];
int color[100010];
bool ck[2019];
int main() {
ll l, r;
cin >> l >> r;
int x = l;
int y = r;
while (l % 2019 != r % 2019) {
ck[l % 2019] = 1;
++l;
}
ck[r] = 1;
if (y - x >= 2018) {
cout << 0 << endl;
exit(0);
}
ll ans = 1e9 + 7;
rep(i, 2019) rep(j, 2019) {
if (!ck[i] || !ck[j])
continue;
if (i == j)
continue;
chmin(ans, (ll)i * j % 2019);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
VI G[100010];
int reached[100010];
int color[100010];
bool ck[2019];
int main() {
ll l, r;
cin >> l >> r;
int x = l;
int y = r;
while (l % 2019 != r % 2019) {
ck[l % 2019] = 1;
++l;
}
ck[r % 2019] = 1;
if (y - x >= 2018) {
cout << 0 << endl;
exit(0);
}
ll ans = 1e9 + 7;
rep(i, 2019) rep(j, 2019) {
if (!ck[i] || !ck[j])
continue;
if (i == j)
continue;
chmin(ans, (ll)i * j % 2019);
}
cout << ans << endl;
}
| replace | 41 | 42 | 41 | 42 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
long L, R, ans = 0;
cin >> L >> R;
if (673 > L - R) {
ans = LONG_MAX;
for (long i = L; i < R; ++i) {
for (long j = 1 + L; j <= R; ++j)
ans = min(ans, i * j % 2019);
}
}
cout << ans;
} | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
long L, R, ans = 0;
cin >> L >> R;
if (673 > R - L) {
ans = LONG_MAX;
for (long i = L; i < R; ++i) {
for (long j = 1 + L; j <= R; ++j)
ans = min(ans, i * j % 2019);
}
}
cout << ans;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
typedef pair<long long, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
long long n, h[100005];
ll dp[100005];
#define ALL(v) (v).begin(), (v).end()
// #define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define DEBUG
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
stack<long long> sta;
queue<long long> que;
set<string> s_set;
int main() {
long long A, B, C, D, E, F, G, H, I, J, L, N, M, K, O, P, Q, R, S, T, U, V, W,
X, Y, Z;
long long ans;
ans = 0;
string s;
long long sum, sum1, sum2, sum3, sum4;
sum = 0;
sum1 = 0;
sum2 = 0;
sum3 = 0;
sum4 = 0;
long long flg, flg1, cnt, cnt1, cnt2, cnt3, cnt4;
flg = 0;
flg1 = 0;
cnt = 0;
cnt1 = 0;
cnt2 = 0;
cnt3 = 0;
cnt4 = 0;
long long max;
long long max1;
max = 0;
max1 = 0;
long long min;
long long min1;
min = INF;
min1 = INF;
long long work, work1, work2, work3, work4;
work = 0;
work1 = 0;
work2 = 0;
work3 = 0;
work4 = 0;
// long long a[4];
long long value;
value = 0;
// std::cin >> N;
// std::cin >> N >> M;
// std::cin >> N >> M >> K;
std::cin >> L >> R;
// std::vector<long long> v(N);
// std::vector<long long> w(N);
// vec.push_back( i );
// accumulate(vec.begin(), vec.end(), 0)
// 配列入力1
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
// std::sort(v.begin(),v.end());//昇順ソート
// std::sort(v.begin(),v.end(),std::greater<long long>());//降順ソート
// 通常
min = INF;
long long i = L;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
work = (i * j) % 2019;
if (work < min) {
min = work;
}
}
}
// 文字列入力
/*
std::cin >> s;
//sort(s.begin(), s.end());
for(long long i=0; i<s.length(); i++){
//work=(s[i+2]-'0')+10*(s[i+1]-'0')+100*(s[i]-'0');
if(s[i]!='1'){
}
//S.substr(i, 5);
//S.size();
}
*/
// 配列入力2
/*
for(long long i=0; i<N; i++){
std::cin >> w[i];
}
*/
// std::sort(w.begin(),w.end());//昇順ソート
// std::sort(w.begin(),w.end(),std::greater<long long>());//降順ソート
// ペア関連
/*
vector<pair<long long, long long> > pairs(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
//sort(pairs.begin(), pairs.end(),greater<pair<long long,long long> >());
//通常（ペア用）
for(long long i=0; i<N; i++){
}
*/
// set関連
/*
std::set<long long> st;
for(long long i=0; i<N; i++){
std::cin >> v[i];
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
}
*/
// set 文字列関連
/*
for(long long i=0; i<S.size(); i++) {
s.insert(S[i]);
}
cnt=(int)s.find('a');
*/
// map関連
/*
bool ok = true;
map<char,char> ma, ima;
for (int i = 0; i < S.size(); ++i) {
char s = S[i], t = T[i];
if (ma.count(s)) if (ma[s] != t) ok = false;
if (ima.count(t)) if (ima[t] != s) ok = false;
ma[s] = t; ima[t] = s;
}
*/
// 各桁の取り出し 関連
/*
a[0] = (value % 10);
value /= 10;// 1桁目を取り出す
a[1] = (value % 10);
value /= 10;// 2桁目を取り出す
a[2] = (value % 10);
value /= 10;// 3桁目を取り出す
a[3] = (value % 10);
value /= 10;// 4桁目を取り出す
work1=a[0]+10*a[1];
work2=a[2]+10*a[3];
*/
if (1) {
printf("%lld", min);
// printf("%lld",N);
// puts("Yes");
// printf("%d",st.size());
// 文字列の出力
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
} else {
// puts("No");
}
return 0;
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
typedef pair<long long, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
long long n, h[100005];
ll dp[100005];
#define ALL(v) (v).begin(), (v).end()
// #define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define DEBUG
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
stack<long long> sta;
queue<long long> que;
set<string> s_set;
int main() {
long long A, B, C, D, E, F, G, H, I, J, L, N, M, K, O, P, Q, R, S, T, U, V, W,
X, Y, Z;
long long ans;
ans = 0;
string s;
long long sum, sum1, sum2, sum3, sum4;
sum = 0;
sum1 = 0;
sum2 = 0;
sum3 = 0;
sum4 = 0;
long long flg, flg1, cnt, cnt1, cnt2, cnt3, cnt4;
flg = 0;
flg1 = 0;
cnt = 0;
cnt1 = 0;
cnt2 = 0;
cnt3 = 0;
cnt4 = 0;
long long max;
long long max1;
max = 0;
max1 = 0;
long long min;
long long min1;
min = INF;
min1 = INF;
long long work, work1, work2, work3, work4;
work = 0;
work1 = 0;
work2 = 0;
work3 = 0;
work4 = 0;
// long long a[4];
long long value;
value = 0;
// std::cin >> N;
// std::cin >> N >> M;
// std::cin >> N >> M >> K;
std::cin >> L >> R;
// std::vector<long long> v(N);
// std::vector<long long> w(N);
// vec.push_back( i );
// accumulate(vec.begin(), vec.end(), 0)
// 配列入力1
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
// std::sort(v.begin(),v.end());//昇順ソート
// std::sort(v.begin(),v.end(),std::greater<long long>());//降順ソート
// 通常
min = INF;
long long i = L;
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
work = (i * j) % 2019;
if (work < min) {
min = work;
if (min == 0) {
printf("%lld", min);
return 0;
}
}
}
}
// 文字列入力
/*
std::cin >> s;
//sort(s.begin(), s.end());
for(long long i=0; i<s.length(); i++){
//work=(s[i+2]-'0')+10*(s[i+1]-'0')+100*(s[i]-'0');
if(s[i]!='1'){
}
//S.substr(i, 5);
//S.size();
}
*/
// 配列入力2
/*
for(long long i=0; i<N; i++){
std::cin >> w[i];
}
*/
// std::sort(w.begin(),w.end());//昇順ソート
// std::sort(w.begin(),w.end(),std::greater<long long>());//降順ソート
// ペア関連
/*
vector<pair<long long, long long> > pairs(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
//sort(pairs.begin(), pairs.end(),greater<pair<long long,long long> >());
//通常（ペア用）
for(long long i=0; i<N; i++){
}
*/
// set関連
/*
std::set<long long> st;
for(long long i=0; i<N; i++){
std::cin >> v[i];
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
}
*/
// set 文字列関連
/*
for(long long i=0; i<S.size(); i++) {
s.insert(S[i]);
}
cnt=(int)s.find('a');
*/
// map関連
/*
bool ok = true;
map<char,char> ma, ima;
for (int i = 0; i < S.size(); ++i) {
char s = S[i], t = T[i];
if (ma.count(s)) if (ma[s] != t) ok = false;
if (ima.count(t)) if (ima[t] != s) ok = false;
ma[s] = t; ima[t] = s;
}
*/
// 各桁の取り出し 関連
/*
a[0] = (value % 10);
value /= 10;// 1桁目を取り出す
a[1] = (value % 10);
value /= 10;// 2桁目を取り出す
a[2] = (value % 10);
value /= 10;// 3桁目を取り出す
a[3] = (value % 10);
value /= 10;// 4桁目を取り出す
work1=a[0]+10*a[1];
work2=a[2]+10*a[3];
*/
if (1) {
printf("%lld", min);
// printf("%lld",N);
// puts("Yes");
// printf("%d",st.size());
// 文字列の出力
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
} else {
// puts("No");
}
return 0;
} | insert | 104 | 104 | 104 | 108 | TLE | |
p02983 | C++ | Time Limit Exceeded | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define pi 3.14159265359;
// %llu %lf
// double result = 0;
// printf("%.12f\n", result);
// v:vector type:型 order:greater(大きい順) or less(小さい順)
#define _sort(v, type, order) \
do { \
sort(v.begin(), v.end(), order<type>()); \
} while (0)
/*
◆pairでもソートは可能
vector<pair<int32_t, int32_t>> pr(n);
sort(pr.begin(), pr.end(),_compare);
bool _compare(pair<int32_t, int32_t> a, pair<int32_t, int32_t> b)
{
#if 0 // first での sort
#if 0
// 昇順
if (a.first != b.first) {
return a.first < b.first;
}
// secondが同じならfirstでソート
return a.second < b.second;
#else
// 降順
if (a.first != b.first) {
return a.first > b.first;
}
// secondが同じならfirstでソート
return a.second > b.second;
#endif
#else // second での sort
#if 1
// 昇順
if (a.second != b.second) {
return a.second < b.second;
}
// secondが同じならfirstでソート
return a.first < b.first;
#else
// 降順
if (a.second != b.second) {
return a.second > b.second;
}
// secondが同じならfirstでソート
return a.first > b.first;
#endif
#endif
}
*/
// vector 要素の総和算出
// v:vector default_value:初期値
#define _sum(v, default_value) accumulate(v.begin(), v.end(), default_value)
// vector 最大値( return ite )
#define _max_element(v) max_element(v.begin(), v.end())
// vector 最小値( return ite )
#define _min_element(v) min_element(v.begin(), v.end())
// vector 最大値が格納されている要素値
#define _max_element_number(v) \
distance(v.begin(), max_element(v.begin(), v.end()))
// 特定コンテナの中から特定の値をカウントする
#define _count(v, value) count(v.begin(), v.end(), value)
// set<uint32_t> member; // 重複するデータを保持する事はできない
// member.insert(2) member.insert(2) ⇒ member.count(2)は1
// member.emplace(2)とかも同じ
// member.size()で確認すると同じ値の挿入ではサイズ変化はない
// multiset<uint32_t> v; // 重複するデータも保持する事はできる
// member.insert(2) member.insert(2) ⇒ member.count(2)は2
// 丸め
#define _round(v) round(v)
// 2乗 / 3乗
#define _square(v) pow(v, 2)
#define _cube(v) pow(v, 3)
// 大小判定
#define _max(x, y) max(x, y)
#define _min(x, y) min(x, y)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// string ⇒ int
#define _stringtoi(s) stoi(s)
// double 平方根
#define _sqrt(x) sqrt(x)
// double 引数 x 以上で最小の整数値 ex) 3.30303 ⇒ 4
#define _ceil(x) ceil(x)
// 指定された要素 【以上の】 値が現れる最初の位置のイテレータを取得する
#define _lower_bound(v, min) lower_bound(v.begin(), v.end(), min)
// 指定された要素 【より大きい】値が現れる最初の位置のイテレータを取得する
#define _upper_bound(v, min) upper_bound(v.begin(), v.end(), min)
// 順列 n個の数が与えられる
// 0,1,2,...,n-1
// 全ての並べ方を1行ごとに出力する
// ex 0 1 2 / 0 2 1 / 1 0 2 / 1 2 0 / 2 0 1 / 2 1 0
#define _next_permutation(v) \
do { \
for (auto num : v) { \
printf("%d ", num); \
} \
printf("\n"); \
/* ※ 昇順である必要がある */ \
/* ※ pair も pair.firstで可能 */ \
} while (next_permutation(v.begin(), v.end()))
// ■bitset
// 100 桁の 2 進数を定義する。
// bitset<100> bs;
//
// 8桁 の 2進数を定義し、10進数 131で初期化
// bitset<8> bs(131); // 7 ビット目から 0
// ビット目への順番で、10000011 になる
//
// 8桁 の 2進数を定義し、2進数で初期化
// bitset<8> bs("10000011"); // 7 ビット目から 0 ビット目への順番で、10000011
// となる。 string _bs; cin >> _bs; bitset<100> bs(_bs); _bs =
// "10000011"であれば上記と同様
//
// 与えられる数値について、それぞれの和を算出する場合
// 下記コードでビットが立っている要素値＝和の値となる
// ex.) AGC 020 C https://atcoder.jp/contests/agc020/tasks/agc020_c
// bitset<1000> dp;
// p[0] = 1;
// for (int i = 0; i < N; ++i) {
// dp |= (dp << A[i]);
// }
// 絶対値
template <typename T> static T _abs(const T x) { return (x > 0 ? x : -x); }
// 最大公約数
int64_t gcd(int64_t a, int64_t b) {
while (b) {
int64_t c = b;
b = a % b;
a = c;
}
return a;
}
// 最小公倍数
int64_t lcm(int64_t a, int64_t b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
// 多次元 std::vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
// ex) auto dp = make_vec<uint64_t>(SIZE + 1, 2, 2);
//
// 2次元 vector の初期化
// vector< vector<int> > s( n, vector<int>(m, 0) );
// pair
// vector<vector<pair<int32_t,int32_t>>> f(n);
// ⇒ 挿入 f[i].push_back(make_pair(x, y));
// Union Find Tree
class UnionFind {
public:
vector<int32_t> par; // 各元の親を表す配列
vector<int32_t> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor 初期では親は自分自身
UnionFind(int32_t sz_) : par(sz_), siz(sz_, 1LL) {
for (int32_t i = 0; i < sz_; ++i)
par[i] = i;
}
void init(int32_t sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (int32_t i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Find
int32_t root(int32_t x) {
// x の親の親を x の親とする
while (par[x] != x) {
x = par[x] = par[par[x]];
// printf("%d\n", x);
}
return x;
}
// Union(Unite, Merge)
bool merge(int32_t x, int32_t y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
// 連結判定
bool is_same(int32_t x, int32_t y) { return root(x) == root(y); }
// 素集合のサイズ
int32_t size(int32_t x) { return siz[root(x)]; }
// 参照
void view(void) {
for (size_t i = 0; i < par.size(); i++) {
printf("%d\n", par[i]);
}
}
};
// ■
// UINT32_MAX
// 4294967295 ≒ 4 * 1e9
// ■
// 割り算した結果との比較での丸め対処時
// ABC 161 B
// https://atcoder.jp/contests/abc161/tasks/abc161_b
// double border = _sum(v, 0 / (double)(4 * m);
// ↓
// uint32_t border = (_sum(v, 0) + (4 * m) - 1) / (4 * m);
/*************************************************************/
// ABC 133
// C - Megalomania
// https://atcoder.jp/contests/abc133/tasks/abc133_c
/*
■問題文
非負整数 L,R が与えられます。
2 つの整数 i,j を L ≤ i < j ≤ R を満たすように選びます。
(i×j) mod 2019 の最小値を求めてください。
■制約
・入力は全て整数
・0 ≤ L < R ≤ 2×1e9
■入力
L R
■出力
条件を満たすように i,j を選んだ時の、(i×j) mod 2019 の最小値を出力せよ。
■入力例
2020 2040
■出力例
2
(i,j)=(2020,2021) とすると、(i×j) mod 2019=2 となります。
*/
const int32_t mod = 2019;
int main() {
int64_t l, r;
cin >> l >> r;
int64_t result = INT64_MAX;
for (int64_t i = l; i < r; i++) {
for (int64_t j = l + 1; j <= r; j++) {
result = _min(result, (i * j) % mod);
}
}
cout << result << endl;
return 0;
}
// プログラムの実行: Ctrl + F5 または [デバッグ] > [デバッグなしで開始] メニュー
// プログラムのデバッグ: F5 または [デバッグ] > [デバッグの開始] メニュー
// 作業を開始するためのヒント:
// 1. ソリューション エクスプローラー
// ウィンドウを使用してファイルを追加/管理します
// 2. チーム エクスプローラー ウィンドウを使用してソース管理に接続します
// 3. 出力ウィンドウを使用して、ビルド出力とその他のメッセージを表示します
// 4. エラー一覧ウィンドウを使用してエラーを表示します
// 5. [プロジェクト] > [新しい項目の追加] と移動して新しいコード
// ファイルを作成するか、[プロジェクト] > [既存の項目の追加]
// と移動して既存のコード ファイルをプロジェクトに追加します
// 6. 後ほどこのプロジェクトを再び開く場合、[ファイル] > [開く] >
// [プロジェクト] と移動して .sln ファイルを選択します
| // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define pi 3.14159265359;
// %llu %lf
// double result = 0;
// printf("%.12f\n", result);
// v:vector type:型 order:greater(大きい順) or less(小さい順)
#define _sort(v, type, order) \
do { \
sort(v.begin(), v.end(), order<type>()); \
} while (0)
/*
◆pairでもソートは可能
vector<pair<int32_t, int32_t>> pr(n);
sort(pr.begin(), pr.end(),_compare);
bool _compare(pair<int32_t, int32_t> a, pair<int32_t, int32_t> b)
{
#if 0 // first での sort
#if 0
// 昇順
if (a.first != b.first) {
return a.first < b.first;
}
// secondが同じならfirstでソート
return a.second < b.second;
#else
// 降順
if (a.first != b.first) {
return a.first > b.first;
}
// secondが同じならfirstでソート
return a.second > b.second;
#endif
#else // second での sort
#if 1
// 昇順
if (a.second != b.second) {
return a.second < b.second;
}
// secondが同じならfirstでソート
return a.first < b.first;
#else
// 降順
if (a.second != b.second) {
return a.second > b.second;
}
// secondが同じならfirstでソート
return a.first > b.first;
#endif
#endif
}
*/
// vector 要素の総和算出
// v:vector default_value:初期値
#define _sum(v, default_value) accumulate(v.begin(), v.end(), default_value)
// vector 最大値( return ite )
#define _max_element(v) max_element(v.begin(), v.end())
// vector 最小値( return ite )
#define _min_element(v) min_element(v.begin(), v.end())
// vector 最大値が格納されている要素値
#define _max_element_number(v) \
distance(v.begin(), max_element(v.begin(), v.end()))
// 特定コンテナの中から特定の値をカウントする
#define _count(v, value) count(v.begin(), v.end(), value)
// set<uint32_t> member; // 重複するデータを保持する事はできない
// member.insert(2) member.insert(2) ⇒ member.count(2)は1
// member.emplace(2)とかも同じ
// member.size()で確認すると同じ値の挿入ではサイズ変化はない
// multiset<uint32_t> v; // 重複するデータも保持する事はできる
// member.insert(2) member.insert(2) ⇒ member.count(2)は2
// 丸め
#define _round(v) round(v)
// 2乗 / 3乗
#define _square(v) pow(v, 2)
#define _cube(v) pow(v, 3)
// 大小判定
#define _max(x, y) max(x, y)
#define _min(x, y) min(x, y)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// string ⇒ int
#define _stringtoi(s) stoi(s)
// double 平方根
#define _sqrt(x) sqrt(x)
// double 引数 x 以上で最小の整数値 ex) 3.30303 ⇒ 4
#define _ceil(x) ceil(x)
// 指定された要素 【以上の】 値が現れる最初の位置のイテレータを取得する
#define _lower_bound(v, min) lower_bound(v.begin(), v.end(), min)
// 指定された要素 【より大きい】値が現れる最初の位置のイテレータを取得する
#define _upper_bound(v, min) upper_bound(v.begin(), v.end(), min)
// 順列 n個の数が与えられる
// 0,1,2,...,n-1
// 全ての並べ方を1行ごとに出力する
// ex 0 1 2 / 0 2 1 / 1 0 2 / 1 2 0 / 2 0 1 / 2 1 0
#define _next_permutation(v) \
do { \
for (auto num : v) { \
printf("%d ", num); \
} \
printf("\n"); \
/* ※ 昇順である必要がある */ \
/* ※ pair も pair.firstで可能 */ \
} while (next_permutation(v.begin(), v.end()))
// ■bitset
// 100 桁の 2 進数を定義する。
// bitset<100> bs;
//
// 8桁 の 2進数を定義し、10進数 131で初期化
// bitset<8> bs(131); // 7 ビット目から 0
// ビット目への順番で、10000011 になる
//
// 8桁 の 2進数を定義し、2進数で初期化
// bitset<8> bs("10000011"); // 7 ビット目から 0 ビット目への順番で、10000011
// となる。 string _bs; cin >> _bs; bitset<100> bs(_bs); _bs =
// "10000011"であれば上記と同様
//
// 与えられる数値について、それぞれの和を算出する場合
// 下記コードでビットが立っている要素値＝和の値となる
// ex.) AGC 020 C https://atcoder.jp/contests/agc020/tasks/agc020_c
// bitset<1000> dp;
// p[0] = 1;
// for (int i = 0; i < N; ++i) {
// dp |= (dp << A[i]);
// }
// 絶対値
template <typename T> static T _abs(const T x) { return (x > 0 ? x : -x); }
// 最大公約数
int64_t gcd(int64_t a, int64_t b) {
while (b) {
int64_t c = b;
b = a % b;
a = c;
}
return a;
}
// 最小公倍数
int64_t lcm(int64_t a, int64_t b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
// 多次元 std::vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
// ex) auto dp = make_vec<uint64_t>(SIZE + 1, 2, 2);
//
// 2次元 vector の初期化
// vector< vector<int> > s( n, vector<int>(m, 0) );
// pair
// vector<vector<pair<int32_t,int32_t>>> f(n);
// ⇒ 挿入 f[i].push_back(make_pair(x, y));
// Union Find Tree
class UnionFind {
public:
vector<int32_t> par; // 各元の親を表す配列
vector<int32_t> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor 初期では親は自分自身
UnionFind(int32_t sz_) : par(sz_), siz(sz_, 1LL) {
for (int32_t i = 0; i < sz_; ++i)
par[i] = i;
}
void init(int32_t sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (int32_t i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Find
int32_t root(int32_t x) {
// x の親の親を x の親とする
while (par[x] != x) {
x = par[x] = par[par[x]];
// printf("%d\n", x);
}
return x;
}
// Union(Unite, Merge)
bool merge(int32_t x, int32_t y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
// 連結判定
bool is_same(int32_t x, int32_t y) { return root(x) == root(y); }
// 素集合のサイズ
int32_t size(int32_t x) { return siz[root(x)]; }
// 参照
void view(void) {
for (size_t i = 0; i < par.size(); i++) {
printf("%d\n", par[i]);
}
}
};
// ■
// UINT32_MAX
// 4294967295 ≒ 4 * 1e9
// ■
// 割り算した結果との比較での丸め対処時
// ABC 161 B
// https://atcoder.jp/contests/abc161/tasks/abc161_b
// double border = _sum(v, 0 / (double)(4 * m);
// ↓
// uint32_t border = (_sum(v, 0) + (4 * m) - 1) / (4 * m);
/*************************************************************/
// ABC 133
// C - Megalomania
// https://atcoder.jp/contests/abc133/tasks/abc133_c
/*
■問題文
非負整数 L,R が与えられます。
2 つの整数 i,j を L ≤ i < j ≤ R を満たすように選びます。
(i×j) mod 2019 の最小値を求めてください。
■制約
・入力は全て整数
・0 ≤ L < R ≤ 2×1e9
■入力
L R
■出力
条件を満たすように i,j を選んだ時の、(i×j) mod 2019 の最小値を出力せよ。
■入力例
2020 2040
■出力例
2
(i,j)=(2020,2021) とすると、(i×j) mod 2019=2 となります。
*/
const int32_t mod = 2019;
int main() {
int64_t l, r;
cin >> l >> r;
int64_t result = INT64_MAX;
for (int64_t i = l; i < r; i++) {
for (int64_t j = l + 1; j <= r; j++) {
result = _min(result, (i * j) % mod);
if (result) {
continue;
}
cout << result << endl;
return 0;
}
}
cout << result << endl;
return 0;
}
// プログラムの実行: Ctrl + F5 または [デバッグ] > [デバッグなしで開始] メニュー
// プログラムのデバッグ: F5 または [デバッグ] > [デバッグの開始] メニュー
// 作業を開始するためのヒント:
// 1. ソリューション エクスプローラー
// ウィンドウを使用してファイルを追加/管理します
// 2. チーム エクスプローラー ウィンドウを使用してソース管理に接続します
// 3. 出力ウィンドウを使用して、ビルド出力とその他のメッセージを表示します
// 4. エラー一覧ウィンドウを使用してエラーを表示します
// 5. [プロジェクト] > [新しい項目の追加] と移動して新しいコード
// ファイルを作成するか、[プロジェクト] > [既存の項目の追加]
// と移動して既存のコード ファイルをプロジェクトに追加します
// 6. 後ほどこのプロジェクトを再び開く場合、[ファイル] > [開く] >
// [プロジェクト] と移動して .sln ファイルを選択します
| insert | 315 | 315 | 315 | 320 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int l, r, i, j, res = 2019 * 2019;
cin >> l >> r;
for (i = l; i < min(l + 2019, r); i++) {
for (j = i + 1; i <= min(l + 2019, r); j++) {
res = min(res, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int l, r, i, j, res = 2019 * 2019;
cin >> l >> r;
for (i = l; i < min(l + 2019, r); i++) {
for (j = i + 1; j <= min(l + 2019, r); j++) {
res = min(res, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << res << "\n";
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, n, ou = 2018, tp = 0;
cin >> l >> r;
n = r - l + 1;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j < r + 1; j++) {
tp = (i * j) % 2019;
if (tp < ou)
ou = tp;
}
}
cout << ou << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, n, ou = 2018, tp = 0;
cin >> l >> r;
n = r - l + 1;
if (n > 3000) {
cout << 0 << endl;
return 0;
}
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j < r + 1; j++) {
tp = (i * j) % 2019;
if (tp < ou)
ou = tp;
}
}
cout << ou << endl;
} | insert | 6 | 6 | 6 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long minmod = 2019;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
minmod = min(minmod, (i * j) % 2019);
if (minmod == 0) {
break;
}
}
}
cout << minmod << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long minmod = 2019;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
minmod = min(minmod, (i * j) % 2019);
if (minmod == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << minmod << endl;
return 0;
} | replace | 12 | 13 | 12 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all(vec));
#define cend cout << endl;
#define prique(T) priority_queue<T, vector<T>, greater<T>>
struct edge {
int to, cost;
};
typedef pair<int, int> P;
typedef pair<P, int> PP;
const int mod = 1e9 + 7, inf = 1e16;
int modpow(int x, int n) {
if (n == 0)
return 1;
if (n % 2)
return (x * modpow(x * x % mod, n / 2) % mod + mod) % mod;
return (modpow(x * x % mod, n / 2) + mod) % mod;
}
int fact_memo[114514];
int fact(int n) {
int ans = 1;
if (fact_memo[n])
return fact_memo[n];
rep(i, n) {
ans *= (i + 1);
if (mod <= ans)
ans %= mod;
}
return (ans + mod) % mod;
}
int comb(int n, int r) {
if (n < r)
return 0;
if (n - r < r)
r = n - r;
return (fact(n) * modpow(fact(n - r), mod - 2) % mod *
modpow(fact(r), mod - 2) +
mod) %
mod;
}
int perm(int n, int r) {
if (n < r)
return 0;
if (n - r < r)
r = n - r;
return (fact(n) * modpow(fact(n - r), mod - 2) % mod + mod) % mod;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool pri(int p) {
for (int i = 2; i * i <= p; i++)
if (p % i == 0)
return false;
return p > 1;
}
int l, r;
int ans = inf;
signed main() {
cin >> l >> r;
rep(i, 2019) {
if (r <= i)
break;
for (int j = r; j > l + i; j--) {
ans = min(ans, (l + i) * j % 2019);
}
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all(vec));
#define cend cout << endl;
#define prique(T) priority_queue<T, vector<T>, greater<T>>
struct edge {
int to, cost;
};
typedef pair<int, int> P;
typedef pair<P, int> PP;
const int mod = 1e9 + 7, inf = 1e16;
int modpow(int x, int n) {
if (n == 0)
return 1;
if (n % 2)
return (x * modpow(x * x % mod, n / 2) % mod + mod) % mod;
return (modpow(x * x % mod, n / 2) + mod) % mod;
}
int fact_memo[114514];
int fact(int n) {
int ans = 1;
if (fact_memo[n])
return fact_memo[n];
rep(i, n) {
ans *= (i + 1);
if (mod <= ans)
ans %= mod;
}
return (ans + mod) % mod;
}
int comb(int n, int r) {
if (n < r)
return 0;
if (n - r < r)
r = n - r;
return (fact(n) * modpow(fact(n - r), mod - 2) % mod *
modpow(fact(r), mod - 2) +
mod) %
mod;
}
int perm(int n, int r) {
if (n < r)
return 0;
if (n - r < r)
r = n - r;
return (fact(n) * modpow(fact(n - r), mod - 2) % mod + mod) % mod;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool pri(int p) {
for (int i = 2; i * i <= p; i++)
if (p % i == 0)
return false;
return p > 1;
}
int l, r;
int ans = inf;
signed main() {
cin >> l >> r;
rep(i, 2019) {
if (r <= i)
break;
for (int j = r; j > l + i; j--) {
if (2019 < r - j)
break;
ans = min(ans, (l + i) * j % 2019);
}
}
cout << ans << endl;
} | insert | 82 | 82 | 82 | 84 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
// 親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
// 作るときはParentの値を全て-1にする
// こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>;
using Graph = vector<vector<int>>;
vector<bool> seen;
vector<ll> step;
void dfs(const Graph &G, int v, ll now) {
seen[v] = true; // v を訪問済にする
step[v] = now;
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v] && (now + 1 >= step[next_v]))
continue; // next_v が探索済だったらスルー
dfs(G, next_v, now + 1); // 再帰的に探索
}
}
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2020;
FOR(i, L, R - 1) {
FOR(j, i + 1, R) {
ll tmp = i * j % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
// 親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
// 作るときはParentの値を全て-1にする
// こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>;
using Graph = vector<vector<int>>;
vector<bool> seen;
vector<ll> step;
void dfs(const Graph &G, int v, ll now) {
seen[v] = true; // v を訪問済にする
step[v] = now;
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v] && (now + 1 >= step[next_v]))
continue; // next_v が探索済だったらスルー
dfs(G, next_v, now + 1); // 再帰的に探索
}
}
int main() {
ll L, R;
cin >> L >> R;
ll aa = R - L;
if (aa > 2019 * 2) {
aa = aa - 2019;
aa = aa / 2019;
R = R - aa * 2019;
}
ll ans = 2020;
FOR(i, L, R - 1) {
FOR(j, i + 1, R) {
ll tmp = i * j % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| insert | 223 | 223 | 223 | 230 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long i = l, j = l + 1, d = ((i % 2019) * (j % 2019)) % 2019,
k = ((r % 2019) + (l % 2019)) % 2019;
if (k > 2019) {
cout << 0;
return 0;
} else {
for (i; i < r; i++) {
for (j = i + 1; j <= r; j++) {
d = min(((i % 2019) * (j % 2019)) % 2019, d);
}
}
cout << d;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long i = l, j = l + 1, d = ((i % 2019) * (j % 2019)) % 2019, k = r - l;
if (k >= 2019) {
cout << 0;
return 0;
} else {
for (i; i < r; i++) {
for (j = i + 1; j <= r; j++) {
d = min(((i % 2019) * (j % 2019)) % 2019, d);
}
}
cout << d;
}
return 0;
}
| replace | 7 | 10 | 7 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
int L, R;
cin >> L >> R;
if (R - L > 3000) {
cout << 0 << endl;
}
// (i * j) mod 2019
// (i mod 2019) * (j mod 2019)
ll num;
ll mn = LINF;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
num = (i * j) % 2019;
mn = min(mn, num);
}
}
printf("%d\n", mn);
return (0);
} | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
int L, R;
cin >> L >> R;
if (R - L > 3000) {
cout << 0 << endl;
return (0);
}
// (i * j) mod 2019
// (i mod 2019) * (j mod 2019)
ll num;
ll mn = LINF;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
num = (i * j) % 2019;
mn = min(mn, num);
}
}
printf("%d\n", mn);
return (0);
} | insert | 14 | 14 | 14 | 15 | 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 ld = long double;
using P = pair<int, int>;
const int mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2019 * 2019;
if (l - r >= mod) {
cout << 0 << endl;
return 0;
} else {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll c = (i * j) % mod;
ans = min(c, ans);
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const int mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2019 * 2019;
if (r - l >= mod) {
cout << 0 << endl;
return 0;
} else {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll c = (i * j) % mod;
ans = min(c, ans);
}
}
}
cout << ans << endl;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02983 | C++ | Runtime Error | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip> // 20桁出力 cout << setprecision(20) << double;
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VL;
typedef vector<VL> VVL; // VVL v(100,VL(100,0));
typedef vector<pair<LL, LL>> VP;
typedef vector<string> VS;
typedef map<int, int> MAPII;
typedef multimap<int, char, greater<int>> MuMAPIC;
typedef multimap<int, string, greater<int>> MuMIS;
typedef pair<LL, pair<P, P>> PP;
#define INF 999999999999999997 // 少し加算したらオーバーフローする
#define MP make_pair
#define FAST_IO \
cin.tie(0); \
ios::sync_with_stdio(false);
#define FOR(i, a, b) for (LL i = (a); i < (b); i++)
#define FOR_REV(i, a, b) for (int i = (a); i >= (b); i--)
#define FOR_ITR(d) \
for (auto itr = d.begin(), d_end = d.end(); itr != d_end; ++itr) // C++11
#define O(s) cout << s << endl;
#define SORTVL(v) sort(v.begin(), v.end());
#define SORTVL_GR(v) sort(v.begin(), v.end(), greater<LL>());
#define DUMP_VVI(b) \
if (dbgF) { \
FOR(i, 0, b.size()) { \
FOR(j, 0, b[i].size()) printf("%d ", b[i][j]); \
puts(""); \
} \
}
#define D_OUT(str, value) \
if (dbgF) { \
cout << str << " : " << value << endl; \
}
template <class T> T IN() {
T d;
cin >> d;
return d;
}
LL gcd(LL a, LL b) {
return (b > 0) ? gcd(b, a % b) : a;
} // 最大公約数（Greatest Common Divisor）
LL lcm(LL a, LL b) {
return a / gcd(a, b) * b;
} // 最小公倍数（Least Common Multiple）
bool uruu(LL Y) {
return (((Y % 4 == 0 && Y % 100 != 0) || Y % 400 == 0) ? true : false);
} // うるう年判定
string Replace(string S, string from, string to) {
auto p = S.find(from);
while (p != string::npos) {
S.replace(p, from.size(), to);
p = S.find(from, p + to.size());
}
return S;
}
// 桁和
LL Ketawa_s(string s) {
LL a = 0;
FOR(i, 0, s.length()) a += s[i] - '0';
return a;
}
// 末尾数字で切り上げ
LL CeilLastNumber(LL n) { return ((n + (10 - 1)) / 10) * 10; }
// 二項係数 nCk mod pを求める
const LL MAX = 510000, p = 998244353;
LL fac[MAX], finv[MAX], inv[MAX];
/* 前処理 */ void COM_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAX) {
fac[i] = fac[i - 1] * i % p;
inv[i] = p - inv[p % i] * (p / i) % p;
finv[i] = finv[i - 1] * inv[i] % p;
}
}
/* 主処理 */ LL COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % p) % p;
}
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int dxx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dyy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
// -------------------------------------------------------------------------------
int main() {
FAST_IO;
bool dbgF =
true; // for D_OUT(str, value) ... cout<< str <<" : "<< value <<endl;
LL L, R;
cin >> L >> R;
LL mod = 2019;
// (i*j)%2019 = i%2019 * j%2019
VL modList;
FOR(i, L, R + 1) { modList.push_back(i % mod); }
SORTVL(modList);
O(modList[0] * modList[1]);
return 0;
} | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip> // 20桁出力 cout << setprecision(20) << double;
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VL;
typedef vector<VL> VVL; // VVL v(100,VL(100,0));
typedef vector<pair<LL, LL>> VP;
typedef vector<string> VS;
typedef map<int, int> MAPII;
typedef multimap<int, char, greater<int>> MuMAPIC;
typedef multimap<int, string, greater<int>> MuMIS;
typedef pair<LL, pair<P, P>> PP;
#define INF 999999999999999997 // 少し加算したらオーバーフローする
#define MP make_pair
#define FAST_IO \
cin.tie(0); \
ios::sync_with_stdio(false);
#define FOR(i, a, b) for (LL i = (a); i < (b); i++)
#define FOR_REV(i, a, b) for (int i = (a); i >= (b); i--)
#define FOR_ITR(d) \
for (auto itr = d.begin(), d_end = d.end(); itr != d_end; ++itr) // C++11
#define O(s) cout << s << endl;
#define SORTVL(v) sort(v.begin(), v.end());
#define SORTVL_GR(v) sort(v.begin(), v.end(), greater<LL>());
#define DUMP_VVI(b) \
if (dbgF) { \
FOR(i, 0, b.size()) { \
FOR(j, 0, b[i].size()) printf("%d ", b[i][j]); \
puts(""); \
} \
}
#define D_OUT(str, value) \
if (dbgF) { \
cout << str << " : " << value << endl; \
}
template <class T> T IN() {
T d;
cin >> d;
return d;
}
LL gcd(LL a, LL b) {
return (b > 0) ? gcd(b, a % b) : a;
} // 最大公約数（Greatest Common Divisor）
LL lcm(LL a, LL b) {
return a / gcd(a, b) * b;
} // 最小公倍数（Least Common Multiple）
bool uruu(LL Y) {
return (((Y % 4 == 0 && Y % 100 != 0) || Y % 400 == 0) ? true : false);
} // うるう年判定
string Replace(string S, string from, string to) {
auto p = S.find(from);
while (p != string::npos) {
S.replace(p, from.size(), to);
p = S.find(from, p + to.size());
}
return S;
}
// 桁和
LL Ketawa_s(string s) {
LL a = 0;
FOR(i, 0, s.length()) a += s[i] - '0';
return a;
}
// 末尾数字で切り上げ
LL CeilLastNumber(LL n) { return ((n + (10 - 1)) / 10) * 10; }
// 二項係数 nCk mod pを求める
const LL MAX = 510000, p = 998244353;
LL fac[MAX], finv[MAX], inv[MAX];
/* 前処理 */ void COM_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAX) {
fac[i] = fac[i - 1] * i % p;
inv[i] = p - inv[p % i] * (p / i) % p;
finv[i] = finv[i - 1] * inv[i] % p;
}
}
/* 主処理 */ LL COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % p) % p;
}
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int dxx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dyy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
// -------------------------------------------------------------------------------
int main() {
FAST_IO;
bool dbgF =
true; // for D_OUT(str, value) ... cout<< str <<" : "<< value <<endl;
LL L, R;
cin >> L >> R;
LL mod = 2019;
// (i*j)%2019 = i%2019 * j%2019
LL count = pow(mod, 2);
LL ans = INF;
FOR(i, L, R + 1) {
FOR(j, i + 1, R + 1) {
ans = min(ans, i % mod * j % mod);
count--;
if (count < 0) {
break;
}
}
if (count < 0) {
break;
}
}
O(ans);
return 0;
} | replace | 132 | 136 | 132 | 147 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
if (L - R >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
int x = (i * j) % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
int x = (i * j) % 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
ll l, r;
cin >> l >> r;
ll mod = 2019;
ll mini = 1LL << 60;
int cnt = 0;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll x = i % mod;
ll y = j % mod;
ll e = x * y % mod;
mini = min(mini, e);
cnt++;
if (cnt > 2019 * 2019)
break;
}
}
cout << mini << endl;
}
signed main() {
// while(1)
solve();
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
ll l, r;
cin >> l >> r;
ll mod = 2019;
ll mini = 1LL << 60;
int cnt = 0;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll x = i % mod;
ll y = j % mod;
ll e = x * y % mod;
mini = min(mini, e);
cnt++;
if (cnt > 2019 * 2019) {
cout << mini << endl;
return;
}
}
}
cout << mini << endl;
}
signed main() {
// while(1)
solve();
} | replace | 18 | 20 | 18 | 22 | 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() {
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(ans, (i * j) % 2019);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
l %= 2019;
r = l + 2019;
}
ll ans = 2019;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
return 0;
} | insert | 10 | 10 | 10 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
int main() {
lint l, r;
cin >> l >> r;
lint min = INT_MAX;
FOR(i, l, r) {
FOR(j, i + 1, r + 1) {
lint tmp = ((i % 2019) * (j % 2019)) % 2019;
if (tmp < min)
min = tmp;
}
}
cout << min << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
int main() {
lint l, r;
cin >> l >> r;
lint min = INT_MAX;
if (r - l >= 2019) {
min = 0;
} else {
FOR(i, l, r) {
FOR(j, i + 1, r + 1) {
lint tmp = ((i % 2019) * (j % 2019)) % 2019;
if (tmp < min)
min = tmp;
}
}
}
cout << min << endl;
return 0;
}
| replace | 27 | 32 | 27 | 36 | TLE | |
p02983 | C++ | Time Limit Exceeded | // author: zekigurbuz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef queue<int> qi;
typedef map<string, int> msi;
#define RANGE_SUM 0
#define RANGE_MIN 1
#define RANGE_MAX 2
#define RANGE_XOR 3
#define RANGE_MUL 4
#define RANGE_OR 5
#define RANGE_AND 6
#define bit_ison(S, j) (S & (1 << j))
#define bit_setbit(S, j) (S |= (1 << j))
#define bit_clearbit(S, j) (S &= ~(1 << j))
#define bit_togglebit(S, j) (S ^= (1 << j))
#define bit_lowestbit(S) (S & (-S))
#define bit_setallon(S, n) (S = (1 << n) - 1)
#define bit_ispowertwo(S) (!(S & (S - 1))
#define bit_turnofflastbit(S) ((S) & (S - 1))
#define bit_turnonlastzero(S) ((S) | (S + 1))
#define int ll
#define double ld
#define M0D 1000000007
#define imin -(1e18)
#define imax 1e18
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define forn(a, b) for (int a = 0; a < b; ++a)
#define rep(a, b, c) for (int a = b; a < c; ++a)
const ld PI = 4 * atan((ld)1);
vs split(string s) {
vs v;
istringstream iss(s);
do {
string sub;
iss >> sub;
v.pb(sub);
} while (iss);
v.pop_back();
return v;
}
int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int p0wm(int n, int p, int m) {
if (p == 0)
return 1;
if (p == 1)
return n % m;
if (p % 2 == 0) {
int t = p0wm(n, p / 2, m);
return t % m * t % m % m;
}
int t = p0wm(n, p / 2, m);
t = t % m * t % m % m;
return t % m * n % m % m;
}
int p0w(int n, int p) {
if (p == 0)
return 1;
if (p == 1)
return n;
if (p % 2 == 0) {
int t = p0w(n, p / 2);
return t * t;
}
int t = p0w(n, p / 2);
return t * t * n;
}
int m0d(int n, int m) { return (m + (n % m)) % m; }
int fact(int n) {
int a = 1;
for (int i = 1; i <= n; ++i)
a *= i;
return a;
}
bool ip(int n) {
if (n <= 1)
return false;
if (n == 2)
return true;
for (int i = 2; i * i <= n; ++i)
if (n % i == 0)
return false;
return true;
}
vb ps(int n) {
vector<bool> p;
forn(i, n + 1) { p.pb(true); }
p[0] = false;
p[0] = p[1] = false;
for (int i = 2; i * i <= n; ++i) {
if (p[i]) {
for (int j = i * i; j <= n; j += i) {
p[j] = false;
}
}
}
return p;
}
vi psp(int n) {
vector<bool> p = ps(n);
vi a;
forn(i, n + 1) if (p[i]) a.pb(i);
return a;
}
// variables: vi pset, vi size, int numsets. methods: constructor(int n), int
// find_set(int i) void unify(int i, int j) bool same_set(int i, int j)
struct dsu {
vi pset;
vi size;
int numsets;
dsu(int n) {
numsets = n;
pset.resize(n);
size.resize(n);
forn(i, n) pset[i] = i;
forn(i, n) size[i] = 1;
}
int find_set(int i) { return pset[i] == i ? i : pset[i] = find_set(pset[i]); }
void unify(int i, int j) {
int a = find_set(i), b = find_set(j);
if (a == b)
return;
numsets--;
if (size[a] < size[b]) {
pset[a] = b;
size[b] += size[a];
} else {
pset[b] = a;
size[a] += size[b];
}
}
bool same_set(int i, int j) { return find_set(i) == find_set(j); }
int size_set(int i) { return size[find_set(i)]; }
};
// variables: vi bit, int size. methods: constructor(int n), int sum(int a), int
// sum(int a, int b), void update(int k, int x)
struct fenwick {
vi bit;
int size;
fenwick(int n) {
size = n;
bit.resize(n + 1, 0);
}
int sum(int a) {
int s = 0;
while (a >= 1) {
s += bit[a];
a -= a & -a;
}
return s;
}
int sum(int a, int b) { return sum(b) - (a == 1 ? 0 : sum(a - 1)); }
void update(int k, int x) {
while (k <= size) {
bit[k] += x;
k += k & -k;
}
}
};
// variables: int code, int size, vi segment_tree. methods: constructor(int n,
// int type), void update(...), int query(...)
struct segtree {
int code;
int size;
vi segment_tree;
segtree(int n, int type) {
n = (int)(2 * pow(2, floor(log2(n)) + 3));
size = n;
code = type;
segment_tree.resize(n, 0);
}
void update(int index, int value) { update(1, 0, size - 1, index, value); }
void update(int index, int left, int right, int i, int value) {
if (left == right)
segment_tree[index] = value;
else {
int mid = (left + right) / 2;
if (i <= mid) {
update(2 * index, left, mid, i, value);
} else {
update(2 * index + 1, mid + 1, right, i, value);
}
switch (code) {
case RANGE_SUM:
segment_tree[index] =
segment_tree[2 * index] + segment_tree[2 * index + 1];
break;
case RANGE_MIN:
segment_tree[index] =
min(segment_tree[2 * index], segment_tree[2 * index + 1]);
break;
case RANGE_MAX:
segment_tree[index] =
max(segment_tree[2 * index], segment_tree[2 * index + 1]);
break;
case RANGE_XOR:
segment_tree[index] =
segment_tree[2 * index] ^ segment_tree[2 * index + 1];
break;
case RANGE_MUL:
segment_tree[index] =
segment_tree[2 * index] * segment_tree[2 * index + 1];
break;
case RANGE_OR:
segment_tree[index] =
segment_tree[2 * index] | segment_tree[2 * index + 1];
break;
case RANGE_AND:
segment_tree[index] =
segment_tree[2 * index] & segment_tree[2 * index + 1];
break;
}
}
}
int query(int left, int right) { return query(1, 0, size - 1, left, right); }
int query(int index, int left, int right, int lhs, int rhs) {
if (left >= lhs && right <= rhs) {
return segment_tree[index];
} else {
int ret = 0;
switch (code) {
case RANGE_SUM:
ret = 0;
break;
case RANGE_MIN:
ret = imax;
break;
case RANGE_MAX:
ret = imin;
break;
case RANGE_XOR:
ret = 0;
break;
case RANGE_MUL:
ret = 1;
break;
case RANGE_OR:
ret = 0;
break;
case RANGE_AND:
ret = 9223372036854775807;
break;
}
int mid = (left + right) / 2;
if (mid >= lhs) {
switch (code) {
case RANGE_SUM:
ret += query(2 * index, left, mid, lhs, rhs);
break;
case RANGE_MIN:
ret = min(ret, query(2 * index, left, mid, lhs, rhs));
break;
case RANGE_MAX:
ret = max(ret, query(2 * index, left, mid, lhs, rhs));
break;
case RANGE_XOR:
ret ^= query(2 * index, left, mid, lhs, rhs);
break;
case RANGE_MUL:
ret *= query(2 * index, left, mid, lhs, rhs);
break;
case RANGE_OR:
ret |= query(2 * index, left, mid, lhs, rhs);
break;
case RANGE_AND:
ret &= query(2 * index, left, mid, lhs, rhs);
break;
}
}
if (mid + 1 <= rhs) {
switch (code) {
case RANGE_SUM:
ret += query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
case RANGE_MIN:
ret = min(ret, query(2 * index + 1, mid + 1, right, lhs, rhs));
break;
case RANGE_MAX:
ret = max(ret, query(2 * index + 1, mid + 1, right, lhs, rhs));
break;
case RANGE_XOR:
ret ^= query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
case RANGE_MUL:
ret *= query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
case RANGE_OR:
ret |= query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
case RANGE_AND:
ret &= query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
}
}
return ret;
}
}
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int l, r;
cin >> l >> r;
if (r - l + 1 <= 2019) {
int ans = 2018;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
} else {
int ans = 2018;
for (int i = l; i <= r; i += 2019 - l % 2019) {
for (int j = i + 1; j <= r; j += 2019 - l % 2019) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
}
return 0;
}
/* Think about this stuff:
- printing: double -> int || printf
- use for loop instead of memset
- check bounds & edge cases
- just implement something
- find reason of tle
*/
| // author: zekigurbuz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef queue<int> qi;
typedef map<string, int> msi;
#define RANGE_SUM 0
#define RANGE_MIN 1
#define RANGE_MAX 2
#define RANGE_XOR 3
#define RANGE_MUL 4
#define RANGE_OR 5
#define RANGE_AND 6
#define bit_ison(S, j) (S & (1 << j))
#define bit_setbit(S, j) (S |= (1 << j))
#define bit_clearbit(S, j) (S &= ~(1 << j))
#define bit_togglebit(S, j) (S ^= (1 << j))
#define bit_lowestbit(S) (S & (-S))
#define bit_setallon(S, n) (S = (1 << n) - 1)
#define bit_ispowertwo(S) (!(S & (S - 1))
#define bit_turnofflastbit(S) ((S) & (S - 1))
#define bit_turnonlastzero(S) ((S) | (S + 1))
#define int ll
#define double ld
#define M0D 1000000007
#define imin -(1e18)
#define imax 1e18
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define forn(a, b) for (int a = 0; a < b; ++a)
#define rep(a, b, c) for (int a = b; a < c; ++a)
const ld PI = 4 * atan((ld)1);
vs split(string s) {
vs v;
istringstream iss(s);
do {
string sub;
iss >> sub;
v.pb(sub);
} while (iss);
v.pop_back();
return v;
}
int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int p0wm(int n, int p, int m) {
if (p == 0)
return 1;
if (p == 1)
return n % m;
if (p % 2 == 0) {
int t = p0wm(n, p / 2, m);
return t % m * t % m % m;
}
int t = p0wm(n, p / 2, m);
t = t % m * t % m % m;
return t % m * n % m % m;
}
int p0w(int n, int p) {
if (p == 0)
return 1;
if (p == 1)
return n;
if (p % 2 == 0) {
int t = p0w(n, p / 2);
return t * t;
}
int t = p0w(n, p / 2);
return t * t * n;
}
int m0d(int n, int m) { return (m + (n % m)) % m; }
int fact(int n) {
int a = 1;
for (int i = 1; i <= n; ++i)
a *= i;
return a;
}
bool ip(int n) {
if (n <= 1)
return false;
if (n == 2)
return true;
for (int i = 2; i * i <= n; ++i)
if (n % i == 0)
return false;
return true;
}
vb ps(int n) {
vector<bool> p;
forn(i, n + 1) { p.pb(true); }
p[0] = false;
p[0] = p[1] = false;
for (int i = 2; i * i <= n; ++i) {
if (p[i]) {
for (int j = i * i; j <= n; j += i) {
p[j] = false;
}
}
}
return p;
}
vi psp(int n) {
vector<bool> p = ps(n);
vi a;
forn(i, n + 1) if (p[i]) a.pb(i);
return a;
}
// variables: vi pset, vi size, int numsets. methods: constructor(int n), int
// find_set(int i) void unify(int i, int j) bool same_set(int i, int j)
struct dsu {
vi pset;
vi size;
int numsets;
dsu(int n) {
numsets = n;
pset.resize(n);
size.resize(n);
forn(i, n) pset[i] = i;
forn(i, n) size[i] = 1;
}
int find_set(int i) { return pset[i] == i ? i : pset[i] = find_set(pset[i]); }
void unify(int i, int j) {
int a = find_set(i), b = find_set(j);
if (a == b)
return;
numsets--;
if (size[a] < size[b]) {
pset[a] = b;
size[b] += size[a];
} else {
pset[b] = a;
size[a] += size[b];
}
}
bool same_set(int i, int j) { return find_set(i) == find_set(j); }
int size_set(int i) { return size[find_set(i)]; }
};
// variables: vi bit, int size. methods: constructor(int n), int sum(int a), int
// sum(int a, int b), void update(int k, int x)
struct fenwick {
vi bit;
int size;
fenwick(int n) {
size = n;
bit.resize(n + 1, 0);
}
int sum(int a) {
int s = 0;
while (a >= 1) {
s += bit[a];
a -= a & -a;
}
return s;
}
int sum(int a, int b) { return sum(b) - (a == 1 ? 0 : sum(a - 1)); }
void update(int k, int x) {
while (k <= size) {
bit[k] += x;
k += k & -k;
}
}
};
// variables: int code, int size, vi segment_tree. methods: constructor(int n,
// int type), void update(...), int query(...)
struct segtree {
int code;
int size;
vi segment_tree;
segtree(int n, int type) {
n = (int)(2 * pow(2, floor(log2(n)) + 3));
size = n;
code = type;
segment_tree.resize(n, 0);
}
void update(int index, int value) { update(1, 0, size - 1, index, value); }
void update(int index, int left, int right, int i, int value) {
if (left == right)
segment_tree[index] = value;
else {
int mid = (left + right) / 2;
if (i <= mid) {
update(2 * index, left, mid, i, value);
} else {
update(2 * index + 1, mid + 1, right, i, value);
}
switch (code) {
case RANGE_SUM:
segment_tree[index] =
segment_tree[2 * index] + segment_tree[2 * index + 1];
break;
case RANGE_MIN:
segment_tree[index] =
min(segment_tree[2 * index], segment_tree[2 * index + 1]);
break;
case RANGE_MAX:
segment_tree[index] =
max(segment_tree[2 * index], segment_tree[2 * index + 1]);
break;
case RANGE_XOR:
segment_tree[index] =
segment_tree[2 * index] ^ segment_tree[2 * index + 1];
break;
case RANGE_MUL:
segment_tree[index] =
segment_tree[2 * index] * segment_tree[2 * index + 1];
break;
case RANGE_OR:
segment_tree[index] =
segment_tree[2 * index] | segment_tree[2 * index + 1];
break;
case RANGE_AND:
segment_tree[index] =
segment_tree[2 * index] & segment_tree[2 * index + 1];
break;
}
}
}
int query(int left, int right) { return query(1, 0, size - 1, left, right); }
int query(int index, int left, int right, int lhs, int rhs) {
if (left >= lhs && right <= rhs) {
return segment_tree[index];
} else {
int ret = 0;
switch (code) {
case RANGE_SUM:
ret = 0;
break;
case RANGE_MIN:
ret = imax;
break;
case RANGE_MAX:
ret = imin;
break;
case RANGE_XOR:
ret = 0;
break;
case RANGE_MUL:
ret = 1;
break;
case RANGE_OR:
ret = 0;
break;
case RANGE_AND:
ret = 9223372036854775807;
break;
}
int mid = (left + right) / 2;
if (mid >= lhs) {
switch (code) {
case RANGE_SUM:
ret += query(2 * index, left, mid, lhs, rhs);
break;
case RANGE_MIN:
ret = min(ret, query(2 * index, left, mid, lhs, rhs));
break;
case RANGE_MAX:
ret = max(ret, query(2 * index, left, mid, lhs, rhs));
break;
case RANGE_XOR:
ret ^= query(2 * index, left, mid, lhs, rhs);
break;
case RANGE_MUL:
ret *= query(2 * index, left, mid, lhs, rhs);
break;
case RANGE_OR:
ret |= query(2 * index, left, mid, lhs, rhs);
break;
case RANGE_AND:
ret &= query(2 * index, left, mid, lhs, rhs);
break;
}
}
if (mid + 1 <= rhs) {
switch (code) {
case RANGE_SUM:
ret += query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
case RANGE_MIN:
ret = min(ret, query(2 * index + 1, mid + 1, right, lhs, rhs));
break;
case RANGE_MAX:
ret = max(ret, query(2 * index + 1, mid + 1, right, lhs, rhs));
break;
case RANGE_XOR:
ret ^= query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
case RANGE_MUL:
ret *= query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
case RANGE_OR:
ret |= query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
case RANGE_AND:
ret &= query(2 * index + 1, mid + 1, right, lhs, rhs);
break;
}
}
return ret;
}
}
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int l, r;
cin >> l >> r;
if (r - l + 1 <= 2019) {
int ans = 2018;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
} else {
int ans = 2018;
for (int i = l; i <= r; i += 2019 - l % 2019) {
ans = min(ans, min(i * (i + 1) % 2019,
i * (i + 1 + 2019 - (i + 1) % 2019) % 2019));
}
cout << ans << endl;
}
return 0;
}
/* Think about this stuff:
- printing: double -> int || printf
- use for loop instead of memset
- check bounds & edge cases
- just implement something
- find reason of tle
*/
| replace | 329 | 332 | 329 | 331 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
int a[2019];
for (ll i = 0; i < 2019; i++) {
a[i] = 0;
}
for (ll i = L; i <= R; i++) {
ll temp = i % 2019;
a[temp]++;
}
ll min_value = 2020;
for (ll i = 0; i < 2019; i++) {
for (ll j = 0; j < 2019; j++) {
if (i == j) {
if (a[i] >= 2) {
min_value = min(min_value, i * j % 2019);
}
} else if (a[i] >= 1 && a[j] >= 1) {
min_value = min(min_value, i * j % 2019);
}
}
}
cout << min_value << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
int a[2019];
for (ll i = 0; i < 2019; i++) {
a[i] = 0;
}
for (ll i = L; i <= R; i++) {
ll temp = i % 2019;
if (temp == 0) {
cout << 0 << endl;
return 0;
}
a[temp]++;
}
ll min_value = 2020;
for (ll i = 0; i < 2019; i++) {
for (ll j = 0; j < 2019; j++) {
if (i == j) {
if (a[i] >= 2) {
min_value = min(min_value, i * j % 2019);
}
} else if (a[i] >= 1 && a[j] >= 1) {
min_value = min(min_value, i * j % 2019);
}
}
}
cout << min_value << endl;
return 0;
} | insert | 14 | 14 | 14 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll k = i + 1; k <= R; k++) {
if (i >= k)
continue;
if (ans == 0)
break;
ans = min(ans, (i * k) % 2019);
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#define ll long long
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll k = i + 1; k <= R; k++) {
if (i >= k)
continue;
if (ans == 0)
break;
ans = min(ans, (i * k) % 2019);
}
if (ans == 0)
break;
}
cout << ans << endl;
return 0;
}
| insert | 19 | 19 | 19 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
const int p = 2019;
ll ans;
if (L - R + 1 >= p) {
ans = 0;
} else {
ans = LONG_MAX;
for (ll i = L; i <= R - 1; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ans = min(ans, ((i % p) * (j % p)) % p);
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
const int p = 2019;
ll ans;
if (R - L + 1 >= p) {
ans = 0;
} else {
ans = LONG_MAX;
for (ll i = L; i <= R - 1; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ans = min(ans, ((i % p) * (j % p)) % p);
}
}
}
cout << ans << endl;
}
| replace | 18 | 19 | 18 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int l, r;
cin >> l >> r;
ll ans = 2019;
if (l - r >= 2019) {
cout << 0 << endl;
}
repi(i, r + 1, l) {
repi(j, r + 1, i + 1) { ans = min(ans, ((i % 2019) * (j % 2019)) % 2019); }
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int l, r;
cin >> l >> r;
ll ans = 2019;
if (l - r >= 2019) {
cout << 0 << endl;
}
repi(i, r + 1, l) {
repi(j, r + 1, i + 1) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
if (ans == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << ans << endl;
return 0;
} | replace | 17 | 18 | 17 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
// cout << setprecision(20) <<
int main() {
ll L, R;
cin >> L >> R;
ll mod_min = 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
mod_min = min(mod_min, i * j % 2019);
}
if (mod_min == 0)
break;
}
cout << mod_min << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
// cout << setprecision(20) <<
int main() {
ll L, R;
cin >> L >> R;
ll mod_min = 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
mod_min = min(mod_min, i * j % 2019);
if (mod_min == 0)
break;
}
if (mod_min == 0)
break;
}
cout << mod_min << endl;
} | insert | 13 | 13 | 13 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399375105820974
#define ten5p1 100001
#define ten6p1 1000001
#define ten8p1 100000001
#define ten9p1 1000000001
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define rep(var, n) for (int var = 0; var < n; ++var)
#define repi(n) rep(i, n)
#define repj(n) rep(j, n)
#define repi1(n) for (int i = 1; i < n; ++i)
#define repj1(n) for (int j = 1; j < n; ++j)
int _min(int a, int b) { return a <= b ? a : b; }
int _min(ll a, ll b) { return a <= b ? a : b; }
int _max(int a, int b) { return a >= b ? a : b; }
int _max(ll a, ll b) { return a >= b ? a : b; }
void zero(int *data, int n) { memset(data, 0, sizeof(int) * n); }
void zero(ll *data, int n) { memset(data, 0, sizeof(ll) * n); }
void zero(char *data, int n) { memset(data, 0, sizeof(char) * n); }
char readc() {
char var;
fscanf(_fin, "%c", &var);
return var;
}
int readi() {
int var;
fscanf(_fin, "%d", &var);
return var;
}
ll readll() {
ll var;
fscanf(_fin, "%lld", &var);
return var;
}
void repread(int *data, int n) { repi(n) data[i] = readi(); }
void repread(ll *data, int n) { repi(n) data[i] = readll(); }
int reads(char *str, int maxsize) {
for (;;) {
if (fgets(str, maxsize, _fin) == NULL)
break;
if (str[0] != '\n' && str[0] != '\r')
break;
}
int slen = strlen(str);
if (slen == 0)
return 0;
if (str[slen - 1] == '\n' || str[slen - 1] == '\r')
str[--slen] = 0;
return slen;
}
#define writec(var) fprintf(_fout, "%c", var)
#define writecsp(var) fprintf(_fout, "%c ", var)
#define writecln(var) fprintf(_fout, "%c\n", var)
#define writei(var) fprintf(_fout, "%d", var)
#define writeisp(var) fprintf(_fout, "%d ", var)
#define writellsp(var) fprintf(_fout, "%lld ", var)
#define writeiln(var) fprintf(_fout, "%d\n", var)
#define writellln(var) fprintf(_fout, "%lld\n", var)
#define writeulln(var) fprintf(_fout, "%llu\n", var)
#define writefln(var) fprintf(_fout, "%f\n", var)
#define writes(str) fprintf(_fout, "%s", str)
#define writesp() fprintf(_fout, " ")
#define writeln() fprintf(_fout, "\n")
#define RUN_LOCAL(testfilename) \
{ \
_fin = fopen(testfilename, "r"); \
if (_fin == NULL) \
_fin = stdin; \
}
#define swap(type, a, b) \
{ \
type t = a; \
a = b; \
b = t; \
}
#define sort(data, n) std::sort(data, data + n)
// #define mod(a,b) b==0 ? 0 : a==0 ? 0 :(a>0 ? a%b : b + a % b) //what the hell
// is this...
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void reverse(char *data, int n) {
int k = n >> 1;
repi(k) {
char tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
void reverse(int *data, int n) {
int k = n >> 1;
repi(k) {
int tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
#define _Vec(type, name) \
struct name { \
type *data; \
int size; \
int n; \
}; \
void init(name *t, int size) { \
t->data = (type *)malloc(sizeof(type) * size); \
t->size = size; \
t->n = 0; \
} \
void resize(name *t) { \
int ns = t->size * 1.2f; \
t->data = (type *)realloc(t->data, sizeof(type) * ns); \
t->size = ns; \
} \
void add(name *t, type val) { \
if (t->n >= t->size) \
resize(t); \
int k = t->n; \
t->data[k] = val; \
t->n = k + 1; \
} \
void free(name *t) { free(t->data); }
_Vec(int, Veci) _Vec(long long, Vecll) _Vec(char *, Vecs)
#define _ispal(type, name) \
int name(type *a, type *b, int n) { \
repi(n) { \
if (a[i] != b[n - i - 1]) { \
return 0; \
} \
} \
return 1; \
}
_ispal(int, ispali) _ispal(char, ispalc)
#define _Pair(type, name) \
struct name { \
type x, y; \
}; \
int cmp_##name(const void *_a, const void *_b) { \
name *a = (name *)_a; \
name *b = (name *)_b; \
if (a->x == b->x) { \
if (a->y < b->y) \
return -1; \
else \
return 1; \
} \
if (a->x < b->x) \
return -1; \
else \
return 1; \
} \
void sort_##name(name *d, int n) { qsort(d, n, sizeof(name), cmp_##name); }
_Pair(int, Pairi)
int cmp_Str(const void *_a, const void *_b) {
char *a = *((char **)_a);
char *b = *((char **)_b);
return strcmp(a, b);
}
void sort_Str(char **str, int n) { qsort(str, n, sizeof(char *), cmp_Str); }
ll expmod(ll x, ll n, ll m) {
ll ans = 1;
for (; n;) {
if (n & 1)
ans = (ans * x) % m;
x = (x * x) % m;
n >>= 1;
}
return ans;
}
ll combmod(ll n, ll k, ll m) {
ll ret = 1;
ll div = 1;
for (ll i = 0; i < k; ++i) {
ret = (ret * (n - i) % m) % m;
div = (div * (i + 1)) % m;
}
div = expmod(div, m - 2, m) % m;
return (ret * div) % m;
}
//------------------------------------------
//------------
int main() {
RUN_LOCAL("xxb05in.txt");
int a = readi();
int b = readi();
// since 2019 will loop around, no matter how big range is, the most you will
// do is 2019*2019
int xmin = 2019;
for (int i = a; i <= b; ++i) {
for (int j = i + 1; j <= b; ++j) {
int ans = ((i % 2019) * (j % 2019)) % 2019;
if (ans < xmin)
xmin = ans;
if (xmin == 0)
break;
}
}
writeiln(xmin);
return 0;
/*
1999999264 1999999270
26
*/
}
| /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399375105820974
#define ten5p1 100001
#define ten6p1 1000001
#define ten8p1 100000001
#define ten9p1 1000000001
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define rep(var, n) for (int var = 0; var < n; ++var)
#define repi(n) rep(i, n)
#define repj(n) rep(j, n)
#define repi1(n) for (int i = 1; i < n; ++i)
#define repj1(n) for (int j = 1; j < n; ++j)
int _min(int a, int b) { return a <= b ? a : b; }
int _min(ll a, ll b) { return a <= b ? a : b; }
int _max(int a, int b) { return a >= b ? a : b; }
int _max(ll a, ll b) { return a >= b ? a : b; }
void zero(int *data, int n) { memset(data, 0, sizeof(int) * n); }
void zero(ll *data, int n) { memset(data, 0, sizeof(ll) * n); }
void zero(char *data, int n) { memset(data, 0, sizeof(char) * n); }
char readc() {
char var;
fscanf(_fin, "%c", &var);
return var;
}
int readi() {
int var;
fscanf(_fin, "%d", &var);
return var;
}
ll readll() {
ll var;
fscanf(_fin, "%lld", &var);
return var;
}
void repread(int *data, int n) { repi(n) data[i] = readi(); }
void repread(ll *data, int n) { repi(n) data[i] = readll(); }
int reads(char *str, int maxsize) {
for (;;) {
if (fgets(str, maxsize, _fin) == NULL)
break;
if (str[0] != '\n' && str[0] != '\r')
break;
}
int slen = strlen(str);
if (slen == 0)
return 0;
if (str[slen - 1] == '\n' || str[slen - 1] == '\r')
str[--slen] = 0;
return slen;
}
#define writec(var) fprintf(_fout, "%c", var)
#define writecsp(var) fprintf(_fout, "%c ", var)
#define writecln(var) fprintf(_fout, "%c\n", var)
#define writei(var) fprintf(_fout, "%d", var)
#define writeisp(var) fprintf(_fout, "%d ", var)
#define writellsp(var) fprintf(_fout, "%lld ", var)
#define writeiln(var) fprintf(_fout, "%d\n", var)
#define writellln(var) fprintf(_fout, "%lld\n", var)
#define writeulln(var) fprintf(_fout, "%llu\n", var)
#define writefln(var) fprintf(_fout, "%f\n", var)
#define writes(str) fprintf(_fout, "%s", str)
#define writesp() fprintf(_fout, " ")
#define writeln() fprintf(_fout, "\n")
#define RUN_LOCAL(testfilename) \
{ \
_fin = fopen(testfilename, "r"); \
if (_fin == NULL) \
_fin = stdin; \
}
#define swap(type, a, b) \
{ \
type t = a; \
a = b; \
b = t; \
}
#define sort(data, n) std::sort(data, data + n)
// #define mod(a,b) b==0 ? 0 : a==0 ? 0 :(a>0 ? a%b : b + a % b) //what the hell
// is this...
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void reverse(char *data, int n) {
int k = n >> 1;
repi(k) {
char tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
void reverse(int *data, int n) {
int k = n >> 1;
repi(k) {
int tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
#define _Vec(type, name) \
struct name { \
type *data; \
int size; \
int n; \
}; \
void init(name *t, int size) { \
t->data = (type *)malloc(sizeof(type) * size); \
t->size = size; \
t->n = 0; \
} \
void resize(name *t) { \
int ns = t->size * 1.2f; \
t->data = (type *)realloc(t->data, sizeof(type) * ns); \
t->size = ns; \
} \
void add(name *t, type val) { \
if (t->n >= t->size) \
resize(t); \
int k = t->n; \
t->data[k] = val; \
t->n = k + 1; \
} \
void free(name *t) { free(t->data); }
_Vec(int, Veci) _Vec(long long, Vecll) _Vec(char *, Vecs)
#define _ispal(type, name) \
int name(type *a, type *b, int n) { \
repi(n) { \
if (a[i] != b[n - i - 1]) { \
return 0; \
} \
} \
return 1; \
}
_ispal(int, ispali) _ispal(char, ispalc)
#define _Pair(type, name) \
struct name { \
type x, y; \
}; \
int cmp_##name(const void *_a, const void *_b) { \
name *a = (name *)_a; \
name *b = (name *)_b; \
if (a->x == b->x) { \
if (a->y < b->y) \
return -1; \
else \
return 1; \
} \
if (a->x < b->x) \
return -1; \
else \
return 1; \
} \
void sort_##name(name *d, int n) { qsort(d, n, sizeof(name), cmp_##name); }
_Pair(int, Pairi)
int cmp_Str(const void *_a, const void *_b) {
char *a = *((char **)_a);
char *b = *((char **)_b);
return strcmp(a, b);
}
void sort_Str(char **str, int n) { qsort(str, n, sizeof(char *), cmp_Str); }
ll expmod(ll x, ll n, ll m) {
ll ans = 1;
for (; n;) {
if (n & 1)
ans = (ans * x) % m;
x = (x * x) % m;
n >>= 1;
}
return ans;
}
ll combmod(ll n, ll k, ll m) {
ll ret = 1;
ll div = 1;
for (ll i = 0; i < k; ++i) {
ret = (ret * (n - i) % m) % m;
div = (div * (i + 1)) % m;
}
div = expmod(div, m - 2, m) % m;
return (ret * div) % m;
}
//------------------------------------------
//------------
int main() {
RUN_LOCAL("xxb05in.txt");
int a = readi();
int b = readi();
// since 2019 will loop around, no matter how big range is, the most you will
// do is 2019*2019
int xmin = 2019;
for (int i = a; i <= b; ++i) {
for (int j = i + 1; j <= b; ++j) {
int ans = ((i % 2019) * (j % 2019)) % 2019;
if (ans < xmin)
xmin = ans;
if (xmin == 0)
break;
}
if (xmin == 0)
break;
}
writeiln(xmin);
return 0;
/*
1999999264 1999999270
26
*/
}
| insert | 228 | 228 | 228 | 230 | TLE | |
p02983 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << endl;
using LL = long long;
using VS = vector<string>;
using VD = vector<double>;
using VI = vector<int>;
using VL = vector<LL>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
const int inf = (int)1e9;
const double pi = acos(-1.0);
const LL MOD = 1000000007;
const string Snum = "0123456789";
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1},
dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
template <class T> void Sort(T &a) { sort(a.begin(), a.end()); }
template <class T> void ReSort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> void Reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> void Unique(T &a) {
a.erase(unique(a.begin(), a.end()), a.end());
}
template <class T> auto Max(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto Min(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> int Count(const T &a, U c) {
return count(a.begin(), a.end(), c);
}
template <class T, class U> U Sum(const T &a, U init = 0) {
return accumulate(a.begin(), a.end(), init);
}
template <class T, class U> int Lower(const T &a, U s) {
return lower_bound(a.begin(), a.end(), s) - a.begin();
}
template <class T, class U> int Upper(const T &a, U s) {
return upper_bound(a.begin(), a.end(), s) - a.begin();
}
template <class T> T Age(T a, T b) { return (a + b - 1) / b; }
template <class T> T Gcd(T n, T m) { return m == 0 ? n : Gcd(m, n % m); }
template <class T> T Lcm(T n, T m) { return n / Gcd(n, m) * m; }
/* INPUT */
template <class T> T InputF() { return 0; }
template <> char InputF() {
char ret = '\0', c = getchar_unlocked();
while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
ret = c;
c = getchar_unlocked();
}
return ret;
}
template <> string InputF() {
string ret;
char c = getchar_unlocked();
while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
ret.push_back(c);
c = getchar_unlocked();
}
return ret;
}
template <> int InputF() {
int ret = 0;
bool neg = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while ('0' <= c && c <= '9') {
ret = ret * 10 + (c - '0');
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <> LL InputF() {
LL ret = 0;
bool neg = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while ('0' <= c && c <= '9') {
ret = ret * 10LL + (LL(c) - LL('0'));
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <> double InputF() {
double ret = 0, dp = 1;
bool neg = false, adp = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while (('0' <= c && c <= '9') || c == '.') {
if (c == '.') {
adp = true;
} else if (adp) {
dp *= 0.1;
ret += (c - '0') * dp;
} else {
ret = ret * 10.0 + (c - '0');
}
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <class T> T StoT(string s) { return s; }
template <> char StoT(string s) { return s.front(); }
template <> string StoT(string s) { return s; }
template <> int StoT(string s) { return stoi(s); }
template <> LL StoT(string s) { return stoll(s); }
template <> double StoT(string s) { return stod(s); }
string GetLine() {
string ret;
char c = getchar_unlocked();
while (c != '\0' && c != '\n') {
ret.push_back(c);
c = getchar_unlocked();
}
return ret;
}
VS InputB;
template <class T> struct InputC {
operator T() { return InputF<T>(); }
vector<T> operator[](int h) {
vector<T> ret(h);
rep(i, h) ret[i] = InputF<T>();
return ret;
}
vector<vector<T>> operator[](PII p) {
int h, w;
tie(h, w) = p;
vector<vector<T>> ret(h, vector<T>(w));
rep(i, h) rep(j, w) ret[i][j] = InputF<T>();
return ret;
}
T at(int n) {
while (sz(InputB) <= n)
InputB.pb(InputF<string>());
return StoT<T>(InputB[n]);
}
vector<T> at(int n, int h) {
vector<T> ret(h);
rep(i, h) ret[i] = at(i + n);
return ret;
}
vector<vector<T>> at(int n, int h, int w) {
vector<vector<T>> ret(h, vector<T>(w));
rep(i, h) rep(j, w) ret[i][j] = at(n + i * w + j);
return ret;
}
};
InputC<char> inc;
InputC<string> ins;
InputC<int> ini;
InputC<LL> inl;
InputC<double> ind;
/* OUTPUT */
class ostreamfbuff : public std::basic_streambuf<char, std::char_traits<char>> {
protected:
int overflow(int nCh = EOF) {
putchar_unlocked(nCh);
return 0;
}
};
class ostreamf : public std::basic_iostream<char, std::char_traits<char>> {
public:
ostreamf(void)
: std::basic_iostream<char, std::char_traits<char>>(new ostreamfbuff()) {}
};
ostreamf coutf;
ostream &operator<<(ostream &ostr, InputC<string> i) {
ostr << string(i);
return ostr;
}
struct BoolStr {
string t, f;
BoolStr(string tr, string fa) : t(tr), f(fa) {}
} yes("yes", "no"), Yes("Yes", "No"), YES("YES", "NO"), Yay("Yay!", ":(");
struct Divizer {
string s;
Divizer(string s_) : s(s_) {}
} spc(" "), nosp(""), comma(","), lin("\n");
struct Output {
bool flag = false;
BoolStr bs;
Divizer di;
Output(bool f, BoolStr b, Divizer d) : flag(f), bs(b), di(d) {}
template <class T> void print(T o) { coutf << o; }
void print(double o) { printf("%.20f", o); }
void print(bool o) { coutf << (o ? bs.t : bs.f); }
template <class T, class U> void print(const pair<T, U> &o) {
print(o.first);
coutf << di.s;
print(o.second);
}
template <class T> void print(const vector<T> &o) {
for (int i = 0; i < (int)o.size(); ++i) {
if (i != 0)
coutf << di.s;
print(o[i]);
}
}
template <class T, class U> void print(const map<T, U> &o) {
coutf << "Map";
for (auto a : o) {
coutf << " {";
print(a);
coutf << "},";
}
coutf << "\n";
}
template <class T> void print(const set<T> &o) {
coutf << "Set {";
for (auto a : o) {
print(a);
coutf << ",";
}
coutf << "}\n";
}
template <class T> Output operator,(T o) {
if (flag)
coutf << di.s;
print(o);
Output t(true, bs, di);
return t;
}
Output operator,(Output o) {
coutf << '\n';
return o;
}
Output operator,(BoolStr b) {
Output t(flag, b, di);
return t;
}
Output operator,(Divizer d) {
Output t(flag, bs, d);
return t;
}
} out(false, Yes, spc);
/* ANSWER */
struct Answer {
int mini = INT_MAX, maxi = INT_MIN, sumi = 0;
LL minl = LLONG_MAX, maxl = LLONG_MIN, suml = 0;
double mind = DBL_MAX, maxd = DBL_MIN, sumd = 0;
int cnt = 0;
void operator=(int n) {
mini = min(mini, n);
maxi = max(maxi, n);
sumi += n;
cnt++;
}
void operator=(LL n) {
minl = min(minl, n);
maxl = max(maxl, n);
suml += n;
cnt++;
}
void operator=(double n) {
mind = min(mind, n);
maxd = max(maxd, n);
sumd += n;
cnt++;
}
} ans;
int main() {
int L = ini, R = ini;
int l = L % 2019, r = l + (R - L);
FOR(i, l, r + 1) FOR(j, i + 1, r + 1) { ans = i * j % 2019; }
out, ans.mini, out;
} | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << endl;
using LL = long long;
using VS = vector<string>;
using VD = vector<double>;
using VI = vector<int>;
using VL = vector<LL>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
const int inf = (int)1e9;
const double pi = acos(-1.0);
const LL MOD = 1000000007;
const string Snum = "0123456789";
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1},
dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
template <class T> void Sort(T &a) { sort(a.begin(), a.end()); }
template <class T> void ReSort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> void Reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> void Unique(T &a) {
a.erase(unique(a.begin(), a.end()), a.end());
}
template <class T> auto Max(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto Min(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> int Count(const T &a, U c) {
return count(a.begin(), a.end(), c);
}
template <class T, class U> U Sum(const T &a, U init = 0) {
return accumulate(a.begin(), a.end(), init);
}
template <class T, class U> int Lower(const T &a, U s) {
return lower_bound(a.begin(), a.end(), s) - a.begin();
}
template <class T, class U> int Upper(const T &a, U s) {
return upper_bound(a.begin(), a.end(), s) - a.begin();
}
template <class T> T Age(T a, T b) { return (a + b - 1) / b; }
template <class T> T Gcd(T n, T m) { return m == 0 ? n : Gcd(m, n % m); }
template <class T> T Lcm(T n, T m) { return n / Gcd(n, m) * m; }
/* INPUT */
template <class T> T InputF() { return 0; }
template <> char InputF() {
char ret = '\0', c = getchar_unlocked();
while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
ret = c;
c = getchar_unlocked();
}
return ret;
}
template <> string InputF() {
string ret;
char c = getchar_unlocked();
while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
ret.push_back(c);
c = getchar_unlocked();
}
return ret;
}
template <> int InputF() {
int ret = 0;
bool neg = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while ('0' <= c && c <= '9') {
ret = ret * 10 + (c - '0');
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <> LL InputF() {
LL ret = 0;
bool neg = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while ('0' <= c && c <= '9') {
ret = ret * 10LL + (LL(c) - LL('0'));
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <> double InputF() {
double ret = 0, dp = 1;
bool neg = false, adp = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while (('0' <= c && c <= '9') || c == '.') {
if (c == '.') {
adp = true;
} else if (adp) {
dp *= 0.1;
ret += (c - '0') * dp;
} else {
ret = ret * 10.0 + (c - '0');
}
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <class T> T StoT(string s) { return s; }
template <> char StoT(string s) { return s.front(); }
template <> string StoT(string s) { return s; }
template <> int StoT(string s) { return stoi(s); }
template <> LL StoT(string s) { return stoll(s); }
template <> double StoT(string s) { return stod(s); }
string GetLine() {
string ret;
char c = getchar_unlocked();
while (c != '\0' && c != '\n') {
ret.push_back(c);
c = getchar_unlocked();
}
return ret;
}
VS InputB;
template <class T> struct InputC {
operator T() { return InputF<T>(); }
vector<T> operator[](int h) {
vector<T> ret(h);
rep(i, h) ret[i] = InputF<T>();
return ret;
}
vector<vector<T>> operator[](PII p) {
int h, w;
tie(h, w) = p;
vector<vector<T>> ret(h, vector<T>(w));
rep(i, h) rep(j, w) ret[i][j] = InputF<T>();
return ret;
}
T at(int n) {
while (sz(InputB) <= n)
InputB.pb(InputF<string>());
return StoT<T>(InputB[n]);
}
vector<T> at(int n, int h) {
vector<T> ret(h);
rep(i, h) ret[i] = at(i + n);
return ret;
}
vector<vector<T>> at(int n, int h, int w) {
vector<vector<T>> ret(h, vector<T>(w));
rep(i, h) rep(j, w) ret[i][j] = at(n + i * w + j);
return ret;
}
};
InputC<char> inc;
InputC<string> ins;
InputC<int> ini;
InputC<LL> inl;
InputC<double> ind;
/* OUTPUT */
class ostreamfbuff : public std::basic_streambuf<char, std::char_traits<char>> {
protected:
int overflow(int nCh = EOF) {
putchar_unlocked(nCh);
return 0;
}
};
class ostreamf : public std::basic_iostream<char, std::char_traits<char>> {
public:
ostreamf(void)
: std::basic_iostream<char, std::char_traits<char>>(new ostreamfbuff()) {}
};
ostreamf coutf;
ostream &operator<<(ostream &ostr, InputC<string> i) {
ostr << string(i);
return ostr;
}
struct BoolStr {
string t, f;
BoolStr(string tr, string fa) : t(tr), f(fa) {}
} yes("yes", "no"), Yes("Yes", "No"), YES("YES", "NO"), Yay("Yay!", ":(");
struct Divizer {
string s;
Divizer(string s_) : s(s_) {}
} spc(" "), nosp(""), comma(","), lin("\n");
struct Output {
bool flag = false;
BoolStr bs;
Divizer di;
Output(bool f, BoolStr b, Divizer d) : flag(f), bs(b), di(d) {}
template <class T> void print(T o) { coutf << o; }
void print(double o) { printf("%.20f", o); }
void print(bool o) { coutf << (o ? bs.t : bs.f); }
template <class T, class U> void print(const pair<T, U> &o) {
print(o.first);
coutf << di.s;
print(o.second);
}
template <class T> void print(const vector<T> &o) {
for (int i = 0; i < (int)o.size(); ++i) {
if (i != 0)
coutf << di.s;
print(o[i]);
}
}
template <class T, class U> void print(const map<T, U> &o) {
coutf << "Map";
for (auto a : o) {
coutf << " {";
print(a);
coutf << "},";
}
coutf << "\n";
}
template <class T> void print(const set<T> &o) {
coutf << "Set {";
for (auto a : o) {
print(a);
coutf << ",";
}
coutf << "}\n";
}
template <class T> Output operator,(T o) {
if (flag)
coutf << di.s;
print(o);
Output t(true, bs, di);
return t;
}
Output operator,(Output o) {
coutf << '\n';
return o;
}
Output operator,(BoolStr b) {
Output t(flag, b, di);
return t;
}
Output operator,(Divizer d) {
Output t(flag, bs, d);
return t;
}
} out(false, Yes, spc);
/* ANSWER */
struct Answer {
int mini = INT_MAX, maxi = INT_MIN, sumi = 0;
LL minl = LLONG_MAX, maxl = LLONG_MIN, suml = 0;
double mind = DBL_MAX, maxd = DBL_MIN, sumd = 0;
int cnt = 0;
void operator=(int n) {
mini = min(mini, n);
maxi = max(maxi, n);
sumi += n;
cnt++;
}
void operator=(LL n) {
minl = min(minl, n);
maxl = max(maxl, n);
suml += n;
cnt++;
}
void operator=(double n) {
mind = min(mind, n);
maxd = max(maxd, n);
sumd += n;
cnt++;
}
} ans;
int main() {
LL L = inl, R = inl, diff = R - L;
LL l, r;
if (L / 2019 == R / 2019) {
l = L % 2019;
r = R % 2019;
} else {
l = L % 2019;
r = R % 2019 + 2019;
if (r > R)
r -= 2019;
}
LL Ans = 100000;
for (LL i = l; i <= r; ++i)
for (LL j = i + 1; j <= r; ++j) {
Ans = min(Ans, i * j % 2019);
}
out, Ans, out;
} | replace | 292 | 297 | 292 | 312 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
bool a[2020] = {false};
bool isZero = false;
for (long long i = L; i <= R; i++) {
a[i % 2019] = true;
}
if (a[0] || (a[3] && a[673]))
cout << 0 << endl;
else {
int minV = 2020;
repi(i, 1, 2019) {
if (a[i % 2019]) {
repi(j, i + 1, 2019) {
if (a[j % 2019]) {
int value = (i % 2019) * (j % 2019) % 2019;
if (value < minV)
minV = value;
if (minV == 0)
break;
}
}
if (minV == 0)
break;
}
}
cout << minV << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
bool a[2020] = {false};
bool isZero = false;
for (long long i = L; i <= min(R, L + 2019); i++) {
a[i % 2019] = true;
}
if (a[0] || (a[3] && a[673]))
cout << 0 << endl;
else {
int minV = 2020;
repi(i, 1, 2019) {
if (a[i % 2019]) {
repi(j, i + 1, 2019) {
if (a[j % 2019]) {
int value = (i % 2019) * (j % 2019) % 2019;
if (value < minV)
minV = value;
if (minV == 0)
break;
}
}
if (minV == 0)
break;
}
}
cout << minV << endl;
}
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 100000000007
int main() {
ll l, r, a = 2019;
cin >> l >> r;
ll ans = inf;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, (i % a) * (j % a) % a);
}
if (ans == 0) {
break;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 100000000007
int main() {
ll l, r, a = 2019;
cin >> l >> r;
ll ans = inf;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, (i % a) * (j % a) % a);
if (ans == 0) {
break;
}
}
if (ans == 0) {
break;
}
}
cout << ans;
return 0;
} | insert | 12 | 12 | 12 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #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 <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// #include <boost/foreach.hpp>
// #include <boost/range/algorithm.hpp>
#define rep(i, j, k) for (int i = (int)j; i < (int)k; i++)
#define ll long long
#define Sort(v) sort(all(v))
// #define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define MP make_pair
#define int long long
using namespace std;
int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};
struct edge {
int to, cost;
};
// typedef pair<int,int> P;
const long long MOD = 1000000007LL;
bool isupper(char c) {
if ('A' <= c && c <= 'Z')
return 1;
return 0;
}
bool islower(char c) {
if ('a' <= c && c <= 'z')
return 1;
return 0;
}
bool isPrime(int x) {
if (x == 1)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (int i = 3; i * i <= x; i++)
if (x % i == 0)
return 0;
return 1;
}
bool iskaibun(string s) {
for (int i = 0; i < s.size() / 2; i++)
if (s[i] != s[s.size() - i - 1])
return 0;
return 1;
}
bool isnumber(char c) { return ('0' <= c && c <= '9'); }
bool isalpha(char c) { return (isupper(c) || islower(c)); }
template <typename T> void print(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
int INF = 1e18;
template <typename T> void printendl(vector<T> v) {
for (auto date : v)
cout << date << endl;
}
template <typename T> void printvv(vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
if (j)
cout << " ";
cout << v[i][j];
}
cout << endl;
}
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
struct Edge {
int to, cost;
};
signed main() {
int l, r;
cin >> l >> r;
vector<int> v;
if (r - l + 1 == 2019)
cout << 0 << endl;
else {
int ans = 1e9;
rep(i, l, r + 1) {
rep(j, i + 1, r + 1) { ans = min(ans, i * j % 2019); }
}
cout << ans << endl;
}
}
/*
*/ | #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 <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// #include <boost/foreach.hpp>
// #include <boost/range/algorithm.hpp>
#define rep(i, j, k) for (int i = (int)j; i < (int)k; i++)
#define ll long long
#define Sort(v) sort(all(v))
// #define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define MP make_pair
#define int long long
using namespace std;
int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};
struct edge {
int to, cost;
};
// typedef pair<int,int> P;
const long long MOD = 1000000007LL;
bool isupper(char c) {
if ('A' <= c && c <= 'Z')
return 1;
return 0;
}
bool islower(char c) {
if ('a' <= c && c <= 'z')
return 1;
return 0;
}
bool isPrime(int x) {
if (x == 1)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (int i = 3; i * i <= x; i++)
if (x % i == 0)
return 0;
return 1;
}
bool iskaibun(string s) {
for (int i = 0; i < s.size() / 2; i++)
if (s[i] != s[s.size() - i - 1])
return 0;
return 1;
}
bool isnumber(char c) { return ('0' <= c && c <= '9'); }
bool isalpha(char c) { return (isupper(c) || islower(c)); }
template <typename T> void print(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
int INF = 1e18;
template <typename T> void printendl(vector<T> v) {
for (auto date : v)
cout << date << endl;
}
template <typename T> void printvv(vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
if (j)
cout << " ";
cout << v[i][j];
}
cout << endl;
}
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
struct Edge {
int to, cost;
};
signed main() {
int l, r;
cin >> l >> r;
vector<int> v;
if (r - l + 1 >= 2019)
cout << 0 << endl;
else {
int ans = 1e9;
rep(i, l, r + 1) {
rep(j, i + 1, r + 1) { ans = min(ans, i * j % 2019); }
}
cout << ans << endl;
}
}
/*
*/ | replace | 175 | 176 | 175 | 176 | TLE | |
p02983 | C++ | Time Limit Exceeded | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバース
#define RSORT(V) \
SORT(V); \
REV(V) // 大きい方からソート
#define NPN(V) next_permutation(ALL(V)) // 順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } // 最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN2(n, m);
int min_num = INF;
bool exit = false;
FOR(i, n, m) {
FOR(j, i + 1, m + 1) {
min_num = min(min_num, (i * j) % 2019ll);
if (min_num == 0)
exit = true;
}
if (exit)
break;
}
OUT(min_num);
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバース
#define RSORT(V) \
SORT(V); \
REV(V) // 大きい方からソート
#define NPN(V) next_permutation(ALL(V)) // 順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } // 最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN2(n, m);
int min_num = INF;
bool exit = false;
FOR(i, n, m) {
FOR(j, i + 1, m + 1) {
min_num = min(min_num, (i * j) % 2019ll);
if (min_num == 0)
exit = true;
if (exit)
break;
}
if (exit)
break;
}
OUT(min_num);
} | insert | 104 | 104 | 104 | 106 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pa pair<int, int>
#define F first
#define S second
#define maxth 9999
#define d n % 3
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
ll MIN = 0x8000000;
ll a, b;
if (n - m >= 2019) {
cout << "0";
return 0;
}
for (ll i = n; i <= m; i++)
for (ll j = i + 1; j <= m; j++)
if (i * j % 2019 < MIN) {
MIN = i * j % 2019;
a = i;
b = j;
}
cout << a * b % 2019 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pa pair<int, int>
#define F first
#define S second
#define maxth 9999
#define d n % 3
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
ll MIN = 0x8000000;
ll a, b;
if (m - n >= 2019) {
cout << "0";
return 0;
}
for (ll i = n; i <= m; i++)
for (ll j = i + 1; j <= m; j++)
if (i * j % 2019 < MIN) {
MIN = i * j % 2019;
a = i;
b = j;
}
cout << a * b % 2019 << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | /*
ID: Nipun Paul
LANG: C++
PROB: God knows
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c = 2019;
cin >> a >> b;
for (long long int i = a; i <= b; i++) {
for (long long int j = i + 1; j <= b; j++) {
c = min(c, (i * j) % 2019);
if (c == 0) {
break;
}
}
}
cout << c << endl;
return 0;
}
| /*
ID: Nipun Paul
LANG: C++
PROB: God knows
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c = 2019;
cin >> a >> b;
for (long long int i = a; i <= b; i++) {
for (long long int j = i + 1; j <= b; j++) {
c = min(c, (i * j) % 2019);
if (c == 0) {
break;
}
}
if (c == 0) {
break;
}
}
cout << c << endl;
return 0;
}
| insert | 19 | 19 | 19 | 22 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
int main() {
long long L, R;
std::cin >> L >> R;
if (R - L >= 2019) {
std::cout << 0 << std::endl;
return 0;
}
long long l = L % 2019;
long long r = R % 2019;
long long min = 2019;
for (long long i = l; i <= r; ++i, i %= 2019) {
for (long long j = i + 1; j <= r; ++j, j %= 2019) {
min = std::min(min, (i * j) % 2019);
}
}
std::cout << min << std::endl;
return 0;
} | #include <cmath>
#include <iostream>
#include <vector>
int main() {
long long L, R;
std::cin >> L >> R;
if (R - L >= 2019) {
std::cout << 0 << std::endl;
return 0;
}
long long l = L % 2019;
long long r = R % 2019;
long long min = 2019;
for (long long i = l; i <= r; ++i) {
if (i >= 2019)
i -= 2019;
for (long long j = i + 1; j <= r; ++j) {
// std::cout << i << " " << j << std::endl;
if (j >= 2019)
j -= 2019;
min = std::min(min, (i * j) % 2019);
}
}
std::cout << min << std::endl;
return 0;
} | replace | 17 | 19 | 17 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int x, y;
int z;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
x = i % 2019;
y = j % 2019;
z = (x * y) % 2019;
if (ans > z) {
ans = z;
}
}
}
cout << ans;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int x, y;
int z;
int ans = 2019;
if (r - l > 2020) {
for (int i = 0; i <= 2019; i++) {
for (int j = i + 1; j <= 2019; j++) {
x = i % 2019;
y = j % 2019;
z = (x * y) % 2019;
if (ans > z) {
ans = z;
}
}
}
} else {
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
x = i % 2019;
y = j % 2019;
z = (x * y) % 2019;
if (ans > z) {
ans = z;
}
}
}
}
cout << ans;
} | replace | 14 | 21 | 14 | 34 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
bool isInteger(double x) { return floor(x) == x; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll l, r;
cin >> l >> r;
ll ans = 2e10;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
if (ans == 0)
break;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
bool isInteger(double x) { return floor(x) == x; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll l, r;
cin >> l >> r;
ll ans = 2e10;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
if (ans == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << ans << endl;
return 0;
} | replace | 28 | 30 | 28 | 32 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#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 sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
int main() {
int l, r;
cin >> l >> r;
int mod = 2019;
if (l % mod >= r % mod || l % mod == 0 || r % mod == 0) {
cout << 0 << endl;
return 0;
}
int mo = 2019;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int lmo = i % mod;
int rmo = j % mod;
mo = min(mo, lmo * rmo % mod);
}
}
cout << mo << endl;
} | #include <bits/stdc++.h>
using namespace std;
#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 sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
int main() {
int l, r;
cin >> l >> r;
int mod = 2019;
if (r - l >= 2019 || l % mod == 0 || r % mod == 0) {
cout << 0 << endl;
return 0;
}
int mo = 2019;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int lmo = i % mod;
int rmo = j % mod;
mo = min(mo, lmo * rmo % mod);
}
}
cout << mo << endl;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define el "\n"
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define M 1000000007
#define all(v) v.begin(), v.end()
long long pow(long long int a, long long int b, long long int MOD) {
long long x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
if (x > MOD)
x %= MOD;
}
y = (y * y);
if (y > MOD)
y %= MOD;
b /= 2;
}
return x;
}
long long modInverse(long long int n, long long int MOD) {
return pow(n, MOD - 2, MOD);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
unordered_map<ll, ll> mp;
ll l, r;
cin >> l >> r;
for (ll i = l; i <= r; i++) {
mp[i % 2019]++;
}
ll ans = INT_MAX;
for (auto x : mp) {
if (x.Y >= 2) {
ans = min(ans, (x.X * x.X) % 2019);
}
}
vector<ll> v;
for (auto x : mp)
v.pb(x.X);
sort(all(v));
int n = v.size();
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans = min(ans, (v[i] * v[j]) % 2019);
}
}
cout << ans << el;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define el "\n"
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define M 1000000007
#define all(v) v.begin(), v.end()
long long pow(long long int a, long long int b, long long int MOD) {
long long x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
if (x > MOD)
x %= MOD;
}
y = (y * y);
if (y > MOD)
y %= MOD;
b /= 2;
}
return x;
}
long long modInverse(long long int n, long long int MOD) {
return pow(n, MOD - 2, MOD);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
unordered_map<ll, ll> mp;
ll l, r;
cin >> l >> r;
ll tmp;
tmp = (r - l + 1) / 2019;
if (tmp > 2) {
cout << 0 << el;
return 0;
}
for (ll i = l; i <= r; i++) {
mp[i % 2019]++;
}
ll ans = INT_MAX;
for (auto x : mp) {
if (x.Y >= 2) {
ans = min(ans, (x.X * x.X) % 2019);
}
}
vector<ll> v;
for (auto x : mp)
v.pb(x.X);
sort(all(v));
int n = v.size();
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans = min(ans, (v[i] * v[j]) % 2019);
}
}
cout << ans << el;
return 0;
}
| insert | 36 | 36 | 36 | 42 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, e) for (int x = 0; x <= e; x++)
#define in_arr(n) \
loop(i, 0, n - 1) { cin >> a[i]; }
#define out_arr(n) \
loop(i, 0, n - 1) { cout << a[i]; }
const int N = 1e5 + 5;
const int INF = 1 << 30;
const int MOD = 2019;
inline void boost() {
cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
}
int main() {
boost();
ll l, r;
cin >> l >> r;
if ((r / MOD) != (l / MOD)) {
cout << 0;
return 0;
}
l %= MOD;
r %= MOD;
ll mn = INF;
ll s = min(l, r);
ll e = max(l, r);
for (ll i = s; s <= e; ++i) {
for (ll j = i + 1; j <= e; ++j) {
mn = min(mn, (i * j) % MOD);
}
}
cout << mn;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, e) for (int x = 0; x <= e; x++)
#define in_arr(n) \
loop(i, 0, n - 1) { cin >> a[i]; }
#define out_arr(n) \
loop(i, 0, n - 1) { cout << a[i]; }
const int N = 1e5 + 5;
const int INF = 1 << 30;
const int MOD = 2019;
inline void boost() {
cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
}
int main() {
boost();
ll l, r;
cin >> l >> r;
if ((r / MOD) != (l / MOD)) {
cout << 0;
return 0;
}
l %= MOD;
r %= MOD;
ll mn = INF;
ll s = min(l, r);
ll e = max(l, r);
for (ll i = s; i <= e; ++i) {
for (ll j = i + 1; j <= e; ++j) {
mn = min(mn, (i * j) % MOD);
}
}
cout << mn;
return 0;
} | replace | 34 | 35 | 34 | 35 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 2019
int main() {
long long l, r, minv;
cin >> l >> r;
minv = l * (l + 1) % MOD;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
minv = min(minv, (i * j) % MOD);
if (minv == 0)
break;
}
}
cout << minv << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 2019
int main() {
long long l, r, minv;
cin >> l >> r;
minv = l * (l + 1) % MOD;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
minv = min(minv, (i * j) % MOD);
if (minv == 0)
break;
}
if (minv == 0)
break;
}
cout << minv << '\n';
return 0;
}
| insert | 13 | 13 | 13 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
#define rep(i, j, n) for (ll i = (j); i < (n); i++)
#define per(i, n, j) for (ll i = (n); i >= (j); i--)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
ll l, r;
int main() {
cin >> l >> r;
ll ans = INF;
rep(i, l, min(l + 2019, r)) {
rep(j, l + 1, min(l + 2020, r + 1)) {
ll num = (i % 2019) * (j % 2019);
while (num >= 2019)
num % 2019;
chmin(ans, (i % 2019) * (j % 2019));
}
}
/*if(l%2019==0 ||l%2019>=r%2019 || r-l>=2019) ans=0;
else{
ll num;
num=l%2019*(l+1)%2019;
if(num<2019) ans=num;
else ans=num%2019;
}*/
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using ll = long long;
#define rep(i, j, n) for (ll i = (j); i < (n); i++)
#define per(i, n, j) for (ll i = (n); i >= (j); i--)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
ll l, r;
int main() {
cin >> l >> r;
ll ans = INF;
rep(i, l, min(l + 2019, r)) {
rep(j, l + 1, min(l + 2020, r + 1)) {
ll num = (i * j) % 2019;
chmin(ans, num);
}
}
/*if(l%2019==0 ||l%2019>=r%2019 || r-l>=2019) ans=0;
else{
ll num;
num=l%2019*(l+1)%2019;
if(num<2019) ans=num;
else ans=num%2019;
}*/
cout << ans << "\n";
return 0;
}
| replace | 28 | 32 | 28 | 30 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
ll l, r;
cin >> l >> r;
if (l - r >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 3000;
for (ll i = l; i <= r - 1; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 3000;
for (ll i = l; i <= r - 1; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mod (ll)2019
#define inf (ll)(3e18 + 7)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
ll L, R, m = inf;
cin >> L >> R;
for (int i = 0; i < 1000000000; i += 2019) {
if (i >= L && i <= R) {
cout << 0;
exit(0);
}
}
int x = L % mod, y = R - (L - x);
for (int i = x; i < y; i++) {
for (int j = i + 1; j <= y; j++) {
m = min(m, ((i % mod) * (j % mod)) % mod);
}
}
cout << m;
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mod (ll)2019
#define inf (ll)(3e18 + 7)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
ll L, R, m = inf;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0;
exit(0);
}
int x = L % mod, y = R - (L - x);
for (int i = x; i < y; i++) {
for (int j = i + 1; j <= y; j++) {
m = min(m, ((i % mod) * (j % mod)) % mod);
}
}
cout << m;
}
| replace | 13 | 18 | 13 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll L;
ll R;
cin >> L >> R;
if (R - L > 2019) {
cout << 0 << endl;
}
ll ans = INF;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
ll temp;
temp = ((i % 2019) * (j % 2019)) % 2019;
ans = min(ans, temp);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll L;
ll R;
cin >> L >> R;
if (R - L > 2019) {
cout << 0 << endl;
return 0;
}
ll ans = INF;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
ll temp;
temp = ((i % 2019) * (j % 2019)) % 2019;
ans = min(ans, temp);
}
}
cout << ans << endl;
return 0;
} | insert | 18 | 18 | 18 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r / 2019 - l / 2019) {
cout << 0 << endl;
}
long long i, j;
long long min = l * r % 2019;
long long temp;
for (i = l; i <= r - 1; ++i) {
for (j = i + 1; j <= r; ++j) {
temp = i * j % 2019;
if (temp < min) {
min = temp;
}
}
}
cout << min << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r / 2019 - l / 2019) {
cout << 0 << endl;
return 0;
}
long long i, j;
long long min = l * r % 2019;
long long temp;
for (i = l; i <= r - 1; ++i) {
for (j = i + 1; j <= r; ++j) {
temp = i * j % 2019;
if (temp < min) {
min = temp;
}
}
}
cout << min << endl;
return 0;
} | insert | 10 | 10 | 10 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void co(First first, Rest... rest) {
cout << first << " ";
co(rest...);
return;
}
#define ll long long
#define ld long double
#define st string
#define dl double
#define wh while
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define tp tuple
#define ft first
#define sc second
#define ve vector
#define tos to_string
#define len length
#define rt return 0
#define gcd __gcd
#define lcm(n, m) (n * m / gcd(n, m))
#define np next_permutation
#define repi(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) repi(i, 0, n)
#define repill(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repll(i, n) repill(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for (auto &&i : n)
#define so(n) sort(n.begin(), n.end())
#define rev(n) reverse(n.begin(), n.end())
#define sp(n) cout << fixed << setprecision(n)
#pragma endregion
// sqrt ルート, int 2*10^9, gcd 最大公約数
int main() {
ll L, R, a = 2018;
ci(L, R);
repill(i, L, R + 1) {
repill(j, L, R + 1) {
if (i % 2019 == 0) {
co(0);
rt;
} else if (i != j) {
a = min(a, ((i % 2019) * ((j) % 2019)) % 2019);
}
}
}
co(a);
} | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void co(First first, Rest... rest) {
cout << first << " ";
co(rest...);
return;
}
#define ll long long
#define ld long double
#define st string
#define dl double
#define wh while
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define tp tuple
#define ft first
#define sc second
#define ve vector
#define tos to_string
#define len length
#define rt return 0
#define gcd __gcd
#define lcm(n, m) (n * m / gcd(n, m))
#define np next_permutation
#define repi(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) repi(i, 0, n)
#define repill(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repll(i, n) repill(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for (auto &&i : n)
#define so(n) sort(n.begin(), n.end())
#define rev(n) reverse(n.begin(), n.end())
#define sp(n) cout << fixed << setprecision(n)
#pragma endregion
// sqrt ルート, int 2*10^9, gcd 最大公約数
int main() {
ll L, R, a = 2018;
ci(L, R);
repi(i, L, R) {
if (i % 2019 == 0) {
co(0);
rt;
}
}
repill(i, L % 2019, R % 2019 + 1) {
repill(j, L % 2019, R % 2019 + 1) {
if (i != j) {
a = min(a, (i * j) % 2019);
}
}
}
co(a);
} | replace | 52 | 59 | 52 | 62 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
inline int scan() { return getchar(); }
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(unsigned &a) { scanf("%u", &a); }
inline void scan(long &a) { scanf("%ld", &a); }
inline void scan(long long &a) { scanf("%lld", &a); }
inline void scan(unsigned long long &a) { scanf("%llu", &a); }
inline void scan(char &a) { cin >> a; }
inline void scan(float &a) { scanf("%f", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(long double &a) { scanf("%Lf", &a); }
inline void scan(vector<bool> &vec) {
for (unsigned i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(string &a) { cin >> a; }
template <class T> inline void scan(vector<T> &vec);
template <class T, size_t size> inline void scan(array<T, size> &vec);
template <class T, class L> inline void scan(pair<T, L> &p);
template <class T, size_t size> inline void scan(T (&vec)[size]);
template <class T> inline void scan(vector<T> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, size_t size> inline void scan(array<T, size> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, class L> inline void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> inline void scan(T (&vec)[size]) {
for (auto &i : vec)
scan(i);
}
template <class T> inline void scan(T &a) { cin >> a; }
inline void in() {}
template <class Head, class... Tail> inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using Graph = vector<vector<int>>;
/* 4方向への隣接頂点への移動を表すベクトル */
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
int main() {
LL(L);
LL(R);
if (L - R >= 2020) {
cout << 0 << endl;
return 0;
} else {
ll ans = 2018;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ll tmp = i * j % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
inline int scan() { return getchar(); }
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(unsigned &a) { scanf("%u", &a); }
inline void scan(long &a) { scanf("%ld", &a); }
inline void scan(long long &a) { scanf("%lld", &a); }
inline void scan(unsigned long long &a) { scanf("%llu", &a); }
inline void scan(char &a) { cin >> a; }
inline void scan(float &a) { scanf("%f", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(long double &a) { scanf("%Lf", &a); }
inline void scan(vector<bool> &vec) {
for (unsigned i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(string &a) { cin >> a; }
template <class T> inline void scan(vector<T> &vec);
template <class T, size_t size> inline void scan(array<T, size> &vec);
template <class T, class L> inline void scan(pair<T, L> &p);
template <class T, size_t size> inline void scan(T (&vec)[size]);
template <class T> inline void scan(vector<T> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, size_t size> inline void scan(array<T, size> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, class L> inline void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> inline void scan(T (&vec)[size]) {
for (auto &i : vec)
scan(i);
}
template <class T> inline void scan(T &a) { cin >> a; }
inline void in() {}
template <class Head, class... Tail> inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using Graph = vector<vector<int>>;
/* 4方向への隣接頂点への移動を表すベクトル */
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
int main() {
LL(L);
LL(R);
if (R - L >= 2020) {
cout << 0 << endl;
return 0;
} else {
ll ans = 2018;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ll tmp = i * j % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
}
} | replace | 101 | 102 | 101 | 102 | TLE | |
p02983 | C++ | Time Limit Exceeded | // 自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define MODA 1000000007
int main() {
int ans = 30000;
int l, r;
cin >> l >> r;
int mo[2019] = {};
if (l - r + 1 >= 2019) {
cout << 0 << endl;
return 0;
} else {
for (int i = l; i <= r; i++) {
mo[i % 2019]++;
}
for (int j = 0; j < 2019; j++) {
for (int k = j + 1; k < 2019; k++) {
if (mo[j] == 0 || mo[k] == 0)
continue;
ans = min(ans, (j * k) % 2019);
}
}
cout << ans << endl;
}
} | // 自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define MODA 1000000007
int main() {
int ans = 30000;
int l, r;
cin >> l >> r;
int mo[2019] = {};
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
} else {
for (int i = l; i <= r; i++) {
mo[i % 2019]++;
}
for (int j = 0; j < 2019; j++) {
for (int k = j + 1; k < 2019; k++) {
if (mo[j] == 0 || mo[k] == 0)
continue;
ans = min(ans, (j * k) % 2019);
}
}
cout << ans << endl;
}
} | replace | 18 | 19 | 18 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll l, r;
cin >> l >> r;
r = min(r, r + 4038);
int ans = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
int tmp = i * j % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
int tmp = i * j % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long l, r, i, j, ans = 100009;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
ans = min(ans, (long long)(i * j) % 2019);
}
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long l, r, i, j, ans = 100009;
cin >> l >> r;
for (i = l; i <= min(l + 2020, r); i++) {
for (j = i + 1; j <= min(i + 2020, r); j++) {
ans = min(ans, (long long)(i * j) % 2019);
}
}
cout << ans << '\n';
}
| replace | 8 | 10 | 8 | 10 | 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 = 3000;
for (long long int ii = L; ii <= R; ii++) {
for (long long int jj = ii + 1; jj <= min(R, ii + 1 + 2019); jj++) {
ans = min(ans, (ii * jj) % 2019);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
long long int ans = 3000;
for (long long int ii = L; ii <= min(R, L + 2019); ii++) {
for (long long int jj = ii + 1; jj <= min(R, ii + 1 + 2019); jj++) {
ans = min(ans, (ii * jj) % 2019);
}
}
cout << ans << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll L, R;
cin >> L >> R;
ll num;
ll subLR = R - L;
L %= 2019;
R %= 2019;
ll xmin = L * R;
REP(i, L, L + subLR) {
REP(j, i + 1, L + subLR + 1) {
num = i * j;
num %= 2019;
xmin = min(num, xmin);
}
}
cout << xmin % 2019 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll L, R;
cin >> L >> R;
ll num;
ll subLR = R - L;
subLR = min(subLR, (ll)2019);
L %= 2019;
R %= 2019;
ll xmin = L * R;
REP(i, L, L + subLR) {
REP(j, i + 1, L + subLR + 1) {
num = i * j;
num %= 2019;
xmin = min(num, xmin);
}
}
cout << xmin % 2019 << endl;
return 0;
} | insert | 16 | 16 | 16 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
if (L - R >= 2018) {
cout << 0 << endl;
return 0;
}
int out = 10000;
for (long long int i = L; i < R + 1; i++) {
for (long long int j = i + 1; j < R + 1; j++) {
int tmpout = (i * j) % 2019;
if (out > tmpout) {
out = tmpout;
}
}
}
cout << out << endl;
return 0;
}
| #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
if (L - R >= 2018) {
cout << 0 << endl;
return 0;
}
int out = 10000;
for (long long int i = L; i < R + 1; i++) {
for (long long int j = i + 1; j < R + 1; j++) {
int tmpout = (i * j) % 2019;
if (out > tmpout) {
out = tmpout;
if (out == 0) {
cout << 0 << endl;
return 0;
}
}
}
}
cout << out << endl;
return 0;
}
| insert | 17 | 17 | 17 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include "stdio.h"
#include <math.h>
#include <stdlib.h>
int main() {
int L, R;
scanf("%d %d", &L, &R);
int valid[2019];
for (int i = 0; i < 2019; i++) {
valid[i] = 0;
}
int mod = 0;
for (int i = L; i <= R; i++) {
mod = i % 2019;
if (valid[mod] < 2) {
valid[mod]++;
}
}
int min_value = 2019 * 2019;
for (int i = 0; i < 2019; i++) {
if (valid[i] == 0) {
continue;
}
for (int j = 0; j < 2019; j++) {
if (j == i) {
if (valid[j] <= 1) {
continue;
}
} else {
if (valid[j] == 0) {
continue;
}
}
if (j * i % 2019 < min_value) {
min_value = j * i % 2019;
}
}
}
printf("%d\n", min_value);
} | #include "stdio.h"
#include <math.h>
#include <stdlib.h>
int main() {
int L, R;
scanf("%d %d", &L, &R);
int valid[2019];
for (int i = 0; i < 2019; i++) {
valid[i] = 0;
}
int mod = 0;
if (R - L > 2019 * 2) {
for (int i = 0; i < 2019; i++) {
valid[i] = 2;
}
} else {
for (int i = L; i <= R; i++) {
mod = i % 2019;
if (valid[mod] < 2) {
valid[mod]++;
}
}
}
int min_value = 2019 * 2019;
for (int i = 0; i < 2019; i++) {
if (valid[i] == 0) {
continue;
}
for (int j = 0; j < 2019; j++) {
if (j == i) {
if (valid[j] <= 1) {
continue;
}
} else {
if (valid[j] == 0) {
continue;
}
}
if (j * i % 2019 < min_value) {
min_value = j * i % 2019;
}
}
}
printf("%d\n", min_value);
} | replace | 13 | 17 | 13 | 23 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int main() {
ll L, R, res;
cin >> L >> R;
ll iMin = 2020;
for (ll i = L; i <= R - 1; ++i) {
for (ll j = L + 1; j <= R; ++j) {
iMin = min(iMin, (i * j) % 2019);
}
}
cout << iMin << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int main() {
ll L, R, res;
cin >> L >> R;
ll iMin = 2020;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
for (ll i = L; i <= R; ++i) {
if (i % 2019 == 0) {
cout << 0 << endl;
return 0;
}
}
for (ll i = L; i <= R - 1; ++i) {
for (ll j = L + 1; j <= R; ++j) {
iMin = min(iMin, (i * j) % 2019);
}
}
cout << iMin << endl;
return 0;
}
| insert | 19 | 19 | 19 | 30 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int main() {
ll L, R;
cin >> L >> R;
ll iMin = 2020;
for (ll i = L; i <= R - 1; ++i) {
for (ll j = i + 1; j <= R; ++j) {
iMin = min(iMin, (i * j) % 2019);
// 2019で割れる値
if (iMin == 0)
break;
}
}
cout << iMin << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int main() {
ll L, R;
cin >> L >> R;
ll iMin = 2020;
for (ll i = L; i <= R - 1; ++i) {
for (ll j = i + 1; j <= R; ++j) {
iMin = min(iMin, (i * j) % 2019);
// 2019で割れる値
if (iMin == 0)
break;
}
if (iMin == 0)
break;
}
cout << iMin << endl;
return 0;
}
| insert | 25 | 25 | 25 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#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;
// map<ll,ll> ma;
int ma[2019] = {0};
for (int i = l; i <= r; ++i) {
int m = i % MOD;
ma[m]++;
}
ll res = 30000;
for (int i = 0; i < 2019; ++i) {
if (ma[i] == 0)
continue;
for (int j = 0; j < 2019; ++j) {
if (ma[j] == 0)
continue;
if (i == j && ma[i] <= 1)
continue;
res = min(res, (i * j) % MOD);
if (res == 0) {
cout << res << endl;
return 0;
}
}
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#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;
// map<ll,ll> ma;
int ma[2019] = {0};
for (int i = l; i <= r && i <= l + 2019 * 4; ++i) {
int m = i % MOD;
ma[m]++;
}
ll res = 30000;
for (int i = 0; i < 2019; ++i) {
if (ma[i] == 0)
continue;
for (int j = 0; j < 2019; ++j) {
if (ma[j] == 0)
continue;
if (i == j && ma[i] <= 1)
continue;
res = min(res, (i * j) % MOD);
if (res == 0) {
cout << res << endl;
return 0;
}
}
}
cout << res << endl;
return 0;
}
| replace | 22 | 23 | 22 | 23 | TLE | |
p02983 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007LL)
static SQWORD addMod(SQWORD x, SQWORD y) { return (x + y) % ANS_MOD; }
static SQWORD subMod(SQWORD x, SQWORD y) { return (x - y + ANS_MOD) % ANS_MOD; }
static SQWORD mulMod(SQWORD x, SQWORD y) { return (x * y) % ANS_MOD; }
static SQWORD powMod(SQWORD x, SQWORD e) {
SQWORD v = 1;
for (; e; x = mulMod(x, x), e >>= 1) {
if (e & 1) {
v = mulMod(v, x);
}
}
return v;
}
static SQWORD divMod(SQWORD x, SQWORD y) {
return mulMod(x, powMod(y, ANS_MOD - 2));
}
static SQWORD combMod(SQWORD n, SQWORD k) {
SQWORD v = 1;
for (SQWORD i = 1; i <= k; i++) {
v = divMod(mulMod(v, n - i + 1), i);
}
return v;
}
/*----------------------------------------------*/
int main(void) {
SQWORD sqInput_L = inputSQWORD();
SQWORD sqInput_R = inputSQWORD();
SQWORD sqAns = 2019;
for (SQWORD sqR = sqInput_L + 1; sqR <= sqInput_R; sqR++) {
for (SQWORD sqL = sqInput_L; sqL < sqR; sqL++) {
sqAns = min(sqAns, ((sqL * sqR) % 2019));
if (0 == sqAns) {
break;
}
}
}
printf("%lld\n", sqAns);
return 0;
} | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007LL)
static SQWORD addMod(SQWORD x, SQWORD y) { return (x + y) % ANS_MOD; }
static SQWORD subMod(SQWORD x, SQWORD y) { return (x - y + ANS_MOD) % ANS_MOD; }
static SQWORD mulMod(SQWORD x, SQWORD y) { return (x * y) % ANS_MOD; }
static SQWORD powMod(SQWORD x, SQWORD e) {
SQWORD v = 1;
for (; e; x = mulMod(x, x), e >>= 1) {
if (e & 1) {
v = mulMod(v, x);
}
}
return v;
}
static SQWORD divMod(SQWORD x, SQWORD y) {
return mulMod(x, powMod(y, ANS_MOD - 2));
}
static SQWORD combMod(SQWORD n, SQWORD k) {
SQWORD v = 1;
for (SQWORD i = 1; i <= k; i++) {
v = divMod(mulMod(v, n - i + 1), i);
}
return v;
}
/*----------------------------------------------*/
int main(void) {
SQWORD sqInput_L = inputSQWORD();
SQWORD sqInput_R = inputSQWORD();
SQWORD sqAns = 2019;
for (SQWORD sqR = sqInput_L + 1; sqR <= sqInput_R; sqR++) {
for (SQWORD sqL = sqInput_L; sqL < sqR; sqL++) {
sqAns = min(sqAns, ((sqL * sqR) % 2019));
if (0 == sqAns) {
printf("%lld\n", sqAns);
return 0;
}
}
}
printf("%lld\n", sqAns);
return 0;
} | replace | 210 | 211 | 210 | 212 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
struct edge {
ll to;
char cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
// 入力
int H, W;
vector<vector<char>> field;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 深さ優先探索
vector<bool> seen;
vector<int> colors;
int N;
int main(void) {
ll L, R;
cin >> L >> R;
const int _mod = 2019;
ll modL = L % _mod;
ll modR = R % _mod;
ll diff = (R / _mod) - (L / _mod);
int ans = _mod;
for (int i = L; i < R; i++) {
for (int j = L + 1; j <= R; j++) {
ans = min(ans, ((i % _mod) * (j % _mod) % _mod));
if (ans == 0)
break;
// cout << i << " " << j << endl;
}
}
cout << ans << endl;
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/
| #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
struct edge {
ll to;
char cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
// 入力
int H, W;
vector<vector<char>> field;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 深さ優先探索
vector<bool> seen;
vector<int> colors;
int N;
int main(void) {
ll L, R;
cin >> L >> R;
const int _mod = 2019;
if (R - L > 1e4) {
cout << 0 << endl;
return 0;
}
int ans = _mod;
for (int i = L; i < R; i++) {
for (int j = L + 1; j <= R; j++) {
ans = min(ans, ((i % _mod) * (j % _mod) % _mod));
if (ans == 0)
break;
// cout << i << " " << j << endl;
}
}
cout << ans << endl;
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/
| replace | 35 | 38 | 35 | 40 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int INF = 2000000;
bool w[105];
vector<int> v[105];
int main() {
ll l, r;
cin >> l >> r;
ll nin = INF;
while (r > l + 2019 * 10) {
l -= 2019 * 10;
}
while (r > l + 2019) {
l -= 2019;
}
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
nin = min(nin, (i * j) % 2019);
}
}
cout << nin << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int INF = 2000000;
bool w[105];
vector<int> v[105];
int main() {
ll l, r;
cin >> l >> r;
ll nin = INF;
if (r > l + 2019) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
nin = min(nin, (i * j) % 2019);
}
}
cout << nin << endl;
return 0;
}
| replace | 13 | 18 | 13 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll l, r;
cin >> l >> r;
ll ans;
ll modans = LLONG_MAX;
for (ll x = l; x < r; x++) {
for (ll y = x + 1; y <= r; y++) {
ans = (x * y);
modans = min(modans, (ans % 2019));
}
}
cout << modans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll l, r;
cin >> l >> r;
if ((r - l) >= 2019) {
cout << 0;
return 0;
}
l = l % 2019;
r = r % 2019;
ll ans;
ll modans = LLONG_MAX;
for (ll x = l; x < r; x++) {
for (ll y = x + 1; y <= r; y++) {
ans = (x * y);
modans = min(modans, (ans % 2019));
}
}
cout << modans;
} | insert | 8 | 8 | 8 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using P = pair<ll, ll>;
// constexpr ll mod = 998244353;
constexpr ll mod = 1e9 + 7;
const double PI = acos(-1.0);
mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
}
vector<int> vec;
for (int i = l; i <= r; i++) {
vec.push_back(i % 2019);
}
int ans = INT_MAX;
int n = vec.size();
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
chmin(ans, vec[i] * vec[j] % 2019);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using P = pair<ll, ll>;
// constexpr ll mod = 998244353;
constexpr ll mod = 1e9 + 7;
const double PI = acos(-1.0);
mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
vector<int> vec;
for (int i = l; i <= r; i++) {
vec.push_back(i % 2019);
}
int ans = INT_MAX;
int n = vec.size();
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
chmin(ans, vec[i] * vec[j] % 2019);
}
}
cout << ans << endl;
} | insert | 47 | 47 | 47 | 48 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long m = LLONG_MAX;
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long c = (i * j) % 2019;
m = min(m, c);
}
}
cout << m << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
L = L;
R = min(R, L + 2019);
long long m = 2018;
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
long long c = (i * j) % 2019;
m = min(m, c);
}
}
cout << m << endl;
return 0;
} | replace | 14 | 15 | 14 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#define int long long
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
if (l - r > 2019)
cout << 0 << endl;
else {
int ans = 2020;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, i % 2019 * j % 2019);
}
}
cout << ans << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#define int long long
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
if (r - l > 2019)
cout << 0 << endl;
else {
int ans = 2020;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, i % 2019 * j % 2019);
}
}
cout << ans << endl;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 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 cnt = 2019;
bool t = false;
for (ll i = 0; i < r - l; i++) {
for (ll j = 1; j < r - l + 1; j++) {
if ((l + i) * (l + j) == 0) {
cnt = 0;
t = true;
break;
} else {
cnt = min((l + i) * (l + j) % 2019, cnt);
}
}
if (t)
break;
}
cout << cnt << endl;
return 0;
} | #include <bits //stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll cnt = 2019;
bool t = false;
for (ll i = 0; i < r - l; i++) {
for (ll j = 1; j < r - l + 1; j++) {
if ((l + i) * (l + j) % 2019 == 0) {
cnt = 0;
t = true;
break;
} else {
cnt = min((l + i) * (l + j) % 2019, cnt);
}
}
if (t)
break;
}
cout << cnt << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a[1001][1001];
int main() {
int a, b;
cin >> a >> b;
int ans = 2020;
for (int i = a; i < b; i++) {
for (int j = i + 1; j <= b; j++) {
ans = min((i % 2019) * (j % 2019) % 2019, ans);
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[1001][1001];
int main() {
int a, b;
cin >> a >> b;
int ans = 2020;
for (int i = a; i < b; i++) {
for (int j = i + 1; j <= b; j++) {
if (ans != 0)
ans = min((i % 2019) * (j % 2019) % 2019, ans);
else {
cout << ans;
return 0;
}
}
}
cout << ans;
return 0;
} | replace | 11 | 12 | 11 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int exists[2019];
int l, r, min;
cin >> l >> r;
for (int i = 0; i < 2019; i++) {
exists[i] = 0;
}
for (int i = l; i <= r; i++) {
exists[i % 2019] = 1;
}
min = 2019;
for (int i = 0; i < 2018; i++) {
if (exists[i]) {
for (int j = i + 1; j < 2019; j++) {
if (exists[j]) {
int rem = (i * j) % 2019;
if (rem < min) {
min = rem;
}
}
}
}
}
cout << min << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int exists[2019];
int l, r, min;
cin >> l >> r;
for (int i = 0; i < 2019; i++) {
exists[i] = 0;
}
for (int i = l; i <= r && i <= l + 2019; i++) {
exists[i % 2019] = 1;
}
min = 2019;
for (int i = 0; i < 2018; i++) {
if (exists[i]) {
for (int j = i + 1; j < 2019; j++) {
if (exists[j]) {
int rem = (i * j) % 2019;
if (rem < min) {
min = rem;
}
}
}
}
}
cout << min << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const int INF = 0x3fffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
int main() {
ll l, r, ans = 0;
cin >> l >> r;
if ((r < l + 2019) || (l % 2019 < r % 2019)) {
ans = 2019;
REP(i, l, r) {
REP(j, i + 1, r + 1) { ans = min(ans, i * j % 2019); }
}
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const int INF = 0x3fffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
int main() {
ll l, r, ans = 0;
cin >> l >> r;
if (r < l + 2019) {
if (l % 2019 < r % 2019) {
ans = 2019;
REP(i, l, r) {
REP(j, i + 1, r + 1) { ans = min(ans, i * j % 2019); }
}
}
}
cout << ans << "\n";
} | replace | 28 | 32 | 28 | 34 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.