Cod sursa(job #1856083)

Utilizator adnicolaeAdrian Danut Nicolae adnicolae Data 24 ianuarie 2017 15:14:21
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <iostream>
#include <cstdio>

using namespace std;

int main() {

  freopen ("ciur.in", "r", stdin);
  freopen ("ciur.out", "w", stdout);
   int count = 0, N;


  scanf("%d", &N);
   for(int  i=2; i<=N; ++i)
   {
    bool prim = true;
       for(int j = 2; j < i; ++j)
       {
           if(i%j == 0)
           {
           prim = false;
            break;
           }
       }

       if(prim == true)
       count++;
   }

   printf("%d", count);


    return 0;
}