一、题目
There are at least P% and at most Q% students of HDU are ACMers, now I want to know how many students HDU have at least?
HDU至少有P%和至多有Q%的学生是顶尖学生,现在我想知道HDU至少有多少学生?
Input:
The input contains multiple test cases.
The first line has one integer,represent the number of test cases.
The following N lines each line contains two numbers P and Q(P < Q),which accurate up to 2 decimal places.
输入包含多个测试用例。
第一行有一个整数,表示测试用例的数量。
以下N行每行包含两个数字P和Q(P<Q),精确到小数点后2位
Output:
For each test case, output the minumal number of students in HDU.
对于每个测试用例,输出HDU中的最小学生数。
Inputcopy:
1
13.00 14.10
Outputcopy:
15
二、方法一
1、思路
浮点数精度问题,感觉有点水,p<q的时候跳出循环,输出即可。
2、代码
#include<stdio.h>
int n;
int i, j, k;
double p, q;
int main()
{
scanf("%d", &n);
while (n--)
{
scanf("%lf %lf", &p, &q);
i = 1;
while ((int)(i * p / 100) >= (int)(i * q / 100))
i++;
printf("%d\n", i);
}
return 0;
}