Cod sursa(job #1239114)
Utilizator | Data | 8 octombrie 2014 11:32:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
bool c[2000000];
int verif(int n)
{
for (int i=2; i*i<=n; i++)
if (!c[i])
{
for(int j=i*i; j<=n; j+=i)
c[j]=true;
}
}
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,p=0;
f>>n;
verif(n);
for(int i=2; i<=n; i++)
if(!c[i])
p++;
g<<p;
return 0;
}