Cod sursa(job #2518289)
Utilizator | Data | 5 ianuarie 2020 14:43:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[3000000];
int main()
{ int i,n,j,k=0;
in>> n;
for(i=2;i<=n;i++){
v[i]=1;
}
for(i=2;i*i<=n;i++)
{
if(v[i]==1)
{
for(j=i*i;j<=n;j=j+i)
{
v[j]=0;
}
}
}
for(i=2;i<=n;i++){
if(v[i]==1){
k++;
}
}
out<< k;
return 0;
}