Cod sursa(job #1344027)
Utilizator | Data | 16 februarie 2015 11:06:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
int n,i,j,k;bool n1[2000001];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
fin>>n;
for(i=2;i*i<=n;++i)if(!n1[i])for(j=i*i;j<=n;j+=i)n1[j]=1;
for(i=2;i<=n;++i)if(!n1[i])++k;
fout<<k;
return 0;
}