Community Dashboard

DigIT

Practice

3.8 (60 votes)

Dynamic programming

Combinatorics

Hard

Number theory

Brute Force search

Open

Approved

Problem

86% Success 4874 Attempts 50 Points 5s Time Limit 512MB Memory 1024 KB Max Code

This problem is as simple as short. Just find how many numbers from A to B with sum of digits from X to Y are divisible by K . Input The first line contains 5 space-separated positive integers: A, B, X, Y, K Output Output one number - answer for the question. Constraints 0 < A, B, K \leq 10 13 0 < X, Y \leq 1000 A \leq B 0 < A, B, \leq 10 7 in 32 % of the test data

You need to be logged in to access the code editor

Please wait while we load the editor

Results

Custom Input

Run your code to see the output

Submissions

Please login to view your submissions