aboutsummaryrefslogtreecommitdiff
path: root/challenge-174/mohammad-anwar/python/ch-1.py
blob: 9bc35c3c6de0d485509d425acc7c299a84990fc6 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#!/usr/bin/python3

'''

Week 174:

    https://theweeklychallenge.org/blog/perl-weekly-challenge-174

Task #1: Disarium Numbers

    Write a script to generate first 19 Disarium Numbers.

'''

import unittest

def is_disarium_number(n):
    _str = str(n)
    _sum = 0
    for i in range(0, len(_str)):
        _sum += int(_str[i]) ** (i + 1)

    return _sum == n

def disarium_numbers(n):
    i  = 0
    dn = []
    while len(dn) < n:
        if is_disarium_number(i):
            dn.append(i)
        i = i + 1

    return dn

#
#
# Unit test class

class TestDisariumNumbers(unittest.TestCase):
    def test_example(self):
        exp = [ 0,1,2,3,4,5,6,7,8,9,89,135,175,518,598,1306,1676,2427,2646798 ]
        got = disarium_numbers(19)
        self.assertEqual(exp, got)

unittest.main()