Submission #2653289

Source Code Expand

n = gets.to_i
N = 100000
memo = [0] * (N+1)
(1..N+1).each do |i|
  a = []
  7.times do |j|
    k = i - 6 ** j
    a << memo[k] if k >= 0
    k = i - 9 ** j
    a << memo[k] if k >= 0
  end
  memo[i] = a.min + 1
end
puts memo[n]

Submission Info

Submission Time
Task C - Strange Bank
User kikunantoka
Language Ruby (2.3.3)
Score 300
Code Size 242 Byte
Status AC
Exec Time 291 ms
Memory 2812 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01.txt AC 278 ms 2812 KiB
02.txt AC 281 ms 2812 KiB
03.txt AC 281 ms 2812 KiB
04.txt AC 281 ms 2812 KiB
05.txt AC 280 ms 2812 KiB
06.txt AC 278 ms 2812 KiB
07.txt AC 279 ms 2812 KiB
08.txt AC 281 ms 2812 KiB
09.txt AC 280 ms 2812 KiB
10.txt AC 291 ms 2812 KiB
11.txt AC 280 ms 2812 KiB
12.txt AC 279 ms 2812 KiB
13.txt AC 291 ms 2812 KiB
14.txt AC 281 ms 2812 KiB
15.txt AC 280 ms 2812 KiB
16.txt AC 279 ms 2812 KiB
sample_01.txt AC 281 ms 2812 KiB
sample_02.txt AC 283 ms 2812 KiB
sample_03.txt AC 280 ms 2812 KiB