(b) In a crypto-arithmetic puzzle, a mathematical equation is written using letters. Each letter can be a digit from 0 to 9 but no two Ictters can be the same. This is an example of such a puzzle; SEND + MORE = MONEY A solution to this puzzle is D=7, E=5, M-1, N=6, 0=0, R=8, S=9, and Y=-2. Write a program to read a crypto-arithmetic puzzle and print a solution to it. For simplicity, assume the puzzle is in the form x + y = z, where x and y are each no longer than 8 letters. Hint: read the input terms of the puzzle into character arrays and use a nested loop for each unique letter in the puzzle.

(b) In a crypto-arithmetic puzzle, a mathematical equation is written using letters. Each letter can be a digit from 0 to 9 but no two Ictters can be the same. This is an example of such a puzzle; SEND + MORE = MONEY A solution to this puzzle is D=7, E=5, M-1, N=6, 0=0, R=8, S=9, and Y=-2. Write a program to read a crypto-arithmetic puzzle and print a solution to it. For simplicity, assume the puzzle is in the form x + y = z, where x and y are each no longer than 8 letters. Hint: read the input terms of the puzzle into character arrays and use a nested loop for each unique letter in the puzzle.

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 14PE

See similar textbooks

Similar questions

In python, Problem Description:Sheldon and Leonard are physicists who are fixated on the BIG BANG theory. In order to exchange secret insights they have devised a code that encodes UPPERCASE words by shifting their letters forward. Shifting a letter by S positions means to go forward S letters in the alphabet. For example, shifting B by S = 3 positions gives E. However, sometimes this makes us go past Z, the last letter of the alphabet. Whenever this happens we wrap around, treating A as the letter that follows Z. For example, shifting Z by S = 2 positions gives B. Sheldon and Leonard’s code depends on a parameter K and also varies depending on the position of each letter in the word. For the letter at position P, they use the shift value of S = 3P + K. For example, here is how ZOOM is encoded when K = 3. The first letter Z has a shift valueof S = 3 × 1 + 3 = 6; it wraps around and becomes the letter F. The second letter, O, hasS = 3 × 2 + 3 = 9 and becomes X. The last two letters…
Write a program that calculates the equivalent resistance of a circuit. n electrical resistors with resistance values R1, R2,.., Rn are said to be connected in parallel if the same voltage is applied across each. Their equivalent resistance Reg is related to the values R1, R2, ..., Rn by: 1 1 1 1 + +...+ R R R, R. "eq Write a program that prompts the user to enter the resistance of n resistors. The user should be prompted continuously by using a while loop until a zero or negative value is entered (the program should count the number of resistors n entered by the user and store the values in an array). Use another separate loop to print the resistance values entered by the user and the equivalent resistance Reg. Test your program with R1= 1 kn, R2= 2 kn, R3= 4 kQ and R4= 8 kQ.
Write in Java: Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. You will need to write a second function to reverse the string. Ex: If the input is: 6 the output is: 110 Your program must define and call the following two methods. The method integerToReverseBinary() should return a string of 1's and 0's representing the integer in binary (in reverse). The method reverseString() should return a string representing the input string in reverse. public static String integerToReverseBinary(int integerValue)public static String reverseString(String inputString) LabProgram.java: import java.util.Scanner; public class LabProgram {/* Define your method here */ public static void main(String[] args) {/* Type your code…
Computer Science Write a Java program that reads a line and a line segment and then determines whether they intersect or not. When they overlap completely, consider that as intersecting. Use variables ((lp1x, lp1y), (lp2x, lp2y)) to represent a line and ((sp1x, sp1y), (sp2x, sp2y)) to represent a line segment
Submit in python or c++. Error code will downvoted. Every cell (x,y) contains an integer ax,y signifying the course of how the ball will move. ax,y=1 — the ball will move to one side (the following cell is (x,y+1)); ax,y=2 — the ball will move to the base (the following cell is (x+1,y)); ax,y=3 — the ball will move to one side (the following cell is (x,y−1)). Each time a ball leaves a cell (x,y), the integer ax,y will change to 2. Mr. Chanek will drop k balls successively, each beginning from the primary line, and on the c1,c2,… ,ck-th (1≤ci≤m) sections. Decide in which segment each ball will wind up in (position of the ball in the wake of leaving the network). Input :The principal line contains three integers n, m, and k (1≤n,m≤1000, 1≤k≤105) — the size of the framework and the number of balls dropped by Mr. Chanek. The I-th of the following n lines contains m integers ai,1,ai,2,… ,ai,m (1≤ai,j≤3). It will fulfill ai,1≠3 and ai,m≠1. The following line contains k integers c1,c2,……
Description A mathmatician Goldbach's conjecture: any even number(larger than 2) can divide into two prime number’s sum.But some even numbers can divide into many pairs of two prime numbers’ sum. Example:10 =3+7, 10=5+5, 10 can divide into two pairs of two prime number. Input Input consist a positive even number n(4<=n<=32766). Output Print the value of how many pairs are this even number can be divided into. Sample Input 1 1234 Sample Output 1 25
Python only Rajesh loves lucky numbers. Everyone knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, the numbers 47,744, 4 are lucky and 5, 17,467 are not. Let Fa(x) equal the number of digits d in the decimal representation of the positive integer x. Chef is only interested in F4(x) and F7(x) functions. For a given positive integer N, he wants to know the total number of distinct pairs (L; R) such that F4(L) + F4(L + 1) + ... + F4(R) equals F7(L) + F7(L + 1) + ... + F7(R) and 1
Write a program that reads an integer between 0 and 1000 and multiplies all the digits in the integer. For example, if an integer is 932, the multiplication of all its digits is
Write a program in C to display the multiplication table for numbers 1-12 in a square table.• Create a number guessing game that sets a number and then allows the user to guess it. The number will be between 1 and 10.• To calculate a random number between 1-10 for the game use:guessAnswer = (rand() % 10) + 1; ( the output should be same as picture and please provide screenshot
write a program in python language: You are given a rectangular board of Mx N squares. Also you are given an unlimited number of standard domino pieces of 2 x1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions: 1. Each domino completely covers two squares. 2. No two dominoes overlap. 3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board. Find the maximum number of dominoes, which can be placed under these restrictions. ex: 24 4
java: Run length coding is a method to represent a string in a more compact manner. Each character that occurs more than 2 times in a row is represented by the character and a number following it. Two examples are: "abba" → "abba""abcccbbbba" → "abc3b4a"Write a function that calculates how many characters the encoded string is shorter than the original.
Exercise III: Catalan numbers For n e N, denote by c, to be the number of ways to form a "mountain range" with n upstrokes (U) and n downstrokes (D) that all stay above a horizontal line. For instance: for n = 1, only UD is allowed, so c = 1; • for n = 2, only UUDD and UDUD are allowed, so c2 = 2. 1. Check that c3 = 5 by writing down or drawing all possible options. 2. Consider the power series +00 g(x) = 2 n=0 (by definition co = 1) called the generating function of the sequence (en). Justify that cn < 4" for each n, and deduce that the radius of convergence of g is at least 1/4. 3. It can be show that for r E (-1/4, 1/4), g(x) = 1+ xg(r)? and therefore 1- VI 4.x g(x) = 2.x Use this formula and the known power series of V1+ x to write the first terms of the power series expansion of g, in the form g(x) = co + c1x + c2x2 + C3x + c4x* + ·.. Show how you obtain a few terms, but you do not need to show all computations and you can use a calculator for fractions. Check that you recover co,…