ural 1864
2013-11-30 22:59
387 查看
题意描述不清 而且还卡精度 ~~
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a[110];
int main()
{
int n, sum = 0;
scanf("%d", &n);
for(int i = 0; i < n; i ++)
{
scanf("%d", &a[i]);
sum += a[i];
}
double k = (double)sum/(n+1), sum2 = 0;
for(int i = 0; i < n; i ++)
{
if((double)a[i] > k)
sum2 += (double)a[i]-k;
}
for(int i = 0; i < n; i ++)
{
if(i)
putchar(' ');
if((double)a[i] > k)
printf("%d", (int)(((double)a[i]-k)/sum2*100+0.00001));
else
printf("0");
}
return 0;
}
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a[110];
int main()
{
int n, sum = 0;
scanf("%d", &n);
for(int i = 0; i < n; i ++)
{
scanf("%d", &a[i]);
sum += a[i];
}
double k = (double)sum/(n+1), sum2 = 0;
for(int i = 0; i < n; i ++)
{
if((double)a[i] > k)
sum2 += (double)a[i]-k;
}
for(int i = 0; i < n; i ++)
{
if(i)
putchar(' ');
if((double)a[i] > k)
printf("%d", (int)(((double)a[i]-k)/sum2*100+0.00001));
else
printf("0");
}
return 0;
}
相关文章推荐
- ural 1864
- 数学分析 + 容斥原理 - URAL 1907 Coffee and Buns
- URAL 1775 B - Space Bowling 计算几何
- 回文树(回文自动机) - URAL 1960 Palindromes and Super Abilities
- ural 1272. Non-Yekaterinburg Subway
- ural Electrification Plan 最小生成树,多个源点
- ural 1008 Image Encoding
- 【算法设计与数据结构】二分法解决最大值最小化问题—进阶篇— URAL 2034 Caravans
- URAL 1434 Buses in Vasyuki (双静态邻接链表+BFS)
- [BZOJ1864][Zjoi2006]三色二叉树
- URAL 1106 Two Teams
- URAL 1198 Jobbery (强连通分量 Gabow)
- Ural 1114 Boxes
- URAL 1910 Titan Ruins: Hidden Entrance
- ural 1221. Malevich Strikes Back!
- URAL 1003 Parity(并查集)
- URAL 1201 Which Day Is It?
- 【算法设计与数据结构】URAL 1167. Bicolored Horses(动态规划求解)
- URAL 1354 Palindrome. Again Palindrome (回文 + KMP)
- ural 1341. Device