牛客440904392号

分类

/ 注册

全部文章（共258篇）

题解 | 遍历平滑线

import sys sys.setrecursionlimit(1000000) def main(): n = int(sys.stdin.readline()) a = list(map(int, sys.stdin.readline().split())) a = ...

2026-01-08

0 22

题解 | 众数

import sys from collections import defaultdict def main(): # 读取输入（处理大数据量时用sys.stdin更高效） input = sys.stdin.read().split() ptr = 0 n =...

2026-01-08

0 25

题解 | 树上计数后序遍历计算节点数

import java.util.ArrayList; import java.util.LinkedList; import java.util.List; import java.util.Scanner; public class Main { private static int ...

2026-01-08

0 21

题解 | 字符串注意连续子串是至少为M不是只能为M

n, m = map(int, input().split()) s = input() count = ans = 0 for i in range(n): if s[i] == "1": count += 1 else: a =...

2026-01-08

0 19

题解 | Prime暴力遍历

x = input() for i in range(1, 1000): a = int(x + str(i)) for j in range(2, int(a ** 0.5) + 1): if a % j == 0: break else: ...

2026-01-08

0 16

题解 | 最大价值路径动态规划加预处理

#include<iostream> #include<vector> #include<list> #include<climits> using namespace std; struct Edge { int to, cost; ...

2026-01-08

0 21

题解 | 统计次数直接遍历

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n...

2026-01-08

0 22

题解 | 等差数列先按行计算，再按列计算，最后根据题目要求排序

n, m = map(int, input().split()) matrix = [list(map(int, input().split())) for _ in range(n)] ans = [] for i in range(n): index = -1 for j in ...

2026-01-08

0 28

题解 | 元数据直接模拟

#include<iostream> #include<algorithm> #include<vector> using namespace std; int main() { ios::sync_with_stdio(false); cin...

2026-01-08

0 18

题解 | 最小前缀pypy3加二分查找勉强不超时

import sys import bisect def find_min_x(): # 快速读取输入（sys.stdin.read 比 input() 快10倍以上） data = sys.stdin.read().split() idx = 0 n = int...

2026-01-07

0 22