Write a program to check whether the message received at the destination is error-free. For simplicity, assume that the secret code representing the message is a sequence of digits (0 to 9) and the maximum length of the message is 250 digits. Also, the first number in the message is the length of the message. For example, if the secret code is: 7 9 2 7 8 3 5 6 then the actual message is 7 digits long, and it is transmitted twice. The above message is transmitted as: 7 9 2 7 8 3 5 6 7 9 2 7 8 3 5 6 Input A file containing the secret code and its copy Output The secret code, its copy, and a message—if the received code is error-free—in the following form: Code Digit Code Digit Copy 9 9 2 2 7 7 8 8 3 3 5 5 6 6 Message transmitted OK.
Response Required: Write a program to check whether the message received at the destination is error-free. For simplicity, assume that the secret code representing the message is a sequence of digits (0 to 9) and the maximum length of the message is 250 digits. Also, the first number in the message is the length of the message. For example, if the secret code is: 7 9 2 7 8 3 5 6 then the actual message is 7 digits long, and it is transmitted twice. The above message is transmitted as: 7 9 2 7 8 3 5 6 7 9 2 7 8 3 5 6 Input A file containing the secret code and its copy Output The secret code, its copy, and a message—if the received code is error-free—in the following form: Code Digit Code Digit Copy 9 9 2 2 7 7 8 8 3 3 5 5 6 6 Message transmitted OK. Note: Compile the code on any software and capture the secreenshot and the language is C++.
Step by step
Solved in 3 steps with 8 images