aboutsummaryrefslogtreecommitdiff
path: root/challenge-257/pokgopun/python/ch-1.py
blob: 895ac3857bd1e011334eca9714447ed90d549741 (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
60
### https://theweeklychallenge.org/blog/perl-weekly-challenge-257/
"""

Task 1: Smaller than Current

Submitted by: [44]Mohammad Sajid Anwar
     __________________________________________________________________

   You are given a array of integers, @ints.

   Write a script to find out how many integers are smaller than current
   i.e. foreach ints[i], count ints[j] < ints[i] where i != j.

Example 1

Input: @ints = (5, 2, 1, 6)
Output: (2, 1, 0, 3)

For $ints[0] = 5, there are two integers (2,1) smaller than 5.
For $ints[1] = 2, there is one integer (1) smaller than 2.
For $ints[2] = 1, there is none integer smaller than 1.
For $ints[3] = 6, there are three integers (5,2,1) smaller than 6.

Example 2

Input: @ints = (1, 2, 0, 3)
Output: (1, 2, 0, 3)

Example 3

Input: @ints = (0, 1)
Output: (0, 1)

Example 4

Input: @ints = (9, 4, 9, 2)
Output: (2, 1, 2, 0)

Task 2: Reduced Row Echelon
"""
### solution by pokgopun@gmail.com

def stc(tup: tuple):
    return tuple(
            sum(x < y for x in tup) for y in tup
            )

import unittest

class TestStc(unittest.TestCase):
    def test(self):
        for inpt,otpt in {
                (5, 2, 1, 6): (2, 1, 0, 3),
                (1, 2, 0, 3): (1, 2, 0, 3),
                (0, 1): (0, 1),
                (9, 4, 9, 2): (2, 1, 2, 0),
                }.items():
            self.assertEqual(stc(inpt),otpt)

unittest.main()