华为收银小助手(转载要注明出处，谢谢！！)

爱喝雪花啤酒

于 2014-06-03 16:22:39 发布

阅读量761

点赞数

CC 4.0 BY-SA版权

分类专栏：编程语言文章标签： cpp

本文链接：https://blog.youkuaiyun.com/kuenking111/article/details/28268577

编程语言专栏收录该内容

126 篇文章

订阅专栏

本文介绍了一个使用C语言实现的货币找零算法。该算法能够根据输入的金额计算出最优的纸币和硬币组合，并考虑了不同面额的限制。通过对输入金额的整数倍放大处理，确保了计算精度。

#include<stdio.h>

int main()
{
double m;
int n;
unsigned int wushi=0,ershi=0,shi=0,wuyuan=0,yiyuan=0,wujiao=0,yijiao=0;
while(scanf("%lf",&m)!=EOF)
{
n = (int)(m*10.0);
if(n > 21500||n<0)
{
printf("the operate is fail\n");
break;
}
else
{
wushi = n /500;
if(wushi >10)
wushi=10;
n = n - 500*wushi;
ershi = n/200;
if(ershi > 20)
ershi=20;
n =n-200*ershi;
shi = n/100;
if(shi > 50)
shi =50;
n =n-shi*100;
wuyuan =n/50;
if(wuyuan >100)
wuyuan=100;
n -=wuyuan*50;
yiyuan =n/10;
if(yiyuan >100)
yiyuan =100;
n = n-yiyuan*10;
wujiao = n/5;
if(wujiao >200)
wujiao =200;
n = n-wujiao*5;
yijiao = n;
if(n >500)
yijiao=500;
printf("%d %d %d% d %d %d %d\n",wushi,ershi,shi,wuyuan,yiyuan,wujiao,yijiao);

}

}
return 0;
}