编程介的小学生 2017-09-30 22:20 采纳率: 20.5%
浏览 819
已采纳

Base pairing

Problem Description
  We have two straight parallel DNA single strands. You can shift any strand left or right, but you can not reverse it or bent it.
  Your task is to calculate how many paired bases at most between the two strands. Note that the paired bases can only be A-T, T-A, C-G or G-C.

Input
  There is an integer T (1 <= T <= 100) in the first line, indicates there are T test cases in total.
  For each test case, there are two lines, and each line contains one DNA single strand. You can assume that there are only “A”, “T”, “C” or “G” in the two strands. The length of each strand is at least 1 and not more than 30000.
There are at most 10 test cases that satisfy the total length of the two strands is more than 200.

Output
  For each test case, you should output the correct answer in one line.

Sample Input
3
ATC
GAT
ATCG
TGC
CTAG
TGAT

Sample Output
1
2
3

  • 写回答

1条回答 默认 最新

报告相同问题?

悬赏问题

  • ¥15 关于#python#的问题:求帮写python代码
  • ¥20 MATLAB画图图形出现上下震荡的线条
  • ¥15 LiBeAs的带隙等于0.997eV,计算阴离子的N和P
  • ¥15 关于#windows#的问题:怎么用WIN 11系统的电脑 克隆WIN NT3.51-4.0系统的硬盘
  • ¥15 来真人,不要ai!matlab有关常微分方程的问题求解决,
  • ¥15 perl MISA分析p3_in脚本出错
  • ¥15 k8s部署jupyterlab,jupyterlab保存不了文件
  • ¥15 ubuntu虚拟机打包apk错误
  • ¥199 rust编程架构设计的方案 有偿
  • ¥15 回答4f系统的像差计算