Cod sursa(job #1365490)
Utilizator | Data | 28 februarie 2015 12:17:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char prim[2000002];
long long i,j,n,nrprime;
int main()
{
f>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]==1)
{
nrprime++;
for(j=i+1;j<=n;j+=i)
prim[j]=0;
}
g<<nrprime;
return 0;
}