Cod sursa(job #1561678)
Utilizator | Data | 4 ianuarie 2016 13:23:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,ct;
fin>>N;
ct=0;
bool prim[2000000];
for (int i=2;i<=N;i++)
{
prim[i]=1;
}
for (int i=2;i<=N;i++)
{
if (prim[i]==1)
{
ct++;
int j;
for (j=i+i;j<=N;j=j+i)
{
prim[j]=0;
}
}
}
fout<<ct;
}