Cod sursa(job #1855040)
Utilizator | Data | 23 ianuarie 2017 13:34:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000001];
int n, i, j, nr;
int main()
{
in>>n;
for(i=2; i<n; i++)
if(v[i]==0)
{
nr++;
for(j=i+i; j<n; j+=i)
v[j]=1;
}
out<<nr;
return 0;
}