Cod sursa(job #1322611)
| Utilizator | Data | 20 ianuarie 2015 10:36:46 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,j,a[100],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++)
a[i*j]=0;
}
//for(i=1;i<=n;i++)
// g<<a[i]<<' ';
g<<k;
return 0;
}
