490A - Team Olympiad - CodeForces Solution


greedy implementation sortings *800

Please click on ads to support us..

Python Code:

if __name__ == '__main__':
    n = int(input())
    x = input().split()
    li = [int(i) for i in x]
    m1 = 0
    m2 = 0
    m3 = 0

    for i in li:
        if i == 1:
            m1 += 1
        elif i == 2:
            m2 += 1
        else:
            m3 += 1
    count = min(m1, m2, m3)

    if count == 0:
        print(0)
    else:
        l1 = []
        l2 = []
        l3 = []
        for i in range(0, len(li)):
            if li[i] == 1:
                l1.append(i + 1)
            elif li[i] == 2:
                l2.append(i + 1)
            else:
                l3.append(i + 1)

        print(count)
        for i in range(0, count):
            print(l1[i], l2[i], l3[i])


Comments

Submit
0 Comments
More Questions

148A - Insomnia cure
1650A - Deletions of Two Adjacent Letters
1512A - Spy Detected
282A - Bit++
69A - Young Physicist
1651A - Playoff
734A - Anton and Danik
1300B - Assigning to Classes
1647A - Madoka and Math Dad
710A - King Moves
1131A - Sea Battle
118A - String Task
236A - Boy or Girl
271A - Beautiful Year
520B - Two Buttons
231A - Team
479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets
96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters