I wanto to get rid of the whitespace, but how do i do it? Currently, it is Hailstone sequences for 1 to 6 : but I want to make it into Hailstone sequences for 1 to 6:

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 11PE: The program in the Programming Example: Fibonacci Number does not check whether the first number...
icon
Related questions
Question

I wanto to get rid of the whitespace, but how do i do it? Currently, it is Hailstone sequences for 1 to 6 : but I want to make it into Hailstone sequences for 1 to 6:

6 # taking input from the user
7 N = eval(input("N: "))
8 # if the input is non-positive then print the following and exit the program
9 if N <= 0:
10
print("N must be positive!")
11 # if the input in positive
12 else:
print("Hailstone sequences for 1 to",N,':')
# longest variable to store maximum number of hailstone number present
13
14
15
longest = 0
16
# longestN variable to store the index which has maximum number
longestN = O
# initializing the loop variable
i = 1
17
18
19
while i <= N:
# initializing the inner loop variable
j = i
print(j, end="")
20
21
22
23
24
# count variable to count the number of hailstone present and compare it to the lon
25
count = 1
26
while True:
# if j = 1 the break the loop
if(j == 1) :
print()
27
28
29
30
break
/home/hailstones.py Spaces: 4 (Auto)
Terminal
[user@sahara ~]$ python3 hailstones.py
N: 6
Hailstone sequences for 1 to 6 :
1
2, 1
3, 10, 5, 16, 8, 4, 2, 1
4, 2, 1
5, 16, 8, 4, 2, 1
6, 3, 10, 5, 16, 8, 4, 2, 1
First longest sequence found in n = 6
[user@sahara ~]$ ]
Transcribed Image Text:6 # taking input from the user 7 N = eval(input("N: ")) 8 # if the input is non-positive then print the following and exit the program 9 if N <= 0: 10 print("N must be positive!") 11 # if the input in positive 12 else: print("Hailstone sequences for 1 to",N,':') # longest variable to store maximum number of hailstone number present 13 14 15 longest = 0 16 # longestN variable to store the index which has maximum number longestN = O # initializing the loop variable i = 1 17 18 19 while i <= N: # initializing the inner loop variable j = i print(j, end="") 20 21 22 23 24 # count variable to count the number of hailstone present and compare it to the lon 25 count = 1 26 while True: # if j = 1 the break the loop if(j == 1) : print() 27 28 29 30 break /home/hailstones.py Spaces: 4 (Auto) Terminal [user@sahara ~]$ python3 hailstones.py N: 6 Hailstone sequences for 1 to 6 : 1 2, 1 3, 10, 5, 16, 8, 4, 2, 1 4, 2, 1 5, 16, 8, 4, 2, 1 6, 3, 10, 5, 16, 8, 4, 2, 1 First longest sequence found in n = 6 [user@sahara ~]$ ]
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Hash Table
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
Microsoft Visual C#
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage