Cod sursa(job #1559121)
Utilizator | Data | 30 decembrie 2015 10:43:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
#define Max 1000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,ok[Max],nr;
int main()
{fin>>n;
for(i=2;i<n;i++)
ok[i]=0;
for(i=2;i*i<n;i++)
for(j=2;i*j<n;j++)
ok[i*j]=1;
for(i=2;i<n;i++)
if(ok[i]==0) {nr++;}
fout << nr;
return 0;
}