10300 - Ecological Premium
来源:互联网 发布:如何建立大数据平台 编辑:程序博客网 时间:2024/06/05 18:00
这题目奇奇怪怪的,除掉了在乘回去…这是要考浮点数转整数这个知识点吗?反正我没有除,直接 premium = size*degree.
题目:
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 farmers 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 Ger- many’s budget, which will always be a whole number. Do not output any blank lines.
Sample Input
3
5
111
222
333
234
892
3
918
6 12 1 811
3
10 30 40 985
100 1000 70
Sample Output
38 86 7445
代码:
#include <stdio.h>int main() { int n; scanf("%d", &n); for (int i = 0; i < n; ++i) { int f, totalBurden = 0; scanf("%d", &f); for (int j = 0; j < f; ++j) { int sm, an, degree; scanf("%d%d%d", &sm, &an, °ree); totalBurden += sm * degree; } printf("%d\n", totalBurden); } 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
- web api filter 和 mvc filter 区别
- 统计字符串中每个字符出现的次数
- Android开发蓝牙4.0BLE开发
- 数据结构初探(部分原创)
- 在Windows下如何安装Tomcat服务器搭建
- 10300 - Ecological Premium
- IOS 数据存储之 Core Data详解
- 携车网及其竞品分析
- Java之字节流与字符流的区别
- 创建和销毁对象
- 获取radio选中的值
- hdu 2768 Cat vs. Dog【最大独立集】
- C++编译连接总结(一)--g++
- 即使jarsigner 后,有些机型还是会安装不上,报错INSTALL_PARSE_FAILED_NO_CERTIFICATES