CARLJOSEPHLEE

分类

题解(26)

/ 注册

全部文章（共209篇）

题解 | 定义变量

#include <iostream> using namespace std; int main() { // write your code here...... char a; int b; long c; double d; c...

2025-08-02

0 8

题解 | 大水题

n = input() while len(n) != 1: n = str(sum(int(i) for i in n)) print(n)

2025-08-02

1 7

题解 | 数位五五

a,b = map(int,input().split()) cnt = 0 for i in range(a,b+1): if sum(int(j) for j in str(i))%5==0: cnt += 1 print(cnt)

2025-08-02

0 5

题解 | 小乐乐计算函数

a,b,c = map(int,input().split()) ans = max(a+b,b,c)/(max(a,b+c,c)+max(a,b,b+c)) print(f"{ans:.2f}")

2025-08-02

1 6

题解 | 牛牛逆序输出

print(input()[::-1])

2025-08-02

1 6

题解 | 牛牛的排列数

牛客什么时候能把Python3和pypy3的版本更新一下，太旧了 from math import perm n,m = map(int,input().split()) print(perm(n,m))

2025-08-02

1 7

题解 | 牛牛的Hermite多项式

解包省代码量 def h(n,x): if n == 0: return 1 if n == 1: return 2*n return 2*x*h(n-1,x)-2*(n-1)*h(n-2,x) print(h(*map(int,input()...

2025-08-02

1 6

题解 | 牛牛的digit

x,i = input().split() print(x[len(x)-int(i):len(x)])

2025-08-02

1 6

题解 | 牛牛的Ackmann

from sys import setrecursionlimit setrecursionlimit(1000000) def ackmann(m,n): if m == 0: return n+1 if m>0 and n == 0: ret...

2025-08-02

1 7

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

这题只能用C++写，害得我复习了一下C++语法@烤点老白薯(637174235) #include <iostream> using namespace std; long long factorial(int n); int main() { int n; cin...

2025-08-02

1 8