hdu 1701 ACMer
2014-08-01 22:25
120 查看
ACMer
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3695 Accepted Submission(s): 1693
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 /*题解: 暴力 */ #include<cstdio> int main() { int i,n; double a,b; scanf("%d",&n); while(n--) { scanf("%lf %lf",&a,&b); for(i=0; ;i++) { if((int)(i*a/100)<(int)(i*b/100)) break; } printf("%d\n",i); } return 0; }
相关文章推荐
- HDU 1701 ACMer
- HDU-1701-ACMer
- hdu-1701-ACMer
- hdu 1701 ACMer
- hdu 1701 ACMer
- HDU 1701 ACMer(浮点数精度)
- hdu 1701 ACMer
- HDU 1701 ACMer
- hdu 1701 ACMer(水题)
- HDU 1701 ACMer
- hdu 1701 ACMer
- hdu 1701 ACMer
- HDU 1420 Prepared for New Acmer
- hdu 1420(Prepared for New Acmer)(中国剩余定理)(降幂法)
- HDU 1420 Prepared for New Acmer(快速幂)
- HDU 1701 Binary Tree Traversals 【二叉树】
- hdu 1420 Prepared for New Acmer(快速幂入门)
- 【HDU】1420 Prepared for New Acmer(水题、取余)
- [1701]: ACMer
- (HDU-5246)2015Astar-初赛-1001-超级赛亚ACMer