ACMer

ACMer

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

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
  
  

 

Source

2007省赛集训队练习赛（1）

注意浮点型陷阱：double x*0.01应写为x/100

 

 

#include<stdio.h>
int main()
{
	int N,n;
	double x,y;
	scanf("%d",&N);
	while(N--){
		scanf("%lf%lf",&x,&y);
		for(n=1;;n++)
		{
			if((int)(n*x/100)<(int)(n*y/100)){
				printf("%d\n",n);
				break;
			}
			
		}
	}
	return 0;
}