Submission #713415

Source Code Expand

function main()
    K, M = io.read "n", io.read "n"
    local count = 0
    for N = 1, M do
        local c = 0
        local n = N
        while n > 0 do
            c = c + n % 10
            n = n // 10
        end 
        if N == c or N % K == c % K then
            count = count + 1
        end
    end
    print(count)
end

main()

Submission Info

Submission Time
Task D - 9
User bovini
Language Lua (5.3.2)
Score 10
Code Size 357 Byte
Status TLE
Exec Time 2105 ms
Memory 760 KiB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 10 / 10 0 / 90
Status
AC × 2
TLE × 2
AC × 21
AC × 21
TLE × 31
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt
Case Name Status Exec Time Memory
sample_01.txt AC 144 ms 760 KiB
sample_02.txt AC 24 ms 256 KiB
sample_03.txt TLE 2101 ms 256 KiB
sample_04.txt TLE 2101 ms 256 KiB
subtask1_01.txt AC 69 ms 256 KiB
subtask1_02.txt AC 38 ms 256 KiB
subtask1_03.txt AC 11 ms 256 KiB
subtask1_04.txt AC 20 ms 256 KiB
subtask1_05.txt AC 23 ms 256 KiB
subtask1_06.txt AC 50 ms 256 KiB
subtask1_07.txt AC 47 ms 256 KiB
subtask1_08.txt AC 8 ms 256 KiB
subtask1_09.txt AC 17 ms 256 KiB
subtask1_10.txt AC 56 ms 256 KiB
subtask1_11.txt AC 60 ms 256 KiB
subtask1_12.txt AC 59 ms 256 KiB
subtask1_13.txt AC 69 ms 256 KiB
subtask1_14.txt AC 45 ms 256 KiB
subtask1_15.txt AC 66 ms 256 KiB
subtask1_16.txt AC 48 ms 256 KiB
subtask1_17.txt AC 51 ms 256 KiB
subtask1_18.txt AC 68 ms 256 KiB
subtask1_19.txt AC 45 ms 256 KiB
subtask2_01.txt TLE 2101 ms 256 KiB
subtask2_02.txt TLE 2101 ms 256 KiB
subtask2_03.txt TLE 2101 ms 256 KiB
subtask2_04.txt TLE 2105 ms 256 KiB
subtask2_05.txt TLE 2104 ms 256 KiB
subtask2_06.txt TLE 2105 ms 256 KiB
subtask2_07.txt TLE 2101 ms 256 KiB
subtask2_08.txt TLE 2105 ms 256 KiB
subtask2_09.txt TLE 2101 ms 256 KiB
subtask2_10.txt TLE 2104 ms 256 KiB
subtask2_11.txt TLE 2105 ms 256 KiB
subtask2_12.txt TLE 2101 ms 256 KiB
subtask2_13.txt TLE 2105 ms 256 KiB
subtask2_14.txt TLE 2105 ms 256 KiB
subtask2_15.txt TLE 2105 ms 256 KiB
subtask2_16.txt TLE 2105 ms 256 KiB
subtask2_17.txt TLE 2105 ms 256 KiB
subtask2_18.txt TLE 2105 ms 256 KiB
subtask2_19.txt TLE 2105 ms 256 KiB
subtask2_20.txt TLE 2105 ms 256 KiB
subtask2_21.txt TLE 2104 ms 256 KiB
subtask2_22.txt TLE 2104 ms 256 KiB
subtask2_23.txt TLE 2101 ms 256 KiB
subtask2_24.txt TLE 2101 ms 256 KiB
subtask2_25.txt TLE 2105 ms 256 KiB
subtask2_26.txt TLE 2105 ms 256 KiB
subtask2_27.txt TLE 2101 ms 256 KiB
subtask2_28.txt TLE 2101 ms 256 KiB
subtask2_29.txt TLE 2104 ms 256 KiB