Cod sursa(job #1551612)
Utilizator | Data | 16 decembrie 2015 09:14:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int nr=0, n, i, j,a[10005],cate;
int main()
{
f>>n;
cate=0;
for (i=2;i<=n;i++)
a[i]=1;
for (i=2;i<=sqrt(n);i++)
if (a[i])
for (j=i;j<=n/i;j++)
a[i*j]=0;
for (i=2;i<=n;i++)
if (a[i]) cate++;
g<<cate;
return 0;
}