Valued Keys- Codeforce
来源:互联网 发布:mac 系统 修改用户名 编辑:程序博客网 时间:2024/06/05 13:28
You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.
The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.
For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".
You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.
The first line of input contains the string x.
The second line of input contains the string y.
Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.
If there is no string z such that f(x, z) = y, print -1.
Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.
abaa
ba
nzwzlniwel
xiyez
abba
-1
The first case is from the statement.
Another solution for the second case is "zizez"
There is no solution for the third case. That is, there is no z such that f("ab", z) = "ba".
思路:yi是xi,zi中小的一个,如果yi大于xi,输出-1,否则输出y就行了
Ac code:
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <vector>#include <queue>#include <stack>#include <string>#include <map>using namespace std;#define LL long long#define INF 0x3f3f3f3f#define fi first#define se second#define eps 1const int maxn=100000+5; int main() { char x[105],y[105]; while(~scanf("%s%s",x,y)) { int k=strlen(x); int flag=0; for(int i=0;i<k;i++) { if(x[i]<y[i]) { flag=1; break; } } if(flag) printf("-1\n"); else printf("%s\n",y); } return 0; }
- Valued Keys- Codeforce
- B. Valued Keys
- Codeforces801B Valued Keys
- Codeforces801B Valued Keys
- B. Valued Keys
- Codeforces 801B Valued Keys
- CodeForces 801B Valued Keys
- codeforces 801B Valued Keys
- 0519 G2n#W2B-D Valued Keys
- Codeforces Round #409 (Div. 2) B. Valued Keys
- CF#801 B. Valued Keys(字符串,贪心)
- Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2) B. Valued Keys
- CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-B-Valued Keys
- Keys
- keys
- keys
- keys
- Keys
- 为啥文件有写权限还是说只读
- [Machine Learning & Algorithm] 随机森林(Random Forest)
- MySQL数据库基本操作(DDL)
- 数据结构—哈夫曼树与哈夫曼编码
- 5555
- Valued Keys- Codeforce
- P-R曲线与mAP
- java Iterator迭代器分析
- Image style transfer
- RecyclerView实现广告轮播图(一)
- 双向循环链表的冒泡排序
- 求出1~13的整数中1出现的次数,并算出100~1300的整数中1出现的次数?并把问题更加普遍化,可以很快的求出任意非负整数区间中1出现的次数。
- 冒泡排序
- linux下遇到服务器的网络连接限制数为1024个的原因及修正