Cod sursa(job #3189502)
Utilizator | Data | 5 ianuarie 2024 21:37:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int a[20],j,i,k;
int main() {
int n;
fin>>n;
for(i=2;i<=n;i++){
a[i]=true;}
for(i=2;i<=sqrt(n);i++){
if(a[i]==true)
for(j=i*i;i<=n;j+=i){
a[j]=false;}}
for(i=2;i<=sqrt(n);i++){
if(a[i]==true) k++;}
fout<<k;
return 0;
}