#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int calcScore(vector<pair<int, int>>& inp) //<5,6,10,9> --><10, 9,  >
{
    int res =0;
    //for handle a:
    // b, c
    int checkPair[13]={0}; // A-king, 1-13 0-12 //-1
    int checkFlush[4] ={0}; // 4 suits 0 ,1,2,3
    for(auto item: inp)
    {
      checkPair[item.second-1]++;
      checkFlush[item.first]++;
      if(checkFlush[item.first]==4) 
        res+=4;
    }
    for(auto item: checkPair)
    {
      if(item==2)
        res+=2;
      else if(item==3)
      {
       //c num 2
        res+= 6;      // 2*3; // 3 => 3, 4=>6 (n-1)*(n-2)
      }
      else if(item==4)
      {
        res+=12;     //2*6;
      }   
    }
    for(auto x: inp)
    {
      if(x.second>10) x.second=10;
    }
    for(int i=0; i<inp.size(); i++)
    {
      for(int j=i+1; j<inp.size(); j++)
      {
        if(inp[i].second + inp[j].second>=15)
          res+=2;
      }
    }
    return res;
}
// To execute C++, please define "int main()"
int main() {
  vector<pair<int, int>> inp={
    {0,1},{0,2},{0,3},{0,4}
  };
  cout<<calcScore(inp)<<endl; //=> 4
  
  
  vector<pair<int, int>> inp2={
    {0,8},{1,9},{0,3},{0,7}  //2,2,2
  };
  cout<<calcScore(inp2)<<endl; //=> 4
  
  vector<pair<int, int>> inp3={
    {0,6},{1,6},{2,6},{0,2}  //2,2,2
  };
  cout<<calcScore(inp3)<<endl; //=> 4
  
    
  vector<pair<int, int>> inp4={
    {0,6},{1,6},{2,6},{3,6}  //2,2,2
  };
  cout<<calcScore(inp4)<<endl; //=> 4
  
  return 0;
}

/* 
Your previous Plain Text content is preserved below:

/* 

// Determine the Cribbage score (simplified) for a hand of four cards.
Rules:
# // a) "Fifteen" any 2 cards' values sum to 15 => 2 points
# //        (where value of Jack,Queen,King = 10, Ace = 1).
# // b) "Pair" any two cards with same rank => 2 points. //2,2,2 -> 6
# // c) "flush" all four cards with same suit => 4 points. //1,2,3,4 Hearts 
# // Example: [Jack Hearts, Jack Clubs, 5 Spades, Queen Clubs] ==> 8 pts
# //  2 pts:  Jack Hearts + 5 = 15
# //  2 pts:  Jack Clubs  + 5 = 15
# //  2 pts:  Queen Clubs + 5 = 15
# //  2 pts:  Pair of Jacks)

# Question: Implement a func calcScore that returns the score for a hand of
cards
//input 4.
//c++
//pair<int, int> heart-1, clubs -2.... //<suit, number>
//inp no dup
//[C1 , C2, C3, C4]  = 0+
//checkPair[1,1,1,1,0,0,0...]
 */

class Solution {//
public:
    vector<string> fullJustify(vector<string>& words, int maxWidth) {
        int i, l=0, k=0;
        vector<string> res;
        for(i=0; i<words.size(); i+=k)
        {
            l+=words[i].size();
            //for(k=1; k+i<words.size() && l+k-1+words[i+k].size()<=maxWidth; k++)
            for(k=1; k+i<words.size() && l+k+words[i+k].size()<=maxWidth; k++) //k more than 1
                l+=words[i+k].size();
            //cout<<"i ="<<i<<", k is"<<k<<", l:"<<l<<endl;        
            string temp=words[i];//todo k==0
            for(int j=1; j<k;j++) //from j->k
            {
                if(i+k>=words.size()) temp+=" "+words[i+j];
                else{
                    int space = (maxWidth-l)/(k-1); int extraspace=0;//int space = (maxWidth-l)/(i+k); int extraspace=0;
                    //cout<<"maxWidth: "<<maxWidth<<endl;
                    //cout<<"space is: "<<space<<endl;    
                    extraspace=(maxWidth-l)%(k-1)>=j;//extraspace=(maxWidth-l)%(i+k)>=j;//2
                    temp+=string(space+extraspace,' ')+words[i+j];
                    //cout<<"-"<<temp<<"-"<<endl;
                }
            }
            temp+=string(maxWidth-temp.size(),' ');
            //cout<<endl;
            res.push_back(temp);
            l=0;
        }
        return res;
    }
};
//problem
//k more than 1, 
//k-1=0
//

class Solution{
public:
    vector<int> getMin(vector<float> inp)
    {
        vector<int> res(inp.begin(), inp.end());
        double T =0; int sum=0;
        for(int i=0; i<inp.size(); i++)
        {
            T += inp[i];
            sum += res[i];
        }
        T = round(T);
        int left = T-sum;
        if(left == 0) return res;
        vector<int> resIndex(inp.size());
        iota(resIndex.begin(), resIndex.end(), 0);
        sort(resIndex.begin(), resIndex.end(),
            [res](int a, int b){
                return res[a]>res[b];
            });
        int index=0;
        while(left>0)
        {
            res[resIndex[index++]]++;
            left--;
        }
        return res;
    }
};

#include <iostream>
#include <math.h>
#include <numeric> 

class Solution{
public:
    vector<int> getMin(vector<float> inp)
    {
        vector<int> res(inp.begin(), inp.end());
        double T =0; int sum=0;
        for(int i=0; i<inp.size(); i++)
        {
            T += inp[i];
            sum += res[i];
        }
        cout<<"T is: "<<T<<endl;
        T = round(T);
        cout<<"T is: "<<T<<", and sum is: "<<sum<<endl;
        int left = T-sum;
        if(left == 0) return res;
        vector<int> resIndex(inp.size());
        iota(resIndex.begin(), resIndex.end(), 0);
        sort(resIndex.begin(), resIndex.end(),
            [res](int a, int b){
                return res[a]>res[b];
            });
        int index=0;
        cout<<"Index sort is: ";
        for(auto item: resIndex) cout<<item<<" ";cout<<endl;
        cout<<"left is: "<<left<<endl;
        while(left>0)
        {
            res[resIndex[index++]]++;
            left--;
        }
        return res;
    }
};


int main() {
    vector<float> inp = {1.2, 2.3, 3.4};
    Solution S;
    vector<int> res = S.getMin(inp);
    for(auto x: res) cout<<x<<" ";
    cout<<endl;
}

//aba, aabbaa 


// ["gab", "cat", "Bag", "alpha"] => find(ab) find(ga) ... find(bag)
// => [["gab", "Bag"], ["bag", "gab"]]

//  012
// "gab"  index 0->3 => g, ga, gab
/*
if(is_P(g)) => is_p(ga) X => gab X
{
   hashtable.find(ba) //=> ba gab,  =>bag
}
// "gab"  index 3->0 => b, ab, gab
                  hashtable exist  => ag, X, X => bag
*/
//every lower case
//no dup

// check from beg, end two if

#include <iostream>
#include <unordered_map>
#include <vector>
#include <algorithm>
using namespace std;

class Solution{
public:
  vector<vector<string>> findPPairs(vector<string> words)
  {
    vector<vector<string>> result;
    unordered_map<string, int> dict; // the string, the string's index
    for(int i=0; i<words.size(); i++) dict[words[i]] = i;
    for(int i=0; i<words.size(); i++)
    {
      for(int j=0; j<=(int)words[i].size();j++)
      {
        //check beg
        if(is_p(words[i], j, (int)words[i].size() - 1)) // aaa, aa
        {
          string suffix = words[i].substr(0, j);
          reverse(suffix.begin(), suffix.end());
          if(dict.find(suffix) != dict.end() && i!=dict[suffix])
          {
            vector<string> temp;
            temp.push_back(words[i]);
            temp.push_back(words[dict[suffix]]);
            result.push_back(temp);
          }
            
        }
        //check end
        if(j>0 && is_p(words[i], 0, j-1)) //  aaa, aa 1,2 
        {
          string prefix = words[i].substr(j);
          reverse(prefix.begin(), prefix.end());
          if(dict.find(prefix) != dict.end() && i!=dict[prefix])
          {
            vector<string> temp;
            temp.push_back(words[i]);
            temp.push_back(words[dict[prefix]]);
            result.push_back(temp);
          }
            
        }
      }
    }
    return result;
    
  }
  bool is_p(string s, int start, int end){
    while(start < end)
    {
      if(s[start++]!=s[end--])
        return false;
    }
    return true;
  }
  
}; 

int main() {
  //vector<string> inp ={"gab", "cat", "bag", "alpha"};
  vector<string> inp = {"gab", "cat", "bag", "alpha", "nurses", "race", "car", "run"};
  Solution s;
  vector<vector<string>> res = s.findPPairs(inp);
  for(auto item: res)
  {
    for(auto x: item)
      cout<<x<<" ";
    cout<<endl;
  }
  
  return 0;
}