【HDOJ】1239 Calling Extraterrestrial Intelligence Again

这题wa了很多词,题目本身很简单,把a/b搞反了,半天才检查出来。


 1 #include <stdio.h>
2 #include <string.h>
3 #include <math.h>
4
5 char isPrime[100001];
6
7 int main() {
8 int i, j, q, p, maxi, maxj, max;
9 double m, a, b, n, tmp1, tmp2;
10
11 memset(isPrime, 1, sizeof(isPrime));
12 isPrime[0] = isPrime[1] = 0;
13 for (i=2; i<100001; ++i) {
14 if (isPrime[i]) {
15 for (j=i+i; j<100001; j+=i)
16 isPrime[j] = 0;
17 }
18 }
19
20 while (scanf("%lf %lf %lf", &m, &a, &b) != EOF) {
21 if (m==0.0f && a==0.0f && b==0.0f)
22 break;
23 n = a/b;
24 a = sqrt(m);
25 b = sqrt(m/n);
26 i = (int)floor(a);
27 j = (int)floor(b);
28 max = 0;
29 for (p=j; p>=2; --p) {
30 if ( !isPrime[p] )
31 continue;
32 if (p*i <= max)
33 break;
34 for (q=i; q>=2; --q) {
35 if ( !isPrime[q] )
36 continue;
37 tmp1 = p*q;
38 tmp2 = q*1.0f/p;
39 if (tmp1<=m && tmp2<=1 && tmp2>=n) {
40 if (tmp1 > max) {
41 max = tmp1;
42 maxj = p;
43 maxi = q;
44 }
45 break;
46 }
47 }
48 }
49 printf("%d %d\n", maxi, maxj);
50 }
51
52 return 0;
53 }

【HDOJ】1239 Calling Extraterrestrial Intelligence Again,布布扣,bubuko.com

时间: 2024-10-25 10:53:57

【HDOJ】1239 Calling Extraterrestrial Intelligence Again的相关文章

HDU - 1239 - 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): 4637    Accepted Submission(s): 2433 Problem Description A message from humans to extraterrestrial in

hdu 1239 Calling Extraterrestrial Intelligence Again(素数,枚举)

题目链接http://acm.hdu.edu.cn/showproblem.php?pid=1239 [题目大意] 输入三个数,m,a,b 让你求出一对素数 p ,q ,且满足 p x q <=m  &&   a/b <=p/q <= 1; 数据范围 4< m <= 100000   , 1 <= a <= b <= 1000. [思路] 先用素数筛选法,将1--100000的素数筛选出来, 打了一下表 发现有9000+个素数: 直接暴力枚举

【HDOJ】4956 Poor Hanamichi

基本数学题一道,看错位数,当成大数减做了,而且还把方向看反了.所求为最接近l的值. 1 #include <cstdio> 2 3 int f(__int64 x) { 4 int i, sum; 5 6 i = sum = 0; 7 while (x) { 8 if (i & 1) 9 sum -= x%10; 10 else 11 sum += x%10; 12 ++i; 13 x/=10; 14 } 15 return sum; 16 } 17 18 int main() { 1

【HDOJ】1099 Lottery

题意超难懂,实则一道概率论的题目.求P(n).P(n) = n*(1+1/2+1/3+1/4+...+1/n).结果如果可以除尽则表示为整数,否则表示为假分数. 1 #include <cstdio> 2 #include <cstring> 3 4 #define MAXN 25 5 6 __int64 buf[MAXN]; 7 8 __int64 gcd(__int64 a, __int64 b) { 9 if (b == 0) return a; 10 else return

【HDOJ】2844 Coins

完全背包. 1 #include <stdio.h> 2 #include <string.h> 3 4 int a[105], c[105]; 5 int n, m; 6 int dp[100005]; 7 8 int mymax(int a, int b) { 9 return a>b ? a:b; 10 } 11 12 void CompletePack(int c) { 13 int i; 14 15 for (i=c; i<=m; ++i) 16 dp[i]

【HDOJ】3509 Buge&#39;s Fibonacci Number Problem

快速矩阵幂,系数矩阵由多个二项分布组成.第1列是(0,(a+b)^k)第2列是(0,(a+b)^(k-1),0)第3列是(0,(a+b)^(k-2),0,0)以此类推. 1 /* 3509 */ 2 #include <iostream> 3 #include <string> 4 #include <map> 5 #include <queue> 6 #include <set> 7 #include <stack> 8 #incl

【HDOJ】1818 It&#39;s not a Bug, It&#39;s a Feature!

状态压缩+优先级bfs. 1 /* 1818 */ 2 #include <iostream> 3 #include <queue> 4 #include <cstdio> 5 #include <cstring> 6 #include <cstdlib> 7 #include <algorithm> 8 using namespace std; 9 10 #define MAXM 105 11 12 typedef struct {

【HDOJ】2424 Gary&#39;s Calculator

大数乘法加法,直接java A了. 1 import java.util.Scanner; 2 import java.math.BigInteger; 3 4 public class Main { 5 public static void main(String[] args) { 6 Scanner cin = new Scanner(System.in); 7 int n; 8 int i, j, k, tmp; 9 int top; 10 boolean flag; 11 int t

【HDOJ】2425 Hiking Trip

优先级队列+BFS. 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <queue> 5 using namespace std; 6 7 #define MAXN 25 8 9 typedef struct node_st { 10 int x, y, t; 11 node_st() {} 12 node_st(int xx, int yy, int tt)