CodeRorce- Prizes, Prizes, more Prizes
来源:互联网 发布:人工智能程序的维护 编辑:程序博客网 时间:2024/04/30 15:51
这个题目比较简单,但是有些细节。
比如:50个输入,每个都是10^9,但是奖品最高价格为5.
那么奖品5的数量将会超过int的表示范围,所以cnt要用unsigned long long类型。
#include <stdio.h>#include <string.h>typedef unsigned long long LL;int n;int points[60];int cost[5];LL cnt[5];LL sum;int main(){ freopen("input.txt","r",stdin); while(scanf("%d",&n)!=EOF){ memset(points,0,sizeof(points)); memset(cost,0,sizeof(cost)); memset(cnt,0,sizeof(cnt)); sum=0; for (int i = 0; i < n; ++i){ scanf("%d",&points[i]); } for (int i = 0; i < 5; ++i) scanf("%d",&cost[i]); for (int i = 0; i < n; ++i) { sum+=points[i]; while(sum>=cost[0]){ for (int j = 4; j >= 0; --j) { int num = sum/cost[j]; if (num>=1) { cnt[j]+=num; sum-=cost[j]*num; break; } } } } printf("%llu %llu %llu %llu %llu\n",cnt[0],cnt[1],cnt[2],cnt[3],cnt[4]); printf("%llu\n",sum); }}
0 0
- CodeRorce- Prizes, Prizes, more Prizes
- <cf> Prizes, Prizes, more Prizes
- D. Prizes, Prizes, more Prizes
- CodeForces Prizes, Prizes, more Prizes
- CodeForces - 208D Prizes, Prizes, more Prizes
- Codeforces 208D Prizes, Prizes, more Prizes
- 【CodeForces 208D】Prizes, Prizes, more Prizes
- Codeforces-208D Prizes, Prizes, more Prizes
- 十八周周赛D题Prizes, Prizes, more Prizes
- 第18周周赛(大一)--D - Prizes, Prizes, more Prizes
- Nobel Prizes: Aggregate functions
- SGU495-Kids and Prizes
- 【SGU495】【Kids and Prizes】
- 【SGU495】 Kids and Prizes
- SGU495 Kids and Prizes 概率
- Kids and Prizes(概率+期望)
- SGU 495. Kids and Prizes
- Kids and Prizes - SGU 495
- printf非常奇怪的参数问题
- Eclipse+CDT+MinGW,搭建C++开发环境
- 文件过滤驱动实现目录重定向(三)
- 大小端
- COM 学习笔记
- CodeRorce- Prizes, Prizes, more Prizes
- nil / Nil / NULL / NSNull
- POJ 2551 Ones(取模)
- 012:列表:一个打了激素的数组3
- 动态页面JSP开发
- 通过Proxy访问其它Cas应用
- jsp之重定向和转发理解
- exe ->dll
- JAVA学习笔记(四十一)-多线程与线程组