Cod sursa(job #1098363)
Utilizator | Data | 4 februarie 2014 19:18:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int main()
{
int c=1,n,i,j;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
int v[2000000]={0};
for(i=3;i<=n;i+=2)
{
if(v[i]==0)
for(j=i+2*i;j<=n;j=j+2*i)
{
v[j]=1;
}
}
for(i=3;i<=n;i+=2)
if(v[i]==0)
c++;
fout<<c;
return 0;
}