Cod sursa(job #1117015)
Utilizator | Data | 22 februarie 2014 23:01:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
#define max 2000005
using namespace std;
int n,i,k,j;
bool sem[max];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;++i)
{
if(!sem[i])
{
++k;
for(j=i+i;j<=n;j+=i) sem[j]=true;
}
}
fout<<k;
return 0;
}