摘要: Consider the infinite sequence ss of positive integers, created by repeating the following steps: Find the lexicographically smallest triple of positi 阅读全文
posted @ 2020-04-15 11:10 XXXSANS 阅读(223) 评论(0) 推荐(0)
摘要: You have unweighted tree of nn vertices. You have to assign a positive weight to each edge so that the following condition would hold: For every two d 阅读全文
posted @ 2020-04-15 09:29 XXXSANS 阅读(203) 评论(0) 推荐(0)
摘要: You have array of nn numbers a1,a2,…,ana1,a2,…,an. Rearrange these numbers to satisfy |a1−a2|≤|a2−a3|≤…≤|an−1−an||a1−a2|≤|a2−a3|≤…≤|an−1−an|, where |x 阅读全文
posted @ 2020-04-15 09:17 XXXSANS 阅读(143) 评论(0) 推荐(0)