Cod sursa(job #1732231)
Utilizator | Data | 21 iulie 2016 10:46:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f ("ciur.in");
ofstream t ("ciur.out");
int magic(int n)
{
bool v[n+10];
int s=0;
for (int i=2; i<=n; ++i)
{
if (!v[i])
++s;
for (int j=i*i; j<=n; j+=i)
v[j]=true;
}
return s;
}
int main()
{
int n;
f>>n;
t<<magic(n);
return 0;
}