chong_0428

分类

/ 注册

全部文章（共132篇）

题解 | #数字之和#

def Digit(n): arr = [] square = [] t=n while int(n): t =n % 10 arr.append(t) n = int(n/10) return arr def ...

2024-03-04

0 248

题解 | #三角形的边#

def tria_max(a, b, c): if a>b and a>c: return a if b>a and b>c: return b if c>a and c>b: retur...

2024-03-04

0 303

题解 | #数组逆置#

while True: try: s = input() print(s[::-1]) except: break

2024-03-03

0 212

题解 | #字符串链接#

while True: try: s1, s2 = input().split() print(s1+s2) except: break

2024-03-03

0 192

题解 | #最大公约数#

#include <stdio.h> int main() { int a, b, t; while (scanf("%d %d", &a, &b) != EOF) { // 注意 while 处理多个 case //...

2024-03-03

0 180

题解 | #找x#

def ind(l, i): c=-1 flag=0 for j in l: c+=1 if i == j: flag = 1 print(c) if flag == 0: ...

2024-03-03

0 215

题解 | #最小长方形#

def fun(a, b): maxa = max(a) maxb = max(b) mina = min(a) minb = min(b) print("%d %d %d %d"%(mina, minb, maxa, maxb)) ...

2024-03-03

0 216

题解 | #还是畅通工程#

#include <stdio.h> #include <math.h> struct Point { double x; double y; }; struct Edge { int from; int to; int lengt...

2024-03-03

0 205

题解 | #统计同成绩学生人数#

def count(s, t): c=0 for i in s: if i == t: c+=1 print(c) while True: try: n = int(input()) if n =...

2024-03-03

0 218

题解 | #ZOJ#

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

2024-03-03

0 219