zoukankan      html  css  js  c++  java
  • 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
    ",number);
    23     }
    24     
    25     return 0;
    26 }
     
  • 相关阅读:
    二叉堆(最小堆, 最大堆)介绍与实现
    C++ 用变量定义数组
    C++ 用变量定义数组
    053185
    053184
    053183
    053182
    053181
    053180
    oracle prior
  • 原文地址:https://www.cnblogs.com/zqxLonely/p/4086128.html
Copyright © 2011-2022 走看看