chong_0428

分类

/ 注册

全部文章（共128篇）

题解 | #最大公约数#

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

2024-03-03

0 170

题解 | #找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 208

题解 | #最小长方形#

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 207

题解 | #还是畅通工程#

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

2024-03-03

0 196

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

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 210

题解 | #ZOJ#

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

2024-03-03

0 211

题解 | #统计字符#

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 215

题解 | #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 204

题解 |

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 198

题解 | #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 218