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