GB279824
GB279824
全部文章
分类
归档
标签
去牛客网
登录
/
注册
GB279824的博客
全部文章
(共162篇)
题解 | 校门外的树
l,m = map(int,input().strip().split()) regin = [] for _ in range(m): a,b = map(int,input().strip().split()) regin.append((a,b)) totals = l +...
2025-06-07
0
8
题解 | 约瑟夫环
n,k,m = map(int,input().strip().split()) l = list(range(n)) while n>1: k = (k+m-1)%n l.pop(k) n -= 1 print(l[0])
2025-06-07
0
8
题解 | 记数问题
import sys n,x = map(int,input().strip().split()) count = 0 for i in range(1,n+1): if str(x) in str(i): count += str(i).count(str(x)) pri...
2025-06-07
0
8
题解 | 数组计数维护
import sys n1 = int(input()) for i in range(n1): s = cnt = 0 n,k = map(int, input().strip().split()) a = list(map(int,input().strip().spli...
2025-06-07
0
9
题解 | 牛牛的数学作业
import sys n = int(input()) for i in range(n): l = int(input()) a = list(map(int,input().strip().split())) maxa = max(a) mina = min(...
2025-06-07
0
10
题解 | 神秘石像的镜像序列
import sys for line in sys.stdin: a = list(map(int,line.strip().split())) for i in a[-2::-1]: print(i,end=' ')
2025-06-07
0
8
题解 | 二维斐波那契数列
MOD = 10**9 + 7 m,n = map(int,input().split()) dp = [[0]*(m+1) for _ in range(n+1)] dp[1][1] = 1 for i in range(2,n+1): dp[i][1] = dp[i-1][1] for...
2025-06-07
0
9
题解 | 牛牛学数列5
import sys def fib(n): if n == 1 or n == 2: return 1 return fib(n-1)+fib(n-2) for line in sys.stdin: a = int(line.strip()) p...
2025-06-07
0
6
题解 | 素数判断
import sys n = int(input()) for line in sys.stdin: a = int(line.strip()) if a > 2: for i in range(2,a): if a % i == 0...
2025-06-07
0
9
题解 | 明天星期几?
import sys for line in sys.stdin: d = int(line.strip()) # if d == 7: # print(1) # else: # print(d+1) print(d % 7 + 1)
2025-06-07
0
8
首页
上一页
1
2
3
4
5
6
7
8
9
10
下一页
末页