Cod sursa(job #1510611)
Utilizator | Data | 25 octombrie 2015 13:09:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool a[2000001];
int main()
{
int n,i,j,nr=0;
in>>n;
/*for(i=1;i<=n;i++)
{
a[i]=i;
}*/
for(i=2;i<=n;i++)
{
if(a[i]==0)
{
nr++;
for(j=i*2;j<=n;j=j+i) a[j]=1;
}
}
out<<nr;
in.close();
out.close();
return 0;
}