hdoj Largest prime factor
2014-03-02 13:50
211 查看
Problem Description
Everybody knows any number can be combined by the prime number.
Now, your task is telling me what position of the largest prime factor.
The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, etc.
Specially, LPF(1) = 0.
Input
Each line will contain one integer n(0 < n < 1000000).
Output
Output the LPF(n).
Sample Input
Sample Output
方法 :
素数筛选法。
代码:
Everybody knows any number can be combined by the prime number.
Now, your task is telling me what position of the largest prime factor.
The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, etc.
Specially, LPF(1) = 0.
Input
Each line will contain one integer n(0 < n < 1000000).
Output
Output the LPF(n).
Sample Input
1 2 3 4 5
Sample Output
0 1 2 1 3
方法 :
素数筛选法。
代码:
相关文章推荐
- 【hdoj2136】Largest prime factor
- hdoj-【2136 Largest prime factor】
- HDOJ 2136 Largest prime factor
- HDOJ 2136 Largest prime factor
- HDOJ-2136-Largest prime factor 解题报告
- HDOJ(HDU) 2136 Largest prime factor(素数筛选)
- HDOJ 题目Largest prime factor(水题)
- HDOJ(HDU) 2136 Largest prime factor(素数筛选)
- hdoj 2136 Largest prime factor
- hdoj Largest prime factor
- 素数筛 HDOJ 2136 Largest prime factor
- HDOJ 2136 Largest prime factor
- 2.1.3 Largest prime factor
- HDU 2136 Largest prime factor
- HDU 2136 Largest prime factor (最大素因子序号,cin超时呀!!!)
- Largest prime factor
- hdu2136 Largest prime factor
- 【Project Euler】【Problem 3】Largest prime factor
- HDU 2136 largest prime factor
- HDU:2136 Largest prime factor!(素数)