Cod sursa(job #1851248)
Utilizator | Data | 19 ianuarie 2017 16:02:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n,v[100],c,i,j;
bool p[100];
fin>>n;
p[1]=1;
c=0;
for(i=2;i<=sqrt(n);i++)
{
if(p[i]==0)
{
for(j=i*2;j<=n;j=j+i)
{
p[j]=1;
}
}
}
for(i=2;i<=n;i++)
{
if(p[i]==0) c++;
}
fout<<c;
return 0;
}