Python Lab: While still in school, Sam had the ability to solve problems. Now one of his friends' circles wants to check his problem-solving ability so he gave him a problem. Since the Sam does not have time to practice problem solving that is why he fails to solve the question, and he is a great friend of the Sam so ask him to solve the question. I.e.: you are given a list of items N A1, A2... An and you must create a new number by adding no digits to each item in the list. If the number is in front then print "Yes" otherwise print "No". Input 1 3 9 12 111 Output: No

The Game of Nim: The game of Nim starts with a random number of stones between 15 and 30.  Two players alternate turns and on each turn may take either 1, 2, or 3 stones from the pile.  The player forced to take the last stone loses.  The computer player will make random choices during their turn.  Your program must check to make sure that neither the computer nor the human player attempts to take 3 if there are only 1 or 2 stones left.  The computer should only take 1 or 2 stones when 3 are left, and only 1 stone when 2 stones are left.   Make sure you are using functions, importing random, and making it at around grade 10 coding levels, haha!

Problem Description The hailstone sequence is defined as the integer sequence that results from manipulating a positive integer value n as follows: If n is even, divide it by 2 (using floor division) • If n is odd, multiply it by 3 and then add 1 Repeat this process until you reach 1. For example, starting with n = 5, we get the sequence 5, 16, 8, 4, 2, 1. If n is 6, we get the sequence 6, 3, 10, 5, 16, 8, 4, 2, 1. If n is 7, we get 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. If n is 8, we get the sequence 8, 4, 2, 1. As far as anyone can tell, this process will eventually reach 1 for any starting value, although mathematicians have been unable to formally prove this property as of yet. a. Write a Python function named hail () that takes a single integer argument. hail() should print out the sequence of numbers generated by applying the process above to the function parameter. This function does not return any value.

Knight's Tour: The Knight's Tour is a mathematical problem involving a knight on a chessboard. The knight is placed on the empty board and, moving according to the rules of chess, must visit each square exactly once. There are several billion solutions to the problem, of which about 122,000,000 have the knight finishing on the same square on which it begins. When this occurs the tour is said to be closed. Your assignment is to write a program that gives a solution to the Knight's Tour problem recursively. You must hand in a solution in C++ AND Java. The name of the C++ file should be "main.cc" and the name of the Java file should be "Main.java". Write C++ only with a file name of main.cc Please run in IDE and check to ensure that there are no errors occuring Output should look similar to: 1 34 3 18 49 32 13 16 4 19 56 33 14 17 50 31 57 2 35 48 55 52 15 12 20 5 60 53 36 47 30 51 41 58 37 46 61 54 11 26 6 21 42 59 38 27 64 29 43 40 23 8 45 62 25 10 22 7 44 39 24 9 28 63