Cod sursa(job #2292674)
Utilizator | Data | 29 noiembrie 2018 20:13:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[2000001];
int main()
{
int n, p=2,s=0;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
for (int i=2;i<=n;i++)
a[i]=1;
for (int i=2;i<=n;i++)
if (a[i])
{
s++;
for (int j=i+i;j<=n;j+=i)
a[j]=0;
}
fout<<s;
return 0;
}