Topcoder题代码
来源:互联网 发布:c语言创建二叉树 编辑:程序博客网 时间:2024/05/22 08:29
原题:
You have a certain amount of money to give out as a bonus to employees. The trouble is, who do you pick to receive what bonus? You decide to assign a number of points to each employee, which corresponds to how much they helped the company in the last year. You are given an vector <int> points, where each element contains the points earned by the corresponding employee (i.e. points[0] is the number of points awarded to employee 0). Using this, you are to calculate the bonuses as follows:
- First, add up all the points, this is the pool of total points awarded.
- Each employee gets a percentage of the bonus money, equal to the percentage of the point pool that the employee got.
- Employees can only receive whole percentage amounts, so if an employee's cut of the bonus has a fractional percentage, truncate it.
- There may be some percentage of bonus left over (because of the fractional truncation). If n% of the bonus is left over, give the top n employees 1% of the bonus. There will be no more bonus left after this. If two or more employees with the same number of points qualify for this "extra" bonus, but not enough bonus is left to give them all an extra 1%, give it to the employees that come first in points.
The return value should be a vector <int>, one element per employee in the order they were passed in. Each element should be the percent of the bonus that the employee gets.
Definition
Class: Bonuses Method: getDivision Parameters: vector <int> Returns: vector <int> Method signature: vector <int> getDivision(vector <int> points) (be sure your method is public)Constraints
- points will have between 1 and 50 elements, inclusive. - Each element of points will be between 1 and 500, inclusive.Examples
0){1,2,3,4,5}
Returns: { 6, 13, 20, 27, 34 }The total points in the point pool is 1+2+3+4+5 = 15.
Employee 1 gets 1/15 of the total pool, or 6.66667%, Employee 2 gets 13.33333%, Employee 3 gets 20% (exactly), Employee 4 gets 26.66667%, and Employee 5 gets 33.33333%. After truncating, the percentages look like:
{6,13,20,26,33}
Adding up all the fractional percentages, we see there is 2% in extra bonuses, which go to the top two scorers. These are the employees who received 4 and 5 points. 1)
{5,5,5,5,5,5}
Returns: { 17, 17, 17, 17, 16, 16 }The pool of points is 30. Each employee got 1/6 of the total pool, which translates to 16.66667%. Truncating for all employees, we are left with 4% in extra bonuses. Because everyone got the same number of points, the extra 1% bonuses are assigned to the four that come first in the array. 2)
{485, 324, 263, 143, 470, 292, 304, 188, 100, 254, 296, 255, 360, 231, 311, 275, 93, 463, 115, 366, 197, 470}
Returns: { 8, 6, 4, 2, 8, 5, 5, 3, 1, 4, 5, 4, 6, 3, 5, 4, 1, 8, 1, 6, 3, 8 }
我的代码:
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <list>
using namespace std;
class Bonuses{
public:
vector <int> getDivision(vector <int> points);
};
vector <int> Bonuses::getDivision(vector<int> points)
{
float sum=0;
int leave=0,save=100,tag=0;
vector<int> stvec,hvec;
vector<int>::iterator iter;
for (iter=points.begin();iter!=points.end();++iter)
{
sum+=*iter;
}
for (int y=0;y!=points.size();++y)
{
leave=(int)(((float)points[y]/(float)sum)*100);
stvec.push_back(leave);
save-=leave;
}
vector<int> temvec(points);
sort(temvec.begin(),temvec.end(),greater<int>());
for (int k=0;k<save;++k)
{
hvec.push_back(temvec[k]);
}
for (int z=0;z<points.size();++z)
{
if (count(hvec.begin(),hvec.end(),points[z]))
{
stvec[z]++;
tag++;
}
if (tag==save)
{
break;
}
}
return stvec;
}
int main()
{
int input;
Bonuses A;
vector<int> avec,bvec;
while (cin>>input)
{
avec.push_back(input);
}
bvec=A.getDivision(avec);
for (int i=0;i<bvec.size();++i)
{
cout<<bvec[i]<<' ';
}
return 0;
}
牛人代码:
#include <iostream>
#include <algorithm>
#include <numeric>
#include <iterator>
#include <string>
#include <vector>
#include <list>
using namespace std;
class Bonuses{
public:
vector <int> getDivision(vector <int> points);
};
vector <int> Bonuses::getDivision(vector<int> points)
{
vector<int>vPercent;
int total=accumulate(points.begin(),points.end(),0);
vector<int>::iterator it=points.begin();
int left=100;
int n;
for (;it!=points.end();++it)
{
n=*it*100/total;
left-=n;
vPercent.push_back(n);
}
vector<int>vTmp(points);
while(left>0)
{
it=max_element(vTmp.begin(),vTmp.end());
*it=-1;
--left;
}
it=vPercent.begin();
vector<int>:: const_iterator itTmp=vTmp.begin();
for (;it!=vPercent.end();++it,++itTmp)
{
if (*itTmp==-1)
{
++(*it);
}
}
return vPercent;
}
int main()
{
int input;
Bonuses A;
vector<int> avec,bvec;
while (cin>>input)
{
avec.push_back(input);
}
bvec=A.getDivision(avec);
for (int i=0;i<bvec.size();++i)
{
cout<<bvec[i]<<' ';
}
return 0;
}
- Topcoder题代码
- Topcoder题代码
- Topcoder 字符串转换题
- Topcoder好题推荐
- TopCoder
- topcoder
- Topcoder
- topcoder
- topcoder
- Topcoder
- TOPCODER/SRM 566 DIVII(250、500、1000题)(1000PT暂未附上代码)
- TopCoder - "TCHS SRM 1" 答案 及 代码
- TopCoder每日一二题--1
- TopCoder每日一二题--2
- [topCoder-每日一二题]--[3]
- [topCoder-每日一二题]--[5]
- Topcoder 551 DIV2 第三题
- [topCoder-每日一二题]--[6]----动态规划
- 初涉JSON
- 要细心
- ASP.NET AJAX框架编程之JSON序列化剖析
- microsoft silverlight和flash有什么区别
- vector可用的函数
- Topcoder题代码
- 看似简单的问题 静态方法和实例化方法的区别
- gridview导入到excel最简单的方法
- 静态类和静态类成员(摘要一些网民的说法)
- 转换
- abstract与interface的区别
- Repository模式
- From China Daily 21/5
- 每日一课 SQL SERVER数据库分类