Wrap-Up

Answers to Self Review Exercises

6.1	a) functions, classes. b) function call. c) local variable. d) return. e) void. f) scope. g) return;, return expression; or encounter the closing right brace of a function. h) function prototype. i) rand. j) srand. k) auto, register, extern, static. l) auto. m) register. n) global. o) static. p) function scope, file scope, block scope, function-prototype scope, class scope, namespace scope. q) recursive. r) base. s) overloading. t) unary scope resolution operator (::). u) const. v) template.
6.2	a) block scope. b) block scope. c) file scope. d) file scope. e) file scope. f) function-prototype scope.
6.3	See the following program: 1 // Exercise 6.3: Ex06_03.cpp 2 // Testing the math library functions. 3 #include 4 using std::cout; 5 using std::endl; 6 using std::fixed; 7 8 #include 9 using std::setprecision; 10 11 #include 12 using namespace std; 13 14 int main() 15 { 16 cout << fixed << setprecision( 1 ); 17 18 cout << "sqrt(" << 900.0 << ") = " << sqrt( 900.0 ) 19 << " sqrt(" << 9.0 << ") = " << sqrt( 9.0 ); 20 cout << " exp(" << 1.0 << ") = " << setprecision( 6 ) 21 << exp( 1.0 ) << " exp(" << setprecision( 1 ) << 2.0 22 << ") = " << setprecision( 6 ) << exp( 2.0 ); 23 cout << " log(" << 2.718282 << ") = " << setprecision( 1 ) 24 << log( 2.718282 ) 25 << " log(" << setprecision( 6 ) << 7.389056 << ") = " 26 << setprecision( 1 ) << log( 7.389056 ); 27 cout << " log10(" << 1.0 << ") = " << log10( 1.0 ) 28 << " log10(" << 10.0 << ") = " << log10( 10.0 ) 29 << " log10(" << 100.0 << ") = " << log10( 100.0 ); 30 cout << " fabs(" << 13.5 << ") = " << fabs( 13.5 ) 31 << " fabs(" << 0.0 << ") = " << fabs( 0.0 ) 32 << " fabs(" << -13.5 << ") = " << fabs( -13.5 ); 33 cout << " ceil(" << 9.2 << ") = " << ceil( 9.2 ) 34 << " ceil(" << -9.8 << ") = " << ceil( -9.8 ); 35 cout << " floor(" << 9.2 << ") = " << floor( 9.2 ) 36 << " floor(" << -9.8 << ") = " << floor( -9.8 ); 37 cout << " pow(" << 2.0 << ", " << 7.0 << ") = " 38 << pow( 2.0, 7.0 ) << " pow(" << 9.0 << ", " 39 << 0.5 << ") = " << pow( 9.0, 0.5 ); 40 cout << setprecision(3) << " fmod(" 41 << 13.675 << ", " << 2.333 << ") = " 42 << fmod( 13.675, 2.333) << setprecision( 1 ); 43 cout << " sin(" << 0.0 << ") = " << sin( 0.0 ); 44 cout << " cos(" << 0.0 << ") = " << cos( 0.0 ); 45 cout << " tan(" << 0.0 << ") = " << tan( 0.0 ) << endl; 46 return 0; // indicates successful termination 47 } // end main   sqrt(900.0) = 30.0 sqrt(9.0) = 3.0 exp(1.0) = 2.718282 exp(2.0) = 7.389056 log(2.718282) = 1.0 log(7.389056) = 2.0 log10(1.0) = 0.0 log10(10.0) = 1.0 log10(100.0) = 2.0 fabs(13.5) = 13.5 fabs(0.0) = 0.0 fabs(-13.5) = 13.5 ceil(9.2) = 10.0 ceil(-9.8) = -9.0 floor(9.2) = 9.0 floor(-9.8) = -10.0 pow(2.0, 7.0) = 128.0 pow(9.0, 0.5) = 3.0 fmod(13.675, 2.333) = 2.010 sin(0.0) = 0.0 cos(0.0) = 1.0 tan(0.0) = 0.0
6.4	double hypotenuse( double side1, double side2 ) int smallest( int x, int y, int z ) void instructions( void ) // in C++ (void) can be written () double intToDouble( int number )
6.5	double hypotenuse( double, double ); int smallest( int, int, int ); void instructions( void ); // in C++ (void) can be written () double intToDouble( int );
6.6	register int count = 0; static double lastVal;
6.7	Error: Function h is defined in function g. Correction: Move the definition of h out of the definition of g. Error: The function is supposed to return an integer, but does not. Correction: Delete variable result and place the following statement in the function: return x + y; Error: The result of n + sum( n - 1 ) is not returned; sum returns an improper result. Correction: Rewrite the statement in the else clause as return n + sum( n - 1 ); Errors: Semicolon after the right parenthesis that encloses the parameter list, and redefining the parameter a in the function definition. Corrections: Delete the semicolon after the right parenthesis of the parameter list, and delete the declaration float a;. Error: The function returns a value when it is not supposed to. Correction: Eliminate the return statement.
6.8	This creates a reference parameter of type "reference to double" that enables the function to modify the original variable in the calling function.
6.9	False. C++ enables pass-by-reference using reference parameters (and pointers, as we discuss in Chapter 8).
6.10	See the following program: 1 // Exercise 6.10 Solution: Ex06_10.cpp 2 // Inline function that calculates the volume of a sphere. 3 #include 4 using std::cin; 5 using std::cout; 6 using std::endl; 7 8 #include 9 using std::pow; 10 11 const double PI = 3.14159; // define global constant PI 12 13 // calculates volume of a sphere 14 inline double sphereVolume( const double radius ) 15 { 16 return 4.0 / 3.0 * PI * pow( radius, 3 ); 17 } // end inline function sphereVolume 18 19 int main() 20 { 21 double radiusValue; 22 23 // prompt user for radius 24 cout << "Enter the length of the radius of your sphere: "; 25 cin >> radiusValue; // input radius 26 27 // use radiusValue to calculate volume of sphere and display result 28 cout << "Volume of sphere with radius " << radiusValue 29 << " is " << sphereVolume( radiusValue ) << endl; 30 return 0; // indicates successful termination 31 } // end main

Exercises

6.11

Show the value of x after each of the following statements is performed:

1. x = fabs( 7.5 )
2. x = floor( 7.5 )
3. x = fabs( 0.0 )
4. x = ceil( 0.0 )
5. x = fabs( -6.4 )
6. x = ceil( -6.4 )
7. x = ceil( -fabs( -8 + floor( -5.5 ) ) )

6.12

A parking garage charges a $2.00 minimum fee to park for up to three hours. The garage charges an additional $0.50 per hour for each hour or part thereof in excess of three hours. The maximum charge for any given 24-hour period is $10.00. Assume that no car parks for longer than 24 hours at a time. Write a program that calculates and prints the parking charges for each of three customers who parked their cars in this garage yesterday. You should enter the hours parked for each customer. Your program should print the results in a neat tabular format and should calculate and print the total of yesterday's receipts. The program should use the function calculateCharges to determine the charge for each customer. Your outputs should appear in the following format:

---

Car Hours Charge
1 1.5 2.00
2 4.0 2.50
3 24.0 10.00
TOTAL 29.5 14.50

 

6.13

An application of function floor is rounding a value to the nearest integer. The statement

y = floor( x + .5 );

 

rounds the number x to the nearest integer and assigns the result to y. Write a program that reads several numbers and uses the preceding statement to round each of these numbers to the nearest integer. For each number processed, print both the original number and the rounded number.

6.14

Function floor can be used to round a number to a specific decimal place. The statement

y = floor( x * 10 + .5 ) / 10;

 

rounds x to the tenths position (the first position to the right of the decimal point). The statement

y = floor( x * 100 + .5 ) / 100;

 

rounds x to the hundredths position (the second position to the right of the decimal point). Write a program that defines four functions to round a number x in various ways:

1. roundToInteger( number )
2. roundToTenths( number )
3. roundToHundredths( number )
4. roundToThousandths( number )

For each value read, your program should print the original value, the number rounded to the nearest integer, the number rounded to the nearest tenth, the number rounded to the nearest hundredth and the number rounded to the nearest thousandth.

6.15

Answer each of the following questions:

1. What does it mean to choose numbers "at random?"
2. Why is the rand function useful for simulating games of chance?
3. Why would you randomize a program by using srand? Under what circumstances is it desirable not to randomize?
4. Why is it often necessary to scale or shift the values produced by rand?
5. Why is computerized simulation of real-world situations a useful technique?

6.16

Write statements that assign random integers to the variable n in the following ranges:

1. 1 2
2. 100
3. 9
4. 1112
5. 1
6. 11

6.17

For each of the following sets of integers, write a single statement that prints a number at random from the set:

1. 2, 4, 6, 8, 10.
2. 3, 5, 7, 9, 11.
3. 6, 10, 14, 18, 22.

---

6.18

Write a function integerPower ( base, exponent ) that returns the value of

base exponent

For example, integerPower( 3, 4 ) = 3 * 3 * 3 * 3. Assume that exponent is a positive, nonzero integer and that base is an integer. The function integerPower should use for or while to control the calculation. Do not use any math library functions.

6.19

(Hypotenuse) Define a function hypotenuse that calculates the length of the hypotenuse of a right triangle when the other two sides are given. Use this function in a program to determine the length of the hypotenuse for each of the triangles shown below. The function should take two double arguments and return the hypotenuse as a double.

Triangle	Side 1	Side 2
1	3.0	4.0
2	5.0	12.0
3	8.0	15.0

6.20

Write a function multiple that determines for a pair of integers whether the second is a multiple of the first. The function should take two integer arguments and return true if the second is a multiple of the first, false otherwise. Use this function in a program that inputs a series of pairs of integers.

6.21

Write a program that inputs a series of integers and passes them one at a time to function even, which uses the modulus operator to determine whether an integer is even. The function should take an integer argument and return true if the integer is even and false otherwise.

6.22

Write a function that displays at the left margin of the screen a solid square of asterisks whose side is specified in integer parameter side. For example, if side is 4, the function displays the following:

****
****
****
****

 

6.23

Modify the function created in Exercise 6.22 to form the square out of whatever character is contained in character parameter fillCharacter. Thus, if side is 5 and fillCharacter is #, then this function should print the following:

#####
#####
#####
#####
#####

 

6.24

Use techniques similar to those developed in Exercise 6.22 and Exercise 6.23 to produce a program that graphs a wide range of shapes.

---

6.25

Write program segments that accomplish each of the following:

1. Calculate the integer part of the quotient when integer a is divided by integer b.
2. Calculate the integer remainder when integer a is divided by integer b.
3. Use the program pieces developed in (a) and (b) to write a function that inputs an integer between 1 and 32767 and prints it as a series of digits, each pair of which is separated by two spaces. For example, the integer 4562 should print as follows:

4 5 6 2

 

6.26

Write a function that takes the time as three integer arguments (hours, minutes and seconds) and returns the number of seconds since the last time the clock "struck 12." Use this function to calculate the amount of time in seconds between two times, both of which are within one 12-hour cycle of the clock.

6.27

(Celsius and Fahrenheit Temperatures) Implement the following integer functions:

1. Function celsius returns the Celsius equivalent of a Fahrenheit temperature.
2. Function fahrenheit returns the Fahrenheit equivalent of a Celsius temperature.
3. Use these functions to write a program that prints charts showing the Fahrenheit equivalents of all Celsius temperatures from 0 to 100 degrees, and the Celsius equivalents of all Fahrenheit temperatures from 32 to 212 degrees. Print the outputs in a neat tabular format that minimizes the number of lines of output while remaining readable.

6.28

Write a program that inputs three double-precision, floating-point numbers and passes them to a function that returns the smallest number.

6.29

(Perfect Numbers) An integer is said to be a perfect number if the sum of its factors, including 1 (but not the number itself), is equal to the number. For example, 6 is a perfect number, because 6 = 1 + 2 + 3. Write a function perfect that determines whether parameter number is a perfect number. Use this function in a program that determines and prints all the perfect numbers between 1 and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect. Challenge the power of your computer by testing numbers much larger than 1000.

6.30

(PrimeNumbers) An integer is said to be prime if it is divisible by only 1 and itself. For example, 2, 3, 5 and 7 are prime, but 4, 6, 8 and 9 are not.

1. Write a function that determines whether a number is prime.
2. Use this function in a program that determines and prints all the prime numbers between 2 and 10,000. How many of these numbers do you really have to test before being sure that you have found all the primes?
3. Initially, you might think that n/2 is the upper limit for which you must test to see whether a number is prime, but you need only go as high as the square root of n. Why? Rewrite the program, and run it both ways. Estimate the performance improvement.

6.31

(Reverse Digits) Write a function that takes an integer value and returns the number with its digits reversed. For example, given the number 7631, the function should return 1367.

6.32

The greatest common divisor (GCD) of two integers is the largest integer that evenly divides each of the numbers. Write a function gcd that returns the greatest common divisor of two integers.

6.33

Write a function qualityPoints that inputs a student's average and returns 4 if a student's average is 90100, 3 if the average is 8089, 2 if the average is 7079, 1 if the average is 6069 and 0 if the average is lower than 60.

6.34

Write a program that simulates coin tossing. For each toss of the coin, the program should print Heads or Tails. Let the program toss the coin 100 times and count the number of times each side of the coin appears. Print the results. The program should call a separate function flip that takes no arguments and returns 0 for tails and 1 for heads. [Note: If the program realistically simulates the coin tossing, then each side of the coin should appear approximately half the time.]

---

6.35

(Computers in Education) Computers are playing an increasing role in education. Write a program that helps an elementary school student learn multiplication. Use rand to produce two positive one-digit integers. It should then type a question such as

How much is 6 times 7?

 

The student then types the answer. Your program checks the student's answer. If it is correct, print "Very good!", then ask another multiplication question. If the answer is wrong, print "No. Please try again.", then let the student try the same question repeatedly until the student finally gets it right.

6.36

(Computer Assisted Instruction) The use of computers in education is referred to as computer-assisted instruction (CAI). One problem that develops in CAI environments is student fatigue. This can be eliminated by varying the computer's dialogue to hold the student's attention. Modify the program of Exercise 6.35 so the various comments are printed for each correct answer and each incorrect answer as follows:

Responses to a correct answer

 Very good!
 Excellent!
 Nice work!
 Keep up the good work!

 

Responses to an incorrect answer

 No. Please try again.
 Wrong. Try once more.
 Don't give up!
 No. Keep trying.

 

Use the random number generator to choose a number from 1 to 4 to select an appropriate response to each answer. Use a switch statement to issue the responses.

6.37

More sophisticated computer-aided instruction systems monitor the student's performance over a period of time. The decision to begin a new topic often is based on the student's success with previous topics. Modify the program of Exercise 6.36 to count the number of correct and incorrect responses typed by the student. After the student types 10 answers, your program should calculate the percentage of correct responses. If the percentage is lower than 75 percent, your program should print "Please ask your instructor for extra help" and terminate.

6.38

(Guess the Number Game) Write a program that plays the game of "guess the number" as follows: Your program chooses the number to be guessed by selecting an integer at random in the range 1 to 1000. The program then displays the following:

I have a number between 1 and 1000.
Can you guess my number?
Please type your first guess.

 

 

The player then types a first guess. The program responds with one of the following:

1. Excellent! You guessed the number!
 Would you like to play again (y or n)?
2. Too low. Try again.
3. Too high. Try again.

 

 

---

If the player's guess is incorrect, your program should loop until the player finally gets the number right. Your program should keep telling the player Too high or Too low to help the player "zero in" on the correct answer.

6.39

Modify the program of Exercise 6.38 to count the number of guesses the player makes. If the number is 10 or fewer, print "Either you know the secret or you got lucky!" If the player guesses the number in 10 tries, then print "Ahah! You know the secret!" If the player makes more than 10 guesses, then print "You should be able to do better!" Why should it take no more than 10 guesses? Well, with each "good guess" the player should be able to eliminate half of the numbers. Now show why any number from 1 to 1000 can be guessed in 10 or fewer tries.

6.40

Write a recursive function power ( base, exponent ) that, when invoked, returns

base exponent

For example, power( 3, 4 ) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equal to 1. Hint: The recursion step would use the relationship

base exponent = base · base exponent - 1

and the terminating condition occurs when exponent is equal to 1, because

base1 = base

6.41

(Fibonacci Series) The Fibonacci series

0, 1, 1, 2, 3, 5, 8, 13, 21, ...

begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the two preceding terms. (a) Write a nonrecursive function fibonacci( n ) that calculates the nth Fibonacci number. (b) Determine the largest int Fibonacci number that can be printed on your system. Modify the program of part (a) to use double instead of int to calculate and return Fibonacci numbers, and use this modified program to repeat part (b).

6.42

(Towers of Hanoi) In this chapter, you studied functions that can be easily implemented both recursively and iteratively. In this exercise, we present a problem whose recursive solution demonstrates the elegance of recursion, and whose iterative solution may not be as apparent.

The Towers of Hanoi is one of the most famous classic problems every budding computer scientist must grapple with. Legend has it that in a temple in the Far East, priests are attempting to move a stack of golden disks from one diamond peg to another (Fig. 6.41). The initial stack has 64 disks threaded onto one peg and arranged from bottom to top by decreasing size. The priests are attempting to move the stack from one peg to another under the constraints that exactly one disk is moved at a time and at no time may a larger disk be placed above a smaller disk. Three pegs are provided, one being used for temporarily holding disks. Supposedly, the world will end when the priests complete their task, so there is little incentive for us to facilitate their efforts.

Figure 6.41. Towers of Hanoi for the case with four disks.

(This item is displayed on page 322 in the print version)

 

Let us assume that the priests are attempting to move the disks from peg 1 to peg 3. We wish to develop an algorithm that prints the precise sequence of peg-to-peg disk transfers.

If we were to approach this problem with conventional methods, we would rapidly find ourselves hopelessly knotted up in managing the disks. Instead, attacking this problem with recursion in mind allows the steps to be simple. Moving n disks can be viewed in terms of moving only n1 disks (hence, the recursion), as follows:

1. Move n 1 disks from peg 1 to peg 2, using peg 3 as a temporary holding area.
2. Move the last disk (the largest) from peg 1 to peg 3.
3. Move the n 1 disks from peg 2 to peg 3, using peg 1 as a temporary holding area.

---

The process ends when the last task involves moving n = 1 disk (i.e., the base case). This task is accomplished by simply moving the disk, without the need for a temporary holding area.

Write a program to solve the Towers of Hanoi problem. Use a recursive function with four parameters:

1. The number of disks to be moved
2. The peg on which these disks are initially threaded
3. The peg to which this stack of disks is to be moved
4. The peg to be used as a temporary holding area

Your program should print the precise instructions it will take to move the disks from the starting peg to the destination peg. For example, to move a stack of three disks from peg 1 to peg 3, your program should print the following series of moves:

1 3 (This means move one disk from peg 1 to peg 3.)

2

2

3

1

3

images/U2192.jpg border=0> 3

6.43

Any program that can be implemented recursively can be implemented iteratively, although sometimes with more difficulty and less clarity. Try writing an iterative version of the Towers of Hanoi. If you succeed, compare your iterative version with the recursive version developed in Exercise 6.42. Investigate issues of performance, clarity and your ability to demonstrate the correctness of the programs.

6.44

(Visualizing Recursion) It is interesting to watch recursion "in action." Modify the factorial function of Fig. 6.29 to print its local variable and recursive call parameter. For each recursive call, display the outputs on a separate line and add a level of indentation. Do your utmost to make the outputs clear, interesting and meaningful. Your goal here is to design and implement an output format that helps a person understand recursion better. You may want to add such display capabilities to the many other recursion examples and exercises throughout the text.

6.45

(Recursive Greatest Common Divisor) The greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y, defined recursively as follows: If y is equal to 0, then gcd( x, y ) is x; otherwise, gcd( x, y ) is gcd( y, x % y ), where % is the modulus operator. [Note: For this algorithm, x must be larger than y.]

---

6.46

Can main be called recursively on your system? Write a program containing a function main. Include static local variable count and initialize it to 1. Postincrement and print the value of count each time main is called. Compile your program. What happens?

6.47

Exercises 6.356.37 developed a computer-assisted instruction program to teach an elementary school student multiplication. This exercise suggests enhancements to that program.

1. Modify the program to allow the user to enter a grade-level capability. A grade level of 1 means to use only single-digit numbers in the problems, a grade level of 2 means to use numbers as large as two digits, etc.
2. Modify the program to allow the user to pick the type of arithmetic problems he or she wishes to study. An option of 1 means addition problems only, 2 means subtraction problems only, 3 means multiplication problems only, 4 means division problems only and 5 means a random mix of problems of all these types.

6.48

Write function distance that calculates the distance between two points (x1, y1) and (x2, y2). All numbers and return values should be of type double.

6.49

What is wrong with the following program?

 1 // Exercise 6.49: ex06_49.cpp
 2 // What is wrong with this program?
 3 #include 
 4 using std::cin;
 5 using std::cout;
 6
 7 int main()
 8 {
 9 int c;
10
11 if ( ( c = cin.get() ) != EOF )
12 {
13 main();
14 cout << c;
15 } // end if
16
17 return 0; // indicates successful termination
18 } // end main

6.50

What does the following program do?

1 // Exercise 6.50: ex06_50.cpp 2 // What does this program do? 3 #include 4 using std::cout; 5 using std::cin; 6 using std::endl; 7 8 int mystery( int, int ); // function prototype 9

---

10 int main() 11 { 12 int x, y; 13 14 cout << "Enter two integers: "; 15 cin >> x >> y; 16 cout << "The result is " << mystery( x, y ) << endl; 17 18 return 0; // indicates successful termination 19 } // end main 20 21 // Parameter b must be a positive integer to prevent infinite recursion 22 int mystery( int a, int b ) 23 { 24 if ( b == 1 ) // base case 25 return a; 26 else // recursion step 27 return a + mystery( a, b - 1 ); 28 } // end function mystery

6.51

After you determine what the program of Exercise 6.50 does, modify the program to function properly after removing the restriction that the second argument be nonnegative.

6.52

Write a program that tests as many of the math library functions in Fig. 6.2 as you can. Exercise each of these functions by having your program print out tables of return values for a diversity of argument values.

6.53

Find the error in each of the following program segments and explain how to correct it:

1. float cube( float ); // function prototype double cube( float number ) // function definition { return number * number * number; }
2. register auto int x = 7;
3. int randomNumber = srand();
4. float y = 123.45678; int x; x = y; cout << static_cast < float > ( x ) << endl;
5. double square( double number ) { double number; return number * number; }
6. int sum( int n ) { if ( n == 0 ) return 0; else return n + sum( n ); }

---

6.54

Modify the craps program of Fig. 6.11 to allow wagering. Package as a function the portion of the program that runs one game of craps. Initialize variable bankBalance to 1000 dollars. Prompt the player to enter a wager. Use a while loop to check that wager is less than or equal to bankBalance and, if not, prompt the user to reenter wager until a valid wager is entered. After a correct wager is entered, run one game of craps. If the player wins, increase bankBalance by wager and print the new bankBalance. If the player loses, decrease bankBalance by wager, print the new bankBalance, check on whether bankBalance has become zero and, if so, print the message "Sorry. You busted!" As the game progresses, print various messages to create some "chatter" such as "Oh, you're going for broke, huh?", "Aw cmon, take a chance!" or "You're up big. Now's the time to cash in your chips!".

6.55

Write a C++ program that prompts the user for the radius of a circle then calls inline function circleArea to calculate the area of that circle.

6.56

Write a complete C++ program with the two alternate functions specified below, of which each simply triples the variable count defined in main. Then compare and contrast the two approaches. These two functions are

1. function tripleByValue that passes a copy of count by value, triples the copy and returns the new value and
2. function tripleByReference that passes count by reference via a reference parameter and triples the original value of count tHRough its alias (i.e., the reference parameter).

6.57

What is the purpose of the unary scope resolution operator?

6.58

Write a program that uses a function template called min to determine the smaller of two arguments. Test the program using integer, character and floating-point number arguments.

6.59

Write a program that uses a function template called max to determine the largest of three arguments. Test the program using integer, character and floating-point number arguments.

6.60

Determine whether the following program segments contain errors. For each error, explain how it can be corrected. [Note: For a particular program segment, it is possible that no errors are present in the segment.]

1. template < class A > int sum( int num1, int num2, int num3 ) { return num1 + num2 + num3; }
2. void printResults( int x, int y ) { cout << "The sum is " << x + y << ' '; return x + y; }
3. template < A > A product( A num1, A num2, A num3 ) { return num1 * num2 * num3; }
4. double cube( int ); int cube( int );