Ruby script to compute G.C.D. with Euclid's algorithm.

gcd_euclid.rb

#! /usr/local/bin/ruby
# ********************************************
#  ユークリッドの互除法（再帰的に求める方法） 
# ********************************************

class Calc
  def calc_gcd(a,  b)
    return b == 0 ? a : calc_gcd(b, a % b);
  end
end

begin
  print "１つ目の自然数："
  a = gets.chomp.to_i
  print "２つ目の自然数："
  b = gets.chomp.to_i
  puts "a = #{a}, b = #{b}"
  obj_calc =Calc.new
  puts "最大公約数 = #{obj_calc.calc_gcd(a, b)}"
rescue => e
  $stderr.puts "例外発生！"
end