Cod sursa(job #1074548)
| Utilizator | Data | 7 ianuarie 2014 18:59:19 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int n,nr;
bool a[2000003];
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(int i=2; i<=n; i++)
a[i]=1;
for(int i=2; i<=n; i++)
if(a[i])
{
nr++;
for(int j=2*i; j<=n; j+=i)
a[j]=0;
}
out<<nr<<'\n';
in.close();
out.close();
return 0;
}
