hdu 1701 ACMer

ACMer

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

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）  

//#include"stdafx.h"
#include<stdio.h>
#include<algorithm>
using namespace std;
#define  size 1010

int main() {
    int test;
    float a, b;
    scanf_s("%d", &test);
    for (int i = 1; i <= test; i++) {
        scanf_s("%f%f", &a, &b);
        float minn = 1;
        while (true){
            int c = (int)(minn*a / 100);
            int d = (int)(minn*b / 100);
            if (d - c == 1)
                break;
            minn++;
        }
        printf_s("%d\n", (int)minn);
    }
}