Ecological Premium

原创 2013年12月04日 20:44:15

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>
#include <stdlib.h>

int main()
{
    int m, n, i, j, a[3], s, k;
    scanf("%d", &m);
    for(i = 0; i <= m - 1; i++)
    {
        scanf("%d", &n);
        s = 0;
        for(j = 0; j <= n - 1; j++)
        {
            for(k = 0; k <= 2; k++)
            {
                scanf("%d", &a[k]);
            }
            s = s + a[0] * a[2];
        }
        printf("%d\n", s);
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

UVa 10300 Ecological Premium (water ver.)

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

Volume 0. Getting Started 10300 - Ecological Premium

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

UVA - 10300 Ecological Premium(水题)

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

Ecological Premium

Ecological Premium Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu     Ge...

10300 - Ecological Premium

入门题,简单地求个和。
  • KWY_Q
  • KWY_Q
  • 2016年06月15日 11:22
  • 121

UVa 10300 - Ecological Premium

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

UVA oj 10300 Ecological Premium(水题)

Ecological Premium Input:  standard input Output:  standard output Time Limit:  1 second ...
  • Sara_YF
  • Sara_YF
  • 2016年06月01日 19:14
  • 181

UVa - 102 - Ecological Bin Packing

没看出动态规划,直接枚举了六种情况,找出最小的即可,注意当结果相同的时候,需要输出字典序最小的,所以输入的时候需要做个小处理。...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Ecological Premium
举报原因:
原因补充:

(最多只允许输入30个字)