Cod sursa(job #1128577)
Utilizator | Data | 27 februarie 2014 17:42:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in"); ofstream g("ciur.out");
long long a[2000000], nr, n;
int main()
{
f>>n;
for(int i=2; i<=n; i++)
{
if(a[i]==0) {nr++; for(int j=i; j<=n; j=j+i) a[j]=1;}
}
g<<nr;
g.close();
return 0;
}