Cod sursa(job #1491794)
Utilizator | Data | 26 septembrie 2015 10:16:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int p[2000001];
int main()
{
int n,nr=0;
fin>>n;
for (int i=2;i<=n;i++) p[i]=1;
for (int i=2;i<=n;i++)
if (p[i]!=0)
{
nr++;
for (int j=i;j<=n;j+=i) p[j]=0;
}
fout<<nr;
return 0;
}