We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
问题描述一节中有:
集合 pp 是 tt 的一个子集,且 pp 中的子集所包含的 ss 的元素可以覆盖集合 ss 。设集合 qq 是 pp 中所有元素所包含的 ss 中元素组成的集合
但是,示例给出的结果中p中的子集所包含的s的元素并不能覆盖集合s。
同时问题描述一节中还有:
精确覆盖:对于$$ \forall x \in s $$,存在且只存在一个$$ \exists s_{i} \in p $$使得$$ x \in s_{i} $$。例如集合$$ s = [ 0,1,2,3 ] $$,子集$$ s_{1} = [ 0,1 ], s_{2} = [ 1,2 ], s_{3} = [ 2,3 ] $$组成$$ p = [ s_{1},s_{2} ] $$,称这样的$$ p $$是$$ s $$的精确覆盖。显然$$ p $$必然满足$$ \forall s_{i}, s_{j} \in p, s_{i} \bigcap s_{j} = \varnothing, i \ne j $$。
其中,$$ p = [ s_{1},s_{2} ] $$,而s1和s2是存在交集的。
The text was updated successfully, but these errors were encountered:
No branches or pull requests
问题描述一节中有:
但是,示例给出的结果中p中的子集所包含的s的元素并不能覆盖集合s。
同时问题描述一节中还有:
其中,$$ p = [ s_{1},s_{2} ] $$,而s1和s2是存在交集的。
The text was updated successfully, but these errors were encountered: