Cod sursa(job #2925332)
Utilizator | Data | 14 octombrie 2022 15:56:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
const int N=2e6+3;
bool ciur[N];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,nr=0,c;
cin>>n;
ciur[1]=1;
for(i=2; i<=n; i++)
if(ciur[i]==0)
{c=2;j=i*c;
nr++;
while(j<=n)
ciur[j]=1,j=j/c,c++,j=j*c;
}
cout<<nr;
return 0;
}