摘要：
Problem Description Give you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell meHow many kinds of necklaces total have.(i 阅读全文
posted @ 2019-08-15 19:32
明霞
阅读(189)
评论(0)
推荐(0)
摘要：
Problem Description For a positive integer n, let's denote function f(n,m) as the m-th smallest integer x that x>n and gcd(x,n)=1. For example, f(5,1) 阅读全文
posted @ 2019-08-15 16:14
明霞
阅读(199)
评论(0)
推荐(0)
摘要：
Problem Description In computer science, a heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies 阅读全文
posted @ 2019-08-15 13:18
明霞
阅读(261)
评论(0)
推荐(0)
摘要：
链接：https://ac.nowcoder.com/acm/contest/887/A来源：牛客网 题目描述 A string is perfect if it has the smallest lexicographical ordering among its cyclic rotations 阅读全文
posted @ 2019-08-15 09:25
明霞
阅读(230)
评论(0)
推荐(0)
浙公网安备 33010602011771号