Three Strings CodeForces

You are given three strings aa, bb and cc of the same length nn. The strings consist of lowercase English letters only. The ii-th letter of aa is aiai, the ii-th letter of bb is bibi, the ii-th letter of cc is cici.

For every ii (1≤i≤n1≤i≤n) you must swap (i.e. exchange) cici with either aiai or bibi. So in total you’ll perform exactly nn swap operations, each of them either ci↔aici↔ai or ci↔bici↔bi (ii iterates over all integers between 11 and nn, inclusive).

For example, if aa is “code”, bb is “true”, and cc is “help”, you can make cc equal to “crue” taking the 11-st and the 44-th letters from aa and the others from bb. In this way aa becomes “hodp” and bb becomes “tele”.

Is it possible that after these swaps the string aa becomes exactly the same as the string bb?

Input
The input consists of multiple test cases. The first line contains a single integer tt (1≤t≤1001≤t≤100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a string of lowercase English letters aa.

The second line of each test case contains a string of lowercase English letters bb.

The third line of each test case contains a string of lowercase English letters cc.

It is guaranteed that in each test case these three strings are non-empty and have the same length, which is not exceeding 100100.

Output
Print tt lines with answers for all test cases. For each test case:

If it is possible to make string aa equal to string bb print “YES” (without quotes), otherwise print “NO” (without quotes).

You can print either lowercase or uppercase letters in the answers.

Example
Input
4
aaa
bbb
ccc
abc
bca
bca
aabb
bbaa
baba
imi
mii
iim
Output
NO
YES
YES
NO
Note
In the first test case, it is impossible to do the swaps so that string aa becomes exactly the same as string bb.

In the second test case, you should swap cici with aiai for all possible ii. After the swaps aa becomes “bca”, bb becomes “bca” and cc becomes “abc”. Here the strings aa and bb are equal.

In the third test case, you should swap c1c1 with a1a1, c2c2 with b2b2, c3c3 with b3b3 and c4c4 with a4a4. Then string aa becomes “baba”, string bb becomes “baba” and string cc becomes “abab”. Here the strings aa and bb are equal.

In the fourth test case, it is impossible to do the swaps so that string aa becomes exactly the same as string bb.
水题。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;string a,b,c;int main()
{int t;scanf("%d",&t);while(t--){cin>>a>>b>>c;int n=a.length();int flag=1;for(int i=0;i<n&&flag;i++){if(a[i]!=b[i]){if(a[i]==c[i]) continue;else if(b[i]==c[i]) continue;else flag=0;}else{if(a[i]!=c[i]) flag=0;}}if(flag) cout<<"YES"<<endl;else cout<<"NO"<<endl;}return 0;
}

努力加油a啊，(^o)/~

Three Strings CodeForces - 1301A相关推荐

【CodeForces - 798A】Mike and palindrome （回文串，水题，字符串问题）
题干: Mike has a string s consisting of only lowercase English letters. He wants to change exactly one ...
Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics）简训
Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics)简训导语涉及的知识点题目 A Game B ...
Educational Codeforces Round 12 C. Simple Strings 贪心
C. Simple Strings 题目连接: http://www.codeforces.com/contest/665/problem/C Description zscoder loves si ...
Codeforces Round #313 (Div. 1) B. Equivalent Strings
Equivalent Strings Problem's Link: http://codeforces.com/contest/559/problem/B Mean: 给定两个等长串s1,s2 ...
Codeforces Round #598 (Div. 3) F. Equalizing Two Strings 思维 + 逆序对
传送门文章目录题意: 思路: 题意: 给你两个长度为nnn的串a,ba,ba,b,每次可以同时翻转a,ba,ba,b中任意一段长度为L(1≤L≤n)L(1\le L\le n)L(1≤L≤n)的子 ...
CodeForces - 798B Mike and strings
B. Mike and strings time limit per test2 seconds memory limit per test256 megabytes inputstandard in ...
Codeforces - Reachable Strings
题目链接:Codeforces - Reachable Strings 我们可以发现每次0的移动都是不改变当前0的位置的左右1的奇偶性. 并且0是不可能改变相对位置的,所以我们对0的个数以及位置的左边 ...
codeforces 616F Expensive Strings
codeforces 616F Expensive Strings (广义后缀自动机) https://codeforces.com/contest/616/problem/F 题意: 给你n个字符串 ...
C. Tyler and Strings（组合数学,树状数组维护前缀和）(Codeforces Round #775 (Div. 1, based on Moscow Open Olympiad i)
对我来说比较困难的一题了,尝试着自己写了一下,调不出来遂放弃. Codeforces Round #775 (Div. 1, based on Moscow Open Olympiad in Info ...

Three Strings CodeForces - 1301A

Three Strings CodeForces - 1301A相关推荐

最新文章

热门文章