Documente Academic
Documente Profesional
Documente Cultură
void main()
{
cout<<a=;
cin>>a;
cout<<b=;
cin>>b;
sa=1;
for(d=2;d<=a/2;d++)
if(a%d==0)
sa=sa+d;
if(sa==b)
{
sb=1;
for(d=2;d<=b/2;d++)
if(b%d==0)
sb=sb+d;
if(sb==a)
cout<<Prietene;
}
else
#include<iostream.h>
int v[25], i, n, ok, aux;
void main()
{cout<<n=; cin>>n;
for(i=1;i<=n;i++)
{cout<<v[<<i<<]=; cin>>v[i]; }
for(i=1;i<=n;i++) cout<<v[i]<< ;
//Sortarea crescatoare
do
ok=1;
for(i=1;i<=n-1;i++)
if(v[i]>v[i+1])
//Interschimbare
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=0;
}while(ok!=1);
cout<<endl;
for(i=1;i<=n;i++)
cout<<v[i]<< ;
Exemplu:
Lista ordonata va fi formata initial din primul element iar lista neordonata de
celelalte (n-1) elemente
*/
#include<iostream.h>
int v[25],i,j,n,x;
void main()
cout<<n=; cin>>n;
for(i=1;i<=n;i++)
{ cout<<v[<<i<<]=; cin>>v[i]; }
for(i=1;i<=n;i++) cout<<v[i]<< ;
for(i=2;i<=n;i++)
sfarsit
{ x=v[i];
j=i-1;
while (j>=0 && v[j]>x) // mut cu o pozitie spre dreapta toate elementele mai
mari decat x=v[i]
v[j+1]=v[j];
j;
cout<<endl;
for(i=1;i<=n;i++)
cout<<v[i]<< ;}
/* Fiecare element v[i] se compara cu toate aflate dupa el. Daca se gaseste
un element mai mic decat v[i] atunci acestea se vor interschimba. Cand v[i]
si-a incheiat rolul de pivot, partea din vector pana la acesta inclusiv, este
sortata crescator. */
#include<iostream.h>
int v[25],n,i,j,aux;
void main()
{cout<<nr de elemente=;
cin>>n;
for(i=0;i<n;i++)
{cout<<v[<<i<<]=;
cin>>v[i];}
for(i=0;i<n;i++)
cout<<v[i]<< ;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(v[i]>v[j])
cout<<endl;
for(i=0;i<n;i++)
cout<<v[i]<< ;
Enunt:
Solutia:
Exemplu:
*/
#include<iostream.h>
int a[25],b[25],c[25],n,i,j;
void main()
for(i=0;i<n;i++) cout<<a[i]<< ;
for(i=0;i<n;i++)
c[i]=a[i];
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if (a[i]<a[j])
b[j]++;
else b[i]++;
for(i=0;i<n;i++)
a[b[i]]=c[i];
cout<<endl;
for(i=0;i<n;i++) cout<<a[i]<< ;