Cod sursa(job #1856086)

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

using namespace std;

int main() {

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


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

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

   printf("%d\n", count);


    return 0;
}