Cod sursa(job #662303)
Utilizator | Data | 16 ianuarie 2012 15:10:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int main ()
{ifstream cin("ciur.in");
ofstream cout("ciur.out");
char ciur[2000001];
int i,j,nr=0,n;
cin>>n;
for(i=2;i<=n;i++);
{
if (ciur[i]==0)
{ nr++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=1;
} }
cout<<nr;
cin.close();
cout.close();
return 0;
}