当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1464:Company

题目描述
company pays different hourly wages for different job types. Each week the company keeps evidence of the total number of work hours for every job type and the total amount paid to all employees for that week. In different weeks different job types can be accomplished. The hourly wage for any job type in the same company remains unchanged. The hourly wage for any job type is a positive integer and the ratio between the maximum wage and the minimum wage is less than 6.

You are asked to write a program that computes the hourly wage for every job type using the data collected a period of time (one or several weeks). The number of job types is limited to 200 and the number of weeks in one data set is limited to 50.
输入解释
The input contains several data sets in text format.

The format for the data set is:

The number of lines for the data set;
information_for__one_or_more_weeks
The format of the information for a week is the following:
job_type1 number_of _hours1
job_type2 number_of _hours2
job_type3 number_of _hours3
... ...
. total_paid ( the dot marks the ending of info for a week)

The job type is represented as a string of characters (limited to 20). The number of hours is a positive integer (smaller than 1E5). The total paid is a positive integer (smaller than 2E10).
输出解释
The program should write to standard output (for every job type involved in the data set) a line containing the job type and the hourly wage. The output for a data set ends with a line containing a dot.

If the program cannot compute a unique hourly wage for every job type it will print "Incomplete data" and if it cannot compute an integer hourly wage it will print "Inconsistent data"

An example is given in the following:
输入样例
5
job1 6
job2 5
job8 4
job10 3
. 100
13
job3 1
job2 2
. 40
job1 3
job2 1
. 100
job1 1
job3 2
job2 3
. 100
job1 1
job2 5
. 80
输出样例
Incomplete data
.
job3 20
job2 10
job1 30
.

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-1464

最后修改于 2020-10-29T06:04:51+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 10000