Cod sursa(job #1274894)
Utilizator | Data | 24 noiembrie 2014 15:41:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr,i,j;
bool p[2000001];
int main()
{
f>>n;
for(i=2;i<=n;i++) p[i]=true;
for(i=2; i*i<=n; i++)
if(p[i]==true)
for(j=2*i; j<=n; j+=i)
p[j]=false;
for(i=2; i<=n; i++)
if(p[i]==true)
nr++;
g<<nr;
return 0;
}