hdu 1239 Calling Extraterrestrial Intelligence Again
2015-08-22 21:30
405 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1239
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.
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.
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.
99999 999 999
1680 5 16
1970 1 1
2002 4 11
0 0 0
313 313
23 73
43 43
37 53
题目简意:根据给定的m、a、b 输出尽可能大的质数p和q 使得p*q<=m且p/q>=a/b
打个素数表,暴力算就行了
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.
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.
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 299999 999 999
1680 5 16
1970 1 1
2002 4 11
0 0 0
Sample Output
2 2313 313
23 73
43 43
37 53
题目简意:根据给定的m、a、b 输出尽可能大的质数p和q 使得p*q<=m且p/q>=a/b
打个素数表,暴力算就行了
[code]#include<cstdio> #include <iostream> #include<algorithm> #include <vector> #include <string.h> #define N 100009 using namespace std; int flag ; vector<double> prime; void init() { int i, j; memset(flag, 1, sizeof(flag)); flag[1] = 0; for (i = 2; i < N; i++) { for (j = 2; flag[i] && i*j < N; j++) { flag[i*j] = 0; } } for (i = 2; i < N; i++) { if (flag[i]) { prime.push_back(i); } } } int main() { #ifndef ONLINE_JUDGE freopen("1.txt", "r", stdin); #endif int m, a, b, i, j, t, q, p, len, max; double x, y; init(); len = prime.size(); while(scanf("%d%d%d", &m, &a, &b), (a || b || m)) { x = 1.0 * a / b; p = q = 0; max = 0; for (i = 0; prime[i] <= m; i++) { for (j = i; prime[i]*prime[j]<= m; j++) { if (prime[i]/prime[j] >= x) { if (prime[i]*prime[j] > max) { max = prime[i]*prime[j]; p = i; q = j; } } } } cout << prime[p] << " " << prime[q] << endl; } return 0; }
相关文章推荐
- Debug Assertion Failed! File: afx.inl
- PAT 1014. Waiting in Line (30)
- unresolved external symbol _winmain@16
- rails yaml with expression or variable (Using ERB in YAML Configuration File)
- 【LeetCode】(70)Climbing Stairs (Easy)
- POJ 1995 Raising Modulo Numbers【快速幂】
- CodeForcesGym 100676G Training Camp
- HN OJ 13375 Flowery Trails (spfa的路径遍历)
- Aizu 2302 On or Off
- poj1363——Rails
- 转:CDC,CPaintDC,CClientDC,CWindowDC区别
- (转载)BeginPaint和GetDC有什么区别?
- HDU2141Can you find it? (二分计算计算Ai+Bj+Ck = X)
- HDU 5344(MZL's xor-(ai+aj)的异或和)
- BFS(最短路) HDOJ 4308 Saving Princess claire_
- hdu 3047 Zjnu Stadium(加权并查集)2009 Multi-University Training Contest 14
- 百度地图Baidu LBS 的使用
- POJ 2248 & ZOJ 1937 Addition Chains
- Injection of resource dependencies failed解决办法总结
- int main(int argc,char* argv[])详解