Cod sursa(job #1119588)
Utilizator | Data | 24 februarie 2014 18:43:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<iostream>
using namespace std;
int x[300];
int main()
{
int n,i,j,nr=0;
cin>>n;
x[2]=0;
for(i=2; i<n; i++)
for(j=i+1; j<=n; j++)
if(j%i==0)
x[j]=-1;
for(i=2; i<=n; i++)
if(x[i]==0)
nr++;
cout<<nr;
return 0;
}