Self descripting number solver

brute_force_solver.py

if __name__ == '__main__':
    try:
        for i in range(10000000000):
            tmp = i
            counts = [0,0,0,0,0,0,0,0,0,0]
            numbers = []
            for x in range(10):
                n = tmp % 10
                numbers.append(n)
                counts[n] += 1
                tmp = tmp//10

            found = True
            for x in range(10):
                if numbers[9-x] != counts[x]:
                    found = False
                    break;
            if found:
                print(i)
    except KeyboardInterrupt:
        print("got to %i" % i)