Cod sursa(job #710579)
Utilizator | Data | 10 martie 2012 01:31:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
#include<cmath>
using namespace std;
int n,V[2000000];
ifstream f("ciur.in");
ofstream g("ciur.out");
int nr=0;
int main()
{
f>>n;
int i;
for(i=2;i<=n;i++)
V[i]=1;
for(i=2;i<sqrt(n);i++)
{
if(V[i])
for(int j=2;j*i<=n;j++)
V[j*i]=0;
}
for(i=2;i<=n;i++)
if(V[i])
nr++;
g<<nr;
f.close();
g.close();
return 0;
}