aboutsummaryrefslogtreecommitdiff
path: root/challenge-283/pokgopun/python/ch-2.py
blob: b3dc4a444c1210aae165ee28cb0e2ed771aa6476 (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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
### https://theweeklychallenge.org/blog/perl-weekly-challenge-283/
"""

Task 2: Digit Count Value

Submitted by: [46]Mohammad Sajid Anwar
     __________________________________________________________________

   You are given an array of positive integers, @ints.

   Write a script to return true if for every index i in the range 0 <= i
   < size of array, the digit i occurs exactly the $ints[$i] times in the
   given array otherwise return false.

Example 1

Input: @ints = (1, 2, 1, 0)
Ouput: true

$ints[0] = 1, the digit 0 occurs exactly 1 time.
$ints[1] = 2, the digit 1 occurs exactly 2 times.
$ints[2] = 1, the digit 2 occurs exactly 1 time.
$ints[3] = 0, the digit 3 occurs 0 time.

Example 2

Input: @ints = (0, 3, 0)
Ouput: false

$ints[0] = 0, the digit 0 occurs 2 times rather than 0 time.
$ints[1] = 3, the digit 1 occurs 0 time rather than 3 times.
$ints[2] = 0, the digit 2 occurs exactly 0 time.
     __________________________________________________________________

   Last date to submit the solution 23:59 (UK Time) Sunday 25th August
   2024.
     __________________________________________________________________

SO WHAT DO YOU THINK ?
"""
### solution by pokgopun@gmail.com

def dcv(ints):
    for i in range(len(ints)):
        if ints.count(i) != ints[i]:
            return False
    return True

import unittest

class TetDcv(unittest.TestCase):
    def test(self):
        for inpt, otpt in {
                (1, 2, 1, 0): True,
                (0, 3, 0): False,
                }.items():
            self.assertEqual(dcv(inpt),otpt)

unittest.main()