Cod sursa(job #2291878)
Utilizator | Data | 28 noiembrie 2018 18:40:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,nr=0;
bool util[2000000];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
util[0]=1;
util[1]=1;
for(int i=2;i<=n;i++)
{
if(util[i]==false)
{
nr++;
for(int j=2*i;j<=n;j+=i)
util[j]=true;
}
}
g<<nr;
return 0;
}