1214A Optimal Currency Exchange

Optimal Currency Exchange

Andrew was very excited to participate in Olympiad of Metropolises. Days flew by quickly, and Andrew is already at the airport, ready to go home. He has n rubles left, and would like to exchange them to euro and dollar bills. Andrew can mix dollar bills and euro bills in whatever way he wants. The price of one dollar is d rubles, and one euro costs e rubles.

Recall that there exist the following dollar bills: 1, 2, 5, 10, 20, 50, 100, and the following euro bills — 5, 10, 20, 50, 100, 200 (note that, in this problem we do not consider the 500 euro bill, it is hard to find such bills in the currency exchange points). Andrew can buy any combination of bills, and his goal is to minimize the total number of rubles he will have after the exchange.

Help him — write a program that given integers n, e and d, finds the minimum number of rubles Andrew can get after buying dollar and euro bills.

Input

The first line of the input contains one integer n (1≤n≤108) — the initial sum in rubles Andrew has.

The second line of the input contains one integer d (30≤d≤100) — the price of one dollar in rubles.

The third line of the input contains integer e (30≤e≤100) — the price of one euro in rubles.

Output

Output one integer — the minimum number of rubles Andrew can have after buying dollar and euro bills optimally.

解题思路
欧元和美元的面值都分别为5欧元，和1美元的倍数，只需要分别考虑1美元和5欧元面值的纸币即可。之后对其中一种进行枚举找到最小的省钱数即可。

AC代码

#include<bits/stdc++.h>

using namespace std;

int main() {
    int n, d, e;
    cin>>n;
    cin>>d;
    cin>>e;
    int ei = e * 5;
    int num = n / ei;
    int _min =  1000000000;
    int num1;
    for(int i = 0;i <= num;i++) {
        num1 = (n - ei * i) % d;
        if(_min > num1)
            _min = num1;
    }
    cout<<_min<<endl;
    return 0;
}