2016年10月22日
Codeforces Round #198 (Div. 1) D. Iahub and Xors 二维树状数组*
摘要： D. Iahub and Xors Iahub does not like background stories, so he'll tell you exactly what this problem asks you for. You are given a matrix a with n ro 阅读全文
posted @ 2016-10-22 14:20 meekyan 阅读(230) 评论(0) 推荐(0) 编辑