hdu 1164 Eddy's research I
来源:互联网 发布:键盘操作记录软件 编辑:程序博客网 时间:2024/06/01 12:36
Eddy's research I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7342 Accepted Submission(s): 4439
Problem Description
Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he
艾迪的兴趣是非常广泛的,最近他感兴趣的是素数.艾迪想找到所有可以被素数整除的数.但是他写不出这个程序。
can't write program, so Eddy has to ask intelligent you to help him,
所以艾迪请求你帮他解决这个素数,
he asks you to write a program which can do the number to divided into the multiply of prime number factor .
他要求你把这个数分解成多个素数的积
他要求你把这个数分解成多个素数的积
Input
The input will contain a number 1 < x<= 65535 per line representing the number of elements of the set.
输入将包含一个数字1 < x < = 65535每行代表的数量的元素集
Output
You have to print a line in the output for each entry with the answer to the previous question.
每个题的答案在单独的一行输出
Sample Input
119412
Sample Output
112*2*13*181
Author
eddy
import java.util.Scanner;public class p1164 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int[] primes = new int[7000];// 打表法primes[0] = 2;primes[1] = 3;primes[2] = 5;primes[3] = 7;int count = 4;for (int i = 11; i <= 65535; i += 2) {// 65535--素数个数为6542个boolean isPrime = true;for (int j = 0; primes[j] * primes[j] <= i && primes[j] != 0; j++) {if (i % primes[j] == 0) {isPrime = false;break;}}if (isPrime) {primes[count++] = i;}}String result = "";boolean isFirst;while (sc.hasNext()) {int x = sc.nextInt();result = "";isFirst = true;for (int i = 0; primes[i] <= x; i++) {if (x % primes[i] == 0) {if (isFirst) {result += primes[i];isFirst = false;} else {result += "*" + primes[i];}x /= primes[i];i = -1;}}System.out.println(result);}}}
0 0
- HDU 1164 Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- Hdu 1164-Eddy's research I
- hdu(1164)Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- hdu-1164-Eddy's research I
- hdu-oj 1164 Eddy's research I
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I.doc
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I
- 启动Eclipse 弹出Failed to load the JNI shared library 的解决方法
- 百度之星 2015 初赛(2) 1003 棋盘占领
- javascript && 和 || 最清晰的描述
- DOM节点——JS总结
- Pool进程池创建大量子进程,进程间通信
- hdu 1164 Eddy's research I
- php利用接口实现类的多重继承
- MooTools
- Android canvas & shader & path
- 将正整数N转换成m(2-16)进制数
- 百度之星 2015 初赛(2) 1005 序列变换
- linux下安装oracle11g详解
- Java NIO 02=====Channel
- linux下stc89c52及其他国产芯片烧写方案