#!/usr/bin/env python3

########################################################################
#   Solves problem 29 from projectEuler.net.
#   Finds the amount of distinct numbers formed by pow(a,b) where
#   a and b are between 2 and 100 inclusive.
#   Copyright (C) 2010  Santiago Alessandri
#
#   This program is free software: you can redistribute it and/or modify
#   it under the terms of the GNU General Public License as published by
#   the Free Software Foundation, either version 3 of the License, or
#   (at your option) any later version.
#
#   This program is distributed in the hope that it will be useful,
#   but WITHOUT ANY WARRANTY; without even the implied warranty of
#   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
#   GNU General Public License for more details.
#
#   You should have received a copy of the GNU General Public License
#   along with this program.  If not, see <http://www.gnu.org/licenses/>.
#    
#   You can contact me at san.lt.ss@gmail.com
#   Visit my wiki at http://san-ss.wikidot.com
########################################################################

if __name__ == '__main__':
    result = set()
    for a in range(2,100+1):
        for b in range(2, 100+1):
            num = a ** b
            result.add(num)
    print("The result is:", len(result))