同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

21771_Drr1Numbers

2022-5-16 18:20| 发布者: Hocassian| 查看: 31| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-4-89505831983200-Problem List-采集的数据-后羿采集器.html

Pro.ID

21771

Title

Drr1 Numbers

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=21771

AC

Submit

Ratio

100.00%

时间&空间限制

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

描述

A number is a drr1 number if it is a divisor of its right rotation by one digit.

For example, consider the number 102564, its one-digit-right-rotation is 410256, and we have 410256 = 4 * 102564, so it is a drr1 number.

Give you an integer n, what is the sum of all drr1 numbers between 10 and 10ⁿ ?

输入

An integer n, 1 ≤ n ≤ 1000

输出

Description

A number is a drr1 number if it is a divisor of its right rotation by one digit.

For example, consider the number 102564, its one-digit-right-rotation is 410256, and we have 410256 = 4 * 102564, so it is a drr1 number.

Give you an integer n, what is the sum of all drr1 numbers between 10 and 10ⁿ ?

Input

An integer n, 1 ≤ n ≤ 1000

Output

The result mod 100000

Sample Input

2
100

Sample Output

495
59206

Source

2009 Multi-University Training 9

样例输入