Chtholly's request (思维)
来源:互联网 发布:数字最优化的方法 编辑:程序博客网 时间:2024/06/14 21:41
— 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 ispalindrome means when written in decimal representation, it contains no leading zeros and reads the same forwards and backwards. For example12321 and 1221 are palindromes and 123 and 12451 are not. Moreover, 1221 is zcy number and12321 is not.
Given integers k and p, calculate the sum of the k smallest zcy numbers and output this sum modulop.
Unfortunately, Willem isn't good at solving this kind of problems, so he asks you for help!
The first line contains two integers k andp (1 ≤ k ≤ 105, 1 ≤ p ≤ 109).
Output single integer — answer to the problem.
2 100
33
5 30
15
In the first example, the smallest zcy number is 11, and the second smallest zcy number is22.
In the second example, .
题意:前K个长度为偶数的回文数相加%p;
思路:长度为偶数,那么每个数对称一下都是符合要求的回文数
AC代码:
#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>#include<queue>using namespace std;int k,p;long long zcy[100005];void init(){ int cnt=0; for(int i=1;i<=100000;i++) { long long tmp=i; int p=i; while(p){ tmp=tmp*10+p%10; p/=10; } zcy[++cnt]=tmp; }}int main(){ init(); while(~scanf("%d%d",&k,&p)) { long long sum=0; for(int i=1;i<=k;i++){ sum+=zcy[i]; sum%=p; } printf("%lld\n",sum); } return 0;}
- Chtholly's request (思维)
- Codeforces Round #449 (Div. 2) B. Chtholly's request (思维
- Codeforces897B-Chtholly's request
- Codeforces897B Chtholly's request
- Codeforces897B Chtholly's request
- B. Chtholly's request
- cf-Chtholly's request(水)
- CF897B——Chtholly's request(关于回文数)
- CF-897B.Chtholly's request
- Codeforces Round #449 (Div. 2) B Chtholly's request (预处理)
- CF Round# 449 Div2 B. Chtholly's request
- Codeforces Round #449 (Div. 2) B. Chtholly's request
- Codeforces Round #449 (Div. 2) 897B. Chtholly's request
- 周赛的题目—Chtholly's request
- Codeforces Round #449 (Div. 2) B. Chtholly's request
- [easy]CodeForces-897B Chtholly's request 模拟/找规律
- codeforces 897 B. Chtholly's request【构造回文数+递推】
- HDOJ 4883 TIANKENG’s restaurant(思维)
- 欢迎使用CSDN-markdown编辑器
- R中关于包的操作
- CSS 选择符有哪些?哪些属性可以继承?优先级算法如何计算? CSS3新增伪类有那些?
- Lua中面向对象之new的传参方式
- 二哥OJ 1051-1250
- Chtholly's request (思维)
- 以 XXXXdigYYMMdd.txt的形式在手机文件目录下新建文件
- python中进程、线程的浅谈
- python TypeError: xx() got multiple values for argument 'x'
- java并发---BlockingQueue
- 【Java】读取其下所有文件夹与文件的路径
- Java基础知识小计 二,JAVA的三大特性【封装,继承,多态】
- java获取当前类的绝对路径
- 1043. 输出PATest(20)