Cod sursa(job #1546057)
Utilizator | Data | 7 decembrie 2015 17:24:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool a[2000001];
int main()
{
int i,j,nr=0,n;
in>>n;
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;
}