Cod sursa(job #1388578)
Utilizator | Data | 15 martie 2015 16:02:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
char f[2000000];
int x,i,k,ct=0;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin >> x;
f[1]=1;
for(k=2;k*k<=x;k++)
{
if(f[k]==0)
{
for(i=2;i<=x;i++)
f[i*k]=1;
}
}
for(k=2;k<=x;k++)
{
if(f[k]==0)
ct++;
}
fout << ct;
fout.close();
fin.close();
return 0;
}