
acm
文章平均质量分 67
canhong121
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
果实计数
题目描述 淘淘家有棵奇怪的苹果树,这棵树共有n+1层,标号为0~n。这棵树第0层只有一个节点,为根节点。已知这棵树为b叉树,且保证是一颗满b叉树。如图为一颗满3叉树。 现在,该树第n层的每个节点上都结出了一个苹果,淘淘想知道共结了多少苹果。由于数量可能很大,答案要求输出mod k后的结果。 输入 给出第1层的节点数b和层数n和k. 输出 输出苹果数mod k后的结果。 ...原创 2018-07-25 09:31:39 · 420 阅读 · 0 评论 -
Coloring Dominoes
题目描述 We have a board with a 2×N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1×2 or 2×1 square. Then, Snuke decided to paint these dominoes using three c...转载 2018-07-31 09:25:08 · 315 阅读 · 0 评论 -
Find Integer
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1453 Accepted Submission(s): 479Special Judge Problem Description people in U...原创 2018-08-29 10:48:54 · 267 阅读 · 0 评论 -
Characters with Hash
Mur loves hash algorithm, and he sometimes encrypt another one's name, and call him with that encrypted value. For instance, he calls Kimura KMR, and calls Suzuki YJSNPI. One day he read a book about ...原创 2018-09-10 20:25:30 · 265 阅读 · 0 评论 -
Features Track
Morgana is learning computer vision, and he likes cats, too. One day he wants to find the cat movement from a cat video. To do this, he extracts cat features in each frame. A cat feature is a two-dime...原创 2018-09-14 12:33:46 · 312 阅读 · 0 评论