首页 > 代码库 > ACMer
ACMer
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
1 #include <stdio.h> 2 3 int main(){ 4 int T; 5 double P; 6 double Q; 7 int number; 8 9 scanf("%d",&T);10 11 while(T--){12 scanf("%lf%lf",&P,&Q);13 14 number=1;15 while(1){16 if((int)(number*P/100)<(int)(number*Q/100))17 break;18 19 number++;20 }21 22 printf("%d\n",number);23 }24 25 return 0;26 }
ACMer
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。