【模拟】XMU 1062 山东煎饼

来源：互联网发布：win10 php环境搭建编辑：程序博客网时间：2024/04/27 13:35

题目链接：

　　http://acm.xmu.edu.cn/JudgeOnline/problem.php?id=1062

题目大意：

　　已知金钱，和各面额钞票张数，问最少可以换成几张。

题目思路：

　　【模拟】

　　暴力模拟即可。

////by coolxxx//#include<iostream>#include<algorithm>#include<string>#include<iomanip>#include<memory.h>#include<time.h>#include<stdio.h>#include<stdlib.h>#include<string.h>//#include<stdbool.h>#include<math.h>#define min(a,b) ((a)<(b)?(a):(b))#define max(a,b) ((a)>(b)?(a):(b))#define abs(a) ((a)>0?(a):(-(a)))#define lowbit(a) (a&(-a))#define sqr(a) ((a)*(a))#define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))#define eps (1e-8)#define J 10000000#define MAX 0x7f7f7f7f#define PI 3.1415926535897#define N 14using namespace std;typedef long long LL;int cas,cass;int n,m,lll,ans;int c[]={0,500,100,50,10,5,1};int a[N],b[N];int main(){#ifndef ONLINE_JUDGE//freopen("1.txt","r",stdin);//freopen("2.txt","w",stdout);#endifint i,j,k;//for(scanf("%d",&cas);cas;cas--)//for(scanf("%d",&cas),cass=1;cass<=cas;cass++)//while(~scanf("%s",s))while(~scanf("%d",&n)){ans=0;n=1000-n*25;for(i=1;i<7;i++)scanf("%d",&a[i]);for(i=1;i<7 && n;i++){if(n<c[i])continue;b[i]=n/c[i];b[i]=min(a[i],b[i]);n-=b[i]*c[i];ans+=b[i];}if(n)puts("-1");else printf("%d\n",ans);}return 0;}/*////*/

0 0