Sieve Prime

#include <cstdio>
#include <cstring>
#define limit 100
#define iclear(x) memset(x,0,sizeof(x))
#define sclear(x) memset(x,0,strlen(x))
int i,j,k,p[limit],f[limit];
void prime()
{
    for (i=2; i<=limit; i++)
        if (!f[i])
            for (j=i+i; j<=limit; j+=i)
                f[j]++; /// Divisors
    for (i=2,j=1; i<=limit; i++)
        if (!f[i]) p[j++]=i; ///Push the primes.
    p[0]=j-1; //total prime stock in 0.
    for (i=1; i<j; i++) printf("%d\n",p[i]);
    iclear(f);
}
int main() { prime(); }