Cod sursa(job #1244695)

Utilizator tabbyMaria Vasiliu tabby Data 17 octombrie 2014 23:44:12
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.55 kb
#include <cstdlib>
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int prim[1000],n,i,j,cnt;
int main()
{
    fin>>n;
    for(i=2;i<=n;i++)
        prim[i]=1;
    for(i=2;i*i<=n;i++)
        if(prim[i])
        {
            for (j=i*i;j<= n;j=j+i)
                prim[j]=0;
        }
                for(i=2;i<=n;i++)
                if(prim[i]==1) //printf("%d ", i);
                cnt++;         
             fout<<cnt;            
    system("PAUSE");
    return 0;
}