text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, x1, x2, now, ans = -99;
cin >> n >> a >> b;
if (n == a + b) {
cout << "1" << endl;
} else {
for (x1 = 1; x1 < n; x1++) {
x2 = n - x1;
now = 700000;
now = min(a / x1, now);
now = min(b / x2, now);
ans = ... |
#include <bits/stdc++.h>
inline int getint() {
register char ch;
while (!isdigit(ch = getchar()))
;
register int x = ch ^ '0';
while (isdigit(ch = getchar())) x = (((x << 2) + x) << 1) + (ch ^ '0');
return x;
}
inline bool check(const int &n, int a, int b, const int &m) {
for (register int i = 1; i <= n... |
#include <bits/stdc++.h>
using namespace std;
bool Check(long long M, long long A, long long B, long long N) {
long long Cnt = 0;
if (M <= A)
Cnt += (A / M);
else
return 0;
if (M <= B)
Cnt += (B / M);
else
return 0;
return Cnt >= N;
}
int main() {
long long N, A, B;
cin >> N >> A >> B;
... |
#include <bits/stdc++.h>
using namespace std;
long double pi = 3.14159265359;
long long mod = 1000000007;
long long GCD(long long n1, long long n2) {
if (n2 != 0)
return GCD(n2, n1 % n2);
else
return n1;
}
long long LCM(long long n1, long long n2) {
long long m;
m = n1 * n2 / GCD(n1, n2);
return m;
}
... |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int mod1 = 998244353;
void swap(long long int &a, long long int &b) {
long long int t = a;
a = b;
b = t;
}
long long int min(long long int a, long long int b) {
if (a < b) return a;
return b;
}
long long int max(l... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 1000000, v = 0, i, j, k, a, b, c, d, p, x, y;
cin >> n >> a >> b;
for (i = 1; i < n; i++) {
c = a / i;
d = b / (n - i);
y = min(c, d);
if (y > v) {
v = y;
p = i;
}
}
cout << min(a / p, b / (n - p));
}
|
#include <bits/stdc++.h>
using namespace std;
const int PRIME = 1e9 + 7;
const int MAX = -1 + (1 << 30) + (1 << 30);
const int MIN = -(1 << 31);
const long long lMAX = -1LL + (1LL << 62) + (1LL << 62);
const long long lMIN = -(1LL << 63);
int main() {
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, res;
int main() {
cin >> n >> a >> b;
for (int i = 1; i <= min(a, b); i++) {
if (a / i + b / i >= n) {
res = i;
}
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long a1[1000], b1[1000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cerr.tie(nullptr);
long n, a, b, i = 0;
cin >> n >> a >> b;
for (i = 1; i < n; i++) {
a1[i] = a / i;
b1[i] = b / (n - i);
}
long brmax = 0;... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, x, y, ans;
while (scanf("%d%d%d", &n, &a, &b) != EOF) {
x = max(n - b, 1);
y = min(n - 1, a);
ans = 0;
for (int i = x; i <= y; i++) ans = max(ans, min(a / i, b / (n - i)));
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
bool check(int x) {
int m = 0;
for (int i = 1; i < n; i++) {
if (a / i >= x && b / (n - i) >= x) return true;
m++;
}
return false;
}
int main() {
scanf("%d%d%d", &n, &a, &b);
int l, r;
for (int i = a + b; i >= 1; i--)
if (check(i)) {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0, a = 0, b = 0, an, bn, minimo, resultado = 0;
cin >> c >> a >> b;
for (int i = 1; i < c; i++) {
an = i;
bn = c - i;
minimo = min(a / an, b / bn);
if (minimo > resultado) resultado = minimo;
}
cout << resultado << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
for (int x = min(a, b); x >= 1; x--) {
if (max(a, b) / x >= n - min(a, b) / x) {
printf("%d", x);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
int c = max(a, b);
int d = min(a, b);
int i = d;
int j;
while (true) {
if (i * n <= c + d && (n - (c / i)) * i <= d) {
j = i;
break;
}
i--;
}
cout << j << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
for (int i = a + b; i >= 0; i--) {
int ta = a, tb = b;
int j = 0;
bool bad = 0;
while (j < n) {
if (ta >= i)
ta -= i;
else if (tb >= i)
tb -= i;
else {
bad = 1;
... |
#include <bits/stdc++.h>
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
int Pa, Pb, k, m, p;
int x[60], y[100];
for (Pa = 1, m = 1; Pa < n; Pa++) {
Pb = n - Pa;
if (a / Pa == 0 || b / Pb == 0)
continue;
else {
k = a / Pa;
p = b / Pb;
if (k > p)
y[m] = p;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, ans = 1;
cin >> n >> a >> b;
for (int i = 1; i <= n - 1; i++) {
ans = max(ans, min(a / i, b / (n - i)));
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = -1;
for (int i = 1; i < n; i++) {
ans = max(ans, min(a / i, b / (n - i)));
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
while (scanf("%d %d %d", &n, &a, &b) == 3) {
int x = 1;
int ans = 0;
while (x <= n - 1 && (a / x) > (b / (n - x))) {
ans = b / (n - x);
x++;
}
if (x != n) ans = max(ans, a / x);
printf("%d\n", ans);
}
ret... |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const long long N = 2e5 + 5;
long long n;
long long a[N];
void solve() {
long long n, a, b;
cin >> n >> a >> b;
long long ans = 0;
for (long long i = 1; i < n; i++) {
long long x1 = a / i;
long long x2 = b / (n - i);
long long... |
#include <bits/stdc++.h>
int p[100005];
int s[100005];
int main() {
int m, n, a, b, i, j, t, x, y;
while (scanf("%d%d%d", &n, &a, &b) != EOF) {
m = -1;
for (i = 1; i < n; i++) {
x = a / i;
y = b / (n - i);
t = (((x) > (y)) ? (y) : (x));
if (t > m) m = t;
}
printf("%d\n", m);
... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
int ans = -1000000000;
for (int i = 1; i <= n - 1; i++) ans = max(ans, min(a / i, b / (n - i)));
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a, b, res = 0;
cin >> n >> a >> b;
for (int i = 1; i <= min(a, b); i++) {
if (a / i + b / i >= n) {
res = i;
}
}
cout << res << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, A, B;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
cin >> N >> A >> B;
int ans = 0;
for (int a = 1; a < N; a++) {
ans = max(ans, min(A / a, B / (N - a)));
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename C>
ostream &operator<<(ostream &os, pair<T, C> x) {
return os << "<" << x.first << ", " << x.second << ">";
}
template <typename T>
auto operator<<(ostream &os, T x) ->
typename enable_if<is_same<decltype(x.begin()), decltype(x.end())>::... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
int z = 0;
for (int i = 1; i < n; i++) {
if (i > a || n - i > b) {
continue;
}
z = max(z, min(a / i, b / (n - i)));
}
printf("%d\n", z);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(true);
int n, a, b, ans = -1;
cin >> n >> a >> b;
for (int ai = 1; ai < n; ai++) {
int bi = n - ai;
ans = max(ans, min((a / ai), (b / bi)));
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, a, b;
cin >> n >> a >> b;
double ans = 0.0;
for (double i = 0.0; i < n - 1; i++) {
double aa = floor(a / (i + 1.0));
double ab = floor(b / (n - (i + 1.0)));
double x = min(aa, ab);
if (x > ans) ans = x;
}
cout << (int)ans <... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<int> vec(n);
int ans = 0;
for (int cur = 1; cur <= min(a, b); cur++) {
int l = a, r = b;
int flag = 1;
for (int i = 0; i < n; i++) {
if (l >= cur) {
l = l - cur;
} else if (r >= c... |
#include <bits/stdc++.h>
using namespace std;
int main() {
float n, n1, n2, ans, a, b;
cin >> n >> a >> b;
n1 = ceil((n * a) / (a + b));
n2 = n - n1;
if (n1 == 0) {
n1 = 1;
n2--;
}
if (n2 == 0) {
n2 = 1;
n1--;
}
ans = floor(min(a / n1, b / n2));
n1 = ceil((n * b) / (a + b));
n2 = n... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
bool ok(int x) {
for (int i = 1; i < n; i++) {
int rem = n - i;
if (i * x <= a && rem * x <= b) return true;
}
return false;
}
int main() {
cin >> n >> a >> b;
int lo = 1, hi = 100;
while (lo < hi) {
int mid = (lo + hi + 1) / 2;
if (... |
#include <bits/stdc++.h>
using namespace std;
int scanst(char *a) {
int i = 0;
char c = 0;
while (c < 33) c = getchar();
while (c > 33) {
a[i++] = c;
c = getchar();
}
a[i] = 0;
return i;
}
template <typename T>
bool scan(T &n) {
n = 0;
bool got = false;
bool negative = false;
char c = getc... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
;
int n;
cin >> n;
int a, b;
cin >> a >> b;
int l = 1, h = a + b + 1;
while (l + 1 < h) {
int m = l + (h - l) / 2;
int c = a / m + b / m;
if (c >= n && m <= a && m <= b)
l = m;
... |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
template <typename T>
inline void amin(T& x, T y) {
if (x > y) x = y;
}
template <typename T>
inline void amax(T& x, T y) {
if (x < y) x = y;
}
void prepro() {}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(17);... |
#include <bits/stdc++.h>
using namespace std;
namespace Mlxa {
template <class A>
inline void println(A a) {
cout << a << '\n';
}
template <class A, class... B>
inline void println(A a, B... b) {
cout << a << ' ', println(b...);
}
template <class I>
inline void printseq(I b, I e) {
for (I i(b); i != e; ++i) cout ... |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7, INF = 10000000, MAXN = 301, BASE = 257,
MAXLOG = 19;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n, a, b;
cin >> n >> a >> b;
long long ans = (a + b) / n;
for (int i = ans; i >= 1; i--) {
if... |
#include <bits/stdc++.h>
using namespace std;
inline void boost() {
ios_base::sync_with_stdio();
cin.tie(0);
cout.tie(0);
}
const long long maxn = 1e5 + 123;
const long long inf = 1e9 + 123;
const long long mod = 1e9 + 7;
const double pi = acos(-1);
int main() {
boost();
int n, a, b;
cin >> n >> a >> b;
i... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, a, b;
int main() {
cin >> n >> a >> b;
int ans = 0;
for (int i = 1; i <= min(a, b); i++) {
int tn = n;
tn -= a / i;
tn -= b / i;
if (tn <= 0) ans = i;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool f[1000007];
vector<int> prime;
void sieve() {
f[0] = f[1] = 1;
for (int i = 2; i < 1000007; ++i) {
if (f[i]) continue;
prime.push_back(i);
for (int j = i * i; i <= 10000 && j < 1000007; j += i) f[j] = 1;
}
}
vector<int> factor;
void getFactor(int n) {... |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
int a, b, ans = 0;
scanf("%d%d%d", &n, &a, &b);
for (int i = 1; i <= a; i++) {
if (n - i <= 0) break;
ans = max(ans, min(a / i, b / (n - i)));
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n, a, b;
cin >> n >> a >> b;
int maxCakes = 1;
for (int i = 1; i < (n); ++i) {
maxCakes = max(maxCakes, min(a / i, b / (n - i)));
}
cout << maxCakes << '\n';
}
|
#include <bits/stdc++.h>
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, -1, 1};
using namespace std;
void solve() {
long long int n, a, b;
cin >> n >> a >> b;
for (long long int i = min(a, b); i > 0; i--) {
if (((a / i) + (b / i)) >= n) {
cout << i << endl;
return;
}
}
}
int main() {
solve(... |
#include <bits/stdc++.h>
using namespace std;
bool myfnc(const pair<long long, long long>& a,
const pair<long long, long long>& b) {
return a.first < b.first;
}
long long mxx = 1e9;
template <typename K, typename V>
void print_map(std::map<K, V> const& m) {
for (auto const& pair : m) {
std::cout << p... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long int llINF = 0x3f3f3f3f3f3f3f;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for (int i = 1; i <= a + b; i++) {
int vala = a / i;
i... |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for (int i = 0; i <= n; i++) {
int cand;
if (i and n - i)
cand = min(a / i, b / (n - i));
else
continue;
ans = max(ans, cand);
}
cout <... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
while (~scanf("%d%d%d", &n, &a, &b)) {
int maxs = 0;
for (int i = 0; i <= n; i++) {
if (i == 0) {
} else if (i == n) {
} else {
if ((n - i) <= b && i <= a) {
maxs = max(maxs, min(b / (n - i), a / i));... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, minn = 0;
scanf("%d %d %d", &n, &a, &b);
for (int i = 1; i < n; i++) {
if (a / i < 1 || b / (n - i) < 1) continue;
minn = max(min(a / i, b / (n - i)), minn);
}
printf("%d\n", minn);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, a, b, m = 0;
cin >> n >> a >> b;
for (int i = 1; i < n; i++) {
m = max(min(a / i, b / (n - i)), m);
}
cout << m << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, a, b;
cin >> n >> a >> b;
int ans = -1;
for (int i = 1; i < n; ++i) {
int ap = a / i;
int bp = b / (n - i);
if (ans < min(ap, bp)) {
ans = min(ap, bp);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, a, b;
while (scanf("%d%d%d", &n, &a, &b) != EOF) {
int mn = 0;
for (int i = max(1, n - b); i <= a && i < n; i++) {
mn = max(mn, min(a / i, b / (n - i)));
}
printf("%d\n", m... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, m, i;
cin >> n >> a >> b;
m = (a + b) / n;
for (i = m; i > 0; i--) {
if (a / i + b / i >= n && a >= i && b >= i) {
cout << i;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int inf = 1e9, dx[] = {0, 0, 1, -1, 1, 1, -1, -1},
dy[] = {1, -1, 0, 0, 1, -1, 1, -1}, MOD = 1e9 + 7;
long double eps = 1e-7, pi = acos(-1);
int a, b, n, ans = 1;
bool f(int x) { return x && (a / x + b / x) >= n; }
int main() {
... |
#include <bits/stdc++.h>
using namespace std;
long long a, b, i, m, n;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
for (cin >> n >> a >> b; ++i < n;) {
m = max(m, min(a / i, b / (n - i)));
}
cout << m;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long n, a, b;
int32_t main() {
cin >> n;
cin >> a;
cin >> b;
long long ans = 1;
for (long long i = 1; i < n; i++) ans = max(... |
#include <bits/stdc++.h>
using namespace std;
int ar[10000];
int main() {
long long mi = 10000000000;
int n;
cin >> n;
int a, b;
cin >> a >> b;
int an = 0;
for (int i = 1; i < n; i++) {
int p1 = a / i;
int p2 = b / (n - i);
int p3 = min(p1, p2);
an = max(an, p3);
}
cout << an;
return... |
#include <bits/stdc++.h>
using namespace std;
void online() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const long long N = 105;
long long n, a, b;
bool check(long long x) {
long long xx = a / x + b / x;
if (xx >= n and a >= x and b >= x)
return 1;
else
return 0;
}
void solve() {
ci... |
#include <bits/stdc++.h>
using namespace std;
long long s1, s2, a, b, c, i, j, ot;
int main() {
ios_base::sync_with_stdio(0);
cin >> c >> a >> b;
ot = -1e9;
for (i = 1; i <= min(c, a); i++) {
j = c - i;
if (j > b) continue;
if (j == 0) continue;
s1 = a / i;
s2 = b / j;
ot = max(ot, min(s... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int p, a, b, i;
cin >> p >> a >> b;
i = (a + b) / p;
while (a / i == 0 || b / i == 0 || (a / i + b / i) < p) {
i--;
}
cout << i;
return 0;
}
|
#include <bits/stdc++.h>
int min(int a, int b) { return a > b ? b : a; }
int main(void) {
int n, a, b, x, y, max, min_;
while (scanf("%d %d %d", &n, &a, &b) != EOF) {
max = 0;
for (int i = 1; i < n; i++) {
x = a / i;
y = b / (n - i);
min_ = min(x, y);
if (min_ > max) {
max = ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
long long n, a, b, ans = 0;
cin >> n >> a >> b;
for (int i = 1; i < n; i++) {
ans = max(ans, min(a / i, b / (n - i)));
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
int l = 1, r = min(a, b);
while (l != r) {
int x = (l + r + 1) / 2;
int can = a / x + b / x;
if (can >= n)
l = x;
else
r = x - 1;
}
cout << l <... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, ans;
int main() {
scanf("%d%d%d", &n, &a, &b);
for (int i = 1; i < n; i++) {
int x, y;
x = a / i;
y = b / (n - i);
ans = max(ans, min(x, y));
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
const long long MOD = 1000000007;
using namespace std;
const int N = 10e5 + 10;
int arr[N] = {0};
int main() {
int n, a, b;
cin >> n >> a >> b;
int maxc = 1;
for (int i = 1; i < n; ++i) {
int ac = a / i;
int bc = b / (n - i);
maxc = max(maxc, min(ac, bc));
}
for (int i =... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res = 0;
int maxi = 0;
for (int i = 1; i < n; i++) {
if (b / (n - i) > 0 && a / i > 0) {
res = min((a / i), (b / (n - i)));
maxi = max(maxi, res);
}
}
cout << maxi;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool umin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool umax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, a, b, ans = 0;
scanf("%d%d%d", &n, &a, &b);
for ... |
#include <bits/stdc++.h>
const int maxn = 200005;
const int inf = 1234567890;
using namespace std;
int n, a, b;
int main(void) {
cin >> n >> a >> b;
double max_x = -1;
for (int i = ((1) > (n - b) ? (1) : (n - b));
i <= ((n - 1) < (a) ? (n - 1) : (a)); i++) {
double av1 = 1.0 * a / i;
double av2 = 1... |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
if (a % b) return gcd(b, a % b);
return b;
}
template <typename T>
T lcm(T a, T b) {
return (a * (b / gcd(a, b)));
}
void solve();
void file_i_o() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
f... |
#include <bits/stdc++.h>
using namespace std;
int getInt() {
int tmp;
scanf("%d", &tmp);
return tmp;
}
int main() {
int n, a, b;
while (~scanf("%d %d %d", &n, &a, &b)) {
int tmpb = n - 1, ansa, ansb, ans = 0;
for (int i = 1; i < n; i++) {
tmpb = n - i;
ansa = a / i;
ansb = b / tmpb;
... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, a, b;
cin >> n >> a >> b;
long long mx = (-9223372036854775807LL - 1);
for (long long i = 1; i < n; i++) {
long long p = a / i;
long long q = b / (n - i);
long long x = min(p, q);
mx = max(mx, x);
}
cout << mx << "\n";... |
#include <bits/stdc++.h>
int main(void) {
int n, a, b;
std::scanf("%d %d %d", &n, &a, &b);
int ans = 0;
for (int i = 1; i < n; ++i) {
ans = std::max(ans, std::min(a / i, b / (n - i)));
}
std::printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b, x = 1;
cin >> n >> a >> b;
for (int i = max(1, n - b); i <= min(n - 1, a); i++) {
x = max(x, min(a / i, b / (n - i)));
}
cout << x;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int a_, b_, ans = 0;
for (int i = 1; i < n; i++) {
a_ = a / i;
b_ = b / (n - i);
ans = max(ans, min(a_, b_));
}
if (a + b == n) {
cout << 1 << endl;
} else
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool read(T &x) {
int c = getchar();
int sgn = 1;
while (~c && c < '0' || c > '9') {
if (c == '-') sgn = -1;
c = getchar();
}
for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
x *= sgn;
return ~c;
}
... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int check(int p) {
int res;
res = a / p + b / p;
if (a / p == 0 || b / p == 0) return 0;
if (res >= n)
return 1;
else
return 0;
}
int main() {
int l, r, mid;
scanf("%d%d%d", &n, &a, &b);
r = a + b;
l = 1;
while (r - l > 1) {
mid ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ats = 1;
for (int i = 1; i < n; i++) {
ats = max(ats, min(a / i, b / (n - i)));
}
cout << ats;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k;
int n, m;
int a, b;
scanf("%d%d%d", &n, &a, &b);
if (a > b) swap(a, b);
m = 0;
for (i = 1; i <= n - 1; i++) {
j = a / i;
k = b / (n - i);
if (j >= 1 && k >= 1) m = max(m, min(j, k));
}
printf("%d", m);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int SIZE = 1 << 17;
int pointer = SIZE;
char buffer[SIZE];
char Advance() {
if (pointer == SIZE) {
fread(buffer, 1, SIZE, stdin);
pointer = 0;
}
return buffer[pointer++];
}
int Read() {
int answer = 0;
char ch = Advance();
while (!isdigit(ch)) ch =... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
int mx = max(a, b);
int mn = min(a, b);
int ans = 0;
for (int i = 1; i <= n / 2; i++) {
int x = (mn / i);
int y = (mx) / (n - i);
if (x >= 1 and y >= 1) {
ans = max(an... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, x = 1;
cin >> n >> a >> b;
for (int i = 1; i < n; i++) x = max(min(a / i, b / (n - i)), x);
cout << x;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000007, inf = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(false);
int n, a, b, p, q;
cin >> n >> a >> b;
int ans = 0;
for (int i = 1; i < n; ++i) {
p = i;
q = n - i;
ans = max(ans, min(a / p, b / q));
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int T;
T = 1;
while (T--) {
int n, a, b, i, j, l, r, mid, ans, x, y, ct;
cin >> n >> a >> b;
l = 1, r = (a + b);
ans = -1;
while (l <= r) {
mid = (l + r) / 2;
x = a, y = b;
ct = 0;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = 1;
for (int i = 1; i <= n - 1; i++) {
int k = n - i;
int f = a / i, s = b / k;
ans = max(ans, min(f, s));
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
int mi = 110;
int ma = 0;
if (a > b) {
int temp = a;
a = b;
b = temp;
}
if (a == 1) {
printf("1\n");
return 0;
}
for (int i = 1; i <= min(a, n - 1); i++) {
ma = max(ma, min(a / ... |
#include <bits/stdc++.h>
using namespace std;
long long n, m, k, i, j, t, q, cnt, cnt1, cnt2, cnt3;
long long cnt4, cnt5, ans, ans1, ans2, ans3, sum, sum1, sum2;
long long mini = 1e9, maxi = -999;
int main() {
ios_base::sync_with_stdio(0);
long long ans = 0;
cin >> n >> m >> k;
for (i = 1; i < n; i++) {
ans... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
for (int x = min(a, b); x >= 1; x--) {
if (a / x + b / x >= n) {
cout << x << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, m = 0, m_m;
scanf("%d%d%d", &n, &a, &b);
for (int i = 1; i < n; i++) {
m_m = min(a / i, b / (n - i));
if (m_m > m) m = m_m;
}
printf("%d\n", m);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
bool check(int v) {
if ((v > a) || (v > b)) return 0;
int rem = n;
rem -= a / v;
rem -= b / v;
if (rem > 0) return 0;
return 1;
}
int main() {
cin >> n >> a >> b;
int st = 1;
int nd = a + b;
int ans = -1;
while (st <= nd) {
int md = (s... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
int i;
for (i = 100; i >= 1; i--) {
if (a / i + b / i >= n) {
if (b / i >= 1 && a / i >= 1) break;
}
}
printf("%d\n", i);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0, a = 0, b = 0;
cin >> n >> a >> b;
for (int i = 1; i <= 100; i++) {
int v1 = a / i, v2 = b / i;
if (v1 < 1 || v2 < 1 || v1 + v2 < n) {
cout << i - 1 << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
int num = 0, min = 0;
int i, j;
int numa, numb;
int temp;
for (i = 1; i < n; ++i) {
j = n - i;
numa = a / i;
numb = b / j;
if (numa < numb) {
temp = numa;
} else {
temp = numb;
}
if (tem... |
#include <bits/stdc++.h>
using namespace std;
int zhs(int n) { return n * (n - 1) / 2; }
bool isP(long long n) {
for (long long i = 2; i <= sqrt(n); ++i)
if (n % i == 0) return false;
return true;
}
bool yuanyin6(char c) {
switch (c) {
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
... |
#include <bits/stdc++.h>
using namespace std;
void red() {
cin.tie(0);
cin.sync_with_stdio(false);
}
int main() {
red();
int n, a, b;
cin >> n >> a >> b;
int mx = 0;
for (int i = 1; i < n; ++i) {
int a1 = a / i, a2 = b / (n - i);
mx = max(mx, min(a1, a2));
}
cout << mx;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 77;
const int Mod = 1e9 + 7;
int n, a, b, ans;
int main() {
scanf("%d%d%d", &n, &a, &b);
ans = min(b / n, a / n);
for (int i = 1; i < n; i++) {
ans = max(ans, min(a / i, b / (n - i)));
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b;
cin >> n >> a >> b;
long long int m = 0;
for (long long int i = 1; i < n; i++) {
long long int q = i;
long long int w = n - i;
long long int ca = a / q, cb = b / w;
if (min(ca, cb) > m) m = min(ca, cb);
}
cout ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c = 0, i;
cin >> n >> a >> b;
for (i = 1; i < n; i++) {
c = max(c, min(a / i, b / (n - i)));
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, a, b;
cin >> n >> a >> b;
int st = (a + b) / n;
while (a / st + b / st < n) {
st--;
}
cout << min(st, min(a, b)) << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
int ans = 0;
for (int i = 1; i < n; i++) {
ans = max(ans, min(a / i, b / (n - i)));
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int r = 0;
for (int i = 1; i < 300; i++) {
int x1 = a / i;
int x2 = b / i;
if (x1 + x2 >= n && x1 != 0 && x2 != 0) r = i;
}
cout << r;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
void pv(vector<T> &vec) {
for (int i = 0; i < (int)(vec).size(); i++)
cout << vec[i] << (i == (int)(vec).size() - 1 ? '\n' : ' ');
}
int a, b, n;
bool ok(int x) {
int nowa = 0, nowb = 0;
int ta = a, tb = b;
while (ta >= x) {
nowa++;
ta... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
for (int x = min(a, b); x >= 1; x--) {
if ((a / x + b / x) >= n) {
printf("%d", x);
break;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.