Cod sursa(job #662219)
| Utilizator | Data | 16 ianuarie 2012 09:24:46 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
#include<cstring>
#define lmax 2000000
using namespace std;
ifstream f("ciur.in",fstream::in);
ofstream g("ciur.out",fstream::out);
bool viz[lmax];
unsigned int n,m,lol,i,contor,j;
int main()
{f>>n;
for(i=2;i<=n;i++)
if(!viz[i])
{ for(j=i+i;j<=n;j+=i)
viz[j]=1;
contor+=1;
}
g<<contor;
f.close();
g.close();
return 0;
}
