911B - Two Cakes - CodeForces Solution


binary search brute force implementation *1200

Please click on ads to support us..

Python Code:

n,a,b=map(int,input().split())
print(max(min(a//i,b//(n-i)) for i in range(1,n)))

C++ Code:

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int n,a,b;

bool ok(int mid)
{
    if(a/mid + b/mid >= n)
        return true;
    return false;
}

int main()
{

    ios::sync_with_stdio(0);
    cin.tie(0);


    cin>>n>>a>>b;

    int l=1,r=min(a,b);

    while(l<r)
    {
        int mid = (l+r+1)/2;
        if(ok(mid))
            l = mid;
        else
            r = mid-1;
    }

    cout<<r;


    return 0;
}


Comments

Submit
0 Comments
More Questions

1671D - Insert a Progression
1671A - String Building
1671B - Consecutive Points Segment
1671C - Dolce Vita
1669G - Fall Down
4D - Mysterious Present
1316B - String Modification
1204A - BowWow and the Timetable
508B - Anton and currency you all know
1672A - Log Chopping
300A - Array
48D - Permutations
677C - Vanya and Label
1583B - Omkar and Heavenly Tree
1703C - Cypher
1511C - Yet Another Card Deck
1698A - XOR Mixup
1702E - Split Into Two Sets
1703B - ICPC Balloons
1702F - Equate Multisets
1700A - Optimal Path
665C - Simple Strings
1708A - Difference Operations
1703E - Mirror Grid
1042A - Benches
1676B - Equal Candies
1705B - Mark the Dust Sweeper
1711A - Perfect Permutation
1701B - Permutation
1692A - Marathon