li_wen_zhuo的博客

题目描述There are two sequences of length n−1, b=(b2,b3,……,bn), c=(c2,c3,……,cn). Here, each bi,ci is a non-negative integer.Now, the sequence a=(a1,a2,……,an)，considers beautiful if and only if forall i (2≤i≤n), bi = a[i-1] | a[i] , ci=a[i-1]+a[i] and each a

题目描述Only a few know that Pan and Apollo weren’t only battling for the title of the GOAT musician. A few millenniums later, they also challenged each other in math (or rather in fast calculations). The task they got to solve is the following:Let x1,x2,…,

题目描述题目链接题目大意有n个点和m个约束，每个约束包含三个数u，v，w，表示a[u]^a[v]=w.求满足m个约束 并且 和最小的序列的和。题目分析这很明显是一个图论问题，对于每个约束u−v−w，我们可以在u和v之间连一条权值为w的边。这很明显是一个图论问题，对于每个约束u-v-w，我们可以在u和v之间连一条权值为w的边。这很明显是一个图论问题，对于每个约束u−v−w，我们可以在u和v之间连一条权值为w的边。因为题目对于约束并没有太多的限制。因此这个图是可能存在环和不连通的。因为题目对于约束

题目描述There is a new attraction in Singapore Zoo: The Infinite Zoo.The Infinite Zoo can be represented by a graph with an infinite number of vertices labeled 1,2,3,…. There is a directed edge from vertex u to vertex u+v if and only if u&v=v, where &am

题目描述Once Divan analyzed a sequence a1,a2,…,an consisting of n non-negative integers as follows. He considered each non-empty subsequence of the sequence a, computed the bitwise XOR of its elements and added up all the XORs, obtaining the coziness of the