叶花永不相见

分类

题解(183)

/ 注册

全部文章（共155篇）

题解 | #及格分数#

while True: try: score = int(input()) if score >= 60: print("Pass") else: print("Fail") exc...

Python3

2022-06-11

0 336

题解 | #你是天才吗？#

while True: try: a = int(input()) if a >= 140: print("Genius") except: break

Python3

2022-06-11

0 300

题解 | #合并表记录#

#include<stdio.h> typedef struct KeyVal{ int index; int value; }KV; int main() { int n; scanf("%d", &n); KV arr[n]; ...

C

2022-06-11

1 337

题解 | #函数实现计算一个数的阶乘#

#include<stdio.h> long long factorial(long long n) { if (n==1) return 1; n*=factorial(n-1); return n; } int main() { lon...

C

2022-05-12

0 338

题解 | #公共子串计算#

#include <stdio.h> #include <string.h> int main() { char str[200], str2[200]; scanf("%s\n%s", str, str2); int max = 0; for...

C

2022-04-24

1 458

题解 | #小乐乐改数字#

n = input() for i in n: if int(i)%2 == 0: n = n.replace(i,'0') else: n = n.replace(i,'1') print(int(n))

Python3

2022-04-20

0 347

题解 | #矩阵乘法#

#include<stdio.h> int main() { int x, y, z; scanf("%d", &x); scanf("%d", &y); scanf("%d", &z); int arr1[100][100...

C

2022-04-20

0 318

题解 | #小乐乐与欧几里得#

n, m = map(int, input().split()) p = n * m tmp=n % m while tmp != 0: n = m m = tmp tmp = n % m max = m min = p//max print(max+min)

Python3

2022-04-19

0 306

题解 | #小乐乐定闹钟#

h, m, k = map(int, input().replace(":", " ").split(" ")) h = (h + (m+k) // 60) % 24 m = (m+k) % 60 print("%02d:%02d" % (h, m))

Python3

2022-04-19

0 291

题解 | #字符串通配符#

#include<stdio.h> #include<string.h> #include<ctype.h> int match(char *str1, char *str2) { if(str1[0]=='\0' && str2[0]=...

C

2022-04-18

1 452