Cod sursa(job #1112981)

Utilizator fluture.godlikeGafton Mihnea Alexandru fluture.godlike Data 20 februarie 2014 10:57:24
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool *sieve;
int main()
{
    int n, count = 0;
    fin>>n;
    sieve = new bool[n+1]();
    for(int i = 2; i<= n; i++) sieve[i] = 0;
    for(int i = 2; i<= n; i++)
    {
            if(sieve[i] != 0) continue;
            for(int j = 2; j<= n/i; j++)
            {
                    if(sieve[i*j] == 0){sieve[i*j] = 1; count++;}
            }
    }
    //for(int i = 2; i< n; i++) cout<<sieve[i]<<" ";cout<<endl; 
    fout<<n-1-count<<endl;
    return 0;
}