Cod sursa(job #2184523)
Utilizator | Data | 24 martie 2018 09:37:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int v[2000001]={0}, i, n, d, j,x=0;
fin>>n;
for(d=2;d<=n;d++)
{
if( v[d]==0 )
{
for( int j=i*i; j<n; j+i)
v[j]=1;
}
}
for(i=2;i<=n;i++){if(v[i]==1)x++;}
fout<<x;
return 0;
}