Cod sursa(job #1900639)
Utilizator | Data | 3 martie 2017 15:30:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char v[2000003];
int i,n,j,nr;
int main()
{
f>>n;
for(i=2;i*i<=n;i++)
if(v[i]==0)
{
for(j=i*i;j<=n;j=j+i)
v[j]=1;
}
nr=0;
for(i=2;i<=n;i++)
if(v[i]==0) nr++;
g<<nr<<endl;
return 0;
}