Cod sursa(job #2460650)
Utilizator | Balacescu Robert Robert_24_52 | Data | 24 septembrie 2019 08:53:56 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
unsigned N,i,j,nr=0;
bool a[2000001];
int main()
{
in>>N;
for(int i=0;i<=N;i++)
a[i]=0;
for(int i=2;i<=sqrt(N);i++)
{
if(a[i]==0)
for(int j=i;j<=N/i;j++)
a[i*j]=1;
}
for(int i=2;i<=N;i++)
if(a[i]==0)
nr++;
out<<nr;
}