Cod sursa(job #1244714)

Utilizator tabbyMaria Vasiliu tabby Data 18 octombrie 2014 00:07:18
Problema Ciurul lui Eratosthenes Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include <cstdlib>
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,cnt;
char prim[2000000];
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;
}