Cod sursa(job #2943059)
Utilizator | Data | 20 noiembrie 2022 15:44:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n,k=0;
fin>>n;
for(int i=1;i<=n;i++){
int sw=1;
for(int d=2;d*d<=i && sw==1;d++)
if(i%d==0) sw=0;
if(i>1 && sw==1) k++;
}
fout<<k;
return 0;
}