牛客440904392号

分类

/ 注册

全部文章（共258篇）

题解 | 最大公约数和最小公倍数

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

2026-01-14

0 13

题解 | 最大公约数和最小公倍数

from math import gcd, lcm n, m = map(int, input().split()) print(gcd(n, m), lcm(n, m))

2026-01-14

0 14

题解 | 字符菱形

n = int(input()) for i in range(n):print(" " * (n - i - 1) + "*" * (2 * i + 1) + " " * (n - i - 1)) for i in range(n - 1...

2026-01-14

0 10

题解 | 上楼梯

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

2026-01-14

0 12

题解 | 最少纸币兑换数

n = int(input()) nums = [100, 50, 20, 10, 5, 1] ans = 0 for x in nums: ans += n // x n %= x print(ans)

2026-01-14

0 8

题解 | 2024_帕鲁任务分配_1523二分查找

def check(x): temp = sum = x if k > 0: for i in range(k - 1, -1, -1): temp = max(1, temp - min(c[i], c[i + 1])) ...

2026-01-14

0 11

题解 | 队伍成绩排名

#include<iostream> #include<algorithm> using namespace std; struct Team { int score, time; string name; }; int main() { ios:...

2026-01-14

0 12

题解 | 最大递增子序列和

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

2026-01-14

0 15

题解 | 2023_南京理工-最短路径问题_1563

from heapq import heappush, heappop while True: n, m = map(int, input().split()) if n == 0 and m == 0: break graph = [[] for _ in ...

2026-01-13

0 11

题解 | 紧急支援

#include<iostream> using namespace std; int main() { int n, k, h; cin >> n >> k >> h; int nums[n - 1]; long lo...

2026-01-13

0 17