Largest prime factor 2136
来源:互联网 发布:c语言 udp多线程编程 编辑:程序博客网 时间:2024/06/04 19:39
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
1
2
3
4
5
Sample Output
0
1
2
1
3
#include <cstdio>#include <cstring>const int MAX = 1000001;int LPF[MAX];int main(int argc, const char* argv[]){ memset(LPF, 0, sizeof(LPF)); int loc = 1; for (int i=2; i<MAX; ++i) { if (LPF[i] != 0) { continue; } LPF[i] = loc++; for (int j=i*2; j<MAX; j+=i) { LPF[j] = LPF[i]; } } int n = 0; while (scanf("%d", &n) != EOF) { printf("%d\n", LPF[n]); } return 0;}
0 0
- Largest prime factor 2136
- 2136 Largest prime factor
- HDU 2136 Largest prime factor
- HDU 2136 Largest prime factor
- hdu 2136 Largest prime factor
- HDOJ 2136 Largest prime factor
- HDU 2136 Largest prime factor
- hdu 2136 Largest prime factor
- hdu 2136 Largest prime factor
- HDU 2136 Largest prime factor
- HDU 2136 Largest prime factor
- HDU 2136 Largest prime factor
- HDU 2136 Largest prime factor
- HDU 2136 Largest prime factor
- hdu 2136 Largest prime factor
- HDU 2136 Largest prime factor
- HDU 2136 Largest prime factor
- HDU 2136 Largest prime factor
- python购物数据意淫分析(2)
- oa项目总结
- 数据对接—kettle使用之十五
- 《算法导论》笔记 第15章 15.5 最优二叉查找树
- static控件动态透明显示的完美解决方案
- Largest prime factor 2136
- MySQL数据库的授权原则
- (基于Java)算法之动态规划——0-1背包问题
- Python核心编程第三章笔记
- Linux 内核 hlist 详解
- maven构建ssh工程
- SQL实现远程备份本保存备份文件到本地
- ViewPager的用法(一)
- python学习笔记四(python多进程)