Cod sursa(job #2359437)
Utilizator | Data | 28 februarie 2019 20:44:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000003];
int nr,n;
int main()
{
f>>n;
for(int i=2;i<=n;++i)
if(v[i]==0)
{
nr++;
for(int j=i*2;j<=n;j+=i)
v[j]=1;
}
g<<nr;
return 0;
}