# Calling Extraterrestrial Intelligence Again

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4083    Accepted Submission(s): 2140

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 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

Asia 2002, Kanazawa (Japan)

Recommend

Eddy

``` 1 #include<iostream>
2 #include<cstdio>
3 #include<cstring>
4 #define maxn 100
5 #include<cstdlib>
6 using namespace std;
7 int prime[maxn+2],rank=0;
8 bool isprime[maxn+2];
9
10 void Prim()
11 {
12     int i,j;
13     memset(isprime,true,sizeof(isprime));
14
15     isprime=isprime=false;
16     for(i=0;i*i<=maxn;i++)
17     {
18         if(isprime[i])
19         {
20             prime[rank++]=i;
21             for(j=2*i;j<=maxn;j+=i)
22                 isprime[j]=false;
23         }
24     }
25     for(j=i;j<maxn;j++)
26         if(isprime[j])
27             prime[rank++]=j;
28 }
29
30 int main()
31 {
32
33     Prim();
34     for(int i=0;i<rank;i++)
35         printf("%d ",prime[i]);
36     puts("");
37     return 0;
38 }```

``` 1 int maze[maxn+1];
2  int two_find(int a[],int m,int n)
3  {
4    int left=0,right=n,mid;
5    while(left<right)
6    {
7        mid=(left+right)/2;
8        if(a[mid]==m)
9            break;
10        else
11            if(a[mid]<m)
12              left=mid+1;
13            else right=mid-1;
14    }
15    return mid;
16  }```

``` 1     #include<stdio.h>
2     #include<string.h>
3     #define maxn 100000
4     #include<stdlib.h>
5     int prime[maxn+2],step=0;
6     bool bol[maxn+5];
7     int two_find(int m)
8     {
9        int left=0,right=step-1;
10        int mid;
11        while(left<right)
12        {
13           mid=(left+right)/2;
14          if(prime[mid]==m)
15                 break;
16          else if(prime[mid]>m)
17              right=mid-1;
18          else left=mid+1;
19        }
20        return mid;
21     }
22     int main()
23     {
24         int m,a,b,i,j,k;
25       /*¿ìËÙËØÊý±í*/
26       memset(bol,true,sizeof(bol));
27       bol=bol=false;
28       prime[step++]=2;
29       /*³ýÈ¥Å¼Êý*/
30         for(i=4;i<=maxn;i+=2)
31             bol[i]=false;
32         /*¿ªÊ¼*/
33         for(i=3;i*i<=maxn;i++)
34         {
35             /*ÎªËØÊý£¬´æÈë£¬³ýµôÆä±¶Êý*/
36             if(bol[i])
37             {
38              prime[step++]=i;
39              /*´ÓÈý±¶¿ªÊ¼*/
40              for(k=2*i,j=i*i; j<=maxn;j+=k)
41                  bol[j]=false;
42             }
43         }
44         /*´òÏÂÒ»°ëËØÊý*/
45         for( ; i<=maxn ; i++ )
46             if(bol[i])
47                 prime[step++]=i;
48
49         while(scanf("%d%d%d",&m,&a,&b),m+a+b)
50         {
51           double cal=(double)a/b;
52           int max=two_find(m),ans=0,ansx,ansy;
53           for(i=max;i>=0;i--)
54           {
55               for(j=i;j<=max;j++)
56               {
57                 if(prime[i]*prime[j]>m||(double)prime[i]/prime[j]<cal)
58                        break;
59                 if(prime[i]<=m/prime[j]&&(double)prime[i]/prime[j]>=cal)
60                 {
61                     if(ans<prime[i]*prime[j])
62                     {
63                         ans=prime[i]*prime[j];
64                         ansx=i;
65                         ansy=j;
66                     }
67                 }
68               }
69           }
70           printf("%d %d\n",prime[ansx],prime[ansy]);
71         }
72          return 0;
73     }```

657 篇文章64 人订阅

0 条评论

## 相关文章

### HDU 5752 Sqrt Bo【枚举，大水题】

Sqrt Bo Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K ...

26840

### HDU 3450 Counting Sequences（线段树）

Counting Sequences Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 3276...

31160

### HDUOJ-----Difference Between Primes

Difference Between Primes Time Limit: 2000/1000 MS (Java/Others)    Memory Limit...

32760

### HDU 1213 How Many Tables

How Many Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32...

28470

### hdu-----（1150）Machine Schedule（最小覆盖点）

Machine Schedule Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3...

31450

### HDU-1011 Starship Troopers（树形dp）

Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536...

35370

### SPOJ Number of Palindromes(回文树)

Number of Palindromes Time Limit: 100MS Memory Limit: 1572864KB 64bit I...

28360

16600

### hdu----(1677)Nested Dolls(DP/LIS（二维）)

Nested Dolls Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768...

32660

### HDU 4247 Pinball Game 3D(cdq 分治+树状数组+动态规划)

Pinball Game 3D Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/...

28540 