POJ Problem 3940 Grey Area
2016-10-27 11:27
218 查看
主要是要注意结果的输出格式
#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
int main()
{
int n, w;
while(cin >> n >> w){
if(n == 0 && w == 0) break;
vector<int> cnt(80, 0);
int base = -1, len = -1;
for(int i = 0; i < n; ++i){
int v;
cin >> v;
++cnt[v/w];
base = max(base, cnt[v/w]);
len = max(len, v/w);
}
vector<double> color(len);
for(int i = 0; i < len; ++i)
color[i] = (len-i)*1.0/len;
double ans=0.0;
for(int i = 0; i < len; ++i)
ans += (1.0*color[i]*cnt[i])/base;
ans += 0.01;
printf("%.10g\n",ans);
}
return 0;
}
#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
int main()
{
int n, w;
while(cin >> n >> w){
if(n == 0 && w == 0) break;
vector<int> cnt(80, 0);
int base = -1, len = -1;
for(int i = 0; i < n; ++i){
int v;
cin >> v;
++cnt[v/w];
base = max(base, cnt[v/w]);
len = max(len, v/w);
}
vector<double> color(len);
for(int i = 0; i < len; ++i)
color[i] = (len-i)*1.0/len;
double ans=0.0;
for(int i = 0; i < len; ++i)
ans += (1.0*color[i]*cnt[i])/base;
ans += 0.01;
printf("%.10g\n",ans);
}
return 0;
}
相关文章推荐
- poj 3940 Grey Area 浮点输出控制
- 【矩阵乘法】OpenJ_POJ - C17F - A Simple Math Problem
- http://poj.org/problem?id=1195二维树状数组
- (Relax 线段树1.1)POJ 3468 A Simple Problem with Integers(线段树子区间更新的维护:集中更新和动态统计子序列中的数据)
- A Simple Problem with Integers(POJ-3468)(线段树)
- poj 3468 A Simple Problem with Integers
- 线段树 poj 3468 A Simple Problem with Integers 区间add更新
- poj 3468 A Simple Problem with Integers - 线段树
- poj 3468 A Simple Problem with Integers(线段树,成段更新)
- POJ 1350 Cabric Number Problem (6174问题)水题
- POJ 3468 A Simple Problem with Integers 树状数组 区间修改 区间查询
- POJ 3468 A Simple Problem with Integers (线段树)
- poj 3468 A Simple Problem with Integers
- 【POJ 3468】A Simple Problem with Integers
- POJ 3468 A Simple Problem with Integers
- POJ 1658 Eva's Problem(我的水题之路——等差or等比)
- POJ1207-The 3n + 1 problem
- POJ 2282 The Counting Problem (数位dp)
- poj 3468 A Simple Problem with Integers (线段树---成段更新)
- POJ 2826 An Easy Problem?!