Read two lists of integers. Compare the lists using the AND, OR, XOR and NOR operations.
Your application should prompt and read a maximum of 10 digits. The digits will be in the range of 0 to 9. The user will enter a -1 to end the list if less than 10 numbers are entered. Separate each number entered by a space. Once the first list is entered, repeat the process for a second list of integers. The second list can be the same length, longer or shorter than the first list. Each list can have any combination of the numbers 0 through 9. Each list must have at least one number.
Once both lists are entered, apply each of the follow operations to the lists:
Sample Input 1:
8 3 7 1 -1
1 2 3 4 5 6 7 8 9 0 -1
A OR B = 0 1 2 3 4 5 6 7 8 9
A NOR B =
A AND B = 1 3 7 8
A XOR B = 0 2 4 5 6 9
Sample Input 2:
3 2 8 -1
A OR B = 0 2 3 8
A NOR B = 1 4 5 6 7 9
A AND B =
A XOR B = 0 2 3 8
Read a single word and print the word as a rectangle. The word will be a maximum of 40 characters long and a minimum of two characters long.
The format of the rectangle will be:
Your application should accept a single word input from the keyboard. The word will be a maximum of 40 characters long and a minimum of two characters long. Print the word in the format described below. Stop the application after printing the word rectangle.
Sample Input 1:
Sample Output 1:
Sample Input 2:
Sample Output 2:
Find all numbers that, when multiplied by 365, produce an eight-digit product where the first four digits of that product are equal to the last four digits of that product. For example, 271123 x 365 produces an eight-digit product (98959895) whose first four digits (9895) are equal to its last four digits (9895).
There is no input for this problem.
The output will be a list of the first 10 integers that, when multiplied by 365, create an eight-digit product where the first four digits of that product are equal to the last four digits of that product. Also, print the product of the number and 365. Submit a second version of your application that prints all of the numbers (not just the first 10) so the judges can see the last 10 numbers generated.
Output for a single random combination is listed below.
Number Number * 365
Create an application that converts Arabic base 10 numbers into Roman numerals.
Your application should accept a single integer value input from the keyboard. This number will be in the range from 0 to 2000. Convert the number entered to its Roman numeral equivalent if the numbered entered is greater than zero. After converting to and displaying the Roman numeral, prompt the user to enter another number. Repeat these steps as long as the user enters an integer greater than zero.
End the application when the user enters a zero for the number to convert.
The highest number you must convert is 2000.
Your output will be the Roman numeral equivalent to the Arabic number entered. Each Roman numeral "letter" should be displayed in upper case. Below are the Roman numeral symbols you will use and some conversion rules.
Your application must provide the following results for the given input. Your output must be formatted as indicated in the Output column below.