[1701]: ACMer

ACMer

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4484 Accepted Submission(s): 2071

Problem Description
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?

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.

Output
For each test case, output the minumal number of students in HDU.

Sample Input
1
13.00 14.10

Sample Output
15

解题思路：这是一道对于强制转换应用的题目，其中：at least P% and at most Q%

#include<stdio.h>

int main()
{
    int num, i, minNum;
    double p, q;
    scanf("%d", &num);
    while(num--){
        minNum = 0;
        scanf("%lf%lf", &p, &q);
        while((int)(p*minNum/100) >= (int)(q*minNum/100))   {
            minNum++;
        }
        printf("%d\n", minNum);
    }
    return 0;
}