Cod sursa(job #2367335)
Utilizator | Data | 5 martie 2019 10:14:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int nr[80000];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long n, r=0;
fin >> n;
for(long long i=2; i<=n; i++)
{
if(nr[i]==0)
{
r++;
nr[i]=1;
for(long long j=i*2; j<=n; j+=i)
nr[j]=-1;
}
}
fout << r;
return 0;
}