Factoring Large Numbers
来源:互联网 发布:怎么在淘宝买岛国资源 编辑:程序博客网 时间:2024/05/16 11:23
/*一个数必定可以分解成一些素因子的乘积。从2开始,没扫面到一个能被n整除的数。就进行n/=i,否则,i++,如果遇到i*i>n,则此时的n必是最后一个素因子。输出。结束。*/#include <stdio.h>int main(){ long long n; while(scanf("%lld",&n)==1) { if(n==-1) break; long long i=2; while(1) { if(n%i==0) printf("%lld\n",i),n/=i; else { i++; if(i*i>n) { printf("%lld\n",n); break; } } } printf("\n"); } return 0;}
- Factoring Large Numbers
- Factoring Large Numbers
- 10392 - Factoring Large Numbers
- 10392 - Factoring Large Numbers
- 10392 - Factoring Large Numbers
- Factoring Large Numbers
- UVa10392 Factoring Large Numbers
- Factoring Large Numbers
- Factoring Large Numbers UVA10392
- 10392 - Factoring Large Numbers
- UVA10392 Factoring Large Numbers
- Factoring Large Numbers
- UVA10392 Factoring Large Numbers
- UVa 10392 Factoring Large Numbers
- uva 10392 Factoring Large Numbers
- uva 10392 - Factoring Large Numbers
- UVa 10392 - Factoring Large Numbers
- uva 10392 - Factoring Large Numbers
- java学习笔记——自定义实现Stack集合
- sql判断字段包含中文
- _TrackMouseEvent 响应 WM_MOUSELEAVE 和 WM_MOUSEHOVER 消息
- 解决vim乱码
- Android触摸分析
- Factoring Large Numbers
- 批量获取主键sequence的主键
- 如果不是异地
- 如何导入导出MySQL数据库*.sql文件操作
- Win32中使用目录浏览器
- android 通过经纬度获取地址信息
- Ubuntu下安装QNX6.5 SDP
- ADO.Net Entity Framework: 动态修改连接串信息
- oracle自增值