A - Double Helix

最新推荐文章于 2024-11-30 14:25:55 发布

轻舟不载愁

最新推荐文章于 2024-11-30 14:25:55 发布

阅读量216

点赞数

CC 4.0 BY-SA版权

分类专栏： Atcode 文章标签： C/C++

本文链接：https://blog.youkuaiyun.com/weixin_44231195/article/details/89224711

Atcode 专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个简单的程序，用于实现DNA中碱基的互补配对原则，即A-T和C-G的配对。通过输入单一碱基，程序将输出其对应的互补碱基。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Time Limit: 2 sec / Memory Limit: 1024 MB

Score :
100
points

Problem Statement
On the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.

You are given a letter
b
as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base
b
.

Constraints
b
is one of the letters A, C, G and T.
Input
Input is given from Standard Input in the following format:

Output
Print the letter representing the base that bonds with the base
b
.

Sample Input 1
Copy
A
Sample Output 1
Copy
T
Sample Input 2
Copy
G
Sample Output 2
Copy
C

题意：碱基互补配对原则，配对A-T,C-G

代码

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
using namespace std;

int main() {
	char str;
	while (cin >> str) {
		if (str == 'A') {
			cout << "T" << endl;
		}
		else if (str == 'T') {
			cout << "A" << endl;
		}
		else if (str == 'C') {
			cout << "G" << endl;
		}
		else {
			cout << "C" << endl;
		}
	}
}