chong_0428

分类

/ 注册

全部文章（共63篇）

题解 | #ZOJ#

def zoj(s): z=[] o=[] j=[] for i in s: if i == 'Z': z.append('Z') if i == 'O': ...

2024-03-03

0 206

题解 | #统计字符#

def tongji(s2, s1): d = {} for i in s2: print(i,end='') c=0 for j in s1: if i == j: c+=1 ...

2024-03-02

0 207

题解 | #Coincidence#

#include <stdio.h> #include<string.h> int max(int a, int b){ if(a > b) return a; return b; } int main() { int dp[1...

2024-03-02

0 208

题解 |

while True: try: n = int(input()) s = list(map(int,input().split())) for i in s[::-1]: print(i,end=' ') ex...

2024-03-02

0 188

题解 | #WERTYU#

def dec(s): L = list(s) for i in range(len(s)): if s[i] == "\\": L[i] = "]" elif s[i] == "...

2024-03-01

0 200

题解 | #简单密码#

while True: try: while True: arr=[] s = input() if(s=='START'): continue ...

2024-02-29

0 191

题解 | #加减乘除#

def mul(a): if a<2: return a return mul(a-1)*a while True: try: s = input().split() if len(s) == 3: ...

2024-02-29

0 172

题解 | #数字求和#

while True: try: a = list(map(int,input().split())) f = a[0] arr=[] for i in a[1:]: if i<f: ...

2024-02-29

0 173

题解 | #Number Steps#

#include<stdio.h> int main() { int j = 0, i; int a[5000][5000]; //printf("%d",a[1][1]); for (int i = 0; i < 5000; i...

2024-02-29

0 189

题解 | #打印极值点下标#

def point_ex(s): k=0 arr=[] if s[0]!=s[1]: arr.append(0) if s[-1]!=s[-2]: arr.append(len(s)-1) for i in s[1:len(s)...

2024-02-28

0 224