SRM465 Div2 Easy(250) NumberNeighbours

NumberNeighbours

#include <vector>
#include <algorithm>

using namespace std;

class NumberNeighbours
{
public:
    int numPairs( vector <int> numbers );
};

int NumberNeighbours::numPairs( vector <int> numbers )
{
    int n = (int)numbers.size();

    vector<vector<int> > normal( n );

    for ( int i=0; i<n; i++ )
    {
        while ( numbers[i] != 0 )
        {
            if ( numbers[i] % 10 != 0 )
                normal[i].push_back( numbers[i] % 10 );
            numbers[i] /= 10;
        }

        sort( normal[i].begin(), normal[i].end() );
    }

    int c = 0;

    for ( int i=0; i<n; i++ )
        for ( int j=i+1; j<n; j++ )
            if ( normal[i] == normal[j] )
                c++;

    return c;
}