Cod sursa(job #1559120)

Utilizator AndronicAlx99Andronic Alexandra AndronicAlx99 Data 30 decembrie 2015 10:39:37
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.39 kb
#include <iostream>
#include <fstream>
#define Max 10000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,ok[Max],nr;
int main()
{fin>>n;
for(i=2;i<n;i++)
    ok[i]=0;//presupunem ca toate numerele pana la n sunt prime
for(i=2;i*i<n;i++)
    for(j=2;i*j<n;j++)
    ok[i*j]=1;
for(i=2;i<n;i++)
    if(ok[i]==0) nr++;
    fout << nr;
    return 0;
}