bitset
Kirito_Acmer
这个作者很懒,什么都没留下…
展开
-
codeforces 632F. Magic Matrix (最小生成树)
You're given a matrix A of size n × n.Let's call the matrix with nonnegative elements magic if it is symmetric (so aij = aji), aii = 0 and aij ≤ max(aik, ajk) for all triples i, j, k. Note that原创 2016-03-03 21:53:44 · 1541 阅读 · 3 评论 -
poj2443Set Operation (bitset)
DescriptionYou are given N sets, the i-th set (represent by S(i)) have C(i) element (Here "set" isn't entirely the same as the "set" defined in mathematics, and a set may contain two same element)原创 2016-03-04 09:32:48 · 556 阅读 · 0 评论 -
hdu4920Matrix multiplication (矩阵,bitset)
Problem DescriptionGiven two matrices A and B of size n×n, find the product of them.bobo hates big integers. So you are only asked to find the result modulo 3. InputThe input con原创 2016-03-04 12:38:41 · 1091 阅读 · 0 评论 -
zjnu1709 UZASTOPNI (bitset,树形dp)
DescriptionPetar is throwing a birthday party and he decided to invite some of the employees of his company where he is the CEO. Each employee, including Petar, has a unique label from 1 to N, a原创 2016-03-09 21:16:37 · 609 阅读 · 0 评论