forked from keshavnandan/Topcoder
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDecipherabilityEasy.html
More file actions
9 lines (8 loc) · 5.27 KB
/
DecipherabilityEasy.html
File metadata and controls
9 lines (8 loc) · 5.27 KB
1
2
3
4
5
6
7
8
9
<html><body bgcolor="#000000" text="#ffffff"><table><tr><td colspan="2"><h3>Problem Statement</h3></td></tr><tr><td>    </td><td>You had a non-empty string <b>s</b> but you lost it.
Cat Snuke found the string and removed one character from the string.
Later, Snuke gave you the string <b>t</b>.
Can this be the string created from your string <b>s</b>?<br></br><br></br>
You are given the strings <b>s</b> and <b>t</b>.
Return "Possible" (quotes for clarity) if <b>t</b> can be obtained from <b>s</b> by erasing exactly one character.
Otherwise, return "Impossible".
Note that the return value is case-sensitive.</td></tr><tr><td colspan="2"><h3>Definition</h3></td></tr><tr><td>    </td><td><table><tr><td>Class:</td><td>DecipherabilityEasy</td></tr><tr><td>Method:</td><td>check</td></tr><tr><td>Parameters:</td><td>string, string</td></tr><tr><td>Returns:</td><td>string</td></tr><tr><td>Method signature:</td><td>string check(string s, string t)</td></tr><tr><td colspan="2">(be sure your method is public)</td></tr></table></td></tr><tr><td colspan="2"><h3>Limits</h3></td></tr><tr><td>    </td><td><table><tr><td>Time limit (s):</td><td>2.000</td></tr><tr><td>Memory limit (MB):</td><td>256</td></tr><tr><td>Stack limit (MB):</td><td>256</td></tr></table></td></tr><tr><td colspan="2"><h3>Constraints</h3></td></tr><tr><td align="center" valign="top">-</td><td>The number of characters in <b>s</b> will be between 1 and 50, inclusive.</td></tr><tr><td align="center" valign="top">-</td><td>Every character in <b>s</b> will be a lowercase letter ('a'-'z').</td></tr><tr><td align="center" valign="top">-</td><td>The number of characters in <b>t</b> will be between 1 and 50, inclusive.</td></tr><tr><td align="center" valign="top">-</td><td>Every character in <b>t</b> will be a lowercase letter ('a'-'z').</td></tr><tr><td colspan="2"><h3>Examples</h3></td></tr><tr><td align="center" nowrap="true">0)</td><td></td></tr><tr><td>    </td><td><table><tr><td><table><tr><td><pre>"sunuke"</pre></td></tr><tr><td><pre>"snuke"</pre></td></tr></table></td></tr><tr><td><pre>Returns: "Possible"</pre></td></tr><tr><td><table><tr><td colspan="2">If Cat Snuke erase the first 'u' from <b>s</b>, it will equal to <b>t</b>.</td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">1)</td><td></td></tr><tr><td>    </td><td><table><tr><td><table><tr><td><pre>"snuke"</pre></td></tr><tr><td><pre>"skue"</pre></td></tr></table></td></tr><tr><td><pre>Returns: "Impossible"</pre></td></tr><tr><td><table><tr><td colspan="2">Swapping characters is not allowed.</td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">2)</td><td></td></tr><tr><td>    </td><td><table><tr><td><table><tr><td><pre>"snuke"</pre></td></tr><tr><td><pre>"snuke"</pre></td></tr></table></td></tr><tr><td><pre>Returns: "Impossible"</pre></td></tr><tr><td><table><tr><td colspan="2">Erasing nothing is not allowed.</td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">3)</td><td></td></tr><tr><td>    </td><td><table><tr><td><table><tr><td><pre>"snukent"</pre></td></tr><tr><td><pre>"snuke"</pre></td></tr></table></td></tr><tr><td><pre>Returns: "Impossible"</pre></td></tr><tr><td><table><tr><td colspan="2">Cat Snuke can erase exactly one character.</td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">4)</td><td></td></tr><tr><td>    </td><td><table><tr><td><table><tr><td><pre>"aaaaa"</pre></td></tr><tr><td><pre>"aaaa"</pre></td></tr></table></td></tr><tr><td><pre>Returns: "Possible"</pre></td></tr><tr><td><table><tr><td colspan="2"></td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">5)</td><td></td></tr><tr><td>    </td><td><table><tr><td><table><tr><td><pre>"aaaaa"</pre></td></tr><tr><td><pre>"aaa"</pre></td></tr></table></td></tr><tr><td><pre>Returns: "Impossible"</pre></td></tr><tr><td><table><tr><td colspan="2"></td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">6)</td><td></td></tr><tr><td>    </td><td><table><tr><td><table><tr><td><pre>"topcoder"</pre></td></tr><tr><td><pre>"tpcoder"</pre></td></tr></table></td></tr><tr><td><pre>Returns: "Possible"</pre></td></tr><tr><td><table><tr><td colspan="2"></td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">7)</td><td></td></tr><tr><td>    </td><td><table><tr><td><table><tr><td><pre>"singleroundmatch"</pre></td></tr><tr><td><pre>"singeroundmatc"</pre></td></tr></table></td></tr><tr><td><pre>Returns: "Impossible"</pre></td></tr><tr><td><table><tr><td colspan="2"></td></tr></table></td></tr></table></td></tr></table><p>This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved. </p></body></html>