Cod sursa(job #1045766)

Utilizator denis_tdrdenis tdr denis_tdr Data 2 decembrie 2013 00:03:45
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.6 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <math.h>
using namespace std;
ifstream fin; ofstream fout;
int prim(int nr)
{
    if(nr==1 || nr==2)return 1;
    for(int i=2;i<nr;i++)
        if(nr%i==0)return 0;
    return 1;
}
int main()
{
    fin.open("ciur.in"); fout.open("ciur.out");
    int n;fin>>n;fin.close();
    int c=0;
    vector<int> a=vector<int>(n,1);
    int i,j;
    for(i=2;i<=sqrt(n);i++)
        if(a[i])
            for(j=i*i;j<=n;j+=i)
                a[j]=0;
    for(i=2;i<n;i++)
        if(a[i])c++;
    fout<<c;fout.close();
    return 0;
}