37 lines
742 B
Java
37 lines
742 B
Java
|
public class Primalite {
|
||
|
|
public static void main(String[] args) {
|
||
|
|
|
||
|
|
for (int j=0;j<args.length;j++)
|
||
|
|
{
|
||
|
|
int test = Integer.parseInt(args[j]);
|
||
|
|
int estPremier = 1;
|
||
|
|
int[] listDiviseur= new int[test];
|
||
|
|
int indexDiviseur = 0;
|
||
|
|
|
||
|
|
for (int i=2;i<test;i++)
|
||
|
|
{
|
||
|
|
if (test%i==0)
|
||
|
|
{
|
||
|
|
estPremier = 0;
|
||
|
|
listDiviseur[indexDiviseur] = i;
|
||
|
|
indexDiviseur++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (estPremier==1)
|
||
|
|
{
|
||
|
|
System.out.println(test+" est Premier !");
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
System.out.println(test+" est non premier! liste des diviseur :");
|
||
|
|
for (int i =0;i<listDiviseur.length;i++)
|
||
|
|
{
|
||
|
|
if (listDiviseur[i]!=0) {
|
||
|
|
System.out.print(listDiviseur[i]+" ");
|
||
|
|
System.out.println();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|