Cod sursa(job #1540769)
Utilizator | Data | 3 decembrie 2015 11:00:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int ciur[10000];
int main()
{
int n,i,j,s=0;
in>>n;
for (i=2; i<n; i++)
ciur[i]=1;
for (i=2; i*i<=n; i++)
if (ciur[i])
for(j=2; j*i<n; j++)
ciur[i*j]=0;
for (i=2; i<n; i++)
if (ciur[i])
s=s+1;
out<<s;
return 0; }