Cod sursa(job #1657581)
Utilizator | Data | 20 martie 2016 16:59:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
char a[20003];
int main()
{
int n,i,p,cont=0,j;
in>>n;
for(i=2;i<=n;i++)
{
a[i]=i;
}
for(i=2;i*i<=n;i++)
{
if(a[i]!=0)
{
for(j=i;j<=n/i;j++)
{
a[i*j]=0;
}
}
}
for(i=2;i<=n;i++)
if(a[i]!=0) cont++;
out<<cont;
return 0;
}