백준 11999 Milk Pails (USACO February 2016 Bronze 1번)

문제 링크: https://www.acmicpc.net/problem/11999

11999번: Milk Pails (Bronze)

#include <bits/stdc++.h>
using namespace std;
 
int x, y, m;
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    cin >> x >> y >> m;
 
    int ans = 0;
    for(int i = 0; i <= 1000; i++) for(int j = 0; j <= 1000; j++) {
        if(x * i + y * j <= m)
            ans = max(ans, x * i + y * j);
    }
 
    cout << ans << '\n';
    return 0;
}