## DMOPC '19 Contest 4 P0 - Yikes

View as PDF

Points: 3 (partial)
Time limit: 2.0s
Memory limit: 64M

Author:
Problem type

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.

#### Input Specification

The first line of input will be string ().

The next line of input will be string ().

#### Output Specification

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.

#### Sample Input

abc
abd

#### Sample Output

LARRY IS SAVED!

• commented on Feb. 15, 2020, 4:35 p.m.

why is test case 21 not working :(

• commented on March 21, 2020, 4:25 p.m.

Given string A, determine if it is possible to make string B by changing exactly one character of string A to a different character.

Changing exactly one character, no more, no less.

• commented on Jan. 9, 2020, 12:18 a.m.

This comment is hidden due to too much negative feedback. Show it anyway.

• commented on Jan. 11, 2020, 2:42 p.m.

look up