#include <stdio.h>
#include <math.h>

int main ()
{
    int max = 100;
    int primes[max];
    int n_primes = 0;
    int i;

    for (i = 2; n_primes < max; i++) {
        int j;

        for (j = 0; j < n_primes; j++) {
            if (i % primes[j] == 0) {
                goto not_prime;
            }
        }
        primes[n_primes] = i;
        n_primes++;

        not_prime:
            ;
    }

    /* Now display the list. */

    printf ("The first %d primes are:\n", max);
    for (i = 0; i < n_primes; i++) {
        printf ("%4d ", primes[i]);
        if (i % 10 == 9) {
            printf ("\n");
        }
    }
    printf ("\n");
    return 0;
}