hdoj 1239 Calling Extraterrestrial Intelligence Again
来源:互联网 发布:阿里云服务器申请退款 编辑:程序博客网 时间:2024/06/18 11:25
Calling Extraterrestrial Intelligence Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4648 Accepted Submission(s): 2439
Problem Description
A message from humans to extraterrestrial intelligence was sent through the Arecibo radio telescope in Puerto Rico on the afternoon of Saturday November 16, 1974. The message consisted of 1679 bits and was meant to be translated to a rectangular picture with 23 * 73 pixels. Since both 23 and 73 are prime numbers, 23 * 73 is the unique possible size of the translated rectangular picture each edge of which is longer than 1 pixel. Of course, there was no guarantee that the receivers would try to translate the message to a rectangular picture. Even if they would, they might put the pixels into the rectangle incorrectly. The senders of the Arecibo message were optimistic.
We are planning a similar project. Your task in the project is to find the most suitable width and height of the translated rectangular picture. The term "most suitable" is defined as follows. An integer m greater than 4 is given. A positive fraction a / b less than or equal to 1 is also given. The area of the picture should not be greater than m. Both of the width and the height of the translated picture should be prime numbers. The ratio of the width to the height should not be less than a / b nor greater than 1. You should maximize the area of the picture under these constraints.
In other words, you will receive an integer m and a fraction a / b. It holds that m > 4 and 0 < a / b < 1. You should find the pair of prime numbers p, q such that pq <= m and a / b <= p / q <= 1, and furthermore, the product pq takes the maximum value among such pairs of two prime numbers. You should report p and q as the "most suitable" width and height of the translated picture.
We are planning a similar project. Your task in the project is to find the most suitable width and height of the translated rectangular picture. The term "most suitable" is defined as follows. An integer m greater than 4 is given. A positive fraction a / b less than or equal to 1 is also given. The area of the picture should not be greater than m. Both of the width and the height of the translated picture should be prime numbers. The ratio of the width to the height should not be less than a / b nor greater than 1. You should maximize the area of the picture under these constraints.
In other words, you will receive an integer m and a fraction a / b. It holds that m > 4 and 0 < a / b < 1. You should find the pair of prime numbers p, q such that pq <= m and a / b <= p / q <= 1, and furthermore, the product pq takes the maximum value among such pairs of two prime numbers. You should report p and q as the "most suitable" width and height of the translated picture.
Input
The input is a sequence of at most 2000 triplets of positive integers, delimited by a space character in between. Each line contains a single triplet. The sequence is followed by a triplet of zeros, 0 0 0, which indicated the end of the input and should not be treated as data to be processed.
The integers of each input triplet are the integer m, the numerator a, and the denominator b described above, in this order. You may assume 4 < m <= 100000 and 1 <= a <= b <= 1000.
The integers of each input triplet are the integer m, the numerator a, and the denominator b described above, in this order. You may assume 4 < m <= 100000 and 1 <= a <= b <= 1000.
Output
The output is a sequence of pairs of positive integers. The i-th output pair corresponds to the i-th input triplet. The integers of each output pair are the width p and the height q described above, in this order.
Each output line contains a single pair. A space character is put between the integers as a delimiter. No other characters should appear in the output.
Each output line contains a single pair. A space character is put between the integers as a delimiter. No other characters should appear in the output.
Sample Input
5 1 299999 999 9991680 5 161970 1 12002 4 110 0 0
Sample Output
2 2313 31323 7343 4337 53
简单搜索:用了打表法
#include<stdio.h>#include<math.h>#define max 100000+10int prime[max];//是素数为1,不是为0 void Prime(){ int i,j; for(i=1;i<max;i++) prime[i]=1; for(i=2;i<max;i++) { if(prime[i]==1) { for(j=2*i;j<max;j+=i) prime[j]=0; } } prime[1]=0;prime[2]=prime[3]=1;}int main(){ int i,j,q,p,sum; double m; int a,b,t; Prime();//打表 while(scanf("%lf %d%d",&m,&a,&b)&&(m!=0||a!=0||b!=0)) { q=p=0;sum=0; t=sqrt(m); for(i=1;i<=t+1;i++) { for(j=i;j<=m;j++) { if(prime[i]&&prime[j]&&b*i>=a*j&&i*j<=m&&i*j>sum) { sum=i*j;//更新 p=i; q=j; } } } printf("%d %d\n",p,q); } return 0;}
1 0
- hdoj 1239 Calling Extraterrestrial Intelligence Again
- HDOJ 1239 Calling Extraterrestrial Intelligence Again
- HDOJ 1239:Calling Extraterrestrial Intelligence Again 解题报告
- HDOJ 1239 Calling Extraterrestrial Intelligence Again 13.04.21周赛结题报告
- POJ-1411 & HDOJ-1239 Calling Extraterrestrial Intelligence Again 解题报告
- hdoj 1239 Calling Extraterrestrial Intelligence Again(数学)
- Calling Extraterrestrial Intelligence Again
- Calling Extraterrestrial Intelligence Again
- Calling Extraterrestrial Intelligence Again
- 杭电1239 Calling Extraterrestrial Intelligence Again
- hdu 1239Calling Extraterrestrial Intelligence Again
- Hdu 1239 Calling Extraterrestrial Intelligence Again
- hdu 1239 Calling Extraterrestrial Intelligence Again
- HDU 1239 Calling Extraterrestrial Intelligence Again
- hdu 1239 Calling Extraterrestrial Intelligence Again
- HDU 1239 Calling Extraterrestrial Intelligence Again
- hdu 1239 Calling Extraterrestrial Intelligence Again
- HDU 1239 Calling Extraterrestrial Intelligence Again
- ubuntu 14.10 (64位)下载amd显卡,实现双显卡切换
- JAVA中JVM的GC日志解析
- struts2 所有常量配置详解
- Dynamics CRM 2013 SP1 升级到Dynamics CRM 2015
- slave have equal MySQL server UUIDs
- hdoj 1239 Calling Extraterrestrial Intelligence Again
- Leetcode之Palindrome Number
- poj 1502 MPI Maelstrom Dijkstra算法的简单运用 ,呵呵,,我估计有很多人都没看懂什么意思,我也看了很久
- [SPOJ]-1481-寻找素数项-miller rabin
- [USACO]-4.2-完美的牛栏-二分图匹配
- iOS XMPP Framework 07 - 收发消息 上
- 关于FMDB 数据库自己看着学的,希望可以互相学习
- [搬运]关于扩展欧几里得与同余方程
- Poj-1330-Nearest Common Ancestors-倍增LCA