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 = max(ans, now);
}
cout << ans << endl;
}
return 0;
}
|
#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; i++) {
if (a >= m) {
a -= m;
continue;
}
if (b >= m) {
b -= m;
continue;
}
return false;
}
return true;
}
int main() {
const int n = getint(), a = getint(), b = getint();
int l = 1, r = std::min(a, b);
while (l <= r) {
const int mid = (l + r) >> 1;
if (check(n, a, b, mid)) {
l = mid + 1;
} else {
r = mid - 1;
}
}
printf("%d\n", l - 1);
return 0;
}
|
#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;
long long L = 0, R = (long long)1e8;
long long Ans = 0;
while (R >= L) {
long long M = L + (R - L) / 2;
if (Check(M, A, B, N)) {
Ans = M;
L = M + 1;
} else
R = M - 1;
}
cout << Ans << endl;
return 0;
}
|
#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;
}
long long choose(long long n, long long k) {
if (k > n) {
return 0;
}
long long r = 1;
for (long long d = 1; d <= k; ++d) {
r *= n--;
r /= d;
}
return r;
}
bool isprime(int x) {
if (x == 1) return 0;
for (int i = 2; i < x; i++) {
if (x % i == 0) return 0;
}
return 1;
}
long long pow_(long long base, long long exponent) {
long long result = 1;
while (exponent > 0) {
if (exponent % 2 == 1) result = (result * base) % mod;
exponent = exponent >> 1;
base = (base * base) % mod;
}
return result;
}
const int N = 1e5 + 5;
long long F[N], iF[N];
long long fast(long long b, long long e) {
if (!e) return 1;
if (e & 1) return b * fast(b * b % mod, e >> 1) % mod;
return fast(b * b % mod, e >> 1) % mod;
}
void init() {
F[0] = iF[1] = iF[0] = F[1] = 1;
for (long long i = 2; i < N; i++) {
F[i] = i * F[i - 1] % mod;
iF[i] = fast(F[i], mod - 2);
}
}
long long nCr(int n, int k) {
long long ret = F[n];
ret *= iF[n - k];
ret %= mod;
ret *= iF[k];
ret %= mod;
return ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int res = 0;
int n, a, b;
cin >> n >> a >> b;
for (int i = 1; i <= n - 1; i++) {
res = max(res, min(a / i, b / (n - i)));
}
cout << res << endl;
return 0;
}
|
#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(long long int a, long long int b) {
if (a > b) return a;
return b;
}
long long int pow(long long int a, long long int b) {
a %= mod1;
long long int ans = 1;
while (b > 0) {
if (b & 1) ans = ans * a % mod1;
a = a * a % mod1;
b /= 2;
}
return ans;
}
long long int a, b, n;
bool check(long long int x) {
long long int t = a;
long long int q = b;
for (int i = 1; i <= n; i++) {
if (t == 0 && q == 0) {
return false;
}
if (t == 0) {
if (q >= x) {
q -= x;
continue;
} else {
q = 0;
i--;
continue;
}
}
if (t >= x) {
t -= x;
continue;
} else {
t = 0;
i--;
continue;
}
}
return true;
}
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cin >> n;
cin >> a >> b;
long long int st = 1;
long long int end = min(a, b);
long long int ok = -1;
while (st <= end) {
long long int m = st + end;
m /= 2;
if (check(m)) {
ok = m;
st = m + 1;
} else
end = m - 1;
}
cout << ok;
}
|
#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;
int answer = 1;
for (int i = 1; i < n; i++) {
int j = n - i;
answer = max(answer, min(a / i, b / j));
}
cout << answer << endl;
return 0;
}
|
#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;
for (i = 1; i < n; i++) {
brmax = max(min(a1[i], b1[i]), brmax);
}
cout << brmax;
return 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)) {
printf("%d", i);
break;
}
return 0;
}
|
#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;
break;
}
j++;
}
if (!bad) {
cout << min(i, min(a, b));
return 0;
}
}
return 0;
}
|
#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;
else
y[m] = k;
m++;
}
}
int max = y[1];
for (int i = 1; i < m; i++) {
if (y[i] > max) {
max = y[i];
}
}
printf("%d\n", max);
return 0;
}
|
#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);
}
return 0;
}
|
#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 x = min(x1, x2);
ans = max(ans, x);
}
cout << ans << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t = 1;
while (t--) solve();
return 0;
}
|
#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())>::value &&
!is_same<T, string>::value,
ostream &>::type {
os << "{";
int cou = 0;
for (auto c : x) {
if (cou++) os << ", ";
os << c;
}
return os << "}";
}
template <typename T>
string strmask(T r) {
string ans;
for (int i = 0; i < (8 * (int)sizeof(T)); i++) {
ans += '0' + !!(((T)1 << i) & r);
if (i % 5 == 4) ans += '.';
}
return ans;
}
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
int ans = 1;
int low = 1, high = min(a, b);
while (low <= high) {
int med = (low + high) / 2;
if (a / med + b / med >= n && med) {
ans = med;
low = med + 1;
} else
high = med - 1;
}
printf("%d\n", ans);
}
|
#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 << endl;
return 0;
}
|
#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 >= cur) {
r = r - cur;
} else {
flag = 0;
break;
}
}
if (flag) ans = cur;
}
cout << ans;
}
|
#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 - n1;
if (n1 == 0) {
n1 = 1;
n2--;
}
if (n2 == 0) {
n2 = 1;
n1--;
}
ans = max(ans, floor(min(a / n2, b / n1)));
cout << ans;
return 0;
}
|
#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 (ok(mid))
lo = mid;
else
hi = mid - 1;
}
cout << lo;
return 0;
}
|
#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 = getchar();
if (c == EOF) return false;
while (c<'0' | c> '9') {
if (c == '-') negative = true;
c = getchar();
}
while (c >= '0' && c <= '9') {
got = true;
n = n * 10 + c - 48;
c = getchar();
}
if (negative) n = ~(n - 1);
return got;
}
template <typename T>
inline T GCD(T a, T b) {
a = abs(a);
b = abs(b);
while (b) {
a = a % b;
swap(a, b);
}
return a;
}
template <typename T>
inline T LCM(T x, T y) {
T tp = GCD(x, y);
if ((x / tp) * 1. * y > 9e18) return 9e18;
return (x / tp) * y;
}
template <typename T>
inline T BigMod(T A, T B, T M) {
T ret = 1;
while (B) {
if (B & 1) ret = (ret * A) % M;
A = (A * A) % M;
B = B >> 1;
}
return ret;
}
template <typename T>
inline T InvMod(T A, T M) {
return BigMod(A, M - 2, M);
}
int gcdr(int a, int b) {
if (a == 0) return b;
return gcdr(b % a, a);
}
void FastIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
}
int main() {
FastIO();
int n, m, p, q, i, j, a, b;
while (cin >> n) {
cin >> a >> b;
int sum = a + b;
int atmost = (a + b);
if (a > b) swap(a, b);
int ans = 1;
j = 0;
int pos = 1;
while (pos) {
j++;
if (j > atmost || (j > a || j > b)) break;
int ta = a, tb = b;
int mi = INT_MAX;
for (i = 1; i <= n; i++) {
if (ta >= j) {
ta = ta - j;
mi = min(j, mi);
} else if (tb >= j) {
tb = tb - j;
mi = min(j, mi);
} else {
pos = 0;
break;
}
}
if (pos == 1) {
ans = max(ans, mi);
} else {
break;
}
}
cout << ans << endl;
}
}
|
#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;
else
h = m;
}
cout << l;
}
|
#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);
int n, a, b, ans = 1;
cin >> n >> a >> b;
for (auto x = (1); x <= (min(a, b)); x++)
if (a / x + b / x >= n) {
amax(ans, x);
}
cout << ans;
;
return 0;
}
|
#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 << *i << ' ';
cout << '\n';
}
} // namespace Mlxa
using namespace Mlxa;
long long n, a, b;
void start() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
cin >> n >> a >> b;
}
long long s1() {
long long x = 1;
while (a / x + b / x >= n) ++x;
return x - 1;
}
long long s2() {
long long mx(0);
for (long long g(1); g < n; ++g) {
long long x = min(a / g, b / (n - g));
if (x > mx) mx = x;
}
return mx;
}
int main() {
start();
println(s2());
return 0;
}
|
#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 ((a / i) + (b / i) >= n && (a / i) > 0 && (b / i) > 0) {
cout << i;
return 0;
}
}
}
|
#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;
int ans = 0;
for (int i = 1; i < n; i++) {
int cntr = a / i, cntr1 = b, cntr2 = n - i;
ans = max(ans, min(cntr, cntr1 / cntr2));
}
cout << ans;
exit(0);
}
|
#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) {
for (int i = 2; i <= n / i; ++i) {
while (n % i == 0) {
factor.push_back(i);
n /= i;
}
}
if (n != 1) factor.push_back(n);
}
int MaxSubarray(int arr[], int n) {
int best = 0, sum = 0;
for (int i = 0; i < n; ++i) {
sum = max(arr[i], arr[i] + sum);
best = max(best, sum);
}
return best;
}
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
long long fast_power(long long b, long long p) {
long long res = 1;
while (p) {
if (p % 2) res = (res * b) % 1000000007;
b = (b * b) % 1000000007;
p /= 2;
}
return res;
}
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
int st = 0, en = 1e9;
while (st < en) {
int mid = (st + en + 1) / 2;
if (mid > min(a, b))
en = mid - 1;
else if (a / mid + b / mid < n)
en = mid - 1;
else
st = mid;
}
printf("%d\n", st);
return 0;
}
|
#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();
return 0;
}
|
#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 << pair.first << ":" << pair.second << "\n";
}
}
void solve() {
int n, a, b;
cin >> n >> a >> b;
int ans;
for (int i = 1; i <= min(a, b); i++) {
int tmp = a / i;
int tmp1 = b / i;
if (tmp + tmp1 >= n) ans = i;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#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;
int valb = b / i;
if (vala + valb >= n && vala && valb) ans = max(ans, i);
}
cout << ans << endl;
}
|
#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 << 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)) {
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));
}
}
}
printf("%d\n", maxs);
}
return 0;
}
|
#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", mn);
}
return 0;
}
|
#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() {
ios_base::sync_with_stdio(0);
cin >> n >> a >> b;
int st = 1, en = a + b, mid;
while (st <= en) {
mid = (st + en) / 2;
if (f(mid)) {
ans = mid;
st = mid + 1;
} else
en = mid - 1;
}
cout << min(ans, min(a, b));
return 0;
}
|
#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(ans, min(a / i, b / (n - i)));
cout << ans;
}
|
#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 0;
}
|
#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() {
cin >> n >> a >> b;
if (n == a + b)
cout << 1;
else {
long long ans = 1;
long long l = 1, r = a + b;
while (l <= r) {
long long mid = (r + l) / 2;
if (check(mid))
l = mid + 1, ans = mid;
else
r = mid - 1;
}
cout << ans << "\n";
}
}
int32_t main() {
online();
solve();
}
|
#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(s1, s2));
}
cout << ot << endl;
}
|
#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 = min_;
}
}
printf("%d\n", max);
}
return 0;
}
|
#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 << '\n';
return (0);
}
|
#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 = 1; i < n; ++i) {
int bc = b / i;
int ac = a / (n - i);
maxc = max(maxc, min(ac, bc));
}
cout << maxc << endl;
return 0;
}
|
#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 (int i = 1; i < n; i++) {
int j = n - i;
umax(ans, min(a / i, b / j));
}
printf("%d\n", ans);
return 0;
}
|
#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.0 * b / (n - i);
double cur_x = ((av1) < (av2) ? (av1) : (av2));
max_x = ((max_x) > (cur_x) ? (max_x) : (cur_x));
}
cout << (int)max_x << endl;
return 0;
}
|
#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() {
file_i_o();
solve();
return 0;
}
void solve() {
long long int n, first, second;
cin >> n >> first >> second;
long long int minimal = 0;
for (long long int i = 1; i < n; i++) {
minimal = max(minimal, min(first / i, second / (n - i)));
}
cout << minimal << "\n";
}
|
#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;
ans = max(ans, min(ansa, ansb));
}
printf("%d\n", ans);
}
return 0;
}
|
#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";
}
int main() {
cin.tie(0);
cout.tie(0);
cin.sync_with_stdio(0);
cout.sync_with_stdio(0);
int TC = 1;
for (int ZZ = 1; ZZ <= TC; ZZ++) {
clock_t start = clock();
solve();
clock_t end = clock();
cerr << "Time: " << (double)(end - start) / CLOCKS_PER_SEC << " seconds"
<< '\n';
}
return 0;
}
|
#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;
}
const int INF = 2e9;
const int MX = 100005;
const int MOD = 1000000007;
const double PI = acos(-1.0);
int main() {
int n = ({
int a;
read(a);
a;
}),
a = ({
int a;
read(a);
a;
}),
b = ({
int a;
read(a);
a;
});
int num = min(a, b) + 1;
while (num--) {
int x = (a / num);
int y = (b / num);
if (x + y >= n) break;
}
printf("%d\n", num);
return 0;
}
|
#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 = (r + l) / 2;
if (check(mid))
l = mid;
else
r = mid;
}
printf("%d\n", l);
return 0;
}
|
#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 = Advance();
while (isdigit(ch)) {
answer = answer * 10 + ch - '0';
ch = Advance();
}
return answer;
}
bool Check(int x, int n, int a, int b) {
if (a / x + b / x >= n && a / x >= 1 && b / x >= 1) return true;
return false;
}
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
int left = 1, right = max(a, b), answer = 1;
while (left <= right) {
int middle = (left + right) / 2;
if (Check(middle, n, a, b)) {
answer = middle;
left = middle + 1;
} else
right = middle - 1;
}
printf("%d\n", answer);
return 0;
}
|
#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(ans, min(x, y));
}
}
cout << ans << '\n';
return 0;
}
|
#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;
if (a >= mid && b >= mid) {
ct = a / mid + b / mid;
}
if (ct < n) {
r = mid - 1;
} else {
l = mid + 1;
ans = mid;
}
}
cout << ans << "\n";
}
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 - 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 / i, b / (n - i)));
}
printf("%d\n", ma);
return 0;
}
|
#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 = max(min(m / i, (k / (n - i))), ans);
}
cout << 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 = (st + nd) / 2;
if (check(md)) {
ans = md;
st = md + 1;
} else
nd = md - 1;
}
cout << ans;
return 0;
}
|
#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 (temp > min) {
min = temp;
}
}
printf("%d\n", min);
return 0;
}
|
#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':
case 'y':
return true;
break;
default:
return false;
break;
}
}
bool check(const int a[55][55], int n, int x, int y) {
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (a[x][i] + a[j][y] == a[x][y]) return true;
return false;
}
int work(int n, int p, int m) {
long long v = 0;
long long bs = 1;
int half = 0;
long long back = n;
while (n > 0) {
bs *= 10;
v = v * 10 + n % 10;
n /= 10;
}
v += back * bs;
return (v + m) % p;
}
struct a230 {
int s;
int b;
bool operator<(a230 a) { return s < a.s; }
};
long long gcd(long long a, long long b) {
if (a < b) swap(a, b);
if (b == 0) return a;
if (a % b == 0) return b;
return gcd(b, a % b);
}
long long data[300005] = {0};
long long data2[1000005] = {0};
void initFib() {
data[1] = 1;
for (int i = 2; data[i - 1] < 1000000000; i++)
data[i] = data[i - 1] + data[i - 2];
}
void init2048() {
data[0] = 1;
for (int i = 1; i < 13; i++) data[i] = data[i - 1] * 2;
}
bool isI(int i) {
int a[10] = {0};
while (i > 0) {
a[i % 10]++;
i /= 10;
}
for (int i = 0; i < 10; i++)
if (a[i] > 1) return false;
return true;
}
void init(int num, int len) {
data[0] = 1;
for (int i = 1; i < len; ++i) data[i] = num * data[i - 1];
}
void a1251() {
string s;
cin >> s;
int a[26] = {0};
for (int i = 0; i < s.length(); ++i)
if (i == s.length() - 1 || s[i] != s[i + 1])
a[s[i] - 'a'] = 1;
else
++i;
for (int i = 0; i < 26; ++i)
if (a[i] == 1) cout << (char)('a' + i);
cout << endl;
}
void b465() {
int n;
cin >> n;
int p, c;
cin >> p;
int sum = 0, seg = 0;
if (p == 1) {
sum++;
seg++;
}
for (int i = 1; i < n; ++i) {
cin >> c;
if (c == 1) {
sum++;
if (p != 1) seg++;
}
p = c;
}
if (sum == 0)
cout << 0;
else
cout << sum + seg - 1;
}
void a879() {
int n;
cin >> n;
long long sum = 0;
for (int i = 0; i < n; ++i) {
int s, d;
cin >> s >> d;
if (sum < s)
sum = s;
else {
sum = s + ((sum - s) / d + 1) * d;
}
}
cout << sum;
}
void d1256out(int b, int e, int len, int k, int n, string s) {
for (int i = 0; i < b; ++i) cout << "0";
if (k > 0 && k < len) {
for (int i = 0; i < len - k; ++i) cout << "1";
if (k > 0) cout << "0";
for (int i = 0; i < k; ++i) cout << "1";
for (int i = e + 1; i < n; ++i) cout << s[i];
} else {
for (int i = 0; i < len; ++i) cout << "1";
for (int i = e; i < n; ++i) cout << s[i];
}
cout << endl;
}
void d1256() {
long long k, n;
cin >> n >> k;
string s;
cin >> s;
int b, e = n, len = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') {
b = i;
break;
}
}
for (int i = b; i < n; ++i) {
if (s[i] == '0') {
e = i;
break;
}
len++;
}
if (b + len >= n) {
d1256out(b, n, len, 0, n, s);
return;
}
while (e < n) {
while (s[e] == '0' && len <= k) {
k -= len;
b++;
e++;
}
while (e < n && s[e] == '1') {
e++;
len++;
}
if (k < len) break;
}
if (k > len || e >= n) k = 0;
d1256out(b, e, len, k, n, s);
}
struct sb1256 {
int p, v;
bool operator<(sb1256 s) { return v < s.v; }
};
void b1256() {
int n;
cin >> n;
int a[200];
int p;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] == 1) p = i;
}
int b = 0;
int m = 1;
while (true) {
if (b != p) {
for (int i = p; i > b; --i) a[i] = a[i - 1];
a[b] = m;
} else
p++;
b = p;
m = a[p];
if (b >= n - 1) break;
for (int i = b + 1; i < n; ++i)
if (a[i] < m) {
m = a[i];
p = i;
}
}
for (int i = 0; i < n; ++i) cout << a[i] << " ";
cout << endl;
}
void c1256() {
int n, m, d;
cin >> n >> m >> d;
int a[1005] = {0};
int sum = 0;
for (int i = 0; i < m; ++i) {
cin >> a[i];
sum += a[i];
}
int empty = n - sum;
if (empty > (m + 1) * (d - 1))
cout << "NO";
else {
int each = empty / (m + 1);
int lef = empty % (m + 1);
cout << "YES" << endl;
for (int j = 0; j < m; ++j) {
for (int i = 0; i < each; ++i) cout << 0 << " ";
if (lef > 0) {
cout << 0 << " ";
lef--;
}
for (int i = 0; i < a[j]; ++i) cout << j + 1 << " ";
}
for (int i = 0; i < each; ++i) cout << 0 << " ";
}
}
struct sb520 {
int v, n;
};
void b520() {
long long n, m;
cin >> n >> m;
queue<sb520> q;
sb520 s;
s.n = 0;
s.v = n;
q.push(s);
long long mm = m * 3;
if (n >= m) {
cout << n - m;
return;
}
data[n] = 1;
while (!q.empty()) {
sb520 temp = q.front();
q.pop();
if (temp.n >= mm) {
cout << mm;
return;
}
if (temp.v * 2 == m || temp.v - 1 == m) {
cout << temp.n + 1;
return;
}
if (temp.v > m)
mm = min(mm, temp.n + temp.v - m);
else {
s.n = temp.n + 1;
s.v = temp.v * 2;
if (data[s.v] == 0) {
data[s.v] = 1;
q.push(s);
}
if (temp.v - 1 > 0) {
s.v = temp.v - 1;
if (data[s.v] == 0) {
data[s.v] = 1;
q.push(s);
}
}
}
}
cout << mm;
return;
}
int a217() {
int n;
cin >> n;
vector<int> hv[1005], lv[1005];
int h[1005] = {0}, l[1005] = {0};
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
hv[x].push_back(y);
lv[y].push_back(x);
}
int sum = 0;
for (int i = 1; i <= 1000; ++i) {
if (h[i] != 0 || hv[i].size() == 0) continue;
sum++;
h[i] = sum;
queue<int> hq, lq;
for (int j = 0; j < hv[i].size(); ++j) {
if (l[hv[i][j]] == 0) {
l[hv[i][j]] = sum;
lq.push(hv[i][j]);
}
}
while (!lq.empty()) {
while (!lq.empty()) {
int y = lq.front();
lq.pop();
for (int j = 0; j < lv[y].size(); ++j) {
if (h[lv[y][j]] == 0) {
h[lv[y][j]] = sum;
hq.push(lv[y][j]);
}
}
}
while (!hq.empty()) {
int y = hq.front();
hq.pop();
for (int j = 0; j < hv[y].size(); ++j) {
if (l[hv[y][j]] == 0) {
l[hv[y][j]] = sum;
lq.push(hv[y][j]);
}
}
}
}
}
cout << sum - 1;
}
void a1257() {
int n, x, a, b;
cin >> n >> x >> a >> b;
if (a > b) swap(a, b);
int mov = min(x, a - 1);
a -= mov;
x -= mov;
mov = min(x, n - b);
b += mov;
cout << b - a << endl;
}
void a1256() {
long long a, b, n, s, t1, t2, t3;
cin >> a >> b >> n >> s;
t1 = s / n;
if (t1 > a) t1 = a;
s -= t1 * n;
if (b >= s)
cout << "yes";
else
cout << "no";
cout << endl;
}
void b1257() {
int x, y;
cin >> x >> y;
if (x == 1 && y > 1 || x <= 3 && y > 3)
cout << "no";
else
cout << "yes";
cout << endl;
}
void a1245() {
long long x, y;
cin >> x >> y;
if (gcd(x, y) == 1)
cout << "Finite";
else
cout << "Infinite";
cout << endl;
}
void a1155() {
int n;
string s;
cin >> n >> s;
for (int i = 1; i < s.length(); ++i) {
if (s[i] < s[i - 1]) {
cout << "yes" << endl;
cout << i << " " << i + 1;
return;
}
}
cout << "no";
}
void a990() {
long long n, m, a, b;
cin >> n >> m >> a >> b;
n %= m;
cout << min(n * b, (m - n) * a);
return;
}
void a84() {
int n;
cin >> n;
cout << n + n / 2;
return;
}
void a1100() {
int n, k;
cin >> n >> k;
int arr[100] = {0};
int sum = 0;
for (int i = 0; i < n; ++i) {
int temp;
cin >> temp;
arr[i % k] += temp;
sum += temp;
}
for (int i = 0; i < k; ++i) {
arr[i] -= sum;
if (arr[i] < 0) arr[i] = -arr[i];
}
sort(arr, arr + k);
cout << arr[k - 1];
}
void a1151() {
int n;
string s;
cin >> n >> s;
int m = 55;
for (int i = 0; i < n - 3; ++i) {
int temp = 0, t2;
t2 = abs(s[i] - 'A');
temp += min(t2, 26 - t2);
t2 = abs(s[i + 1] - 'C');
temp += min(t2, 26 - t2);
t2 = abs(s[i + 2] - 'T');
temp += min(t2, 26 - t2);
t2 = abs(s[i + 3] - 'G');
temp += min(t2, 26 - t2);
if (temp < m) m = temp;
}
cout << m;
return;
}
void b1117() {
long long n, m, k, sum, s1 = 0;
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) cin >> data[i];
sort(data, data + n);
sum = 0;
if (data[n - 1] == data[n - 2])
cout << m * data[n - 1];
else {
s1 = k * data[n - 1] + data[n - 2];
sum = (m / (k + 1)) * s1 + (m % (k + 1)) * data[n - 1];
cout << sum;
}
return;
}
void a1253() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> data[i];
for (int i = 0; i < n; ++i) cin >> data2[i];
bool b = true, f = false;
int gap = 0;
for (int i = 0; i < n; ++i) {
if (data2[i] < data[i]) {
b = false;
break;
} else if (data2[i] > data[i]) {
if (f || gap != 0 && gap != data2[i] - data[i]) {
b = false;
break;
}
gap = data2[i] - data[i];
} else if (gap > 0)
f = true;
}
if (b)
cout << "YES";
else
cout << "NO";
cout << endl;
}
void b1225() {
int n, k, d;
cin >> n >> k >> d;
for (int i = 1; i <= n; ++i) cin >> data[i];
if (d == 1 || n == 1) {
cout << 1 << endl;
return;
}
memset(data2, 0, 8 * (k + 1));
int sum = 0, temp = 0;
for (int i = 1; i <= d; ++i) {
data2[data[i]]++;
if (data2[data[i]] == 1) temp++;
}
sum = temp;
for (int i = 2; i <= n - d + 1; ++i) {
data2[data[i - 1]]--;
if (data2[data[i - 1]] == 0) temp--;
data2[data[i + d - 1]]++;
if (data2[data[i + d - 1]] == 1) temp++;
if (temp < sum) sum = temp;
}
cout << sum << endl;
}
void a1255() {
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
int d = b - a;
int sum = d / 5;
d %= 5;
if (d > 2)
sum += 2;
else if (d > 0)
sum += 1;
cout << sum << endl;
}
void a1243() {
int n;
cin >> n;
int temp[1005] = {0};
for (int i = 0; i < n; ++i) {
int it;
cin >> it;
temp[it]++;
}
int sum = 0;
for (int i = 1000; i > 0; --i) {
sum += temp[i];
if (sum >= i) {
cout << i << endl;
;
return;
}
}
}
void a1215() {
int a1, a2, k1, k2, m;
cin >> a1 >> a2 >> k1 >> k2 >> m;
cout << max(m - (k1 - 1) * a1 - (k2 - 1) * a2, 0) << " ";
if (k1 > k2) {
int sum = min(a2, m / k2);
m -= sum * k2;
if (m > 0) sum += m / k1;
cout << sum;
} else {
int sum = min(a1, m / k1);
m -= sum * k1;
if (m > 0) sum += m / k2;
cout << sum;
}
}
void c546() {
int n;
queue<int> q1, q2;
int k1, k2;
cin >> n;
cin >> k1;
for (int i = 0; i < k1; ++i) {
int temp;
cin >> temp;
q1.push(temp);
}
cin >> k2;
for (int i = 0; i < k2; ++i) {
int temp;
cin >> temp;
q2.push(temp);
}
int sum = 0;
while (!q1.empty() && !q2.empty()) {
k1 = q1.front();
k2 = q2.front();
q1.pop();
q2.pop();
if (k1 > k2) {
q1.push(k2);
q1.push(k1);
} else {
q2.push(k1);
q2.push(k2);
}
sum++;
if (sum > 100000) break;
}
if (sum > 100000)
cout << -1;
else {
cout << sum << " " << (q1.empty() ? 2 : 1);
}
}
void a708() {
string s;
cin >> s;
int i = 0;
while (i < s.length() && s[i] == 'a') i++;
if (i == s.length()) s[i - 1] = 'z';
while (i < s.length() && s[i] != 'a') {
s[i]--;
i++;
}
cout << s;
}
void a982() {
string s;
int n;
cin >> n >> s;
bool b = true;
s = "0" + s + "0";
for (int i = 1; i <= n; ++i) {
if (s[i] == '0' && s[i - 1] == '0' && s[i + 1] == '0') {
b = false;
break;
}
if (s[i] == '1' && (s[i - 1] == '1' || s[i + 1] == '1')) {
b = false;
break;
}
}
if (b)
cout << "Yes";
else
cout << "No";
}
void a602() {
unsigned long long a1 = 0, a2 = 0, base = 1;
int n, bx, a[15];
cin >> n >> bx;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = n; i > 0; --i) {
a1 += base * a[i];
base *= bx;
}
cin >> n >> bx;
for (int i = 1; i <= n; ++i) cin >> a[i];
base = 1;
for (int i = n; i > 0; --i) {
a2 += base * a[i];
base *= bx;
}
if (a1 < a2)
cout << "<";
else if (a1 == a2)
cout << "=";
else
cout << ">";
}
void a633() {
long long a, b, c;
cin >> a >> b >> c;
if (a > b) swap(a, b);
if (c / b < 100) {
bool bo = false;
for (int i = 0; i <= c / b; ++i) {
if ((c - (i * b)) % a == 0) {
bo = true;
break;
}
}
if (bo)
cout << "Yes";
else
cout << "No";
} else {
long long mm = gcd(a, b);
if (c % mm == 0)
cout << "Yes";
else
cout << "No";
}
}
void b1153() {
int n, m, h;
cin >> n >> m >> h;
int ma[105] = {0};
int na[105] = {0};
int ha[105][105] = {0};
for (int i = 1; i <= m; ++i) cin >> ma[i];
for (int i = 1; i <= n; ++i) cin >> na[i];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cin >> ha[i][j];
if (ha[i][j] == 1) ha[i][j] = min(ma[j], na[i]);
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cout << ha[i][j] << " ";
}
cout << endl;
}
}
void b705() {
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n; ++i) {
int temp;
cin >> temp;
sum += (temp - 1) % 2;
if (sum % 2 == 0)
cout << 2;
else
cout << 1;
cout << endl;
}
return;
}
void a574() {
int n;
cin >> n;
int a;
cin >> a;
int sum = a;
int num = 1;
int eq = 0;
int ma = a;
int mbuf[1005] = {0};
for (int i = 2; i <= n; ++i) {
int temp;
cin >> temp;
mbuf[temp]++;
}
for (int i = 1000; i >= a; --i) {
if (mbuf[i] == 0) continue;
int temp = mbuf[i];
if (a + mbuf[i] <= i) {
mbuf[i - 1] += mbuf[i];
a += mbuf[i];
mbuf[i] = 0;
} else {
a = i + 1;
}
}
cout << a - ma;
return;
}
void a902() {
int n, m;
cin >> n >> m;
int b = 0, e = 0, t1, t2;
for (int i = 0; i < n; ++i) {
cin >> t1 >> t2;
if (t1 <= e && t2 > e) e = t2;
}
if (e >= m)
cout << "YES";
else
cout << "NO";
}
void b911() {
int n, a, b;
cin >> n >> a >> b;
int mi = 0;
for (int i = 1; i < n; ++i) {
int temp = min(a / i, b / (n - i));
mi = max(mi, temp);
}
cout << mi;
}
int main() {
b911();
return 0;
}
|
#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 << m;
}
|
#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 -= x;
}
while (tb >= x) {
nowb++;
tb -= x;
}
if (nowa == 0 || nowb == 0) return false;
return nowa + nowb >= n;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b;
int s = 1;
for (int i = 1; i <= a + b; i++) {
if (!ok(i)) {
s = i - 1;
break;
}
}
cout << s << '\n';
return 0;
}
|
#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.