Cod sursa(job #1457582)
Utilizator | Data | 3 iulie 2015 17:52:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<iostream>
#include<fstream>
using namespace std;
int prim[2000000],i,n,j,nr;
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
{if(prim[i]==1)nr++;
for(j=2*i;j<=n;j+=i)
prim[j]=0;
}
g<<nr<<"\n";
f.close();
g.close();
return 0;}