Cod sursa(job #3128745)
Utilizator | Data | 10 mai 2023 19:41:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr,ciur[2000001],i,j;
int main()
{
f>>n;
for(i=2;i<=n;i++)
ciur[i]=1;
for(i=2;i<=n;i++)
if(ciur[i])
{nr++;
for(j=i*i;j<=n;j=j+i)
ciur[j]=0;
}
g<<nr;
return 0;
}