Cod sursa(job #3221513)
Utilizator | Data | 7 aprilie 2024 12:24:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
int v[2000000];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n,cnt=0;
fin>>n;
for(int i=2;i*i<=n;i++)
if(v[i]==0)
for(int j=2;j<=n/i;j++)
v[i*j]=1;
for(int i=2;i<=n;i++)
if(v[i]==0)
cnt++;
fout<<cnt;
return 0;
}