Cod sursa(job #2184516)
Utilizator | Data | 24 martie 2018 09:33:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int c[2000000];
int main()
{
int n,nr=0;
in>>n;
for(int i=2;i*i<n;i++)
{
if(!c[i])
{
for(int j=i*i;j<n;j+=i)
{
c[j]=true;
nr++;
}
}
}
out<<nr;
return 0;
}