跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0591. Factoring Large Numbers

  • ID: 597
  • 传统题
  • 1000ms
  • 128MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:待分级
  • 上传者:
  • 数论
  • 数学
  • 难度待定
  • 难度
  • 共享题库
  • 高校与竞赛共享题
  • 英文题面
  • 题目来源
  • 题面语言

Factoring Large Numbers

题目描述

One of the central ideas behind much cryptography is that factoring large numbers is computationally
intensive. In this context one might use a 100 digit number that was a product of two 50 digit prime
numbers. 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 large numbers.

输入格式

The input will be a sequence of integer values, one per line, terminated by a negative number. The
numbers (other than the terminator) will be greater than 0 and less than 262 .

输出格式

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

样例 1

输入

90
1234567891
18991325453139
12745267386521023
-1

输出

    2
    3
    3
    5

    1234567891

    3
    3
    13
    179
    271
    1381
    2423

    30971
    411522630413

题目来源:19 June, 2011 - Waterloo local contest;FPS 共享题包,题包内第 2 题。保留原作者与原赛事署名。