ZCMU 1512: Monster

最新推荐文章于 2022-08-22 11:05:10 发布

原创最新推荐文章于 2022-08-22 11:05:10 发布 · 409 阅读

0 ·

CC 4.0 BY-SA版权

ZCMU 专栏收录该内容

58 篇文章

订阅专栏

博客讲述男孩ZDD为救女友SZD，途中要打N个怪物，杀怪概率为P，杀一个怪可得M把钥匙，需计算能获取钥匙数量的期望。给出输入输出格式，包括测试用例数、怪物数、杀怪概率和得钥匙数等信息。

1512: Monster

Description
There was a boy called ZDD, and he loved a girl whose name is SZD. He loved her very much, and after answering the question, SZD became ZDD’s girlfriend. They fell in love with each other deeply. But the happy time wasn’t longer. One day SZD was caught by a big boss called TIANKENG. And ZDD decided to save his lover. On his way to TIANKENG’s castle, there was N monsters. And ZDD can kill the monster with a probability P. If ZDD killed one monster, he could get M keys. ZDD wanted to know what is the expectation of the number of keys he can get?

Input
The first line is an integer T, which indicates the number of test case.
For each test case, there are three integers N, P, M (1<=N<=10000, 0<=p<=100, 1<=M<=10000), which indicates the number of monsters, the probability of kill a monster, and the number of keys he can get.

Output
For each test case, you should print the answer in one line with two decimal places.

Sample Input

2
10 100 10
10 50 1

Sample Output

100.00
5.00

HINT
水体。
Code：

#include<stdio.h>
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int N,M;
        double P;
        scanf("%d %lf %d",&N,&P,&M);
        printf("%.2lf\n",N*(P/100)*M);
    }
    return 0;
}