//*** CODE ***
/*
Online Java - IDE, Code Editor, Compiler
Online Java is a quick and easy tool that helps you to build, compile, test your programs
online.
*/
// This has been created to ensure I can utilize any random functions more efficiently.
// It is a creation of the permutations (with replacement) calculator.

//TEST CASES
// All done, see documentation
//Since there are not multiple instantiations similar to combinations when r varied,
//I can safely reduce all variables without static

import java.math.*;
import java.util.*;

class Staircase
{
    Object possibleMappingFirst;
    Object possibleMappingSecond;
    long permutations;
    StringJoiner sj;
    int num;
    
    int cycles=0;
    int totalcycles=0;
    int difference = 0;
    int i=0;
    int rMin;
    int rMax;
    List <String> backupValuesSet = new ArrayList<>();
    
    Set<Integer,String> possibleLetters;
    Set<Integer, String> mp;
    Random rand = new Random();
    String[] valuesSet; 
    String []backupValuesSetBeforeModification;
    
    
    public Staircase(long permutations, Set<Integer,String> mp, Set<String> possibleLetters, int rMin, int rMax, Object possibleMappingFirst, Object possibleMappingSecond)
    {
        this.permutations=permutations;
        this.mp=mp;
        this.possibleLetters=possibleLetters;
        this.rMin=rMin;
        this.rMax=rMax;
        this.possibleMappingFirst;
        this.possibleMappingSecond;
        
        sj = new StringJoiner(",");
        boolean invalidIndex=false;
        
        int currentSetSize=0;
        int newSetSize;
        int stepsCounter=0;
        int subsetNumber=1;
        int steps;
        String subsetIntToString="";
        int pos=0;
        int n=0;
       
        System.out.println("*************INITIAL VALUE OF  CYCLES: " + cycles);
        
        do
        {
            stepStore = new int[rMax];
            
            for (int q=rMin; q<rMax;q++)
            {
                if (invalidIndex)
                {
                    sj=new StringJoiner(",");
                    invalidIndex=false;
                    stepsCounter=0;
                    num=0;
                }
                temp1 = rand.nextInt(possibleLetters.size()) + 1;      //this should get random number between
                
                System.out.println("this is random number: " + temp1);
                
                String firstScenarioMapping  = Object.toString(possibleLetters.get(temp1)); 
                String secondScenarioMapping = firstScenarioMapping+Object.toString(possibleMappingFirst);
                
                if (q==0)
            {
                
                if (firstScenarioMapping.equals(possibleMappingFirst)  || secondScenarioMapping.equals(possibleMappingSecond))
                {
                    //here we need to really fill the mapping directly into
                    mapping = firstScenarioMapping;
                    stepsCounter++;
                }
            }
                
                
                else
                {
                    invalidIndex=true;
                    break;
                }
                
                steps = X[p];
                sj.add(Integer.toString(X[p]));
                stepStore[num]=steps;
                num++;
                currentSetSize=st.size();
                
                
            }   //end of for (int q=0; q<r;q++)
            
            newSetSize = st.size();
            cycles++;
            totalcycles++;
        }while (cycles<permutations*400);

        valuesSet = st.toArray(new String[st.size()]);
        backupValuesSetBeforeModification = st.toArray(new String[st.size()]);
        
        System.out.println("******************Contents of the backup set");
        System.out.println("******************Contents of the valuesSet");
        
        for (String g: valuesSet)
        {
            System.out.println("Subset " + subsetNumber+": " + g);
            subsetNumber++;
        }
        
        subsetNumber=1;
        
        for (String m: backupValuesSet)
        {
            n=0;
            do
            {
                if (m==valuesSet[n])
                {
                }
                
                n++;
                
            }while (n<valuesSet.length);
            
        }  //end for processing backupValuesSet
        
        System.out.println("*************NEW VALUE CYCLES: " + cycles);
        System.out.println("*************RUNNING TOTAL CYCLES: " + totalcycles);
        
        System.out.println("***PROCESSING SET AT INDEX: " + (difference));
        System.out.println("**ENDING AT INDEX:***** " + st.size() +"\n");
        
        backupValuesSet= new ArrayList<>(Arrays.asList(backupValuesSetBeforeModification)); 
        
        for (int entry=0; entry<valuesSet.length; entry++)
        {
            if (valuesSet[entry]!="ALREADY PROCESSED")
            {
                System.out.println(valuesSet[entry] + "    Subset: " + subsetEntry  + "  at cycle number: " + totalcycles);
                subsetEntry++;
            
                //MAIN LOGIC OF THE NEW CODE OFFICIALLY STARTS HERE.
                obtainMoves(valuesSet[entry]);
            }
        }
        difference = newSetSize;
    }  //end of constructor...
        
    public void obtainMoves(String moves)
    {
        int[] nMoves = new int [r];
        int i=0;
        StringTokenizer sTok = new StringTokenizer(moves,",");
        
        while (sTok.hasMoreTokens())
        {
            temp=sTok.nextToken();
            nMoves[i]= Integer.valueOf(temp);
            i++;
        }
        performMoves(nMoves);
    }
        
    public void performMoves(int[] nMoves)
    {
        int total=0;
        
        for (int j=0; j<triangle[0].length; j++)
        {
            System.out.println("TRIANGLE " + (j));
            
            for (int k: nMoves)
            {
                try
                {
                    System.out.println("Elements in: " +  "row " + i + " of triangle:  " + triangle[i][j].length);
                }
                catch (ArrayIndexOutOfBoundsException e)
                {
                    System.out.println("There are no elements in row: " + i + " on this triangle");
                    System.exit(0);
                }
                
                if ((triangle[i][j].length)>i+1)
                {
                    System.out.println("Ensure correct triangle configuration.");
                    System.exit(0);
                }
                try
                {
                    System.out.println("Value at triangle: " + j + "  [" + i +  "]" + "[" +j + "]" + "[" +k + "]" + ":  "  + triangle[i][j][k]);
                }
                catch (ArrayIndexOutOfBoundsException e)
                {
                    System.out.println("Ensure correct triangle configuration.");
                    System.exit(0);
                }
                total=triangle[i][j][k] + total;
                indexesTriangle.add("["+ Integer.toString(i)+"]" + "["+ Integer.toString(j)+"]" + "["+ Integer.toString(k)+"]" );
                valuesTriangle.add(Integer.toString(triangle[i][j][k]));
                
                i++;  //increments the row
            }//end for nMoves
            
            i=0;
            System.out.println("*******TOTAL: " + total +"\n");
            processedMax=false;
            outcome = "Triangle: " + j +  " | Subset:" + (subsetEntry-1) + " " +"(" + valuesTriangle + ")" + " (Indexes: " + indexesTriangle +")" +" | " +  "Max value: " + total;
            valuesTriangle = new StringJoiner(",");
            indexesTriangle= new StringJoiner(",");
            
            if (total>max[j])
            {
                max[j]=total;
                int index=0;
                
                do
                {
                    outcomes[j][index]=null;
                    index++;
                    
                }while (index<permutations);
                
                index=0;
                outcomes[j][0]=outcome;
                count++;
                processedMax=true;
            }  //end of (total>max[j])
            
            if (total==max[j] && !processedMax)
            {
                outcomes[j][count] = outcome;
                max[j]=total;
                count++;
            }
            valuesTriangle=new StringJoiner(",");
            total=0;
            
            }//end for  (processing triangles)
            
            for (int c: max)
            {
                System.out.println("Highest total " + "triangle(" + triangleNumber+")" + "is: " + max[triangleNumber]);
                triangleNumber++;
            }
            System.out.println("-----------------------------------\n");
            
            triangleNumber=0;
    }  //end of method
} //end of class.

public class Permutation
{
    
    public static void main(String[] args) 
    {
        System.out.println("Welcome to Online IDE!! Happy Coding :)");
        
        Map <Integer,String> mp = new HashMap<Integer,String>();
        Map <Integer, String> possibleLetters = new HashMap <Integer, String>();  
            
        mp.put(1,"A");
        mp.put(2,"B");
        mp.put(3,"C");
        mp.put(4,"D");
        mp.put(5,"E");
        mp.put(6,"F");
        mp.put(7,"G");
        mp.put(8,"H");
        mp.put(9,"I");
        mp.put(10,"J");
        mp.put(11,"K");
        mp.put(12,"L");
        mp.put(13,"M");
        mp.put(14,"N");
        mp.put(15,"O");
        mp.put(16,"P");
        mp.put(17,"Q");
        mp.put(18,"R");
        mp.put(19,"S");
        mp.put(20,"T");
        mp.put(21,"U");
        mp.put(22,"V");
        mp.put(23,"W");
        mp.put(24,"X");
        mp.put(25,"Y");
        mp.put(26,"Z");
        
        int r;
        String str = "121222"   //this is encoded message I have referenced in my logic documentation
        int rMax = str.length();
        int n=str.length();
        int rLimit = 64;  //taken to be 64 from past experience.
        
        
            
        for (int i=0; i<str.length();i++)
        {
            //need to get the digits out, and search the map for the key  and get the value
            int digitToInteger = Integer.valueOf(str.charAt(0));
            
            if (mp.containsKey(digitToInteger))
            {
                Object temp = mp.get(digitToInteger)
                String tempString = Object.toString(temp);
                
                possibleLetters.put(i,tempString);   //only need to store the String here since should not be indexing again?
            }
            
            if (i==0)
            {
                possibleMappingFirst = tempString;
            }
            
            if (i==1)
            {
                possibleMappingSecond = possibleMappingFirst + tempString;
            }
            
        }
        
        
        if (str.length()%2==1)
        {
            rMin=(str.length()+1)/2;
        }
        else
        {
            rMin=str.length/2;
        }
        
        
        if (rMax>=rLimit)
        {
            System.out.println("rMax " + " will affect recursion");
        }
    
        System.out.println("***PERMUTATIONS***(WITH REPLACEMENT)");
        System.out.println("PR(n,r) = nr");
        System.out.println("**********THE ENCODED MESSAGE TRANSLATION***********");
        
        for (int i=rMin; i<rMax; i++)
        {
        sc = new Staircase (Permutations (n,r), mp,possibleLetters, rMin, rMax, possibleMappingFirst,possibleMappingSecond);
        }
    
        
        public static long Permutations (int n, int r)
        {
            System.out.println("P^R(" + n+","+r+") = " + "Math.pow(n,r)");
            return (long)Math.pow(n,r);
        }
}//end permutation class