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.
 
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 }

 

 

转载于:https://www.cnblogs.com/zqxLonely/p/4086128.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值