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