Cod sursa(job #960075)
Utilizator | Data | 9 iunie 2013 18:42:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int main()
{
int n,a[2000001],i,j,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])
c++;
for(j=2*i;j<=n;j=j+i)
a[j]=0;
}
g<<c;
return 0;
}