ACMer
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4747 Accepted Submission(s): 2225
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.
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
题目看第一眼看不懂。。。。因为样例给的答案乘以百分比不是整数。。。
其实很水的,就是要n*p%<n*q%
因为上面两个数可能是小数,就要把它们转换成int类型
代码:
#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
int t;
scanf("%d",&t);
double p,q;
while(t--){
scanf("%lf%lf",&p,&q);
int i;
for(i=1;;i++){
if((int)(p*i/100)<(int)(q*i/100)){
break;
}
}
printf("%d\n",i);
}
return 0;
}