Cod sursa(job #1113115)
Utilizator | Data | 20 februarie 2014 12:41:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ocinstream g("ciur.out");
bool a[2000005];
int main()
{
int n,nr=0,j,i;
cin>>n;
for(i=2;i<=n;i++)
{
a[i]=1;
for( i=2;i<=n;i++)
{
if(a[i])
{
nr++;
for( j=i+i;j<=n;j=j+i)
a[j]=0;
}
}
}
cout<<nr;
}