2849: 石头剪子布
摘要：参考代码:n = int(input())
for _ in range(n):
S1, S2 = map(str, input().split())
if S1 == S2:
……
题解列表
2850: 输出亲朋字符串
摘要：参考代码:s = input()
s1 = ''
for i in range(len(s) - 1):
s1 += chr(ord(s[i]) + ord(s[i + ……
2851: 合法C标识符
摘要：参考代码:s = input()
for i in s:
if s[0].isdigit():
print('no')
quit()
……
2852: 配对碱基链
摘要：参考代码:s = input()
for i in s:
if i == 'A':
print('T', end='')
……
2853: 字符替换
摘要：参考代码:s, a, b = map(str, input().split())
print(s.replace(a, b))……
找出规律 for循环输出即可
摘要：解题思路:注意事项:参考代码:#include<bits/stdc++.h>using namespace std;using ll = long long;const int N = 1e5+9;i……
2854: 密码翻译
摘要：参考代码:s = list(input())
for i in range(len(s)):
if s[i] == 'z':
s[i] = 'a&……
2855: 简单密码
摘要：参考代码:s = input()
s1 = {
"A": "V",
"B": "W",
"C": "X",
&q
[编程入门]链表之报数问题
摘要：解题思路:注意事项:参考代码:#include<stdio.h>int main() { int n = 0; scanf_s("%d", &n); int arr[1000] = { 0 }; fo……
题解 1099: 校门外的树
摘要：解题思路:注意事项:参考代码:L, M = map(int, input().split())
trees = [1 for x in range(L+1)]
for x in range(M):……