I've been given a project in which I have to find the highest and lowest possible product using 3 2-digit numbers without repeating any numbers.
For example, the algorithm for the highest would be:
7n * 8n * 9n where the n's would be 4, 5, or 6.
The algorithm for the lowest would be:
1n * 2n * 3n where the n's would be 4, 5, or 6.
So far, I know I will have to give an option of finding the lowest or highest, so I would ask the user to put in 0 to minimize and 1 to maximize. Now, I have thought of using an if statement for reading their input, but I need some kind of loop that will rearrange the 4's, 5's, or 6's. I thought of attaching the values of 4, 5, and 6 to the 90, 80, 70, or 10, 20, 30, but am unsure of how I would code a proper loop or simple if statement to find the best answer by trying each combination. In theory, I could make some really over-extensive amount of code to do it right, but it wouldn't follow curriculum.
The code I have so far is
public class Powers
{
public static void main(String[] args);
int input;
int numOneTensLow = 10;
int numTwoTensLow = 20;
int numThreeTensLow = 30;
int numOneOnesLow = 4;
int numTwoOnesLow = 5;
int numThreeOnesLow = 6;
int numOneTensHigh = 90;
int numTwoTensHigh = 80;
int numThreeTensHigh = 70;
int numOneOnesHigh = 6;
int numTwoOnesHigh = 5;
int numThreeOnesHigh = 4;
int numOneLow;
int numTwoLow;
int numThreeLow;
int numOneHigh;
int numTwoHigh;
int numThreeHigh;
int lowproduct = (numOneLow * numTwoLow * numThreeLow);
int highprodcut = (numOneHigh * numTwoHigh * numThreeHigh);
ConsoleIO console = new ConsoleIO();
System.out.println("This program will calculate three two-digit" +
" numbers that create the lowest and highest possible products " +
"using the numbers 1 through 9 once in each.");
System.out.println("To calculate the highest input 1, to calculate" +
" the lowest, input 0: ");
input = console.readInt();
if(int input = 0);
{
do
{
numOneTensLow + NumOneOnesLow;
numTwoTensLow + NumTwoOnesLow;
numThreeTensLow + NumThreeOnesLow;
System.out.println((numOneTensLow + numOneOnesLow) * (NumTwoTensLow + NumTwoOnesLow)
* (NumThreeTensLow + NumThreeOnesLow));
}
}
