909A.md (1638B)
1 Source: https://codeforces.com/problemset/problem/909/A 2 3 A. Generate Login 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 The preferred way to generate user login in Polygon is to concatenate a prefix of the user's first name and a prefix of their last name, in that order. Each prefix must be non-empty, and any of the prefixes can be the full name. Typically there are multiple possible logins for each person. 22 23 You are given the first and the last name of a user. Return the alphabetically earliest login they can get (regardless of other potential Polygon users). 24 25 As a reminder, a prefix of a string *s* is its substring which occurs at the beginning of *s*: "a", "ab", "abc" etc. are prefixes of string "{abcdef}" but "b" and 'bc" are not. A string *a* is alphabetically earlier than a string *b*, if *a* is a prefix of *b*, or *a* and *b* coincide up to some position, and then *a* has a letter that is alphabetically earlier than the corresponding letter in *b*: "a" and "ab" are alphabetically earlier than "ac" but "b" and "ba" are alphabetically later than "ac". 26 27 Input 28 29 The input consists of a single line containing two space-separated strings: the first and the last names. Each character of each string is a lowercase English letter. The length of each string is between 1 and 10, inclusive. 30 31 Output 32 33 Output a single string — alphabetically earliest possible login formed from these names. The output should be given in lowercase as well. 34 35 Examples 36 37 Input 38 39 ``` 40 harry potter 41 ``` 42 43 Output 44 45 ``` 46 hap 47 ``` 48 49 Input 50 51 ``` 52 tom riddle 53 ``` 54 55 Output 56 57 ``` 58 tomr 59 ```