HDUOJ-----(1329)Calling Extraterrestrial Intelligence Again
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
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[0]=isprime[1]=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 }
剩下的就是对问题进行遍历了....由于求最大值,pq.....所以采取从最大处开始搜索......
代码:
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[0]=bol[1]=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 %dn",prime[ansx],prime[ansy]);
71 }
72 return 0;
73 }
- 用PHP蜘蛛做旅游数据分析
- 一秒找出用时间和随机数生成的上传文件名
- Java之集合的遍历与迭代器
- Java之字符串String,StringBuffer,StringBuilder
- JavaScript深入浅出补充——(一)数据类型,表达式和运算符
- Oracle数据库(一)概述、基础与简单操作
- Oracle数据库(二)常用关键字以及函数
- Oracle数据库(三)表操作,连接查询,分页
- 正式学习第一天下午——基础标签及其属性
- 正式学习第二天上午——常用标签及列表 0605
- Java之面向对象例子(三) 多态,重写,重载,equals()方法和toString()方法的重写
- Java之IO流补充
- JavaWeb 例子 JDBC+JSP登陆注册留言板
- 基于bro的计算机入侵取证实战分析
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法
- 「查缺补漏」巩固你的Redis知识体系
- MySQL事务 Krains 2020-08-09
- Linux本地提权漏洞复现与检测思路
- 内容安全策略( CSP )
- [译] 优化 React APP 的 10 种方法
- 如何免登陆观看b站大会员番剧
- 聊聊越来越火的对象存储
- AJAX的基本原理及实例解析。
- Docker私有镜像仓库是什么?
- React Native布局详细指南
- 走进Golang之Context的使用
- 「Workshop」第十一期:降维
- 开始在 GitHub 上写博客
- 微信公众号菜单点击发送天气预报
- SAP CRM Fiori应用如何启用Sales Office和Sales Group两个字段