project-euler/Sidef/029 Distinct powers.sf

#!/usr/bin/ruby

# Daniel "Trizen" Șuteu
# Edited: 05 November 2017
# https://github.com/trizen

# How many distinct terms are in the sequence generated by a^b for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?

# https://projecteuler.net/problem=29

# Runtime: 0.224s

var seen = Hash()

for a in (2..100) {
    for b in (2..100) {
        seen{a**b} = true
    }
}

say seen.keys.len