hdu 1701 ACMer

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1701

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

113.00 14.10

 

Sample Output

15

 

Source

2007省赛集训队练习赛（1）

开始写这道题的时候很坑啊，自己想多了。还对其向上和向下取整了。。因为总人数是整数，所以只需要暴力寻找满足最小和最大值有差距的一个值就好了。

代码：

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<string>#include<math.h>#include<stdlib.h>#include<map>#include<queue>#define max(x,y)x>y?x:y#define min(x,y)x<y?x:yusing namespace std;const int maxn=60;int dp[maxn][maxn][maxn];int main(){   freopen("in.txt","r",stdin);   int n;   scanf("%d",&n);   while(n--)   {       double p,q;       scanf("%lf %lf",&p,&q);       for(int i=1;;i++)       {           int t1=p*i/100;           int t2=q*i/100;           if(t1<t2)           {               printf("%d\n",i);               break;           }       }   }    return 0;}