UVa10300 - Ecological Premium -难度0
来源:互联网 发布:淘宝双十一活动规则2015 编辑:程序博客网 时间:2024/05/16 19:14
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1241
Problem A
Ecological Premium
Input: standard input
Output: standard output
Time Limit: 1 second
Memory Limit: 32 MB
German farmers are given a premium depending on the conditions at their farmyard. Imagine the following simplified regulation: you know the size of each farmer's farmyard in square meters and the number of animals living at it. We won't make a difference between different animals, although this is far from reality. Moreover you have information about the degree the farmer uses environment-friendly equipment and practices, expressed in a single integer greater than zero. The amount of money a farmer receives can be calculated from these parameters as follows. First you need the space a single animal occupies at an average. This value (in square meters) is then multiplied by the parameter that stands for the farmer's environment-friendliness, resulting in the premium a farmer is paid per animal he owns. To compute the final premium of a farmer just multiply this premium per animal with the number of animals the farmer owns.
Input
The first line of input contains a single positive integer n (<20), the number of test cases. Each test case starts with a line containing a single integer f (0<f<20), the number of farmers in the test case. This line is followed by one line per farmer containing three positive integers each: the size of the farmyard in square meters, the number of animals he owns and the integer value that expresses the farmer’s environment-friendliness. Input is terminated by end of file. No integer in the input is greater than 100000 or less than 0.
Output
For each test case output one line containing a single integer that holds the summed burden for Germany's budget, which will always be a whole number. Do not output any blank lines.
Sample Input
3
5
1 1 1
2 2 2
3 3 3
2 3 4
8 9 2
3
9 1 8
6 12 1
8 1 1
3
10 30 40
9 8 5
100 1000 70
Sample Output
38
86
7445
(The Joint Effort Contest, Problem setter: Frank Hutter)
- #include <iostream>
- using namespace std;
- int main()
- {
- //freopen("f:\\input.txt", "r", stdin);
- int n;
- cin >> n;
- while(n--)
- {
- int f;
- cin >>f;
- int sum = 0;
- while(f--)
- {
- int size, num, value;
- cin >> size >> num >> value;
- sum += size * value;//其实动物的数量没关系
- }
- cout << sum << endl;
- }
- return 0;
- }
- UVa10300 - Ecological Premium -难度0
- 算法竞赛入门经典-前四章-UVa10300 - Ecological Premium-生态奖金-难度0
- UVa10300 Ecological Premium
- Ecological Premium - UVa10300
- uva10300 Ecological Premium
- UVA10300 - Ecological Premium
- Ecological Premium
- Ecological Premium
- Ecological Premium
- Ecological Premium
- Ecological Premium
- Ecological Premium
- 10300 - Ecological Premium
- Uva 10300 Ecological Premium
- uva 10300 Ecological Premium
- UVa 10300 Ecological Premium
- UVA 10300 - Ecological Premium
- uva-10300 - Ecological Premium
- 嵌入式Linux之我行——S3C2440上触摸…
- Linux环境进程间通信(二): 信号…
- Linux环境进程间通信(二): 信号…
- Linux环境进程间通信(二): 信号…
- Linux环境进程间通信(二): 信号…
- UVa10300 - Ecological Premium -难度0
- 信号
- 信号
- wait和waitpid函数
- wait和waitpid函数
- fcntl 函数
- fcntl 函数
- Linux 系统内核的调试
- Linux 系统内核的调试