Cod sursa(job #639999)
Utilizator | Data | 24 noiembrie 2011 15:20:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
int a[2000001];
int main()
{
int n,k,i,c=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=1;i<=n;i++)
a[i]=1;
for(i=2;i<=n;i++)
if(a[i]==1)
{
c++;
for(k=2*i;k<=n;k=k+i)
a[k]=0;
}
g<<c;
f.close();
g.close();
return 0;
}