2018年7月14日
GCD LCM
摘要： Description The GCD of two positive integers is the largest integer that divides both the integers without any remainder. The LCM of two positive inte 阅读全文
posted @ 2018-07-14 07:59 霜雪千年 阅读(198) 评论(0) 推荐(0)
And Then There Was One （约瑟夫环变形）
摘要： Description Let’s play a stone removing game. Initially, n stones are arranged on a circle and numbered 1, …, n clockwise (Figure 1). You are also giv 阅读全文
posted @ 2018-07-14 00:23 霜雪千年 阅读(447) 评论(0) 推荐(0)