Tanguy MAZE f9e508d5ef init
2019-06-22 18:23:35 +02:00

57 lines
1.4 KiB
C

/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* fprime.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2018/04/16 15:59:51 by tmaze #+# #+# */
/* Updated: 2018/04/16 17:45:07 by tmaze ### ########.fr */
/* */
/* ************************************************************************** */
#include <stdio.h>
#include <stdlib.h>
int is_prime(int nb)
{
int i;
i = 4;
if (nb == 2 || nb == 3)
return (1);
if (nb % 2 == 0 || nb % 3 == 0)
return (0);
while (i < nb / i && nb % i != 0)
i++;
return (nb % i != 0);
}
int main (int ac, char **av)
{
int nb;
int i;
if (ac == 2)
{
nb = atoi(av[1]);
if (nb == 1)
printf("1");
while (nb != 1 && (i = 2))
{
while (nb % i != 0)
{
i++;
while (!is_prime(i))
i++;
}
printf("%d", i);
nb /= i;
if (nb != 1)
printf("*");
}
}
printf("\n");
return (0);
}