uva 10300 Ecological Premium
来源:互联网 发布:c语言输出一个三角形 编辑:程序博客网 时间:2024/06/03 01:22
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
#include <stdio.h>int main(){ int n; while (scanf("%d", &n) != EOF) { int i, j; for (i = 0; i < n; i++) { int f, sum = 0; scanf("%d", &f); for (j = 0; j < f; j++) { int a, b, c; scanf("%d %d %d", &a, &b, &c); sum += a * c; } printf("%d\n", sum); } } return 0;}
- Uva 10300 Ecological Premium
- uva 10300 Ecological Premium
- UVa 10300 Ecological Premium
- UVA 10300 - Ecological Premium
- uva-10300 - Ecological Premium
- uva 10300 Ecological Premium
- [UVa]10300-Ecological Premium
- UVA:10300 - Ecological Premium
- UVa 10300 - Ecological Premium
- UVa 10300 - Ecological Premium
- UVA - 10300 - Ecological Premium
- UVa 10300 - Ecological Premium
- UVA 10300 Ecological Premium
- UVA - 10300 Ecological Premium
- uva 10300 - Ecological Premium
- UVa 10300 Ecological Premium
- UVA 10300-Ecological Premium
- UVa OJ 10300-Ecological Premium
- BS客户端能否同时登陆多个用户
- 如何在64位操作系统里让Revit的命令连接Access数据库?
- libstagefright
- AA065VD数据线连接错位的现象及分析总结
- android Cursor 使用方法
- uva 10300 Ecological Premium
- ubuntu下安装Ice3.4.2
- ListView异步加载图片是非常实用的方法
- git push错误;fatal: The remote end hung up unexpectedly
- rotate的用法
- 智能课程表Android版-日期和时间的动态显示(二)
- reverse的用法
- 错误代码中文查询GetLastError返回代码的含义
- netstat命令的详细用法示例