Cod sursa(job #289878)
Utilizator | Data | 27 martie 2009 09:20:33 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.17 kb |
#include<stdio.h>
long v[1000010];
int main()
{
long n;
n=1000010;
long i,j;
for(i=2;i<=n;i++)
if(v[i]==0)
for(j=i;j<=n;j+=i)
++v[j];
return 0;
}