Points: 3 (partial)
Time limit: 2.0s
Memory limit: 64M
Larry is having trouble making a problem for the DMOPC, and
[REDACTED] is threatening to savage him, so he decides that he will make a nice string manipulation problem.
Given string , determine if it is possible to make string by changing exactly one character of string to a different character. Both strings are of the same length, and will only consist of alphanumeric characters.
The first line of input will be string ().
The next line of input will be string ().
LARRY IS SAVED! if it is possible to make string from string , given the restrictions.
LARRY IS DEAD! if it is not possible, given the restrictions.
LARRY IS SAVED!
why is test case 21 not working :(
Changing exactly one character, no more, no less.
This comment is hidden due to too much negative feedback. Show it anyway.