Cod sursa(job #1322625)
Utilizator | Data | 20 ianuarie 2015 10:49:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,j,a[2000005],n,k=0;
int main (void)
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i=2;i<=n;i++) a[i]=1;
for (i=2;i<=n;i++)
if (a[i]==1)
{
k++;
for (j=i+i;j<=n;j=j+i)
a[j]=0;
}
g<<k;
return 0;
}