Cod sursa(job #2503556)
Utilizator | Data | 3 decembrie 2019 13:46:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include<fstream>
using namespace std;
long x,v[2000001],nr;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>x;
for(int i=2; x>=i*i; i++)
{
if(v[i]==0)
{
for(j=i*i;j<=x;j+=i)
v[j]=1;
}
}
for(int i=2;i<=x;i++)
if(v[i]==0)
nr++;
g<<nr;
}