Cod sursa(job #1920355)

Utilizator tavisOctavian Matei tavis Data 9 martie 2017 23:44:44
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.22 kb
Raporteaza aceasta sursa 
#include <fstream>
#define MaxN 210000000
using namespace std;
long long i,j,n,prim[MaxN],cnt;
int main()
{in>>n;for(i=2;i<=n;i++)prim[i]=1;for(i=1;i<=n;i++){if(prim[i]){++cnt;for(j=i+i;j<=n;j+=i)prim[j]=0;}}out<<cnt;}