Cod sursa(job #2253710)
Utilizator | Data | 4 octombrie 2018 12:07:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, m;
bool v[2000000];
void citire()
{
f>>n;
}
void testareprim()
{
int i, rad, j;
rad=sqrt(n);
for(i=2;i<=rad;i++)
{
if(v[i]==0)
for(j=i*i;j<=n;j+=i)
v[j]=1;
}
}
void numarareprime()
{ int i;
for(i=2;i<=n;i++)
if(v[i]==0)
m++;
}
void afisare()
{
g<<m;
}
int main()
{
citire();
testareprim();
numarareprime();
afisare();
return 0;
}