
题解
文章平均质量分 80
竹底蜉蝣
这个作者很懒,什么都没留下…
展开
-
The XOR Longest Path(POJ3764)
一、题目描述链接(ACwing):https://www.acwing.com/problem/content/146/链接(POJ):http://poj.org/problem?id=3764Problem Description:In an edge-weighted tree, the xor-length of a path p is defined as the xor sum of the weights of edges on p:⊕ is the xor operator.W原创 2021-09-12 15:26:15 · 194 阅读 · 1 评论 -
2021CCPC网络赛B题Time-division Multiplexing(HDU7101)
一、题目描述链接:http://acm.hdu.edu.cn/showproblem.php?pid=7101Problem Description:Time-division multiplexing (TDM) is a method of transmitting and receiving independent signals over a common signal path by means of synchronized switches at each end of the tran原创 2021-08-31 10:37:48 · 513 阅读 · 0 评论