/*
Euler problem 29
"""
Consider all integer combinations of a^b for 2 <= a <= 5 and 2 <= b <= 5:
2^2=4, 2^3=8, 2^4=16, 2^5=32
3^2=9, 3^3=27, 3^4=81, 3^5=243
4^2=16, 4^3=64, 4^4=256, 4^5=1024
5^2=25, 5^3=125, 5^4=625, 5^5=3125
If they are then placed in numerical order, with any repeats removed, we get the
following sequence of 15 distinct terms:
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
How many distinct terms are in the sequence generated by a^b for
2 <= a <= 100 and 2 <= b <= 100?
"""
This Pop-11 program was created by Hakan Kjellerstrand (hakank@bonetmail.com).
See also my Pop-11 / Poplog page: http://www.hakank.org/poplog/
*/
compile('/home/hakank/Poplib/init.p');
define problem29;
lvars m_min=2, m_max=100;
lvars s = [];
lvars a,b;
lvars hash = newmapping([], 100, 0, true);
for a from m_min to m_max do
for b from m_min to m_max do
lvars val=a**b;
if hash(val) = 0 then
1->hash(val);
endif;
endfor
endfor;
[% explode(hash) %].length=>;
enddefine;
'problem29()'=>
problem29();