摘要:
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. We say a path the 阅读全文
摘要:
Ashish has a tree consisting of nn nodes numbered 11 to nn rooted at node 11 . The ii -th node in the tree has a cost aiai , and binary digit bibi is 阅读全文
摘要:
Ayush and Ashish play a game on an unrooted tree consisting of nn nodes numbered 11 to nn. Players make the following move in turns: Select any leaf n 阅读全文
摘要:
Shubham has a binary string ss. A binary string is a string containing only characters "0" and "1". He can perform the following operation on the stri 阅读全文
摘要:
A. Odd Selection time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Shubham has an array aa 阅读全文