RNA secondary structure(Dynamic Programming)

//
//  main.cpp
//  RNA
//
//  Created by Longxiang Lyu on 6/1/16.
//  Copyright (c) 2016 Longxiang Lyu. All rights reserved.
//

#include <iostream>
#include <string>
#include <vector>

using namespace std;

bool complement(char c1, char c2)
{
    return  (c1 == 'A' && c2 == 'U') ||
            (c1 == 'U' && c2 == 'A') ||
            (c1 == 'C' && c2 == 'G') ||
            (c1 == 'G' && c2 == 'C');
}

void findSolution(const vector<vector<int>> &M, int i, int j, vector<pair<int, int>> &pairs)
{
    for (int t = i; t < j - 4; ++t)
    {
        if (M[i][j] == 1 + M[i][t - 1] + M[t + 1][j - 1])
        {
            pairs.push_back({t, j});
            findSolution(M, i, t - 1, pairs);
            findSolution(M, t