SCUT Training 20170920 Problem B
来源:互联网 发布:软件基础架构平台 编辑:程序博客网 时间:2024/06/05 03:12
原题:http://acm.hdu.edu.cn/showproblem.php?pid=2021
思路:
水题,对于每份工资,尽量给大钞,统计钞票数量就可以了
源代码:
#include <cstdio> //Bint n,ans=0;int a[101]={};int mon[7]={0,100,50,10,5,2,1};void find(int x){ int p=1; int tmp=x; while (tmp>0) { while (tmp>=mon[p]) { tmp-=mon[p]; ans++; } p++; }}int main(){ while (scanf("%d",&n) && n!=0) { ans=0; for (int i=1;i<=n;i++) { scanf("%d",&a[i]); find(a[i]); } printf("%d\n",ans); }}
阅读全文
0 0
- SCUT Training 20170920 Problem B
- SCUT Training 20170913 Problem B
- SCUT Training 20170920 Problem A
- SCUT Training 20170920 Problem C
- SCUT Training 20170920 Problem D
- SCUT Training 20170920 Problem E
- SCUT Training 20170920 Problem F
- SCUT Training 20170920 Problem G
- SCUT Training 20170920 Problem H
- SCUT Training 20170920 Problem I
- SCUT Training 20170920 Problem J
- SCUT Training 20170920 Problem K
- SCUT Training 20170920 Problem L
- SCUT Training 20170920 Problem M
- SCUT Training 20170920 Problem N
- SCUT Training 20170920 Problem O
- SCUT Training 20170920 Problem P
- SCUT Training 20170913 Problem A
- 数据结构笔试、面试
- 身份证识别识别OCR技术解决方案
- 详解将jsoncpp编译so库,进行封装和解析JSON数据
- 修改 linux 文件时间
- Android--多线程断点续传
- SCUT Training 20170920 Problem B
- hdu 1251 统计难题
- Hi3531 软件环境搭建
- Spring 基于xml配置的知识点
- A. Kirill And The Game
- 详解SVM模型
- iOS开发--CoreMotion和CLLocationManager教程
- 产生一个int数组,长度为100,并向其中随机插入1-100,并且不能重复
- android studio学习