Cod sursa(job #1012923)
Utilizator | Data | 19 octombrie 2013 21:52:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
long n,i,j,nr; bool v[2000000];
ifstream ci("ciur.in");
ofstream sc("ciur.out");
ci>>n;
ci.close();
nr=0;
for (i=2;i<=n;i++)
v[i]=1;
v[1]=0;
for (i=2;i<=n;i++)
{ if (v[i]!=0)
{
nr++;
for ( j=i;j<=n;j=i+j)
v[j]=0;
}
}
sc << nr;
sc.close();
return 0;
}