Cod sursa(job #361063)
| Utilizator |  bilal tarik kaan bilalkaan |
Data | 3 noiembrie 2009 17:28:22 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | c | Status | done |
| Runda | CNRV #4 | Marime | 0.27 kb |
#include<iostream.h>
long n,i,s,v[100],k,p;
main()
{cin>>n;
cout<<"2";
for(i=3;i<=n;i++)
if(i%2!=0) {k++; v[k]=i; }
for(s=1;s<=k;s++)
for(i=s+1;i<=k;i++)
if(v[i]%v[s]==0)
{for(p=i+1;p<=k;p++)
v[p-1]=v[p];
k--;i--;}
for(i=1;i<=k;i++)
cout<<v[i]<<" ";
return 1 ;}