10300 - Ecological Premium
来源:互联网 发布:php超链接输出成文本 编辑:程序博客网 时间:2024/06/01 22:32
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
-------------------------------------------------------------------------------------------------------------------------------------
#include <iostream>using namespace std;int main(){ int cases,farmers,count=0; cin >> cases; while (count < cases) { cin >> farmers; int result=0; int arr[farmers][3]; int i,j; for(i=0; i<farmers; i++) { for(j=0;j<3;j++) cin >> arr[i][j]; } for(i=0;i<farmers;i++) result += (arr[i][0]*arr[i][2]); cout << result << endl; count++; } return 0;}
- 10300 - Ecological Premium
- Uva 10300 Ecological Premium
- uva 10300 Ecological Premium
- UVa 10300 Ecological Premium
- UVA 10300 - Ecological Premium
- uva-10300 - Ecological Premium
- 10300 Ecological Premium
- uva 10300 Ecological Premium
- UVaOJ 10300 - Ecological Premium
- 10300 - Ecological Premium
- [UVa]10300-Ecological Premium
- 10300 - Ecological Premium
- UVA:10300 - Ecological Premium
- UVa 10300 - Ecological Premium
- 10300 - Ecological Premium
- 10300 - Ecological Premium
- UVa 10300 - Ecological Premium
- 10300 - Ecological Premium
- 致青春
- 软件控制屏幕亮灭
- 让sublime text 2更好地支持Python
- iOS POST请求
- (24)动态扩展数组边界
- 10300 - Ecological Premium
- 自定义ViewGroup实现水平滑动
- 关于思考VirtualAlloc申请的内存属性的问题
- HTML5视频插件,各种已解决和正在解决的问题
- Redis+Keepalived高可用方案详细分析
- UVa 11991 - Easy Problem from Rujia Liu?
- 快速排序
- java static块异常对类加载的影响
- 降魔篇之springmvc项目开发