Cod sursa(job #2678280)
Utilizator | Data | 28 noiembrie 2020 11:35:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
long long n,cnt=0;
cin>>n;
bool v[n+1];
for(int i=2;i*i<=n;i++)
{
for(int j=2;j*i<=n;j++)
v[i*j]=1;
}
for(int a=2;a<=n;a++)
{
if(v[a]==0)
cnt++;
}
cout<<cnt;
return 0;
}