Cod sursa(job #1978799)

Utilizator VladDragoiDragoi Vlad VladDragoi Data 8 mai 2017 20:30:06
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, a[2000002];
int ciur(int &n,int a[])
{int i,j,nr=0;
    for(i=2;i<=n;i++) a[i]=1;
for(i=2;i<=sqrt(n);i++)
    if(a[i])
    for(j=i;j<=n/i;j++)
    a[i*j]=0;
for(i=2;i<=n;i++) if(a[i]) nr++;
return nr;
}
int main()
{
f>>n;
    g<<ciur(n,a);
    return 0;
f.close();
g.close();}