搜索结果
查询Tags标签： Subsets，共有 9条记录-
ARC143 F Counting Subsets
题意 给定正整数 \(n\)，求有多少 \(\{1,2,\dots ,n\}\) 的子集 \(S\) 满足任意一个 \(1\) 到 \(n\) 到整数都能被表示成 \(S\) 的子集和，且方案数小于等于 \(2\)。 对 \(998244353\) 取模。 \(n\le 1500\)题解 一看到这个，就想到 AHOI 的山河重整，但做法完全不同。 考…
2022/7/21 6:24:44 人评论 次浏览 -
Boruvka最小生成树代码
1 // Boruvkas algorithm to find Minimum Spanning2 // Tree of a given connected, undirected and3 // weighted graph4 #include <stdio.h>5 6 // a structure to represent a weighted edge in graph7 struct Edge8 {9 int src, dest, weight;10 };11 12 /…
2021/8/29 6:06:36 人评论 次浏览 -
Boruvka最小生成树代码
1 // Boruvkas algorithm to find Minimum Spanning2 // Tree of a given connected, undirected and3 // weighted graph4 #include <stdio.h>5 6 // a structure to represent a weighted edge in graph7 struct Edge8 {9 int src, dest, weight;10 };11 12 /…
2021/8/29 6:06:36 人评论 次浏览 -
Kruskal最小生成树代码
1 // C program for Kruskals algorithm to find Minimum2 // Spanning Tree of a given connected, undirected and3 // weighted graph4 #include <stdio.h>5 #include <stdlib.h>6 #include <string.h>7 8 // a structure to represent a weighted e…
2021/8/29 6:06:36 人评论 次浏览 -
Kruskal最小生成树代码
1 // C program for Kruskals algorithm to find Minimum2 // Spanning Tree of a given connected, undirected and3 // weighted graph4 #include <stdio.h>5 #include <stdlib.h>6 #include <string.h>7 8 // a structure to represent a weighted e…
2021/8/29 6:06:36 人评论 次浏览 -
Subsets II
Link: https://leetcode.com/problems/subsets-ii/ Constaint: The array may contains duplicate. The array may not be sorted. Idea The idea is to think about how to avoid adding duplicate values to the subset. We will process the first occurance of a numb…
2021/8/5 6:07:01 人评论 次浏览 -
Subsets II
Link: https://leetcode.com/problems/subsets-ii/ Constaint: The array may contains duplicate. The array may not be sorted. Idea The idea is to think about how to avoid adding duplicate values to the subset. We will process the first occurance of a numb…
2021/8/5 6:07:01 人评论 次浏览 -
78. Subsets
目录题目描述方法1思路代码方法2思路代码 题目描述 Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order(非下降顺序，升序).The solution set must not contain duplicate subsets. For exa…
2021/7/10 23:08:25 人评论 次浏览 -
78. Subsets
目录题目描述方法1思路代码方法2思路代码 题目描述 Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order(非下降顺序，升序).The solution set must not contain duplicate subsets. For exa…
2021/7/10 23:08:25 人评论 次浏览
