Cod sursa(job #1747220)
Utilizator | Data | 24 august 2016 17:04:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define dim 1000001
long long int n,sir[dim*2],i,j,k=0;
int main()
{
fin>>n;
for(i=2;i<=n&&k<n;i++)
{
if(sir[i]==0)
{k++;
for(j=i*2;j<=n;j=j+i)
sir[j]=1;}
}
fout<<k;
return 0;
}