Sample Testcase 0: Input: 7 8 Output: 40 52

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

C++  Chapter 7 - 1D Array - The 3n + 1 problem, please give me a new solution, not the same solution in the questions bank

8:09 P
I/O
Program Input:
• One number that indicates the starting
number of the sequence
• One number that specified the index
of the number to be printed from the
sequence
Program Output:
• One line that prints the sequence
number at the specified index
• One line that outputs the highest
number in the sequence.
Sample Testcase 0:
Input:
7
8
Output:
40
52
Sample Testcase 1:
Input:
7
19
Output:
ΝΑ
52
Sample Testcase 2:
Input:
-10
-5
Output:
2
16
1 #include <iostream>
2 #include <cmath>
3 using namespace std;
4
5 int main()
6 {
7
=
int
8
9
array[1000]
int start = 0;
int numAtIndex
cin>>start;
cin>>numAtIndex;
= 0;
10
11
12
13
// Your code start here
14
15
// Your code end here
16
17
return 0;
18
19 }
{};
Transcribed Image Text:8:09 P I/O Program Input: • One number that indicates the starting number of the sequence • One number that specified the index of the number to be printed from the sequence Program Output: • One line that prints the sequence number at the specified index • One line that outputs the highest number in the sequence. Sample Testcase 0: Input: 7 8 Output: 40 52 Sample Testcase 1: Input: 7 19 Output: ΝΑ 52 Sample Testcase 2: Input: -10 -5 Output: 2 16 1 #include <iostream> 2 #include <cmath> 3 using namespace std; 4 5 int main() 6 { 7 = int 8 9 array[1000] int start = 0; int numAtIndex cin>>start; cin>>numAtIndex; = 0; 10 11 12 13 // Your code start here 14 15 // Your code end here 16 17 return 0; 18 19 } {};
8:09 P
The 3n+ 1 problem is based on a famous
sequence in mathematics that follows a very
simple rule:
• If the number is even, the next number in
the sequence is its half,
• If the number is odd, the next number in
the sequence is three times the number
plus one.
In mathematical notation, the 3n + 1 problem
sequence is given as:
an
2
if an is even
an+1
{
3αn +1
if an is odd
It has been conjectured that for any positive
integer number, the sequence will always end in
4, 2, 1.
So, if the sequence starts with 7, the sequence is
7 22 11 34 17 52 26 13 40 20 10 5 168421
In this task, you are required to write a
program that takes as input two positive
inputs, one for the start of the sequence,
followed by an index. Your code must:
• Generate the above sequence inside a 1D
array. Your code must stop when it reaches
the last number (i.e., 1).
• Your code must print the sequence number
specified by the index. If the input index is
larger than the sequence length, then the
code outputs NA
• Your code must also find and print the
highest number the sequence reaches.
• You must check if the inputs are positive
numbers; otherwise, convert them to a
positive number.
• You must ensure if the start point is not a
zero or one; otherwise, print out "Invalid"
IMPORTANT NOTE
Do not add any cout statements
except for the final answers as
specified above.
• Do not add "Enter a number", "the
number of digits is" or any similar
prompts.
• Also note that the automatic grader is
case-sensitive; so "na" is wrong but
"NA" is correct.
• Do not add any unnecessary spaces
inside the strings of cout statements "
" unless we ask you to.
• You may add any libraries needed.
I/O
Program Input:
=
Transcribed Image Text:8:09 P The 3n+ 1 problem is based on a famous sequence in mathematics that follows a very simple rule: • If the number is even, the next number in the sequence is its half, • If the number is odd, the next number in the sequence is three times the number plus one. In mathematical notation, the 3n + 1 problem sequence is given as: an 2 if an is even an+1 { 3αn +1 if an is odd It has been conjectured that for any positive integer number, the sequence will always end in 4, 2, 1. So, if the sequence starts with 7, the sequence is 7 22 11 34 17 52 26 13 40 20 10 5 168421 In this task, you are required to write a program that takes as input two positive inputs, one for the start of the sequence, followed by an index. Your code must: • Generate the above sequence inside a 1D array. Your code must stop when it reaches the last number (i.e., 1). • Your code must print the sequence number specified by the index. If the input index is larger than the sequence length, then the code outputs NA • Your code must also find and print the highest number the sequence reaches. • You must check if the inputs are positive numbers; otherwise, convert them to a positive number. • You must ensure if the start point is not a zero or one; otherwise, print out "Invalid" IMPORTANT NOTE Do not add any cout statements except for the final answers as specified above. • Do not add "Enter a number", "the number of digits is" or any similar prompts. • Also note that the automatic grader is case-sensitive; so "na" is wrong but "NA" is correct. • Do not add any unnecessary spaces inside the strings of cout statements " " unless we ask you to. • You may add any libraries needed. I/O Program Input: =
Expert Solution
steps

Step by step

Solved in 5 steps with 4 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY