牛客440904392号

分类

/ 注册

全部文章（共258篇）

题解 | 涂颜色

print(pow(2, int(input().split()[0]), 1000000007))

2026-01-09

0 19

题解 | 极大连通图个数连通分量个数等于调用dfs或bfs次数

#include<iostream> #include<vector> using namespace std; vector<string> grid; void dfs(int x, int y) { grid[x][y] = '.'; f...

2026-01-09

1 20

题解 | 正方形的数目全排列暴力搜索

import java.util.ArrayList; import java.util.Arrays; import java.util.List; import java.util.Scanner; public class Main { private static List<...

2026-01-09

0 23

题解 | 数字收集

input() nums = [0] * 100001 a = list(map(int, input().split())) for x in a: nums[x] += 1 for i in range(1, 100001): if nums[i] == 0: p...

2026-01-09

0 22

题解 | 划分子集就是求最大连通分量的大小

import java.util.Scanner; public class Main { private static int[] parents; public static void main(String[] args) { Scanner sc = ne...

2026-01-09

0 17

题解 | N的阶乘

from math import factorial while True: try:print(factorial(int(input()))) except:break

2026-01-08

0 19

题解 | 约数的个数

input() nums = list(map(int, input().split())) for x in nums: count = 0 for i in range(1, int(x ** 0.5) + 1): if x % i == 0: ...

2026-01-08

0 19

题解 | 成绩排序

import java.util.Arrays; import java.util.Comparator; import java.util.Scanner; public class Main { public static void main(String[] args) { ...

2026-01-08

0 26

题解 | 进制转换大整数除法加十进制转二进制

#include<iostream> #include<algorithm> using namespace std; int main() { string s; ...

C++

2026-01-08

1 22

题解 | 进制转换直接调用库函数

while True: try:print(bin(int(input()))[2:]) except:break

2026-01-08

1 20