Cod sursa(job #2246642)
Utilizator | Data | 27 septembrie 2018 11:56:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool a[2000001];
int k,n;
int main()
{
fin>>n;
for(int i=2;i<=n;++i)
if(a[i]==0)
{
k++;
for(int j=i+i;j<=n;j+=i)
{
a[j]=1;
}
}
fout<<k;
return 0;
}