From 056a88ee9c2c9e26f9712d14c645e367d851f394 Mon Sep 17 00:00:00 2001 From: Charles Date: Tue, 6 Aug 2019 16:56:43 +0200 Subject: c05 - primality test correction for ft_is_prime and ft_find_next_prime - queens puzzle solved with backtracking (similar to rush01) --- c05/main.c | 12 ++++++++---- 1 file changed, 8 insertions(+), 4 deletions(-) (limited to 'c05/main.c') diff --git a/c05/main.c b/c05/main.c index bdb7ad7..f66caf9 100644 --- a/c05/main.c +++ b/c05/main.c @@ -9,6 +9,7 @@ #include "ex05/ft_sqrt.c" #include "ex06/ft_is_prime.c" #include "ex07/ft_find_next_prime.c" +#include "ex08/ft_queens.c" int main() { @@ -81,10 +82,10 @@ int main() printf("prime(%d) = %d\n", 899, ft_is_prime(899)); printf("prime(%d) = %d\n", 289, ft_is_prime(289)); 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)); + // 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)); @@ -93,4 +94,7 @@ int main() 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));*/ + + printf("---------------------\n"); + // ft_queens(); } -- cgit