这篇博客介绍了如何帮助Ada用有限的柱子建造不同形状的k边形围栏。输入包含测试用例数量、柱子位置数和围栏边数，以及每个柱子间弧长。输出是可行的不同k边形围栏的数量。题目强调了不同围栏的定义并给出了示例输入输出。
ADAFENCE - Ada and Fence
Ada the Ladybug owns a circular land. She wants to enclose it with fence. Anyway since nobody sells round planks, she has decided to fence it to shape of regular k-gon. Problem is, that there is only limited number or places (on circle) where pilars can be built. Ada has asked you, to find out the number of different regular k-gon shaped fences which can be built on her land (two k-gon's are considered different if they share NO common pillar).
Input
The first line will contain T, the number of test-cases.
Then T test-cases follow, each beginning with two integers 3 ≤ K ≤ N ≤ 105, 3 ≤ K ≤ 100,
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
