Advertisement
Guest User

bnto code

a guest
May 20th, 2019
83
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.50 KB | None | 0 0
  1. #include <iostream>
  2. #include <cstdlib>
  3. #include <ctime>
  4. using std::cout;
  5. using std::cin;
  6. using std::endl;
  7. short generar() {
  8.     return rand() % 40 + 1;
  9. }
  10. short mayor(short *n1, short *n2, short*n3, short *n4) {
  11.     int m = 0;
  12.     if (*n1 > *n2&&*n1 > *n3&&*n1 > *n4)m= *n1;
  13.     else if (*n2 > *n1&&*n2 > *n3&&*n2 > *n4)m= *n2;
  14.     else if (*n3 > *n1&&*n3 > *n2&&*n3 > *n4)m= *n3;
  15.     else if (*n4 > *n1&&*n4 > *n2&&*n4 > *n3)m= *n4;
  16.     return m;
  17. }
  18. short menor(short *n1, short *n2, short*n3, short *n4) {
  19.     int m = 0;
  20.     if (*n1 < *n2&&*n1 < *n3&&*n1 < *n4)m= *n1;
  21.     else if (*n2 < *n1&&*n2 < *n3&&*n2 <*n4)m= *n2;
  22.     else if (*n3 < *n1&&*n3 < *n2&&*n3 <*n4)m= *n3;
  23.     else if (*n4 < *n1&&*n4 < *n2&&*n4 <*n3)m= *n4;
  24.     return m;
  25. }
  26. short menormayor(short *n1, short *n2, short*n3, short *n4) {
  27.     short ma = mayor(n1, n2, n3, n4);
  28.     short t;
  29.     if (ma == *n1) { t=mayor(new short(0), n2, n3, n4); }
  30.     else if (ma == *n2) { t = mayor(n1,new short(0), n3, n4); }
  31.     else if (ma == *n3) { t = mayor(n1,n2 ,new short(0), n4); }
  32.     else if (ma == *n4) { t = mayor(n1,n2, n3, new short(0)); }
  33.     return t;
  34. }
  35. int main() {
  36.  
  37.     short *n1, *n2, *n3, *n4;
  38.     n1 = new short;
  39.     n2 = new short;
  40.     n3 = new short;
  41.     n4 = new short;
  42.     srand(time(NULL));
  43.     *n1 = generar();
  44.     *n2 = generar();
  45.     *n3 = generar();
  46.     *n4 = generar();
  47.     cout << *n1 << " " << *n2 << " " << *n3 << " " << *n4 << endl;
  48.     cout << mayor(n1, n2, n3, n4)<<endl;
  49.     cout << menor(n1, n2, n3, n4)<<endl;
  50.     cout << menormayor(n1, n2, n3, n4) << endl;
  51.     cin.get();
  52.     cin.ignore();
  53.     return 0;
  54.  
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement