Cod sursa(job #2634953)
Utilizator | Data | 12 iulie 2020 19:47:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr;
short vc[2000001];
int main()
{
for (int i=2; i<=2000000; i++)
{
if (vc[i]==0)
{
for (int j=i*2; j<=2000000; j+=i)
vc[j]=1;
}
}
f>>n;
for (int i=2; i<=n; i++)
{
if (vc[i]==0)
{
nr++;
}
}
g<<nr;
return 0;
}