diff options
| author | Tyge Løvset <[email protected]> | 2020-10-26 20:25:03 +0100 |
|---|---|---|
| committer | Tyge Løvset <[email protected]> | 2020-10-26 20:25:03 +0100 |
| commit | 0b95e794fe91b69928bb111d66fc973d18de7a1f (patch) | |
| tree | 35843d6e5f17e07a3cbb3f8b59df4965661a35d8 /examples/prime.c | |
| parent | 0c64199a35a8901a4969f8c2ce0c0483f184732c (diff) | |
| download | STC-modified-0b95e794fe91b69928bb111d66fc973d18de7a1f.tar.gz STC-modified-0b95e794fe91b69928bb111d66fc973d18de7a1f.zip | |
Updates examples using cfmt.h c_print().
Diffstat (limited to 'examples/prime.c')
| -rw-r--r-- | examples/prime.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/examples/prime.c b/examples/prime.c index 95e1fd46..a21e791a 100644 --- a/examples/prime.c +++ b/examples/prime.c @@ -1,4 +1,4 @@ -#include <stdio.h>
+#include <stc/cfmt.h>
#include <stc/cbitset.h>
static inline cbitset_t sieveOfEratosthenes(size_t n)
@@ -16,23 +16,23 @@ static inline cbitset_t sieveOfEratosthenes(size_t n) }
}
return pbits;
-}
+}
int main(void)
{
int n = 100000000;
- printf("computing prime numbers up to %u\n", n);
-
+ c_print(1, "computing prime numbers up to {}\n", n);
+
cbitset_t primes = sieveOfEratosthenes(n);
puts("done");
-
+
size_t np = cbitset_count(primes);
- printf("number of primes: %zu\n", np);
+ c_print(1, "number of primes: {}\n", np);
printf("2 ");
c_forrange (i, int, 3, 1001, 2) {
- if (cbitset_test(primes, i)) printf("%d ", i);
+ if (cbitset_test(primes, i)) c_print(1, "{} ", i);
}
puts("");
cbitset_del(&primes);
|
