发工资咯:)
2016-07-13 11:06
141 查看
#include<stdio.h>
#include<string.h>
int main()
{
int n, a[101], sum, i;
memset(a, 0, sizeof(a));
while(~scanf("%d", &n), n != 0)
{
for(i=0; i<n; i++)
{
scanf("%d", &a[i]);
}
sum = 0;
for(i=0; i<n; i++)
{
sum += a[i]/100;
a[i] %= 100;
sum += a[i]/50;
a[i] %= 50;
sum += a[i]/10;
a[i] %= 10;
sum += a[i]/5;
a[i] %= 5;
sum += a[i]/2;
a[i] %= 2;
sum += a[i]/1;
}
printf("%d\n", sum);
}
return 0;
}
#include<string.h>
int main()
{
int n, a[101], sum, i;
memset(a, 0, sizeof(a));
while(~scanf("%d", &n), n != 0)
{
for(i=0; i<n; i++)
{
scanf("%d", &a[i]);
}
sum = 0;
for(i=0; i<n; i++)
{
sum += a[i]/100;
a[i] %= 100;
sum += a[i]/50;
a[i] %= 50;
sum += a[i]/10;
a[i] %= 10;
sum += a[i]/5;
a[i] %= 5;
sum += a[i]/2;
a[i] %= 2;
sum += a[i]/1;
}
printf("%d\n", sum);
}
return 0;
}
相关文章推荐
- 再度理解原码、反码、补码
- JavaScript中RegExp.$1是什么意思
- "一个实用的却被忽略的命名空间:Microsoft.VisualBasic":
- 7月13日
- css 等高布局
- 可重入和线程安全
- 类型转换问题
- JS基础随笔(菜鸟必看篇)
- RecyclerView更新数据
- linux User Mode linux
- 17.1 Replication Configuration 复制:
- 从Camera来看Binder IPC机制
- Android存储方式-SQlite
- Shell 实用代码块
- POJ2992 Divisors 组合数,分解质因数
- 基于express的精简web服务
- Python2.7 urlparse学习
- Unity5.0 EventSystem事件系统的详细说明
- 常用js语法小记
- Bean和Map相互转化-Java工具类(一)