Cod sursa(job #12943)
| Utilizator | Data | 5 februarie 2007 12:32:11 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
//se citeste un sir de nr nat. sa se afisze fractia subunitara ireductibila care se poate forma din numarul maxim si minim din sir
#include<iostream.h>
#include<math.h>
#include<conio.h>
void main ()
{
clrscr();
int n,x,i,min,max,a,b;
cout<<"n=";
cin>>n;
cin>>x;
min=x;
max=x;
for (i=1; i<n; i++)
{
cin>>x;
if(x<min)
min=x;
if(x>max)
max=x;
}
a=min;
b-max;
while(a!=b)
{if(a>b)
a=a-b;
else b=b-a;
}
cout<<min/b<<"/"<<max/b;
getch();
}
