UVa 10392 Factoring Large Numbers(分解因数)

szhouan

于 2016-11-22 00:15:12 发布

阅读量289

点赞数

分类专栏： UVa

本文链接：https://blog.csdn.net/szhouan/article/details/53270793

版权

UVa 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

One of the central ideas behind much cryptography is that factoring large numbers is computationallyintensive. In this context one might use a 100 digit number that was a product of two 50 digit primenumbers. Even with the fastest projected computers this factorization will take hundreds of years.

You don’t have those computers available, but if you are clever you can still factor fairly largenumbers.

Input

The input will be a sequence of integer values, one per line, terminated by a negative number. Thenumbers will fit in gcc’s long long int datatype, however scanf and printf do not appear to handlethis datatype correctly, so you must do your own I/O conversion.

Output

Each positive number from the input must be factored and all factors (other than 1) printed out. Thefactors must be printed in ascending order with 4 leading spaces preceding a left justified number, andfollowed by a single blank line.

Sample Input

90
1234567891
18991325453139
12745267386521023
-1

Sample Output

2335

1234567891

    30971
    411522630413

题目描述：分解long long范围内的整数，时限3秒

显然普通的试除法复杂度达到根号N，至少10^9级别。在网上查了题解，有很多说至多一个质因数是比较大的(～10^7)，不过在题目描述中并没有这一点。后来看到这个优化，思路是在尝试除法时不需要用原来的N开方作为上界，而是用部分分解之后余下的N开方。代码如下。UVa运行时间30ms。

/*
	PROG: UVa10392
*/

#include <cstdio>
#include <cmath>
using namespace std;

typedef long long LL;
int main(void) {
	LL n;
	while (scanf("%lld", &n), n >= 0) {
		for (LL i = 2, u = (LL)sqrt(n+1); i <= u; ++i) { //u为优化的上界
			if (n%i) continue;
			while (n%i==0) {
				printf("    %lld\n", i);
				n /= i;
			}
			u = (LL)sqrt(n+1);
		}
		if (n > 1) printf("    %lld\n", n);
		printf("\n");
	}
	return 0;
}