# UVA oj 10300 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

Sample Output

38

86

7445

#include<cstdio>
using namespace std;

typedef long long ll;

int main()
{
ll a,b,c,sum;
int n,t;
scanf("%d",&t);
while(t--)
{
sum = 0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%lld%lld%lld",&a,&b,&c);
sum += a*c;
}
printf("%d\n",sum);
}
return 0;
}


• 本文已收录于以下专栏：

## UVA - 10300 Ecological Premium（水题）

Problem A Ecological Premium Input: standard input Output: standard output Time Limit: 1 second ...

## UVa 10300 Ecological Premium (water ver.)

10300 - Ecological Premium Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option...

## UVa 10300 - Ecological Premium

Problem A Ecological Premium Input: standard input Output: standard output Time Limit: 1 second ...

## Volume 0. Getting Started 10300 - Ecological Premium

Problem A Ecological Premium Input: standard input Output: standard output Time Limit: 1 second ...
• WHQ557
• 2012年05月23日 23:33
• 179

• KWY_Q
• 2016年06月15日 11:22
• 138

## 杭电OJ水题

• 2015年06月23日 16:30
• 52KB
• 下载

## UVA oj 445 Marvelous Mazes（水题字符串）

Marvelous Mazes Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %l...
• Sara_YF
• 2016年06月02日 12:31
• 152

## Uva oj （算法入门经典） 排序与检索系列水题系列

Uva10420 - List of Conquests 题意就是首先给出一个n，表示字符的行数，下面n行字母，开头一个单词国家名字，后面一串人名，要你统计出每个国家人出现的次数，并按字母序输出。  ...