Cod sursa(job #538968)
Utilizator | Data | 22 februarie 2011 09:59:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream.h>
#include<fstream.h>
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,p=0,i,j;
in>>n;
bool prim[2000001];
for (i=2;i<=n;i++)
prim[i]=true;
for (i=2;i<=n;i++)
if (prim[i]==true)
{
for (j=2*i;j<=n;j=j+i)
prim[j]=false;
p++;
}
out<<p;
return 0;
}