2019年5月8日
2018CCPC桂林站G Greatest Common Divisor
摘要： 题目描述 There is an array of length n, containing only positive numbers.Now you can add all numbers by 1 many times. Please find out the minimum times yo 阅读全文
posted @ 2019-05-08 19:54 新之守护者 阅读(410) 评论(0) 推荐(0) 编辑