【ACM】Chtholly's request （codeforces 897B）

最新推荐文章于 2019-12-06 22:36:33 发布

dmystery

最新推荐文章于 2019-12-06 22:36:33 发布

阅读量201

点赞数

分类专栏： ACM题解

本文链接：https://blog.csdn.net/dmystery/article/details/79210231

版权

博客内容涉及ACM竞赛中的一道题目，要求找出k个最小的‘zcy数’（偶数长度且回文的数字）并求它们的和，模p后输出结果。思路是预处理生成前k个偶数回文数，并举例说明如何将数字转化为回文形式。

摘要由CSDN通过智能技术生成

题面：
— Thanks a lot for today.
— I experienced so many great things.
— You gave me memories like dreams… But I have to leave now…
— One last request, can you…
— Help me solve a Codeforces problem?
— ……
— What?
Chtholly has been thinking about a problem for days:
If a number is palindrome and length of its decimal representation without leading zeros is even, we call it a zcy number. A number is palindrome means when written in decimal representation, it contains no leading zeros and reads the same forwards and backwards. For example 12321 and 1221 are palindromes and 123 and 12451 are not. Moreover, 1221 is zcy number and 12321 is not.
Given integers k and p, calculate the sum of the k smallest zcy numbers and output this sum modulo p.
Unfortunately, Willem isn’t good at solving this kind of problems, so he asks you for help!
Input
The first line contains two integers k and p (1 ≤ k ≤ 10