Cod sursa(job #2501062)
Utilizator | Data | 29 noiembrie 2019 01:11:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#define NMAX 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,v[NMAX],nr=0;
int main()
{
f>>n;
for(int i=2;i<=n;++i)
if(!v[i])
{
++nr;;
for(int j=i+i;j<=n;j+=i)
v[j]=1;
}
g<<nr;
return 0;
}