Cod sursa(job #1227146)
| Utilizator | Data | 9 septembrie 2014 15:06:12 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
bool v[2000005];
long int k,n,i,j;
f>>n;
for(i=1;i<=n;i++)
{
v[i]=1;
}
for (i=2;i<=sqrt(n);i++)
{
if (v[i]==1)
{
for (j=i; j<=n/i; j++)
{
v[i*j]=0;
}
}
}
k=0;
for (i=2; i<=n; i++)
{
if (v[i]==1) k++;
}
g<<k;
return 0;
}
