Cod sursa(job #2403599)
Utilizator | Data | 11 aprilie 2019 18:45:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int NR=0,N;
int V[2000000];
int main()
{
fin>>N;
for (int i=2; i<=N; i++)
if (!V[i])
{
V[i]=1;
NR++;
for (int j=i+i; j<=N; j+=i)
V[j]=1;
}
fout<<NR;
}