Cod sursa(job #1132053)
Utilizator | Data | 2 martie 2014 15:53:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
using namespace std;
char prim[2000005];
int main()
{
int i,n,j,nrprime;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
nrprime=0;
for(i=2;i<=n;i++)
prim[i]='1';
for(i=2;i<=n;i++)
if(prim[i]=='1')
{
nrprime++;
for(j=i*i;j<=n;j+=i)
prim[j]='0';
}
g<<nrprime;
f.close();
g.close();
return 0;
}