pc1-11.cpp

《c＋＋大学教程实验指导书》源码

// Chapter 1 of C++ How to Program
// Programming Challenge number 11 (Solution)

#include <iostream>

using std::cout; 
using std::endl; 
using std::cin; 

int main()
{
   int number1;
   int number2;
   int number3;
   int number4;
   int number5;
   int smallest;
   int largest;

   cout << "Enter five integers: ";
   cin >> number1 >> number2 >> number3 >> number4 >> number5;

   largest = number1;
   smallest = number1;

   if ( number2 > largest )
      largest = number2;

   if ( number3 > largest )
      largest = number3;

   if ( number4 > largest )
      largest = number4;

   if ( number5 > largest )
      largest = number5;

   if ( number2 < smallest )
      smallest = number2;

   if ( number3 < smallest )
      smallest = number3;

   if ( number4 < smallest )
      smallest = number4;

   if ( number5 < smallest )
      smallest = number5;

   cout << "Largest is " << largest 
        << "\nSmallest is " << smallest << endl;

   return 0;

} // end main



 /**************************************************************************
 * (C) Copyright 1992-2003 by Deitel & Associates, Inc. and Prentice      *
 * Hall. All Rights Reserved.                                             *
 *                                                                        *
 * DISCLAIMER: The authors and publisher of this book have used their     *
 * best efforts in preparing the book. These efforts include the          *
 * development, research, and testing of the theories and programs        *
 * to determine their effectiveness. The authors and publisher make       *
 * no warranty of any kind, expressed or implied, with regard to these    *
 * programs or to the documentation contained in these books. The authors *
 * and publisher shall not be liable in any event for incidental or       *
 * consequential damages in connection with, or arising out of, the       *
 * furnishing, performance, or use of these programs.                     *
 *************************************************************************/