2017年8月5日

HDU 6059 17多校3 Kanade's trio（字典树）
摘要： Problem Description Give you an array A[1..n]，you need to calculate how many tuples (i,j,k) satisfy that (i<j<k) and ((A[i] xor A[j])<(A[j] xor A[k])) 阅读全文
posted @ 2017-08-05 14:49 Annetree 阅读(456) 评论(0) 推荐(0)
 
HDU 6077 17多校4 Time To Get Up 水题
摘要： Problem Description Little Q's clock is alarming! It's time to get up now! However, after reading the time on the clock, Little Q lies down and starts 阅读全文
posted @ 2017-08-05 10:12 Annetree 阅读(401) 评论(0) 推荐(0)
 
HDU 6075 Questionnaire 17多校4 水题
摘要： Problem Description In order to get better results in official ACM/ICPC contests, the team leader comes up with a questionnaire. He asked everyone in 阅读全文
posted @ 2017-08-05 09:40 Annetree 阅读(167) 评论(0) 推荐(0)