
----最小表示法
_Occult_
物語が始まった
展开
-
HDU 3374 String Problem
Problem Description Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate seven strings: String Rank SKYLONG原创 2015-04-29 20:48:30 · 453 阅读 · 0 评论 -
HDU 5442 Favorite Donut
Problem Description Lulu has a sweet tooth. Her favorite food is ring donut. Everyday she buys a ring donut from the same bakery. A ring donut is consists of n parts. Every part has its own sugar原创 2015-09-16 13:35:15 · 495 阅读 · 0 评论