牛客440904392号

分类

/ 注册

全部文章（共258篇）

题解 | 完全平方数动态规划

n = int(input()) dp = [0] + [float('inf')] * n for i in range(1, n + 1): for j in range(1, int(i ** 0.5) + 1): dp[i] = min(dp[i], dp[i - j * j] + ...

2026-01-12

0 39

题解 | 数组排序

input() nums = list(map(int, input().split())) count = 0 ans = [] flag = False for x in nums: if x < 0: flag = True if x == 0: ...

2026-01-12

0 25

题解 | 数组逆序

input() print(*reversed(input().split()))

2026-01-12

1 30

题解 | 区间合并-2注意重叠和相邻的区间都要合并，而不是只有重叠

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

2026-01-12

0 27

题解 | 区间合并1

a1, b1 = map(int, input().split()) a2, b2 = map(int, input().split()) print("Yes" if a1 <= b2 and a2 <= b1 else "No")

2026-01-12

0 36

题解 | 爬楼梯斐波那契数列

p, q = 0, 1 for _ in range(int(input())):p, q = q, p + q print(q)

2026-01-12

0 31

题解 | 矩阵旋转

#include<stdio.h> int main() { int n, m; scanf("%d%d", &n, &m); int matrix[n][m]; for (int i = 0; i < n; i+...

2026-01-12

0 27

题解 | 二分查找

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

2026-01-12

0 22

题解 | 二分查找

from bisect import bisect_left n, m = map(int, input().split()) nums = list(map(int, input().split())) index = bisect_left(nums, m) if 0 <= index &...

2026-01-12

0 26

题解 | 单词逆序-2

s = input() t = [] i = 0 for i in range(len(s)): if s[i].isalpha(): t.append(s[i]) else: print("".join(reversed(t)),...

2026-01-12

0 29