diff options
| author | Charles <sircharlesaze@gmail.com> | 2019-07-15 08:15:37 +0200 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2019-07-15 08:15:37 +0200 |
| commit | 3b9a1d7dcc5683b962f2bf24795e80e1c449cd1f (patch) | |
| tree | 25b02c02f5140dbefbabd7720f292d8be3d5cc51 /c05 | |
| parent | c2bf9fcefbb4453cee271ccd1af9674ad2f3a181 (diff) | |
| download | piscine-3b9a1d7dcc5683b962f2bf24795e80e1c449cd1f.tar.gz piscine-3b9a1d7dcc5683b962f2bf24795e80e1c449cd1f.tar.bz2 piscine-3b9a1d7dcc5683b962f2bf24795e80e1c449cd1f.zip | |
c07 passed, c08 in progress, rush01(+ 6x6 try)
Diffstat (limited to 'c05')
| -rw-r--r-- | c05/ex06/ft_is_prime.c | 4 | ||||
| -rw-r--r-- | c05/main.c | 6 |
2 files changed, 7 insertions, 3 deletions
diff --git a/c05/ex06/ft_is_prime.c b/c05/ex06/ft_is_prime.c index 73ca59b..3c83061 100644 --- a/c05/ex06/ft_is_prime.c +++ b/c05/ex06/ft_is_prime.c @@ -6,7 +6,7 @@ /* By: cacharle <charles.cabergs@gmail.com> +#+ +:+ +#+ */ /* +#+#+#+#+#+ +#+ */ /* Created: 2019/07/06 20:17:59 by cacharle #+# #+# */ -/* Updated: 2019/07/09 10:17:58 by cacharle ### ########.fr */ +/* Updated: 2019/07/12 07:43:36 by cacharle ### ########.fr */ /* */ /* ************************************************************************** */ @@ -23,7 +23,7 @@ int ft_is_prime(int nb) return (0); i = 1; nbu = nb; - while (i * i <= nbu) + while (i * i <= nbu) // ne fonctionne pas de 7 a 41 { if (nbu % (i * 6 - 1) == 0) return (0); @@ -80,12 +80,16 @@ int main() printf("prime(%d) = %d\n", 2147483647, ft_is_prime(2147483647)); printf("prime(%d) = %d\n", 899, ft_is_prime(899)); printf("prime(%d) = %d\n", 289, ft_is_prime(289)); - /*for (int i = INT_MAX; i > INT_MAX - 1000; i--)*/ + printf("prime(%d) = %d\n", 2147483424, ft_is_prime(2147483424)); + /*for (int i = INT_MAX; i > INT_MAX - 1000000; i--)*/ /*printf("%d is %d\n", i, ft_is_prime(i));*/ + for (int i = 3; i <= 41; i++) + printf("%d is %d\n", i, ft_is_prime(i)); printf("---------------------\n"); printf("nextp(%d) = %d\n", 21, ft_find_next_prime(21)); printf("nextp(%d) = %d\n", 23, ft_find_next_prime(23)); + printf("prime(%d) = %d\n", 2147483424, ft_find_next_prime(2147483424)); printf("nextp(%d) = %d\n", 2147483600, ft_find_next_prime(2147483600)); /*for (int i = INT_MAX; i > INT_MAX - 1000000; i--)*/ /*printf("%d is %d\n", i, ft_find_next_prime(i));*/ |