Calling Extraterrestrial Intelligence Again
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 5 Accepted Submission(s) : 5
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
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 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
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
#include <iostream>
#include <cstring>
#define N 1005
using namespace std;
bool tag[1005];
int p[1005];
void get_prime()
{
int cnt=0;
for(int i=2;i<N;i++)
{
if(tag[i]) p[cnt++]=i;
for(int j=0;j<cnt&&p[j]*i<N;j++)
{
tag[i*p[j]]=0;
if(i%p[j]==0) break;
}
}
}
int main(int argc, char *argv[])
{
int m,a,b;
int p1,q1,i,j;
int max;
memset(tag,true,sizeof(tag));
get_prime();
/*
for(i=0;i<170;i++)
{
cout<<p[i]<<endl;
}*/
while(cin>>m>>a>>b)
{
if(m==0&&a==0&&b==0) break;
max=0;
for(i=0;i<170;i++)
{
for(j=i;j<170;j++)
{
double c,d;
c=1.0*p[i]/p[j];
d=1.0*a/b;
if(p[i]*p[j]<=m&&c>=d&&c<=1)
{
if(p[i]*p[j]>max)
{
p1=p[i];q1=p[j];
max=p[i]*p[j];
}
}
}
}
cout<<p1<<" "<<q1<<endl;
}
return 0;
}