— 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 ≤ 105, 1 ≤ p ≤ 109).
OutputOutput single integer — answer to the problem.
Examples2 100
33
5 30
15
In the first example, the smallest zcy number is 11, and the second smallest zcy number is 22.
In the second example, .
题意:求前n个zcy数的和,并对m取模,zcy数是回文字符串,并且长度为偶数思路:第一个zcy数11,第二个是22........第10个1001,第11个是1111,第12个是1221,
可以看出第x个zcy数是 将x看成字符串,x+x的倒序
直接暴力求解即可,注意用long long~~
#include<cstdio>
#include<cstring>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
string zcy(int n){
string str="";
while(n){
str+=(n%10+'0');
n/=10;
}
string s=str;
reverse(str.begin(),str.end());
return str+s;
}
int main(){
int n,m;
cin>>n>>m;
ll sum=0;
for(int i=1;i<=n;i++){
string str=zcy(i);
ll ans=0;
int len=str.length();
for(int j=0;j<len;j++){
int k=str[j]-'0';
ans=(ans*10+k)%m;
}
sum=(ans+sum)%m;
}
cout<<sum<<endl;
return 0;
}