Cod sursa(job #1322588)
Utilizator | Data | 20 ianuarie 2015 10:10:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <iostream>
using namespace std;
int i,j,a[100],n,k=0;
int main (void)
{
cin>>n;
for (i=2;i<=n;i++) a[i]=1;
for (j=2;j<=n;j++) for (i=2;i*i<=n;i++) a[i*j]=0;
for (i=1;i<=n;i++) if (a[i]==1) k++;
cout<<k;
return 0;
}