[easy]CodeForces-897B Chtholly's request 模拟/找规律
来源:互联网 发布:香港房价数据库 编辑:程序博客网 时间:2024/05/17 21:52
题目链接:
http://codeforces.com/problemset/problem/897/B
Description:
— 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 ≤ 105, 1 ≤ p ≤ 109).
Output
Output single integer — answer to the problem.
Example
Input
2 100
Output
33Input
5 30
Output
15
Note
In the first example, the smallest zcy number is 11, and the second smallest zcy number is 22.
In the second example, (11+22+33+44+55)mod 30 = 15.
- 题意
- 求从1开始数前k个的长度为偶数的回文串的和,对p取模
- 分析
- 这题据说可以找规律,不过看到题目数据范围觉得直接模拟就可以,利用回文数的特征,直接枚举1-1e5范围的整数,然后倒着做找出它的回文另一半,记录一下前缀和即可。
例如:通过234->234432
Code:
#include <bits/stdc++.h>using namespace std;typedef long long LL;const int maxn = 1e5 + 5;LL sum[maxn];int rec[25];void Init(){ for(int i = 1;i <= 100000;i++) { int p = 0,tmp = i; while(tmp > 0){ rec[p] = tmp % 10; tmp/=10; p++; } for(int i = p;i <= 2*p-1;i++) rec[i] = rec[i - p]; for(int i = 0;i < p;i++){ rec[i] = rec[2 * p - 1 - i]; } LL ans = 0; for(int i = 0;i < 2*p;i++){ ans *= 10; ans += rec[i]; } sum[i] = sum[i - 1] + ans; }}int main(){ Init(); int k,p; scanf("%d%d",&k,&p); printf("%lld\n",sum[k]%p); return 0;}
- [easy]CodeForces-897B Chtholly's request 模拟/找规律
- Codeforces Round #449 (Div. 2) 897B. Chtholly's request
- B. Chtholly's request
- CF-897B.Chtholly's request
- Codeforces Round #449 (Div. 2) B. Chtholly's request
- Codeforces Round #449 (Div. 2) B. Chtholly's request (思维
- Codeforces Round #449 (Div. 2) B. Chtholly's request
- codeforces 897 B. Chtholly's request【构造回文数+递推】
- Codeforces Round #449 (Div. 2) B Chtholly's request (预处理)
- Codeforces897B-Chtholly's request
- Codeforces897B Chtholly's request
- Codeforces897B Chtholly's request
- CF Round# 449 Div2 B. Chtholly's request
- Codeforces 608B 找规律
- CodeForces 618B (找规律)
- cf-Chtholly's request(水)
- Chtholly's request (思维)
- CodeForces 248B - Chilly Willy - 找规律
- Android 开源日志库 Logger 使用教程
- 一文搞懂SPP(Spatial pyramid pooling)
- 为什么很多人说 Java 不适合编写桌面应用?
- 前端HTML基础知识(2)
- Linux下编译安装Perl6 Rakudo
- [easy]CodeForces-897B Chtholly's request 模拟/找规律
- 【OSGI】1.初识OSGI-到底什么是OSGI
- Intellij从无到有创建项目:梳理web项目各目录及配置作用
- Unity属性——AddComponentMenu
- Sqlmap中文手册
- git rm简介
- Unity3D-关于UnityIAP1.50.0在5.6.4f1版本中使用时出现自动购买问题
- 进程调度API之wake_up_process
- 安装typecho时报错:对不起,无法连接数据库,请先检查数据库配置再继续进行安装