解密
You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.
Background
ACM小队截获了一串加密数字，密码由两个不同质数相乘得到。 只要找到其中较大的质数，就能解开这层数字加密！
Description
给定正整数n，n保证可以化为互不相同质数的乘积，请输出这两个质数中较大的那一个。
Format
Input
一行一个整数 n。 6 ≤ n ≤ 2000000
Output
输出一个整数，代表较大的质因数。
Samples
21
7
Limitation
1s, 1024KiB for each test case.
第十届西南石油大学程序设计新生赛(正式赛)
- Status
- Done
- Rule
- XCPC
- Problem
- 17
- Start at
- 2026-10-24 14:00
- End at
- 2026-10-24 18:00
- Duration
- 4 hour(s)
- Host
-
AiraKeq
- Partic.
- 50