CF897B Chtholly's request

    • 38通过
    • 88提交
  • 题目来源 CodeForces 897B
  • 评测方式 RemoteJudge
  • 标签 构造 枚举,暴力
  • 难度 普及/提高-
  • 时空限制 2000ms / 256MB

题解

  • 提示:收藏到任务计划后,可在首页查看。
  • 体验新版界面

    最新讨论 显示

    推荐的相关题目 显示

    题意翻译

    如果一个数字在十进制下没有前导零、长度为偶数且是一个回文数,那么它是一个zcy数

    例如12321和1221是回文数,123和12451不是。 而且,1221是zcy数,12321不是。

    给出整数k , p ,计算出前k小的zcy数的和并输出其模 p 后的结果 Translated by @保登心爱

    题目描述

    — 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!

    输入输出格式

    输入格式:

    The first line contains two integers $ k $ and $ p $ $ (1<=k<=10^{5},1<=p<=10^{9}) $ .

    输出格式:

    Output single integer — answer to the problem.

    输入输出样例

    输入样例#1: 复制
    2 100
    
    输出样例#1: 复制
    33
    
    输入样例#2: 复制
    5 30
    
    输出样例#2: 复制
    15
    

    说明

    In the first example, the smallest zcy number is $ 11 $ , and the second smallest zcy number is $ 22 $ .

    In the second example, .

    提示
    标程仅供做题后或实在无思路时参考。
    请自觉、自律地使用该功能并请对自己的学习负责。
    如果发现恶意抄袭标程,将按照I类违反进行处理。