Templates - prime linear sieve

void s(int maxn)
{
    for(int i=2;i<=maxn;i++)isprime[i]=1;
    for(int i=2;i<=maxn;i++)
    {
        if(isprime[i])prime[++cnt]=i;
        for(int j=1;j<=cnt && i*prime[j]<=maxn;j++)
        {
            isprime[i*prime[j]]=0;
            if(!i%prime[j])break;
        }
    }
}

As do questions you do, you find that they will not be a linear screen orz, eating dates pills ......