Cod sursa(job #2924123)
Utilizator | Data | 25 septembrie 2022 21:44:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream four("ciur.out");
int vecprim[200005];
int nr;
int ciur(int n)
{
for(int i=2;i<=n;i++)
{
if(vecprim[i]==0)
{
for(int j=i*i;j<=n;j=j+i)
vecprim[j]=1;
nr++;
}
}
}
int main()
{
int n;
cin>>n;
ciur(n);
cout<<nr;
return 0;
}