Cod sursa(job #1812505)

Utilizator victorteslaruVictor Teslaru victorteslaru Data 22 noiembrie 2016 10:15:42
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include <iostream>
#include <fstream>

using namespace std;

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