Cod sursa(job #1034704)
Utilizator | Data | 18 noiembrie 2013 00:00:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | cei_mici3 | Marime | 0.38 kb |
#include <fstream>
#include <cmath>
using namespace std;
int n,nr,j,i;
bool v[2000001];
long a;
int main()
{ifstream f("ciur.in");
ofstream g("ciur.out");
f>>a;
for(int i = 2; i <= a; i++)
v[i]=1;
for(i=2;i<=a;i++){
if(v[i]==1){nr++;
for(j=i+i;j<=a;j+=i)
v[j]=0;
}
}
g<<nr;
f.close();
g.close();
return 0;
}