hdu---1701ACMer

最新推荐文章于 2018-09-16 20:45:51 发布

「已注销」

最新推荐文章于 2018-09-16 20:45:51 发布

阅读量559

点赞数

分类专栏： ====ACM算法学习==== 水题

本文链接：https://blog.csdn.net/Songjs19931206/article/details/42391351

版权

====ACM算法学习==== 同时被 2 个专栏收录

195 篇文章 2 订阅

订阅专栏

水题

22 篇文章 0 订阅

订阅专栏

ACMer

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

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

//一道枚举题，注意判断成功条件。

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#define N 5010
int a,b;//
int f[N];
char str[10],ff[10];
int main()
{
    freopen("in.txt","r",stdin);
    int i,j,k,T,n,m;int len;
    while(scanf("%d",&T)!=EOF){
        while(T--){
            int num=0;
            double x,y;
            scanf("%lf %lf",&x,&y);
            for(n=1;;n++)
                if((int)(n*y/100)-(int)(n*x/100)==1){
                    num=n;break;
                }
            printf("%d\n",num);
        }
    }
    return 0;
}