Code this Programming Task 1: Happy NumberA happy number is a number defined by the following process:Starting with any positive integer, replace the number with the sum of the squares of itsdigits.Repeat the process until the number equals I (where it will stay), or it loops endlessly in acycle which does not include 1.Those numbers for which this process ends in 1 are happy.Example:13 is a happy number.Input: number 131²132-19-101² +0²-111 is an unhappy number.Input: number -111²+1²-1+1-22²-44² = 1612+6²-1+36-3732+72 9+49-585²1 82 25 1 64-898² +92-64 +81 - 1451² +4² +5²-1-16-25-424² +2216+4-2022 +0²=4+0=4 (Endless Loop)JavaWrite a program in Java that prints IIappy, if the input number is happy otherwise printunhappy.Input: 7Output: happyInput: 26Output: UnhappyHappy Numbers: 1, 7, 13, 28, 32 etc.Unhappy Numbers: 4, 9, 11, 26, 38 etc.Note: You are not allowed to use sets or hashset as we have not covered that in our syllabus.

1)THE CODE // import libraries import java.util.*; // class main public class Main { // main…

Programming Task 1: Happy Number A happy number is a number defined by the following process: Starting with any positive integer, replace the number with the sum of the squares of its digits. Repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy. Example: 13 is a happy number. Input: number 13 12132-19-10 1²+0²-1 11 is an unhappy number. Input: number -11 1²+1²-11-2 2²-4 4² = 16 12+6²-1+36-37 32+72 9+49-58 5²1 82 25 1 64-89 82 +92-64 +81-145 1² +42 +5²-1-16-25-42 4²22-16+4-20 22 +0²=4+0-4 (Endless Loop) Write a program in Java that prints Happy, if the input number is happy otherwise print unhappy. . Input: 7 Output: happy Java • Input: 26 Output: Unhappy Happy Numbers: 1, 7, 13, 28, 32 etc. Unhappy Numbers: 4, 9, 11, 26, 38 etc. Note: You are not allowed to use sets or hashset as we have not covered that in our syllabus.

Programming Task 1: Happy Number A happy number is a number defined by the following process: Starting with any positive integer, replace the number with the sum of the squares of its digits. Repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy. Example: 13 is a happy number. Input: number 13 12132-19-10 1²+0²-1 11 is an unhappy number. Input: number -11 1²+1²-11-2 2²-4 4² = 16 12+6²-1+36-37 32+72 9+49-58 5²1 82 25 1 64-89 82 +92-64 +81-145 1² +42 +5²-1-16-25-42 4²22-16+4-20 22 +0²=4+0-4 (Endless Loop) Write a program in Java that prints Happy, if the input number is happy otherwise print unhappy. . Input: 7 Output: happy Java • Input: 26 Output: Unhappy Happy Numbers: 1, 7, 13, 28, 32 etc. Unhappy Numbers: 4, 9, 11, 26, 38 etc. Note: You are not allowed to use sets or hashset as we have not covered that in our syllabus.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 15PE

See similar textbooks

Similar questions

C++ : Write a program that, given the time duration of a task in the number of hours,minutes, and seconds, calculates the duration in seconds.
Q1. a) The Little Man Computer (LMC) is an instructional model of a computer used to teach students all of the basic features of a modern computer in a simplified way. The following Little Man program is supposed to add two input numbers and output the result, i.e., OUT = IN1 + IN2 Mailbox Mnemonic code Numeric code 00 IN 901 01 STO 99 399 02 IN 901 03 ADD 99 199 04 OUT 902 05 COB 000 i) Change the program above to add the numbers 157 and 13. (Hint: these numbers are constants and therefore can pre-exist into memory before the execution of the program). No need to write both mnemonics and numeric codes (opcodes), either one is fine. Please refer to the instruction set provided for all the LMC instruction mnemonics and opcodes.
Python Coding AlgorithmPlease check the task description. Use the test case input as a test case to see if the final code works, as the code's output should be similar to the given sample output. Hopefully, you succeed. TaskIdentify the relationship between the sets of inputs. The inputs represent the wires in a Bulb's Wiring System. Concept-The Bulb system is identical to an electronic circuit, so Basic Circuit Rules and Ohm's Law apply.-Wires in a Series relationship are denoted as Linear, and those in Parallel are denoted as SidebySide-Therefore, the relationships are either Linear or SidebySide. If pairs of wires are neither Linear nor SidebySide, it will be denoted as having Neither relationship.-Wires with similar origins and destinations have a SidebySide relationship. On the other hand, Linear relationships are more complex as they require a continuous and singular wire connection. The flow of electricity starts from the "Start" point and ends at the "End" point.Note: Check…
n an ancient land, the beautiful princess Eve (or handsome prince Val) had many suitors. Being royalty, it was decided that a special process must be used to determine which suitor would win the hand of the prince/princess. First, all of the suitors would be lined up one after the other and assigned numbers. The first suitor would be number 1, the second number 2, and so on up to the last suitor, number n. Starting at 4 the suitor in the first position, she/he would then count three suitors down the line (because of the three letters in his/her name) and that suitor would be eliminated and removed from the line. The prince/princess would then continue, counting three more suitors, and eliminate every third suitor. When the end of the line is reached, counting would continue from the beginning. For example, if there were 6 suitors, the elimination process would proceed as follows: 123456 initial list of suitors, starting count from 1 12456 suitor 3 eliminated,…
: An ant is sitting on an infinite grid of white and black squares. It initially faces right.At each step, it does the following:(1) At a white square, flip the color of the square, turn 90 degrees right (clockwise), and move forwardone unit.(2) At a black square, flip the color of the square, turn 90 degrees left (counter-clockwise), and moveforward one unit.Write a program to simulate the first K moves that the ant makes and print the final board as a grid.Note that you are not provided with the data structure to represent the grid. This is something youmust design yourself. The only input to your method is K. You should print the final grid and returnnothing. The method signature might be something like void printKMoves ( int K)
Create a program that takes in a student’s full names and marks for 3 In-class exercises, then calculate the average of this marks. This average mark is then categorized as follows: Marks obtained Grade Level Message 80 – 100 1 Magnificent!! 70 – 79 2 Excellent!! 60 – 69 3 Good work!! 50 – 59 4 Good!! 0 – 49 0 Fail – Try again next Year!! Greater than 100 or less than 0 X Invalid Marks!!, Marks too high. Or Invalid Marks!!, Negative marks not allowed. Sample run 1: Enter student full names: Goodluck Johnathan Enter 3 marks separated by spaces: 78 94.6 88 Output: Student name: Goodluck Johnathan Grade Level: 1 Comment: Magnificent!! Sample run 2: Enter student full names: Ellen Johnson Sirleaf Enter 3 marks separated by spaces: 200 104.87 99.9…
Write a detailed algorithm for making a peanut butter and jelly sandwich(or some other everyday activity). You should assume that you are talkingto someone who is conceptually able to do the task, but has never actuallydone it before. For example, you might be telling a young child.
A circus is designing a tower routine consisting of people standing atop one another'sshoulders. For practical and aesthetic reasons, each person must be both shorter and lighter thanthe person below him or her. Given the heights and weights of each person in the circus, write amethod to compute the largest possible number of people in such a tower.
An endless grid of white and black squares is occupied by an ant. It faces right at first. It acts as follows at each step:(1) Move one unit forward, change the colour of a white square, and turn it 90 degrees to the right (clockwise).(2) To change a black square's colour, turn 90 degrees to the left (counterclockwise), then go one unit.Write a program to simulate the first K moves that the ant makes and print the final board as a grid. Note that you are not provided with the data structure to represent the grid. This is something you must design yourself. The only input to your method is K. You should print the final grid and return nothing. The method signature might be something like void printKMoves ( int K).
VB Small Project 11 – Phone Number Translator Many companies use telephone numbers like 555-GET-FOOD so the number if easier to remember. On a standard telephone, the alphabetic letters are mapped to numbers in the following manner: A, B, C = 2 D, E, F = 3 G, H, I = 4 J, K, L = 5 M, N, O = 6 P, Q, R, S = 7 T, U, V = 8 W, X, Y, Z = 9 Write a program that asks the user to enter a 10-character telephone number in the format of XXX-XXX-XXXX. The program should display the number with any alphabetic characters translated into the number equivalent. For example, if the user enters 555-GET-FOOD, the result should be 555-438-3663.
in python “c” represents a crop and “w” represents a water source. Each water source hydrates the eight tiles around it (including itself) Input the number of rows and columns in the crop field:ROWS> 4COLUMNS> 4Input each row of the crop field.ROW0> c c c wROW1> w c c cROW2> c c c cROW3> c w c cNot all crops are watered!OUTPUT FalseThe following crops are not watered:OUTPUT [(2, 3), (3, 3)] Input the number of rows and columns in the crop field:ROWS> 7COLUMNS> 1Input each row of the crop field.ROW0> cROW1> wROW2> cROW3> cROW4> wROW5> cROW6> wAll crops are watered!OUTPUT True
Please do this in Python Programming Scenario As you probably know, Sudoku is a number-placing puzzle played on a 9x9 board. The player has to fill the board in a very specific way: each row of the board must contain all digits from 0 to 9 (the order doesn't matter) each column of the board must contain all digits from 0 to 9 (again, the order doesn't matter) each of the nine 3x3 "tiles" (we will name them "sub-squares") of the table must contain all digits from 0 to 9. If you need more details, you can find them here. Your task is to write a program which: reads 9 rows of the Sudoku, each containing 9 digits (check carefully if the data entered are valid) outputs Yes if the Sudoku is valid, and No otherwise. Test your code using the data we've provided. Test data Sample input: 295743861 431865927 876192543 387459216 612387495 549216738 763524189 928671354 154938672 Sample output: Yes Sample input: 195743862 431865927 876192543 387459216 612387495 549216738 763524189 928671354…