HOJ 1370 Candy
来源:互联网 发布:mac怎么升级到10.12 编辑:程序博客网 时间:2024/06/05 09:52
http://acm.hit.edu.cn/hoj/problem/view?id=1370
不能平分就输出-1
N很大 数组开大一点
#include <stdio.h>#include <math.h>int block[16384];double average(int block[], int size);bool isint(double x);int main(){ int i, n, sum; double avg; while (scanf("%d", &n) != EOF) { if (n == -1) break; sum = 0; for (i = 1; i <= n; i++) scanf("%d", &block[i]); avg = average(block, n); if (isint(avg)) { for (i = 1; i <= n; i++) { if (block[i] > avg) sum += block[i]-avg; } printf("%d\n", sum); } else printf("-1\n"); }}double average(int block[], int size){ double s = 0; int i; for (i = 1; i <= size; i++) s += block[i]; return s/size;}bool isint(double x){ const double eps = 10e-12; double z; z = fmod(x, (int)x); if (z < eps) return 1; return 0;}
- HOJ 1370 Candy
- HOJ 2687 Candy
- HOJ
- 线段树+DP 求区间连续最大子段和 hoj Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- candy
- 匈牙利命名法
- C
- 递归分治算法之二分搜索(Java版本)
- 递归分治算法之棋盘分割问题(Java版本)
- 递归分治算法之全排列问题(Java版本)
- HOJ 1370 Candy
- 哑变量矩阵生成dummy matrix with sas
- 递归分治算法之整数划分问题(Java版本)
- 百度开发者中心
- sql 语句对时间操作的总结
- 递归分治算法之N皇后问题(Java版本)
- 安装snecha touch 2的sdk工具
- 递归分治算法之矩阵链问题(Java版本)
- at oException:racle.jdbc.driver.OracleCallableStatement.getObject(OracleCallableStatement.java:1401)