Cod sursa(job #793246)

Utilizator Viva12Ferentz Sergiu Viva12 Data 2 octombrie 2012 13:27:40
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.46 kb
#include <cstdio>
#include <math.h>
using namespace std;
bool ciur[2000000];
int n;
int main()
{
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
    scanf("%d",&n);

    int lim = sqrt(n);
    int pas = 2;
    int nr = 0;
    for(int pas = 2; pas < n; pas++)
        {
            for(int i = pas*2; i < n; i+= pas)
            {
                nr++;
            }

        }

    printf("%d",n-nr);


    return 0;
}