sicily 1009. Mersenne Composite N

原创 2015年11月17日 15:50:28

1009. Mersenne Composite N

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers.
A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.)
Initially it looks as though the Mersenne numbers are all primes.

Prime Corresponding Mersenne Number
2 4–1 = 3 -- prime
3 8–1 = 7 -- prime
5 32–1 = 31 -- prime
7 128–1 = 127 -- prime

If, however, we are having a "Grand Internet" search, that must not be the case.
Where k is an input parameter, compute all the Mersenne composite numbers less than 2k -- where k <= 63 (that is, it will fit in a 64-bit signed integer on the computer). In Java, the "long" data type is a signed 64 bit integer. Under gcc and g++ (C and C++ in the programming contest environment), the "long long" data type is a signed 64 bit integer.

Input

Input is from file a. in. It contains a single number, without leading or trailing blanks, giving the value of k. As promised, k <= 63.

Output

One line per Mersenne composite number giving first the prime factors (in increasing order) separate by asterisks, an equal sign, the Mersenne number itself, an equal sign, and then the explicit statement of the Mersenne number, as shown in the sample output. Use exactly this format. Note that all separating white space fields consist of one blank.

Sample Input

31

Sample Output

23 * 89 = 2047 = ( 2 ^ 11 ) - 1
47 * 178481 = 8388607 = ( 2 ^ 23 ) - 1
233 * 1103 * 2089 = 536870911 = ( 2 ^ 29 ) - 1

题目分析

Mersenne number is a number of the form (2^p–1), where p is a prime number
p 小于64
给定一个数k,求小于(2^k–1)的Mersenne number是否能写成若干个素数相乘
注意题中关于数据类型的说明


#include <iostream>
#include <cmath>

int main()
{
  int key;
  std::cin >> key;
  int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23,
                 29, 31, 37, 41, 43, 47, 53, 59}; //key <= 64 && key is prime
  for (int c = 0; prime[c] <= key && c < 17; ++c) {
    long long temp = pow(2.0, prime[c]) - 1;
    long long tempp = temp;
    bool judge = false;
    for (long long d = 3; d <= sqrt(temp); ) { //筛法求素数
      while (temp % d == 0) {
        if (!judge) {
          std::cout << d;
          judge = true;            
        } else {
          std::cout << " * " << d;       
        }
        temp /= d;
      }
      d += 2;   
    }   
    if (judge)
      std::cout << " * " << temp << " = " << tempp 
                << " = ( 2 ^ " << prime[c] << " ) - 1"
                << std::endl;
  }
  return 0;   
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

Sicily 1009. Mersenne Composite N

1009. Mersenne Composite N Constraints Time Limit: 1 secs, Memory Limit: 32 MB Descriptio...

poj 2191 Mersenne Composite Numbers 大数分解

题意: 给k,求i是素数且在1~k内并且2^i-1是合数的情况,并将它分解。 分析: 枚举1至i然后用miller_rabin素数判定和pollard_rho因数分解即可。 代码: //po...
  • sepNINE
  • sepNINE
  • 2015年04月15日 21:28
  • 429

POJ 2191 Mersenne Composite Numbers 解题报告(大数因式分解)

#include #include #include #include #include using namespace std; //*******************************...
  • kbdwo
  • kbdwo
  • 2014年04月17日 22:29
  • 1025

poj 2191 Mersenne Composite Numbers 筛法判素数

poj 2191 Mersenne Composite Numbers 筛法判素数 One of the world-wide cooperative computing tasks is the "...
  • k_l_c_
  • k_l_c_
  • 2016年08月08日 21:43
  • 200

POJ 2191 Mersenne Composite Numbers 整数分解

题意:分解2^K次方以内的梅森复合数。 #include #include #include #include #include #include using namespace std; #def...
  • Tsaid
  • Tsaid
  • 2012年02月24日 22:03
  • 918

梅森素数(Mersenne prime)判断, FFT 大数乘法 (非递归), O(n^2 log n), c++

原创代码,请勿转载! FFT 的单位根采用数论中的模方程根,避免浮点数运算。 w^{2^k}  = 1 (mod MOD) FFT简介:快速傅里叶变换, 参考 http://beige.ucs.i...

sicily 1009 梅森素数

这道题也是坑的一笔,有几点需要切切注意 (1)    long long temp = pow(2, p) - 1;    求幂之后一定要用long long 来保存, 比如,如果直接输出pow(2,...

南邮acm 1009 2的N次方 java解法

2的N次方 时间限制(普通/Java):1000MS/3000MS          运行内存限制:65536KByte 总提交:1735            测试通过:850 描述 编...

[sicily]1293. 3n+1数链问题

1293. 3n+1数链问题 Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description 在计算机科学上,有很多类问题是...

Sicily 13858. Goldilocks and the N Cows

13858. Goldilocks and the N Cows Constraints Time Limit: 1 secs, Memory Limit: 256 MB Des...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:sicily 1009. Mersenne Composite N
举报原因:
原因补充:

(最多只允许输入30个字)