in need :')
A king sends out two scrolls to the common public with the encryted message in it. the hidden message is the no of days the king is going to declare a war in.
u have to interpret the encryption technique from the example4s given below and find the no of days. write a program which inputs the two messages and gives the no of days as output.
Scroll 1 : AMAZAPPLE
Scroll 2 : APPLIECATION
Hidden message : 5
Scroll 1 : APPLEPIE
Scroll 2 :LEPIECT
Hidden message : 5
It is the no of words common in a stretch
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
@wio please help
..............yeah I'm retard...I can't help ya here :/ Sorry
Not the answer you are looking for? Search for more explanations.
No. of words common in a stretch means the longest common string.
"EXAMple" and " EXAMination" has a common string of length four.
They don't have to start at the beginning.
"reSTRIct" and "STRIke" have again a common string of length four.
These are easier to look for by inspection because of the short length.
You need an algorithm to look for common strings of lengths in the hundreds, for example binary strings.
Does that answer the question?
please help me with program
Do you have an algorithm? If you have, please post the algorithm before working on the program.
Have you done trees?... and dynamic programming?
please tell me the logic to compare the strings
First thing first, do you understand the problem?
Good, if you have done trees and dynamic programming, you can start by taking a look at the algorithm suggest in the following link: