标签：based 583 dollar Andrew rubles Div bills 100 euro

A. Optimal Currency Exchange

Problem Description：

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.

Input

100
60
70

 

Output

40

Input

410
55
70

Output

5

题意:有n个卢布，要换成美元和欧元，使手上剩余的卢克最少。一美元价值d卢布，一欧元价值e卢克.

思路：关键：欧元的面值最小为5，则是5的倍数，美元最小面值为1。

写法：特判+枚举。

AC代码：

//欧元的面值最小为5，其实的都少5的倍数，美元最小面值为1。
/*
1 dollar---> d rubles
1 euro ----> e rubles
 
dollar  1 2 5 10 20 50 100
euro     5 10 20 50 100 200
 
*/
#include<bits/stdc++.h>
 
using namespace std;
 
#define int long long
 
signed main(){
    int n,d,e;
    cin>>n>>d>>e;
    int ans=n;
    int x1=n/e;
    if(x1<5){
        printf("%lld\n",n-(n/d)*d);return 0;
    }else{
        int t1=n/(e*5);
        for(int i=0;i<=t1;i++){
            int temp=n;
            temp=temp-e*i*5-((n-e*i*5)/d)*d;
            //int sum2=temp-(temp/d)*d;
            ans=min(ans,temp);
        }
        printf("%lld\n",ans);
        
    }
    return 0;
}

 

标签：based,583,dollar,Andrew,rubles,Div,bills,100,euro
来源： https://www.cnblogs.com/pengge666/p/11474409.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。