Cod sursa(job #845101)
Utilizator | Moldovan Rares RaresMoldo | Data | 30 decembrie 2012 14:17:09 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
char prim[10000];
long long i,j;
long long n;
long long nrprime;
ifstream is("ciur.in");
ofstream os("ciur.out");
int main()
{
is>>n;
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=j+i)
prim[j]=0;
}
os<<nrprime;
return 0;
}