Cod sursa(job #1455438)

Utilizator Wh1plashOvidiu Taralesca Wh1plash Data 27 iunie 2015 23:28:46
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <cmath>
#include <iomanip>
#include <vector>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <algorithm>
#define x first
#define y second

using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");

bool a[100001];
void ciur(int n)
{
    for(int i=2;i<=n;i++)
    {
        if(a[i]==0)
        {
            for(int j=2;i*j<=n;j++)
                a[i*j]=1;
        }
    }

}
int n, i,nr=0;
int main()
{
    in.sync_with_stdio(false);
    out.sync_with_stdio(false);
    in>>n;
    ciur(n);
    for(i=2;i<=n;i++)
        if(a[i]==0) nr++;
    out<<nr;


    return 0;
}