Cod sursa(job #1331321)

Utilizator alpha37Matei Ian Stefan alpha37 Data 31 ianuarie 2015 15:18:02
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.46 kb
#include <fstream>
#include <iostream>
#include <math.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int N=1000001;
char prim[N];
// 0 - prim
// 1 - neprim
int main()
{
    int i,j,k,n;
    cin>>n;
    k=0;
    for(i=2;i<n;i++)
    {
        if(prim[i]==0)
        {
            for(j=i*i;j<n;j=j+i)
            {
                prim[j]=1;
            }
            k++;
        }
    }
    cout<<k;
}