Cod sursa(job #2919835)
Utilizator | Data | 20 august 2022 00:09:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
vector<int>v;
int n,cnt;
int main()
{
cin>>n;
v.resize(n+3);
v[1]=v[0]=1;
for(int i=2;i<=n;i++)
if(v[i]==0)
for(int j=2;j*i<=n;j++)
v[i*j]=1;
for(int i=1;i<=n;i++)
if(v[i]==0)
cnt++;
cout<<cnt;
}