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