212人阅读 评论(0)

# ACMer

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

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
题目大意：hdu的acmer最多占学校总数的Q%,最少占P%,问学校的人数最少是多少？

#include<stdio.h>
#include<math.h>
int main()
{
int n,i;
double p,q;
scanf("%d",&n);
while(n--)
{
int sum=0;
scanf("%lf%lf",&p,&q);
int num=q-p;
i=1;
while(1)
{
if((int)(p*i/100)<(int)(q*i/100))
{
sum=i; break;
}
i++;
}
printf("%d\n",sum);
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：50677次
• 积分：2420
• 等级：
• 排名：第17697名
• 原创：198篇
• 转载：7篇
• 译文：0篇
• 评论：2条
文章分类