Cod sursa(job #1819976)

Utilizator GeoeyMexicanuBadita George GeoeyMexicanu Data 1 decembrie 2016 00:22:58
Problema Ciurul lui Eratosthenes Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,k,r,i,ok=1,p,sum=0;
int main()
{
    f>>n;
    int* v=new int[n+5];
    p=2;
    for(i=2;i<=n;i++)
        v[i]=i;
    while(ok==1)
    {
        for(i=p;i<=n;i=i+p)
        {
            if(i>p)
                v[i]=0;
        }
        for(i=p+1;i<=n;i++)
        {
            if(v[i]!=0 && v[i]!=n)
            {
                p=i;
                break;
            }
            else
                ok=0;
        }
    }
    for(i=2;i<=n;i++)
    {
        if(v[i]!=0)
        sum++;
    }
    g<<sum;
}