Cod sursa(job #1576973)
Utilizator | Data | 23 ianuarie 2016 08:31:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int n,i,nr=0,j;
bool ok[2000010];
int main()
{
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>n;
for(i=2; i<=n; ++i)
ok[i]=true;
for(i=2; i<=n; i++)
if(ok[i])
for(j=i*2; j<=n; j+=i)
ok[j]=false;
for(i=2; i<=n; i++)
if(ok[i]) nr++;
g<<nr;
return 0;
}