Cod sursa(job #530572)
| Utilizator | Data | 7 februarie 2011 23:21:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
fstream f("ciur.in", ios::in), g("ciur.out", ios::out);
long long n, i, a[2000001], j, prime;
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
if(i%2==0)
a[i]=0;
else
a[i]=1;
}
a[1]=0;
a[2]=1;
for(i=1; i<=n; i++)
{
if(a[i]==1)
{
prime++;
for(j=i; j<=n; j+=i)
a[j]=0;
}
}
g<<prime;
f.close();
g.close();
return 0;
}
