diff options
| author | Charles <sircharlesaze@gmail.com> | 2019-08-06 16:56:43 +0200 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2019-08-06 16:56:43 +0200 |
| commit | 056a88ee9c2c9e26f9712d14c645e367d851f394 (patch) | |
| tree | 52b54df3e809e1526325dd9123078a9cc01e9831 /c05/main.c | |
| parent | e534578eecebd27c4e7e235ce85961446e6c2e43 (diff) | |
| download | piscine-056a88ee9c2c9e26f9712d14c645e367d851f394.tar.gz piscine-056a88ee9c2c9e26f9712d14c645e367d851f394.tar.bz2 piscine-056a88ee9c2c9e26f9712d14c645e367d851f394.zip | |
c05
- primality test correction for ft_is_prime and ft_find_next_prime
- queens puzzle solved with backtracking (similar to rush01)
Diffstat (limited to 'c05/main.c')
| -rw-r--r-- | c05/main.c | 12 |
1 files changed, 8 insertions, 4 deletions
@@ -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(); } |