Submission #63401930

Source Code Expand

require "prime"

def divisors(n)
  prime_factors = n.prime_division
  divisors = [1]

  prime_factors.each do |prime, exponent|
    new_divisors = []
    (0..exponent).each do |exp|
      power = prime ** exp
      divisors.each do |d|
        new_divisors << d * power
      end
    end
    divisors = new_divisors
  end

  divisors.sort
end

a, b = gets.chomp.split.map(&:to_i)

puts divisors(100).each.any? { [*a..b].include?(_1) } ? "Yes" : "No"

Submission Info

Submission Time
Task B02 - Divisor Check
User Kattsun44
Language Ruby (ruby 3.2.2)
Score 1000
Code Size 450 Byte
Status AC
Exec Time 118 ms
Memory 18200 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 23
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
in01.txt AC 118 ms 18100 KiB
in02.txt AC 56 ms 18080 KiB
in03.txt AC 57 ms 18060 KiB
in04.txt AC 57 ms 18112 KiB
in05.txt AC 57 ms 18172 KiB
in06.txt AC 57 ms 17980 KiB
in07.txt AC 57 ms 18036 KiB
in08.txt AC 57 ms 18096 KiB
in09.txt AC 57 ms 18200 KiB
in10.txt AC 57 ms 18056 KiB
in11.txt AC 56 ms 18088 KiB
in12.txt AC 57 ms 18064 KiB
in13.txt AC 57 ms 18076 KiB
in14.txt AC 56 ms 18056 KiB
in15.txt AC 57 ms 18020 KiB
in16.txt AC 57 ms 17980 KiB
in17.txt AC 57 ms 17992 KiB
in18.txt AC 56 ms 18004 KiB
in19.txt AC 56 ms 18128 KiB
in20.txt AC 57 ms 18096 KiB
in21.txt AC 57 ms 18148 KiB
sample_01.txt AC 57 ms 18140 KiB
sample_02.txt AC 57 ms 18012 KiB