2017年9月16日
2017 ACM-ICPC 亚洲区（西安赛区）网络赛
摘要： A There is a tree with nn nodes, at which attach a binary 64 6464∗64 matrix M_i (1 \le i \le n)M ​i ​​ (1≤i≤n). There are qq queries for matrix multip 阅读全文
posted @ 2017-09-16 16:07 besti5332 阅读(509) 评论(0) 推荐(0) 编辑