Cod sursa(job #1679652)
Utilizator | Data | 8 aprilie 2016 09:44:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr;
bool ciur[2000003];
int main()
{
int i,j;
f>>n;
for(i=2;i<=n/2;i++)
if(ciur[i]==0)
for(j=i+i;j<=n;j+=i)
ciur[j]=1;
ciur[1]=1;
for(i=1;i<=n;i++)
if(ciur[i]==0)
nr++;
g<<nr<<'\n';
f.close();
g.close();
return 0;
}