45 lines
861 B
Java
45 lines
861 B
Java
|
package LanQiaoOJ;
|
|||
|
|
|||
|
import java.util.Scanner;
|
|||
|
|
|||
|
/*
|
|||
|
* <EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>N<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ӡ<EFBFBD>
|
|||
|
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>а<EFBFBD><EFBFBD><EFBFBD>Ϊһ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>N<EFBFBD><EFBFBD>
|
|||
|
1<EFBFBD><EFBFBD>W<EFBFBD><EFBFBD>10^12<EFBFBD><EFBFBD>*/
|
|||
|
public class <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> {
|
|||
|
|
|||
|
public static void main(String[] args) {
|
|||
|
Scanner sc=new Scanner(System.in);
|
|||
|
long n=sc.nextLong();
|
|||
|
for(long i=2;i<n/i;i++) {
|
|||
|
//<2F>ж<EFBFBD><D0B6>Ƿ<EFBFBD>Ϊ<EFBFBD><CEAA><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
if(n%i==0) {
|
|||
|
System.out.print(i+" ");
|
|||
|
//<2F><>n<EFBFBD><6E><EFBFBD><EFBFBD>
|
|||
|
while(n%i==0)n/=i;
|
|||
|
}
|
|||
|
}
|
|||
|
if(n>1)
|
|||
|
System.out.print(n);
|
|||
|
}
|
|||
|
}
|
|||
|
/*<EFBFBD>˷<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>OJ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƽ<EFBFBD>
|
|||
|
* public static void main(String[] args) {
|
|||
|
Scanner sc=new Scanner(System.in);
|
|||
|
long n=sc.nextLong();
|
|||
|
|
|||
|
for(long i=2;i<n;i++) {
|
|||
|
if(n%i==0&&check(i)) {
|
|||
|
System.out.print(i+" ");
|
|||
|
}
|
|||
|
}
|
|||
|
}
|
|||
|
static Boolean check(long x) {
|
|||
|
for(long i=2;i<=x/i;i++) {
|
|||
|
if(x%i==0)
|
|||
|
return false;
|
|||
|
}
|
|||
|
return true;
|
|||
|
}*/
|