Accepted solution

490A - Team Olympiad

Open original problem
Source code

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<map>

#include<algorithm>

/***** S. M. Sabiul Hajjaj Sabit *****/

using namespace std;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

    {

        pow *= a;

    }

    return pow;

}

///*********Write Code From Here*********///

int main()

{

    int n;

    vector<int>arr;

    int a=0,b=0,c=0;

    cin>>n;

    for(int i=0; i<n; i++)

    {

        int t;

        cin>>t;

        if(t==1) a++;

        else if(t==2) b++;

        else c++;

        arr.push_back(t);

    }

    int m = min(a,b);

    int m1 =min(m,c);

    cout<<m1<<endl;

    for(int i=0; i<m1; i++)

    {

        for(int j=0; j<n; j++)

        {

            if(arr[j]==1)

            {

                cout<<j+1<<" ";

                arr[j]=0;

                break;

            }

        }

        for(int j=0; j<n; j++)

        {

            if(arr[j]==2)

            {

                cout<<j+1<<" ";

                arr[j]=0;

                break;

            }

        }

        for(int j=0; j<n; j++)

        {

            if(arr[j]==3)

            {

                cout<<j+1<<endl;

                arr[j]=0;

                break;

            }

        }

    }

}
Join the discussion

Add your comment