Codeforces Round #455 (Div. 2) A. Generate Login

最新推荐文章于 2022-08-21 01:05:54 发布

sdau20163940

最新推荐文章于 2022-08-21 01:05:54 发布

阅读量859

点赞数 1

分类专栏： 2017年周训练赛文章标签： ACM cf string

本文链接：https://blog.csdn.net/sinat_37668729/article/details/78919357

版权

2017年周训练赛专栏收录该内容

73 篇文章 0 订阅

订阅专栏

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.

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).

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".

Input

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.

Output

Output a single string — alphabetically earliest possible login formed from these names. The output should be given in lowercase as well.

        Examples 
      
          input 
        
harry potter

          output 
        
hap

          input 
        
tom riddle

          output 
        
tomr

题意：

读题能力是真的差啊。。。愣是读了半小时没有读懂。题意就是求两个字符串的缩写，具体规则就是两个字符串，每个字符串的缩写可以是0-字符串的长度的任意长，然后合并起来，求字母顺序最小的那个

思路：

两层for循环，运用string中的 substr函数解决即可

代码：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define ll long long
#define maxn 10001
using namespace std;
string s,ss;
int k[26];
int a[26];
int main(){
    cin>>s>>ss;
    int x=s.length();
    int y=ss.length();
    string s1="zzzzzzzzzzzz";
    string s2;
    for(int i=0;i<x;i++){
        for(int j=0;j<y;j++){
            s2 =s.substr(0,i+1)+ss.substr(0,j+1);
            s1 = min(s1,s2);
        }
    }
    cout<<s1<<endl;
    return 0;
}