Generating Primes

/*
    Author : Robert_JR
    Implementation of Sieve of Eratosthenes using C
    (
    Resource From : http://www.lightoj.com/article_show.php?article=1001
    Idea : 4
    )
*/
#include <stdio.h>
#include <string.h>
#include <math.h>

int n = 1000000, array[1000000];

void sieve()
{
    int i, j, k;

    array[0] = array[1] = 1;

    for(i = 2; i <= n; i++)
        if(array[i] == 0)
            for(j = (i * 2); j <= n; j += i)
                array[j] = 1;
}

int main()
{
    sieve();
    int i, n;

    for(i = 0; i < 100; i++) // Checking Primes Up to 100 :p
        if(array[i] == 0)
            printf("%d ", i);

    printf("\n");

    while(~scanf("%d", &n)) // Checking Given Number is Prime or Not :D
    {
        if(array[n] == 0)
            printf("Prime\n");
        else
            printf("Not Prime\n");
    }

    return 0;
}