4357：String change

题目描述

In this problem you will receive two strings S₁ and S₂ that contain only lowercase letters.
Each time you can swap any two characters of S₁. After swap,both of the two letters will increase their value by one. If the previous letter is 'z',it will become 'a' after being swapped.
That is to say ,"a" becomes "b","b" becomes "c"....."z" becomes "a" and so on.
You can do the change operation in S₁ as many times as you want.
Please tell us whether you can change S₁ to S₂ after some operations or not.

输入解释

There are several cases.The first line of the input is a single integer T (T <= 41) which is the number of test cases.Then comes the T test cases .

For each case,the first line is S₁,the second line is S₂.S₁ has the same length as S₂ and the length of the string is between 2 and 60.

输出解释

For each case,output "Case #X: " first, X is the case number starting from 1.If it is possible change S₁ to S₂ output "YES",otherwise output "NO".

输入样例

3
ab
ba

bac
ddb

aaabb
cbccd

输出样例

Case #1: NO
Case #2: YES
Case #3: YES

提示

For the first case,it's impossible to change "ab" to "ba" .

For the second case,swap(S1[0],S1[2])->swap(S1[1],S1[2]),meanwhile:bac->dac->ddb.

For the third case,swap(S1[0],S1[3])->swap(S1[1],S1[2])->swap(S1[2],S1[3])->swap(S1[3],S1[4]),
meanwhile:aaabb->caabb->cbbbb->cbccb->cbccd.

来自杭电HDUOJ的附加信息

Author	miketc@UESTC_Goldfinger
Recommend	zhuyuanchen520

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 2012 Multi-University Training Contest 6

源链接： HDU-4357

最后修改于 2020-10-25T23:12:44+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
2000/1000MS(Java/Others)	65536/32768K(Java/Others)