Cod sursa(job #1126057)
Utilizator | Data | 26 februarie 2014 21:01:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long v[2000001],n,i,nr,j;
int main()
{
fin>>n;
fin.close();
nr=n-1;
for(i=2;i<n;i++)
v[i]=1;
for(i=2;i*i<=n;i++)
if(v[i])
for(j=2;i*j<n;j++){
v[i*j]=0;
nr--;}
fout<<nr;
fin.close();
return 0;
}