mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-05-23 22:02:27 +00:00
Initial import
This commit is contained in:
commit
c91b3c5006
14915 changed files with 590219 additions and 0 deletions
39
examples/printprimes.c
Normal file
39
examples/printprimes.c
Normal file
|
@ -0,0 +1,39 @@
|
|||
#if 0
|
||||
/*─────────────────────────────────────────────────────────────────╗
|
||||
│ To the extent possible under law, Justine Tunney has waived │
|
||||
│ all copyright and related or neighboring rights to this file, │
|
||||
│ as it is written in the following disclaimers: │
|
||||
│ • http://unlicense.org/ │
|
||||
│ • http://creativecommons.org/publicdomain/zero/1.0/ │
|
||||
╚─────────────────────────────────────────────────────────────────*/
|
||||
#endif
|
||||
#include "libc/conv/itoa.h"
|
||||
#include "libc/math.h"
|
||||
#include "libc/stdio/stdio.h"
|
||||
|
||||
int main(int argc, char *argv[]) {
|
||||
char buf[32];
|
||||
bool isprime;
|
||||
long i, j, k, n, m;
|
||||
k = 0;
|
||||
n = pow(2, 32);
|
||||
printf("2\n");
|
||||
for (i = 3; i < n; ++i) {
|
||||
isprime = true;
|
||||
for (m = sqrt(i) + 1, j = 2; j < m; ++j) {
|
||||
if (i % j == 0) {
|
||||
isprime = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (isprime) {
|
||||
int64toarray_radix10(i, buf);
|
||||
fputs(buf, stdout);
|
||||
fputc('\n', stdout);
|
||||
if (k++ % 100 == 0) {
|
||||
fprintf(stderr, "\r%20d", i);
|
||||
}
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue