Cod sursa(job #1116679)
Utilizator | Data | 22 februarie 2014 19:04:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
bool v[2000001];
int n,x;
void ciur()
{
int i,j;
for(i=2;i<=n;++i)
if(!v[i])
{
x++;
for(j=i;j<=n/i;++j)v[i*j]=true;
}
}
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
ciur();
fout<<x;
return 0;
}