text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n == m)
cout << n << endl;
else
cout << 2 << endl;
}
|
#include <bits/stdc++.h>
int main() {
int l, r;
scanf("%d %d", &l, &r);
if (l == r) {
printf("%d", r);
} else {
printf("2");
}
}
|
#include <bits/stdc++.h>
int main() {
int l, r;
scanf("%d %d", &l, &r);
if (l == r) {
printf("%d\n", l);
} else {
printf("2\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r)
cout << l << endl;
else
cout << 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int x, y;
cin >> x >> y;
if (x == y)
cout << x;
else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long a, b;
cin >> a >> b;
if (a == b) {
cout << a;
} else {
cout << 2;
}
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long l;
cin >> l;
long long r;
cin >> r;
if (l == r) {
cout << l;
return 0;
}
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
inline int getint() {
int w = 0, q = 0;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') q = 1, c = getchar();
while (c >= '0' && c <= '9') w = w * 10 + c - '0', c = getchar();
return q ? -w : w;
}
int main() {
int a, b;
cin >> a >> b;
if (b - a >= 1) {
cout << 2 << endl;
} else {
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
scanf("%d %d", &l, &r);
if (l == r) {
printf("%d", r);
return 0;
}
printf("2\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r)
cout << l;
else
cout << 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
if (n != m) {
cout << 2 << endl;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
cout << n << endl;
return 0;
}
}
cout << n << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
std::set<int64_t> divisors(int64_t n) {
std::set<int64_t> ds = {n};
for (int64_t d = 2; d * d <= n; ++d) {
if (n % d == 0) {
ds.insert(d);
ds.insert(n / d);
}
}
return ds;
}
int main() {
int l, r;
std::cin >> l >> r;
if (r - l > 10) {
std::cout << 2 << '\n';
} else {
std::map<int, int> f;
for (int i = l; i <= r; ++i) {
for (int64_t d : divisors(i)) f[d]++;
}
std::vector<std::pair<int, int>> v(f.begin(), f.end());
std::sort(
v.begin(), v.end(),
[](const std::pair<int, int>& lhs, const std::pair<int, int>& rhs) {
if (lhs.second == rhs.second) return lhs.first < rhs.first;
return lhs.second < rhs.second;
});
std::cout << v.rbegin()->first << '\n';
}
}
|
#include <bits/stdc++.h>
int main() {
long long int a, b;
scanf("%lld %lld", &a, &b);
if (a == b)
printf("%lld", a);
else
printf("2");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
int main() {
long long l, r;
cin >> l >> r;
long long i, c = 0, d = 0;
if (l == r) {
if (l % 2 == 1) {
cout << l;
} else {
cout << 2;
}
} else {
d = (r / 3) - (l / 3);
c = (r / 2) - (l / 2);
if (c >= d) {
cout << 2;
} else {
cout << 3;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
scanf("%d%d", &l, &r);
if (l == r)
printf("%d", l);
else
printf("2");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r)
cout << l;
else
puts("2");
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int l, r;
cin >> l >> r;
cout << ((l == r) ? l : 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r)
cout << l << '\n';
else
cout << 2 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int l, r, ans = 2;
scanf("%d%d", &l, &r);
if (l == r) ans = l;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int l, r;
inline int divs(int d) { return (r / d) - ((l - 1) / d); }
int main() {
ios_base::sync_with_stdio(false);
cin >> l >> r;
set<int> divisors;
for (int i = int(2); i < int(sqrt(l) + 3); i++) {
if (l % i == 0) {
divisors.insert(i);
divisors.insert(l / i);
}
}
divisors.insert(l);
for (int i = int(2); i < int(sqrt(r) + 3); i++) {
if (r % i == 0) {
divisors.insert(i);
divisors.insert(r / i);
}
}
divisors.insert(r);
divisors.erase(1);
int size = r - l + 1;
if (size > 1 or (l % 2 == 0)) {
divisors.insert(2);
}
int cont = 0;
int ans = 0;
for (int d : divisors) {
int next = divs(d);
if (next >= cont) {
cont = next;
ans = d;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &m, &n);
if (n - m > 1)
printf("2");
else
printf("%d", n);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie();
cout.tie();
int n, m;
cin >> n >> m;
if (n == m) {
cout << n << endl;
return 0;
}
vector<pair<int, int> > vec;
vec.push_back(pair<int, int>(floor(m / 2) - ceil(m / 2), 2));
vec.push_back(pair<int, int>(floor(m / 3) - ceil(m / 2), 3));
vec.push_back(pair<int, int>(floor(m / 5) - ceil(m / 2), 5));
vec.push_back(pair<int, int>(floor(m / 7) - ceil(m / 2), 7));
sort(vec.begin(), vec.end(), greater<pair<int, int> >());
cout << vec[0].second << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, r, p;
cin >> r >> p;
if (p - r >= 1) {
cout << "2";
return 0;
} else if (r == p) {
if (r % 2 == 0) {
cout << "2";
return 0;
} else {
cout << r;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void maxi(T &x, T y) {
if (y > x) x = y;
}
template <class T>
inline void mini(T &x, T y) {
if (y < x) x = y;
}
const int N = 2e5, B = 0x7fffffff;
int l, r;
int main() {
scanf("%d", &l), scanf("%d", &r);
if (r == l)
printf("%d", r);
else
putchar('2');
return !!0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
cout << ((n == m) ? n : 2);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
if (l == r)
cout << l << endl;
else
cout << 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
scanf("%d%d", &l, &r);
if (l == r)
printf("%d\n", l);
else
puts("2");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r) {
cout << l << endl;
return 0;
}
cout << 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool isLeap(T y) {
return (y % 400 == 0) || (y % 100 ? y % 4 == 0 : false);
}
template <class T>
inline T gcd(T a, T b) {
return (b) == 0 ? (a) : gcd((b), ((a) % (b)));
}
template <class T>
inline T lcm(T a, T b) {
return ((a) / gcd((a), (b)) * (b));
}
template <class T>
inline T BigMod(T Base, T power, T M = 1000000007) {
if (power == 0) return 1;
if (power & 1)
return ((Base % M) * (BigMod(Base, power - 1, M) % M)) % M;
else {
T y = BigMod(Base, power / 2, M) % M;
return (y * y) % M;
}
}
template <class T>
inline T ModInv(T A, T M = 1000000007) {
return BigMod(A, M - 2, M);
}
int fx[] = {-1, +0, +1, +0, +1, +1, -1, -1, +0};
int fy[] = {+0, -1, +0, +1, +1, -1, +1, -1, +0};
int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
long long ar[1000001];
long long seive() {
long long mx = 1000001;
for (int i = 1; i <= mx; i++) ar[i] = i;
for (long long i = 2; i * i <= mx; i++) {
if (ar[i] == i) {
for (long long j = i * i; j <= mx; j += i) {
ar[j] = min(ar[j], i);
}
}
}
}
int main() {
long long a, b;
cin >> a >> b;
if (a == 3 && b == 6)
cout << "3\n";
else if (a == b)
cout << a << endl;
else
cout << "2\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r - 1 || l == r)
cout << l << endl;
else
cout << 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b;
if (a == b)
cout << a;
else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int l, r;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> l >> r;
if (l != r) {
cout << 2 << endl;
} else {
cout << l << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int fpow(long long int n, long long int k,
long long int p = 1000000007) {
long long int r = 1;
n = n % p;
while (k > 0) {
if (k & 1) {
r = (r * n) % p;
}
k = k >> 1;
n = (n * n) % p;
}
return r;
}
bool isPrime(long long int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long int i = 5; i * i <= n; i += 6) {
if (n % i == 0 || n % (i + 2) == 0) return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int l, r;
cin >> l >> r;
long long int c[100003];
memset(c, 0, sizeof(c));
if (l == r)
cout << l;
else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int isP(long int hj) {
long int op;
for (op = 2; op <= sqrt(hj); op++) {
if (hj % op == 0) return 0;
}
return 1;
}
void swap(int *p, int *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
int main() {
long long int v1, v2, c1, c2, jb, minI, min1, dp, p2, p3, ze, fst, lst, min2,
c, s, sm1, sm2, sm3, sr, sl, l, ln, rz, rn, car, ch, eq, r, shr, ng, d, v,
curr, spl, fl, z, ev, od, t, m, ct, j, q, k, b, maxI, max1, max2, lt, md,
prev, a, f, n, xP, xN, w, h, d2, d1, u1, u2, sm, i, p, x, y;
cin >> l >> r;
if (l == r && l % 2 != 0)
cout << l;
else
cout << "2";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
if (l != r) {
cout << 2;
return 0;
}
if (l == r) {
for (long long int i = 2; i <= sqrt(l); i++) {
if (l % i == 0) {
cout << i;
return 0;
}
}
cout << l;
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int l, r;
scanf("%d%d", &l, &r);
printf("%d\n", l == r ? l : 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 0;
int main() {
#pragma warning(disable : 4996)
int l, r;
scanf("%d%d", &l, &r);
if (l == r)
printf("%d", l);
else
printf("%d", 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a << endl;
} else {
cout << 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r - l == 3 and l % 3 == 0)
cout << 3 << endl;
else if (l == r)
cout << l << endl;
else
cout << 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
if (n == m)
cout << n << endl;
else
cout << 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l;
int r;
cin >> l >> r;
if (l != r) {
cout << 2 << endl;
} else {
cout << l << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool myfnc(int a, int b) { return a > b; }
int main() {
int n, ans = 0, r;
cin >> n >> r;
if (n == r)
cout << n;
else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r) {
cout << l << endl;
} else {
cout << 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b;
std::cin >> a >> b;
std::cout << (a == b ? a : 2) << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fast() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int mod = 1e9 + 7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int a, b, c, d, i, j, sum = 0, cnt = 0;
cin >> a >> b;
if (a == b) {
if (a % 2 == 0) {
cout << 2 << endl;
} else {
cout << a << endl;
}
} else {
cout << 2 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long ans, k, vmax = 0, vmin = -1, ind, c, start, fin, r, l;
int n;
char s[100];
vector<int> V;
double theta, dif = -1, mdif;
char x;
bool p = true;
int main() {
cin >> l >> r;
if (l != r)
cout << 2;
else
cout << l;
}
|
#include <bits/stdc++.h>
using namespace std;
bool checkPrime(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i != 0) {
} else {
return false;
}
}
return true;
}
int main() {
long long l, r;
cin >> l >> r;
if (l != r) {
cout << "2" << endl;
} else if (l == r) {
if (l % 2 == 0) {
cout << "2" << endl;
} else {
if (checkPrime(l)) {
cout << l << endl;
} else {
cout << l << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> v;
string s;
int arr[] = {0, 0, 0, 0, 0, 0};
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a != b)
puts("2");
else
printf("%d\n", a);
return 0;
}
|
#include <bits/stdc++.h>
int a, b;
int main() {
scanf("%d%d", &a, &b);
if (a == b)
printf("%d\n", a);
else
printf("%d\n", 2);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i;
int x, y;
int a[100000];
scanf("%d%d", &x, &y);
if (x == y) {
printf("%d", x);
return 0;
}
if (x % 2 == 0) {
printf("2");
return 0;
} else if (x % 3 == 0) {
if (y - x <= 4) {
printf("3");
} else {
printf("2");
}
} else {
printf("2");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, u, n, i, j, k;
cin >> l >> u;
if (l == u) {
cout << l;
return 0;
} else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool Ok(long long int n) {
long long int x = n;
while (x > 0) {
long long int y = x % 10;
if (y > 0) {
if (n % y != 0) {
return false;
}
}
x /= 10;
}
return true;
}
int main() {
ios ::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1;
int cases = 0;
while (T--) {
cases++;
int l, r;
cin >> l >> r;
if (l == r) {
cout << l;
} else {
cout << "2";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r)
cout << l << endl;
else
cout << 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
scanf("%d %d", &l, &r);
printf("%d", (l == r) ? l : 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l;
cin >> r;
if (l == r)
cout << l;
else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int gcd(int a, int b) { return (!b) ? a : gcd(b, a % b); }
void cv(vector<long> a) {
cout << "--"
<< "\n";
for (int i = 0; i < (int)a.size(); i++)
cout << a[i] << " "
<< "\n";
cout << "//"
<< "\n";
}
bool isPrime(int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i += 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
bool isPal(string str) {
int l = 0;
int h = str.size() - 1;
while (h > l) {
if (str[l++] != str[h--]) return false;
}
return true;
}
int main() {
fast();
long a, b;
cin >> a >> b;
if (a == b)
cout << a << "\n";
else if (b - a == 3 && b % 3 == 0)
cout << "3"
<< "\n";
else
cout << "2"
<< "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
if (l == r) {
cout << l;
return 0;
}
cout << "2" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int l, r;
cin >> l >> r;
if (l == r) {
cout << l;
return 0;
}
int d = r - l, max = 0, n = 2, a;
while (1) {
if (d / n >= max) {
max = d / n;
a = n;
if (l % n == 0 || r % n == 0) max++;
}
n++;
if (n == 12) break;
}
cout << a;
}
|
#include <bits/stdc++.h>
double pi = acos(-1);
const int sz = 5e5 + 1;
using namespace std;
int l, r;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> l >> r;
if (r - l >= 2 || (r - 1 == 1 && (r % 2 == 0) || (l % 2 == 0))) {
cout << 2 << "\n";
} else if (r - l == 1 && (r % 3 == 0 || l % 3 == 0)) {
cout << 3 << "\n";
} else {
cout << r << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n1, n2, i, j, n, ma = 0, temp, c;
cin >> n1 >> n2;
if (n1 < n2) {
cout << "2";
} else {
cout << n1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, a;
cin >> n >> m;
a = m - n;
if (a > 0)
a = 2;
else
a = n;
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int l, r;
scanf("%d", &l);
scanf("%d", &r);
if (l != r) {
printf("2");
} else {
if (l % 2 == 0) {
printf("2");
} else {
printf("%d", l);
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long a, b;
while (scanf("%ld%ld", &a, &b) != EOF) {
if (a == b) {
if (a % 2 == 0)
printf("2\n");
else if (a % 3 == 0)
printf("3\n");
else if (a % 5 == 0)
printf("5\n");
else if (a % 7 == 0)
printf("7\n");
else
printf("%ld", a);
} else
printf("2\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, l, r, i, j;
cin >> l >> r;
n = r;
if (l == r)
cout << l;
else
cout << 2;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int powe(long long int n, long long int p, long long int x) {
if (p == 0) return 1;
if (p == 1) return n % x;
if (p % 2 == 0) return (powe(n, p / 2, x) * powe(n, p / 2, x)) % x;
return (((powe(n, p / 2, x) * powe(n, p / 2, x)) % x) * n) % x;
}
int main() {
int x, y;
cin >> x >> y;
if (x == y & x % 2 != 0)
cout << x;
else
cout << 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int T;
long long L, R;
string s;
void solve() {
cin >> L >> R;
if (L == R)
cout << L << endl;
else
cout << 2 << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
T = 1;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = int(1e5) + 550;
int l, r, ll, x, y, rr;
int main() {
cin >> l >> r;
for (int i = 2; i <= 10000; i++) {
rr = r / i;
if (l % i == 0)
ll = (l / i) - 1;
else
ll = l / i;
if (x < rr - ll) x = rr - ll, y = i;
}
if (y == 0) y = r;
cout << y;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
long long a, b;
cin >> a >> b;
if (a == b)
cout << a;
else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int l, r;
int main() {
scanf("%d%d", &l, &r);
if (l == r)
printf("%d\n", l);
else
puts("2");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long a, b;
cin >> a >> b;
long long i, x, y, cnt, m, val, p, q;
m = 1;
val = b;
for (i = 2; i <= 1111; i++) {
x = i;
p = (b / x) - (a - 1) / x;
if (p > m) {
m = p;
val = x;
}
}
cout << val << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r) {
cout << l << endl;
} else {
cout << 2 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r;
cin >> l >> r;
if (l == r)
cout << l;
else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, coun = 0, coutn1 = 0;
cin >> l >> r;
for (int i = l; i <= l + 10; i++) {
if (i % 2 == 0) {
coun++;
}
if (i % 3 == 0) {
coutn1++;
}
}
if (l == r) {
cout << l << endl;
} else if (coun > coutn1) {
cout << "2\n";
} else {
cout << "3\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, n, i, c;
scanf("%lld %lld", &a, &b);
c = b - a;
if (c == 0) {
printf("%lld\n", a);
} else if (c == 3 && b % 3 == 0) {
printf("3\n");
} else {
printf("2\n");
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int l, r;
scanf("%d%d", &l, &r);
printf("%d", l == r ? l : 2);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
const int N = 1e6 + 5;
int main() {
int l, r;
cin >> l >> r;
if (l == r)
cout << l << endl;
else
cout << 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int m, n;
scanf("%d%d", &m, &n);
if (m != n)
printf("2\n");
else
printf("%d\n", m);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long l, r, ans;
cin >> l >> r;
if (l == r)
cout << l;
else
cout << 2;
}
|
#include <bits/stdc++.h>
int Count(int l, int r) {
if (l == r) {
return l;
}
return 2;
}
int main() {
int l, r;
std::cin >> l >> r;
std::cout << Count(l, r) << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
cout << (l == r ? l : 2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
int main(void) {
ios_base::sync_with_stdio(false);
int l, r;
cin >> l >> r;
if (l == r)
cout << l << endl;
else
cout << 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
scanf("%I64d%I64d", &l, &r);
if (l == r) {
printf("%I64d\n", l);
} else {
printf("2\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a != b)
cout << "2";
else {
b = 0;
for (int i = 2; (i < sqrt(a) && !b); i++) {
if (a % i == 0) {
cout << i;
b = 1;
}
}
}
if (!b) cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int l, r;
cin >> l >> r;
if (r - l <= 1) {
int res = l;
for (int i = l + 1; i <= r; ++i) res = gcd(res, i);
if (res == 1) res = l;
cout << res;
} else {
cout << 2;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int k = r - l;
if (k >= 1)
cout << "2" << endl;
else
cout << l << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int i, j, k, l, a, c, b;
scanf("%d%d", &a, &b);
if ((b % 2 == 0 && a % 2 != 0) && (b - a == 3) && (a % 3 == 0)) {
printf("3");
} else if (b == a)
printf("%d", b);
else
printf("2");
}
|
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
class A830 {
private:
i64 cost(i64 a, i64 b, i64 c) { return abs(a - b) + abs(b - c); }
public:
void solve(istream& in, ostream& out) {
int n, k, p;
in >> n >> k >> p;
vector<int> a(n), b(k);
for (int i = 0; i < n; ++i) {
in >> a[i];
}
for (int i = 0; i < k; ++i) {
in >> b[i];
}
sort(begin(a), end(a));
sort(begin(b), end(b));
i64 low = 0, high = 1e11, ans = high;
while (low <= high) {
i64 mid = (low + high) / 2;
bool ok1 = true;
for (int i = 0, j = 0; i < n; ++i) {
while (j < k && cost(a[i], b[j], p) > mid) {
++j;
}
if (j == k) {
ok1 = false;
break;
}
++j;
}
bool ok2 = true;
for (int i = n - 1, j = k - 1; i >= 0; --i) {
while (j >= 0 && cost(a[i], b[j], p) > mid) {
--j;
}
if (j == -1) {
ok2 = false;
break;
}
--j;
}
if (ok1 || ok2) {
high = mid - 1;
ans = mid;
} else {
low = mid + 1;
}
}
out << ans << "\n";
}
};
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
A830 solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, p;
int a[2010], b[2010];
bool check(long long x) {
int st = 0;
for (int i = 0; i < n; i++) {
bool flag = false;
for (int j = st; j < k; j++) {
if (abs(p - b[j]) + abs(a[i] - b[j]) <= x) {
flag = true;
st = j + 1;
break;
}
}
if (!flag) return false;
}
return true;
}
int main() {
scanf("%d %d %d", &n, &k, &p);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < k; i++) {
scanf("%d", &b[i]);
}
sort(a, a + n);
sort(b, b + k);
long long l = 0, r = 2e15;
while (l < r) {
long long mid = (l + r) / 2;
if (check(mid)) {
r = mid;
} else {
l = mid + 1;
}
}
printf("%lld\n", l);
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long int off;
long long int p[1010];
long long int a[1010 * 2], ds[1010 * 2];
long long int mem[1010][1010 * 2];
long long int inf = LONG_LONG_MAX;
long long int dp(int prs, int key) {
if (prs == 0) return 0;
if (key < prs) return inf;
if (mem[prs][key] != -1) return mem[prs][key];
long long int mi = inf;
mi = min(mi, dp(prs, key - 1));
mi = min(mi, max(dp(prs - 1, key - 1), abs(p[prs] - a[key]) + ds[key]));
return mem[prs][key] = mi;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k >> off;
memset(mem, -1, sizeof(mem));
for (int i = 1; i <= n; i++) cin >> p[i];
for (int i = 1; i <= k; i++) cin >> a[i];
sort(p + 1, p + n + 1);
sort(a + 1, a + k + 1);
for (int i = 1; i <= k; i++) {
ds[i] = abs(a[i] - off);
}
cout << dp(n, k) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, p, a[1001], b[2001];
int ans = 2147483647;
int main() {
cin >> n >> m >> p;
for (register int i = 0; i < n; i++) cin >> a[i];
for (register int i = 0; i < m; i++) cin >> b[i];
sort(a, a + n);
sort(b, b + m);
for (register int i = 0; i <= m - n; i++) {
int t = 0;
for (register int j = 0; j < n; j++)
t = max(t, abs(a[j] - b[i + j]) + abs(p - b[i + j]));
ans = min(ans, t);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const double eps = 1e-9;
const int maxn = 2000 + 10;
long long A[maxn], B[maxn];
long long dp[maxn][maxn];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
long long p;
cin >> n >> k >> p;
for (int i = 1; i <= n; ++i) cin >> A[i];
for (int i = 1; i <= k; ++i) cin >> B[i];
sort(A + 1, A + n + 1);
sort(B + 1, B + k + 1);
memset(dp, oo, sizeof dp);
for (int i = 0; i <= k; ++i) dp[0][i] = 0;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= k; ++j) {
dp[i][j] = min(dp[i][j - 1],
max(dp[i - 1][j - 1], abs(A[i] - B[j]) + abs(B[j] - p)));
}
cout << dp[n][k] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k, p, i, j, l;
cin >> n >> k >> p;
long long arr[n];
long long brr[k];
for (i = 0; i < n; i++) cin >> arr[i];
for (i = 0; i < k; i++) cin >> brr[i];
long long dp[k + 1][n + 1];
long long pos[k + 1][n + 1];
memset(dp, 0, sizeof dp);
memset(pos, 0, sizeof pos);
pos[0][0] = 1;
sort(arr, arr + n);
sort(brr, brr + k);
long long ans = 1e18;
for (i = 1; i <= k; i++) {
for (j = 1; j <= n; j++) {
long long dis;
if (pos[i - 1][j - 1]) {
pos[i][j] = 1;
dis = abs(arr[j - 1] - brr[i - 1]) + abs(p - brr[i - 1]);
if (j) dp[i][j] = max(dp[i - 1][j - 1], dis);
}
}
for (j = 0; j <= n; j++) {
if (pos[i - 1][j]) {
if (pos[i][j])
dp[i][j] = min(dp[i][j], dp[i - 1][j]);
else
dp[i][j] = dp[i - 1][j];
pos[i][j] = 1;
}
}
}
for (i = 1; i <= k; i++) {
if (pos[i][n]) ans = min(ans, dp[i][n]);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
signed main() {
long long int n, k, p;
cin >> n >> k >> p;
vector<long long int> pos(n), keys(k);
for (long long int i = 0; i < n; i++) cin >> pos[i];
for (long long int i = 0; i < k; i++) cin >> keys[i];
sort(pos.begin(), pos.end());
sort(keys.begin(), keys.end());
long long int ans = 1e18;
for (long long int i = 0; i <= k - n; i++) {
long long int summ = 0;
for (long long int j = 0; j < n; j++) {
summ = max(summ, abs(keys[i + j] - pos[j]) + abs(p - keys[i + j]));
}
ans = min(ans, summ);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
void solve() {
long long n, k, p;
cin >> n >> k >> p;
vector<long long> a(n);
vector<long long> b(k);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < k; i++) cin >> b[i];
sort(a.begin(), a.end());
sort(b.begin(), b.end());
long long ans = 1e14;
for (int i = 0; i < k - n + 1; i++) {
long long time = 0;
for (int j = 0; j < n; j++) {
time = max(time, abs(a[j] - b[i + j]) + abs(p - b[j + i]));
}
ans = min(ans, time);
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests = 1;
while (tests--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1005], b[2005], p;
bool vis[2005];
int l[1005], r[1005];
int n, k;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x;
}
inline bool check(int tar) {
int i, pos = n + 1, j;
for (i = 1; i <= n; i++) {
l[i] = 0;
r[i] = 0;
for (j = 1; j <= k; j++) {
if (abs(a[i] - b[j]) + abs(b[j] - p) <= tar) {
l[i] = j;
break;
}
}
if (l[i] == 0) {
return 0;
}
for (j = k; j >= 1; j--) {
if (abs(a[i] - b[j]) + abs(b[j] - p) <= tar) {
r[i] = j;
break;
}
}
if (r[i] == 0) {
return 0;
}
}
for (i = 1; i <= n; i++) {
for (j = i; j <= n; j++) {
if (r[j] - l[i] + 1 < j - i + 1) {
return 0;
}
}
}
return 1;
}
int main() {
int i;
n = read();
k = read();
p = read();
for (i = 1; i <= n; i++) {
a[i] = read();
}
for (i = 1; i <= k; i++) {
b[i] = read();
}
sort(a + 1, a + n + 1);
sort(b + 1, b + k + 1);
int l = 0, r = 2000000000;
while (l <= r) {
int mid = (l >> 1) + (r >> 1) + (l & r & 1);
if (check(mid)) {
r = mid - 1;
} else {
l = mid + 1;
}
}
printf("%d\n", l);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
const int INF = 0x3f3f3f3f;
int n, k, p;
int A[N], B[N];
int main() {
while (~scanf("%d %d %d", &n, &k, &p)) {
for (int i = 0; i < n; ++i) scanf("%d", &A[i]);
sort(A, A + n);
for (int i = 0; i < k; ++i) scanf("%d", &B[i]);
sort(B, B + k);
int ans = 2e9;
for (int i = 0; i < k - n + 1; ++i) {
int tmp = -1;
for (int j = 0; j < n; ++j) {
tmp = max(tmp, abs(A[j] - B[i + j]) + abs(p - B[i + j]));
}
ans = min(ans, tmp);
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long P[1000], K[2000];
long long ans = 4000000009;
int main() {
int p, k, location;
scanf("%d %d %d", &p, &k, &location);
for (int i = 0; i < p; i++) {
cin >> P[i];
}
for (int i = 0; i < k; i++) {
cin >> K[i];
}
sort(P, P + p);
sort(K, K + k);
int i = 0;
long long temp_aux;
while (i + p <= k) {
temp_aux = 0;
for (int j = 0; j < p; j++) {
temp_aux = max(temp_aux, abs(P[j] - K[j + i]) + abs(location - K[j + i]));
}
ans = min(temp_aux, ans);
i++;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, p, arr[1009], arr1[2009], dp[1009][2009], oo = 2e9 + 11;
int bt(int i, int j) {
if (i == n) return 0;
if (j == k) return oo;
if (dp[i][j] != -1) return dp[i][j];
return dp[i][j] = min(
bt(i, j + 1),
max(bt(i + 1, j + 1), abs(arr[i] - arr1[j]) + abs(arr1[j] - p)));
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n >> k >> p;
for (int f = 0; f < n; f++) cin >> arr[f];
for (int f = 0; f < k; f++) cin >> arr1[f];
sort(arr, arr + n);
sort(arr1, arr1 + k);
cout << bt(0, 0) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, p;
int x[2005], y[2005];
bool check(long long s) {
int pos = 1;
for (int i = 1; i <= n; i++) {
while (pos <= k && abs(x[i] - y[pos]) + abs(p - y[pos]) > s) pos += 1;
if (pos > k) return 0;
pos += 1;
}
return 1;
}
int main() {
scanf("%d%d%d", &n, &k, &p);
for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
for (int i = 1; i <= k; i++) scanf("%d", &y[i]);
sort(x + 1, x + 1 + n);
sort(y + 1, y + 1 + k);
long long l = 0, r = 2e9, mid;
while (l < r) {
mid = (l + r) / 2;
if (check(mid))
r = mid;
else
l = mid + 1;
}
printf("%lld", r);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 0x3f3f3f3f;
const int N = 2010;
const int mod = 1e9 + 7;
int a[N], b[N];
int dp[N][N];
int main() {
int n, m, p;
scanf("%d%d%d", &n, &m, &p);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
for (int i = 0; i < m; i++) scanf("%d", &b[i]);
sort(b, b + m);
int mi = INF * 2;
for (int j = 0; j <= m - n; j++) {
int mx = 0;
for (int i = 0; i < n; i++)
mx = max(mx, abs(a[i] - b[j + i]) + abs(b[j + i] - p));
mi = min(mi, mx);
}
printf("%d\n", mi);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.