当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5590:ZYB's Biology

题目描述
After getting $600$ scores in $NOIP$ $ZYB(ZJ-267)$ begins to work with biological questions.Now he give you a simple biological questions:
he gives you a $DNA$ sequence and a $RNA$ sequence,then he asks you whether the $DNA$ sequence and the $RNA$ sequence are
matched.

The $DNA$ sequence is a string consisted of $A,C,G,T$;The $RNA$ sequence is a string consisted of $A,C,G,U$.

$DNA$ sequence and $RNA$ sequence are matched if and only if $A$ matches $U$,$T$ matches $A$,$C$ matches $G$,$G$ matches $C$ on each position.
输入解释
In the first line there is the testcase $T$.

For each teatcase:

In the first line there is one number $N$.

In the next line there is a string of length $N$,describe the $DNA$ sequence.

In the third line there is a string of length $N$,describe the $RNA$ sequence.

$1 \leq T \leq 10$,$1 \leq N \leq 100$
输出解释
For each testcase,print $YES$ or $NO$,describe whether the two arrays are matched.
输入样例
2
4
ACGT
UGCA
4
ACGT
ACGU
输出样例
YES
NO
来自杭电HDUOJ的附加信息
Recommend hujie

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

题目来源 BestCoder Round #65

源链接: HDU-5590

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

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 131072/131072K(Java/Others)