牛客440904392号

分类

/ 注册

全部文章（共258篇）

题解 | 养鸽子

n, k = map(int, input().split()) mod = int(1e9 + 7) print(sum(pow(i, k, mod) for i in range(1,n + 1)) ** 2 % mod)

2026-01-07

0 19

题解 | 圆上计数

import bisect def main(): import sys input = sys.stdin.read().split() ptr = 0 N = int(input[ptr]) ptr += 1 C = int(input[pt...

2026-01-07

0 46

题解 | 任务调度直接模拟就行

#include<iostream> #include<vector> #include<algorithm> using namespace std; int main() { int n, m; cin >> n >>...

2026-01-07

0 29

题解 | 公司

n, m = map(int, input().split()) nums = [0] + list(map(int, input().split())) graph = [[] for _ in range(n + 1)] for _ in range(m): x, y = map(int...

2026-01-07

0 26

题解 | 2024_最低通行费_1713动态规划，只能往下走和往右走

n = int(input()) grid = [list(map(int, input().split())) for _ in range(n)] dp = [[0] * n for _ in range(n)] dp[0][0] = grid[0][0] for i in range(1, n...

2026-01-07

0 24

题解 | 2024_田忌赛马_1730全排列暴力枚举

import java.util.Arrays; import java.util.LinkedList; import java.util.List; import java.util.Scanner; public class Main { private static int[] n...

2026-01-07

0 33

题解 | 2024_田忌赛马_1730直接暴力枚举

from itertools import permutations n, x = map(int, input().split()) nums = list(map(int, input().split())) for perm in permutations(range(1, n + 1)): ...

2026-01-07

0 27

题解 | 2024_堆栈基本操作_1745直接用栈模拟就行

import java.util.LinkedList; import java.util.List; import java.util.Scanner; import java.util.Stack; public class Main { public static void main...

2026-01-07

0 27

题解 | 2024_打怪救公主_1711类似dijkstra算法

#include<iostream> #include<queue> using namespace std; struct State { int x, y, hp; bool operator<(const State &other) ...

2026-01-07

0 23

题解 | 2024_冰阔落_1716并查集

#include<iostream> #include<vector> using namespace std; vector<int> parents; int find(int x) { return x == parents[x] ? x : p...

2026-01-07

0 32