poj 1411 Calling Extraterrestrial Intelligence Again(超时)
2016-05-27 21:23
489 查看
Calling Extraterrestrial Intelligence Again
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 x 73 pixels. Since both 23 and 73 are prime numbers, 23 x 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.
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 indicates 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.
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.
Sample Input
Sample Output
Source
Japan 2002 Kanazawa
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 11211 | Accepted: 4356 |
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 x 73 pixels. Since both 23 and 73 are prime numbers, 23 x 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.
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 indicates 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.
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.
Sample Input
5 1 2 99999 999 999 1680 5 16 1970 1 1 2002 4 11 0 0 0
Sample Output
2 2 313 313 23 73 43 43 37 53
Source
Japan 2002 Kanazawa
#include<cstdio> #include<cmath> #include<iostream> using namespace std; #define N 100001 int prime ; bool check ; int n,a,b,m,tot; int main(){ for(int i=2;i<=N;i++) if(!check[i]){ prime[n++]=i; for(int j=i*2;j<=N;j+=i) check[j]=1; } while(scanf("%d %d %d",&m,&a,&b)==3&&m&&a&&b){ double adivb=a*1.0/b,tmp=0; int ansi,ansj; for(int i=0;i<n;i++){ for(int j=i;j<n;j++){ double t1=1.0*prime[i]*prime[j]; double t2=1.0*prime[i]/prime[j]; if(t1>tmp&&t1<=m&&t2>=adivb&&t2<=1){ tmp=t1;ansi=i;ansj=j; } } } printf("%d %d\n",prime[ansi],prime[ansj]); } return 0; }
相关文章推荐
- Codeforces Round #353 (Div. 2) E. Trains and Statistic 线段树+dp
- Codeforces Round #317 [AimFund Thanks-Round] (Div. 2)A Arrays
- Codeforces Round #354 (Div. 2) E - The Last Fight Between Human and AI
- Leetcode 217. Contains Duplicate
- InnoDB Spin rounds per wait在>32位机器上可能为负
- 关于tools:context=".MainActivity"的解释
- CodeForces 675B Restoring Painting
- PyBrain库的example之NFQ流程图分析
- Exception in thread "main" org.hibernate.TransactionException: commit failed
- 集合中contains方法体会
- 本地运行hadoop-Failed to locate the winutils binary in the hadoop binary path-转载
- Map.containsKey方法——判断Map集合对象中是否包含指定的键名
- 修改document.domain会引起的问题
- kvm 安ERROR Failed to connect socket to '/var/run/libvirt/libvirt-sock': No such file or directory
- 利用document.domain来进行基础域名相同的跨域操作
- CodeForces675BRestoring Painting(数学规律计算)
- UltraISO制作U盘启动盘安装Win7/9/10系统攻略
- 当代人工智能的核心技术究竟是什么?
- Libcontainer Specification
- codeforces 675E Trains and Statistic 线段树+贪心统计