Cod sursa(job #1305184)

Utilizator Andrei_PopaAndreiCDG Andrei_Popa Data 29 decembrie 2014 16:53:26
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.41 kb
#include <iostream>
#include <math.h>
#include <fstream>

using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[1000],i,n,k,p;
int main()
{
    fin>>n;
    for(i=2;i<=sqrt(n);i++)
    {
        if(v[i]==0)
        for(k=i*i;k<=n;k=k+i)
        v[k]=1;
    }
    for(i=2;i<=n;i++)
    if(v[i]==0)
    p++;
    fout<<p;

    fin.close();
    fout.close();
    return 0;
}