F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Drr1 Numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 161    Accepted Submission(s): 55


Problem 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^n?
 

Input
An integer n, 1 <= n <= 1000
 

Output
The result mod 100000
 

Sample Input
2 100
 

Sample Output
495 59206
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-31 06:01:54, Gzip enabled