5714：Chtholly's request（N个偶数位回文串和，小技巧）

5714: Chtholly's request

时间限制: 2 Sec   内存限制: 256 MB
提交: 136   解决: 55
[ 提交][ 状态][ 讨论版][命题人: admin]

题目描述

— 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≤105,1≤p≤109).

输出

Output single integer — answer to the problem.

样例输入

2 100

样例输出

33

提示

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

#include<stdio.h>
int main()
{
    long long x, y, k, p, sum;
    scanf("%lld%lld", &k, &p);
    for(long long i=1; i<=k; i++)
    {    
            x=i;  
            y=i;  
            while(y)
            {  
                x=x*10+y%10;  
                y/=10;  
            }  
            sum=(sum+x)%p;  
    }  
    printf("%lld\n", sum);
    return 0;
}
/**************************************************************
    Problem: 5714
    User: ldu_reserver201701
    Language: C++
    Result: 正确
    Time:8 ms
    Memory:1092 kb
****************************************************************/