Cod sursa(job #1227742)

Utilizator twinkey_gunnerMuresan Gabi twinkey_gunner Data 11 septembrie 2014 15:51:27
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.46 kb
#include <iostream>
#include <fstream>
using namespace std;
const int MAXN = 100005;
bool ciur[MAXN];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
    int n;
    int cnt =0;
    f>>n;
    for(int i=2; i<MAXN; i++){
        if(ciur[i]==0){
            for(int j=i+i; j<=MAXN; j=j+i){
                ciur[j]=1;
            }
        }
    }
for(int i=2; i<=n; i++){
        if(ciur[i]==0){
            ++ cnt;}}
g<<cnt;
    return 0;
}