Educational Codeforces Round 35 B - Two Cakes

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e5 + 7, maxd = 1e5 + 7;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int n, a, b;

int main() {

    scanf("%d %d %d", &n, &a, &b);
    if(a > b) swap(a, b);
    for(int i = a; i >= 1; --i) {
        if(a / i + b / i >= n) {
            cout << i << endl;
            return 0;
        }
    }

    return 0;
}