Cod sursa(job #1247252)

Utilizator tudor_bonifateTudor Bonifate tudor_bonifate Data 22 octombrie 2014 15:11:32
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <fstream>
#include <cstdio>
using namespace std;
long long n,i,j,nr;
bool v[2000100];
int main()
{
    freopen("ciur.in","r",stdin);
    ofstream g ("ciur.out");
    scanf("%d",&n);
    for(i=2; i<=n; i++)
        v[i]=true;
    for(i=2; i<=n; i++)
        if(v[i])
        {
            j=i*2;
            while(j<=n)
            {
                v[j]=false;
                j+=i;
            }
        }
    for(i=1; i<=n; i++)
        if(v[i])nr++;
    g<<nr;
    return 0;
}