Cod sursa(job #1467338)
Utilizator | Data | 3 august 2015 11:59:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char c[2000005];
int n,nr;
void ciur()
{
int i=0;
int j=0;
c[0]=c[1]=1;
for(i=2;i*i<=200;i++)
if(c[i]==0)
{
for(j=i*i;j<=200;j=j+i)
c[j]=1;
}
}
int main()
{
int i=0;
ciur();
fin>>n;
for(i=1;i<=n;i++)
{
if(c[i]==0) nr++;
}
fout<<nr;
return 0;
}