Cod sursa(job #3363717)
| Utilizator | Data | 21 august 2026 17:34:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
//
// main.cpp
// ciur
//
// Created by Emma on 11.08.2026.
//
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int main()
{
int n;
cin>>n;
vector<bool>ciur(n+1,false);
ciur[0]=ciur[1]=1;
for(int i=2;i*i<=n;i++)
if(ciur[i]==0)
for(int j=i*i;j<=n;j+=i)
ciur[j]=1;
int nr=0;
for(int i=1;i<=n;i++)
if(ciur[i]==0)
nr++;
cout<<nr;
return 0;
}
