UVA oj 10300 Ecological Premium(水题)

原创 2016年06月01日 19:14:25

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.


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 .


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




奖金 = 农场的面积 / 动物的数目 * 环境友好等级 * 动物的数目 = 农场的面积 * 环境友好等级 

using namespace std;

typedef long long ll;

int main()
    ll a,b,c,sum;
    int n,t;
        sum = 0;
        for(int i=0;i<n;i++)
            sum += a*c;
    return 0;

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Sara_YF/article/details/51558314


Ecological Premium Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu 题目链接:http...
  • u013447865
  • u013447865
  • 2014年11月30日 12:56
  • 516

10300 Ecological Premium

Problem A Ecological Premium Input: standard input Output: standard output Time Limit: 1 second ...
  • zhuyi2654715
  • zhuyi2654715
  • 2012年05月14日 18:38
  • 1376


#include #include #include #include #include #include #include #include using na...
  • ll365594480
  • ll365594480
  • 2012年04月11日 13:13
  • 228

10300-Ecological Premium

German farmers are given a premium depending on the conditions at their farmyard. Imagine the follow...
  • userluoxuan
  • userluoxuan
  • 2014年07月07日 20:30
  • 352

10300 - Ecological Premium

10300-Ecological Premium
  • u013515273
  • u013515273
  • 2016年06月22日 19:48
  • 115

UVA - 10300 Ecological Premium(水题)

Problem A Ecological Premium Input: standard input Output: standard output Time Limit: 1 second ...
  • HelloWorld10086
  • HelloWorld10086
  • 2014年08月22日 09:05
  • 428

UVA OJ: 10300 - Ecological Premium

#include int main() {     int n,mon;     int a,b,c;     int t;     scanf("%d",&n);     while(...
  • u013646775
  • u013646775
  • 2014年04月15日 14:57
  • 288

10300 - Ecological Premium

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

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
  • 242

Uva 10300 Ecological Premium

不用说的一道题,就是求每组三个数的第一个和第三个相乘的和。#includelong int rows = 0;int main(void){ while (scanf("%ld",&rows) != ...
  • clicl
  • clicl
  • 2011年03月09日 07:57
  • 472
您举报文章:UVA oj 10300 Ecological Premium(水题)