Cod sursa(job #837557)
Utilizator | Data | 18 decembrie 2012 09:39:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <math.h>
using namespace std;
int a[10000000];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, i, j, k=0;
f >> n;
for (i=2;i<=n;i++)
a[i]=1;
for (i=2; i<=sqrt(n); i++)
if(a[i]==1)
for(j=i; j<=n/i; j++)
a[i*j]=0;
for(i=1; i<=n; i++)
if (a[i]==1) k++;
g<<k;
}