sicily 1009. Mersenne Composite N
来源:互联网 发布:购买域名 云解析版 编辑:程序博客网 时间:2024/06/06 13:56
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.
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 ) - 147 * 178481 = 8388607 = ( 2 ^ 23 ) - 1233 * 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
- Sicily 1009. Mersenne Composite N
- sicily 1009.Mersenne Composite N
- sicily 1009. Mersenne Composite N
- Sicily 1009. Mersenne Composite N
- sicily 1009. Mersenne Composite N
- sicily 1009. Mersenne Composite N
- [sicily online]1009. Mersenne Composite N
- 1009. Mersenne Composite N
- 1009. Mersenne Composite N
- 1009. Mersenne Composite N
- 1009. Mersenne Composite N
- 1009. Mersenne Composite N
- 1009. Mersenne Composite N 梅森素数
- POJ-2191-Mersenne Composite Numbers
- HOJ 2022 Mersenne Composite Numbers
- POJ 2191 Mersenne Composite Numbers 整数分解
- poj 2191 Mersenne Composite Numbers 大数分解
- Spark集群基于Zookeeper的HA搭建部署
- 【Android】混淆,fastjson
- Tomcat中配置https访问
- Python 多进程日志记录
- WIN7下 svn迁移到github
- sicily 1009. Mersenne Composite N
- linux ntpdate同步错误,差一个小时的问题
- 使用TabActivity实现底部菜单栏
- MySQL学习笔记2-System administration(set password)
- 位运算的运用
- System.out.println与System.err.println的区别
- priority_queue 优先队列使用方法
- Python3下周百度页面实例
- 在aspx包含另一个aspx