#include <stdio.h>

/* The number of primes to find */
#define NPRIMES 50

/* List of primes */
int primeList[NPRIMES];

/* Keeps track of the remainders modulo each smaller prime for the number being
 * checked for primality */
int primeMod[NPRIMES];

int main() {
    /* The number of primes found so far */
    int nprimes = 0;

    /* n is the number being checked for primality, i an index into
     * primeList/primeMod, and isPrime a flag */
    int n, i, isPrime;

    for(n = 3; nprimes < NPRIMES; n += 2) {
	isPrime = 1;

	for(i = 0; i < nprimes; i++) {
            /* Does n have a remainder of 0 modulo the prime at index i? This
             * is checked by seeing if the "modulus" equals the prime itself,
             * meaning it should really be 0 */
            if(primeList[i] == primeMod[i]) {
                /* If so, it is not prime */
                isPrime = 0;
                primeMod[i] = 1;
            }
            else {
                /* Strictly speaking, primeMod does not contain the remainders,
                 * but the remainders divided by 2 (++ instead of += 2 below).
                 * The reason we can get away with this is that 2m is divisible
                 * by an odd number n exactly when m is divisible by n. */
                primeMod[i]++;
            }

            /* Once the prime at index i is greater than n/2, there's no way it
             * can be a divisor of n, so we omit the check above and just update
             * the remaining remainders before we go on to the next prime
             * candidate. n/2 could also be implemented as a right shift here. */
	    if(primeList[i] > n/2) {
                while(++i < nprimes)
                    primeMod[i]++;

		break;
	    }
	}

	if(isPrime) {
	    printf("%d\n", n);

            /* Register the new prime */
	    primeList[nprimes] = n;
	    primeMod[nprimes] = 1;
            nprimes++;
	}
    }

    return 0;
}