Cod sursa(job #2631267)

Utilizator PetraPetra Hedesiu Petra Data 29 iunie 2020 17:02:08
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.53 kb
#include <iostream>
#include <fstream>

using namespace std;

int prim (int x)
{
    if (x==1)
        return 0;
    if (x==2)
        return 1;
    if (x%2==0)
        return 0;
    for (int i=3; i*i<=x; i+=2)
    {
        if (x%i==0)
            return 0;
    }
    return 1;
}
int main()
{
    ifstream fin ("ciur.in");
    ofstream fout ("ciur.out");
    int n;
    fin >> n;
    int k=0;
    for (int i=2; i<n; i++)
    {
        if (prim(i)==1)
            k++;
    }
    fout << k;
    return 0;
}