fork download
copy 
  1. #pragma GCC optimize("Ofast,unroll-loops")
  2. #include <climits>
  3. #include <unordered_map>
  4. #include <random>
  5. #include <chrono>
  6. #include <numeric>
  7. #include <iostream>
  8. #include <vector>
  9. #include <algorithm>
  10. #include <map>
  11. #include <queue>
  12. #include <deque>
  13. #include <stack>
  14. #include <functional>
  15. #include <bitset>
  16. #include <string>
  17. #include <sstream>
  18. #include <fstream>
  19. #include <iomanip>
  20. #include <cmath>
  21. #include <cassert>
  22. #include <list>
  23. #include <forward_list>
  24. #include <set>
  25. #include <unordered_set>
  26. #include <cstdint>
  27. #include <utility>
  28. #pragma GCC target("avx2,fma")
  29.  
  30. using namespace std;
  31.  
  32. using ll = long long;
  33. using ld = long double;
  34. using ull = unsigned long long;
  35.  
  36. #define all(x) begin(x), end(x)
  37. #define X first
  38. #define Y second
  39. #define isz(x) ((int)size(x))
  40.  
  41. const int MOD = 2025;
  42.  
  43. void solve() {
  44.   ll l, r;
  45.   cin >> l >> r;
  46.   if (r - l < MOD) {
  47.     pair<ll, ll> ans = {l, r};
  48.     for (ll i = l; i < r; ++i) {
  49.       for (ll j = i + 1; j <= r; ++j) {
  50.         if (ans.X % MOD * (ans.Y % MOD) % MOD > i % MOD * (j % MOD) % MOD) {
  51.           ans = {i, j};
  52.         }
  53.       }
  54.     }
  55.     cout << ans.X << ' ' << ans.Y << '\n';
  56.   } else {
  57.     while (l % MOD) ++l;
  58.     cout << l << ' ' << r << '\n';
  59.   }
  60. }
  61.  
  62. signed main() {
  63.   cin.tie(0)->sync_with_stdio(0);
  64.   #ifdef LOCAL
  65.     freopen("in.txt", "r", stdin);
  66.     freopen("out.txt", "w", stdout);
  67.   #endif
  68.   int t = 1;
  69.   // cin >> t;
  70.   while (t --> 0) solve();
  71.   return 0;
  72. }
Success #stdin #stdout 0s 5292KB
comments (?)
stdin
copy 
1 2026
stdout
copy 
2025 2026
https://ideone.com/P1akDh
language:
C++14 (gcc 8.3)
created:
13 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!