Cod sursa(job #1693533)

Utilizator razvandRazvan Dumitru razvand Data 23 aprilie 2016 13:00:52
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <fstream>
#include <cmath>
#include <bitset>
#include <random>
#include <iostream>
#include <time.h>
#define MAX 2000003
#define NR 12312311

using namespace std;

ifstream in("ciur.in");
ofstream out("ciur.out");

int primes[148950];
int K = 0;

bool isprime(int val) {
    for(int i = 0; primes[i]*primes[i] <= val; i++) {
        if(val%primes[i] == 0)
            return false;
    }
    return true;
}

int n,k;
int main() {
    in >> n;
    primes[K++] = 2;
    for(int i = 3; i <= n; i++)
        if(isprime(i))
            primes[K++] = i;
    out << K;
    return 0;
}