Cod sursa(job #1066271)
Utilizator | Data | 24 decembrie 2013 13:58:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | riad2 | Marime | 0.42 kb |
#include<fstream>
#include <iostream>
using namespace std;
char prim[2000001];
long n,i,j,nr=0;
int main()
{
ifstream f("ciur.in");
f>>n;
f.close();
for (i=2;i<=n;i++)
prim[i]=1;
for (i=2;i<=n;i++)
if(prim[i])
{
nr++;
for(j=i+i;j<=n;j=j+i)
prim[j]=0;
}
ofstream g("ciur.out");
g<<nr;
g.close();
return 0;
}