Cod sursa(job #2487198)
Utilizator | Data | 4 noiembrie 2019 10:43:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long n,i,j,nr;
bool ok=1;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2; i<=n; i++)
{
ok=1;
for(j=2; j*j<=i; j++)
if(i%j==0) ok=0;
if(ok==1) nr++;
}
fout<<nr;
}