Cod sursa(job #953260)
Utilizator | Data | 25 mai 2013 16:28:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool c[2000001];
int main()
{
int x,i,j,cnt=0;
in>>x;
for(i=2; i*i<=x;i++)
if(!c[i])
for(j=i*i; j<=x; j+=i)
c[j]=true;
for(i=2; i<=x;i++)
if(!c[i])
cnt++;
out<<cnt;
return 0;
}