public static void enu2ecefCov(GMatrix ecefCov, GMatrix enuCov, LLA refLLA) {
    double lambda = refLLA.longitude;
    double phi = refLLA.latitude;
    
    GMatrix R = new GMatrix(6, 6);
    GMatrix Rt = new GMatrix(6, 6);
    GMatrix tmp1 = new GMatrix(6, 6);
    GMatrix tmp2 = new GMatrix(6, 6);
    
    R.setElement(0, 0, -Math.sin(lambda));
    R.setElement(0, 1, -Math.sin(phi)*Math.cos(lambda));
    R.setElement(0, 2, Math.cos(phi)*Math.cos(lambda));
    R.setElement(1, 0, Math.cos(lambda));
    R.setElement(1, 1, -Math.sin(phi)*Math.sin(lambda));
    R.setElement(1, 2, Math.cos(phi)*Math.sin(lambda));
    R.setElement(2, 0, 0);
    R.setElement(2, 1, Math.cos(phi));
    R.setElement(2, 2, Math.sin(phi));
    R.setElement(3, 3, -Math.sin(lambda));
    R.setElement(3, 4, -Math.sin(phi)*Math.cos(lambda));
    R.setElement(3, 5, Math.cos(phi)*Math.cos(lambda));
    R.setElement(4, 3, Math.cos(lambda));
    R.setElement(4, 4, -Math.sin(phi)*Math.sin(lambda));
    R.setElement(4, 5, Math.cos(phi)*Math.sin(lambda));
    R.setElement(5, 3, 0);
    R.setElement(5, 4, Math.cos(phi));
    R.setElement(5, 5, Math.sin(phi));

    Rt.transpose(R);
    tmp1.mul(enuCov, R);
    ecefCov.mul(Rt, tmp1);
}

import static java.lang.System.*;
import java.util.Arrays;        

public class MergeSort{

private static int passCount;

public static void mergeSort(int[] list)
{
    passCount=0;
    mergeSort(list, 0, list.length);
}

private static void mergeSort(int[] list, int front, int back)  //O( Log N )
{
    int mid = (front+back)/2;
    if(mid==front) return;
    mergeSort(list, front, mid);
    mergeSort(list, mid, back);
    merge(list, front, back);

}

private static void merge(int[] list, int front, int back)  //O(N)
{
   int dif = back-front;
   int[] temp = new int[dif];
   int beg = front, mid = (front+back)/2;
   int saveMid = mid;
   int spot = 0;

   while(beg < saveMid && mid < back) {
      if(list[beg] < list[mid]) {
         temp[spot++] = list[beg++];
      } else {
         temp[spot++] = list[mid++];
      }
   }
   while(beg < saveMid)
      temp[spot++] = list[beg++];
   while(mid < back)
      temp[spot++] = list[mid++];
   for(int i = 0; i < back-front; i++) {
      list[front+i] = temp[i];
   }
    System.out.println("pass " + passCount++ + " " + Arrays.toString(list) + "\n");
  }
  
  
    public static void main(String args[])
    {
        mergeSort(new Comparable[]{ 9, 5, 3, 2 });
        System.out.println("\n");
        
        mergeSort(new Comparable[]{ 19, 52, 3, 2, 7, 21 });
        System.out.println("\n");
        
        mergeSort(new Comparable[]{ 68, 66, 11, 2, 42, 31});
        System.out.println("\n");
    }
  
 }

public class Daedalus extends Athenian
{
	private Story story;
	public ArrayList<Skill> skills = new ArrayList<Skill>();
	public ArrayList<Athenian> children = new ArrayList<Athenian>();
	
	public Daedalus(Story story, ArrayList<Skill> inherentSkills)
	{
	if(story != null)
	System.out.println("ERROR No one is created with a story.");

	skills.add(inherentSkills);
	}

	public Momento advanceStory(Scene s)
	{
	System.err.println("ERROR Don't know how to proceed...");
	}
}


//██╗  ░█████╗░███╗░░░███╗  ██████╗░░█████╗░███████╗██████╗░░█████╗░██╗░░░░░██╗░░░██╗░██████╗
//██║  ██╔══██╗████╗░████║  ██╔══██╗██╔══██╗██╔════╝██╔══██╗██╔══██╗██║░░░░░██║░░░██║██╔════╝
//██║  ███████║██╔████╔██║  ██║░░██║███████║█████╗░░██║░░██║███████║██║░░░░░██║░░░██║╚█████╗░
//██║  ██╔══██║██║╚██╔╝██║  ██║░░██║██╔══██║██╔══╝░░██║░░██║██╔══██║██║░░░░░██║░░░██║░╚═══██╗
//██║  ██║░░██║██║░╚═╝░██║  ██████╔╝██║░░██║███████╗██████╔╝██║░░██║███████╗╚██████╔╝██████╔╝
//╚═╝  ╚═╝░░╚═╝╚═╝░░░░░╚═╝  ╚═════╝░╚═╝░░╚═╝╚══════╝╚═════╝░╚═╝░░╚═╝╚══════╝░╚═════╝░╚═════╝░

class main {

public static boolean findDuplicates(int[] nums) {
        for(int i = 0; i < nums.length; i++) {
            for(int j = 0; j < i; j++) {
                if(nums[i] == nums[j]) {
                   return true;
                }
            } 
        }
        return false;
}


    public static void main(String[] args) {

        int[] myArray = {1,3};

        System.out.println(findDuplicates(myArray));

    }

}

//Leif Messinger
//Solves wordle
//Needs a list of wordle words, newline separated and 5 characters each

import java.util.*;
import java.io.File;
import java.io.FileNotFoundException;

class WordleSolver {

	public static void printPointer(int position){
		for(int i = 0; i < position; ++i){
			System.out.print(" ");
		}
		System.out.print("^");
	}

	public static void main(String[] args) throws FileNotFoundException{
		if(args.length < 1) return;
		File dictionary = new File(args[0]);
		Scanner sc = new Scanner(dictionary);
		ArrayList<String> possibleWords = new ArrayList<String>();
		while(sc.hasNextLine()){
			possibleWords.add(sc.nextLine());
		}

		Scanner input = new Scanner(System.in);

		while(possibleWords.size() > 0){
			//Choose a word out of the possible words
			final int randomIndex = (int)(Math.random() * possibleWords.size());
			String chosenWord = possibleWords.get(randomIndex);
			possibleWords.remove(randomIndex);

			System.out.println("Is it correct?");
			for(int i = 0; i < chosenWord.length(); ++i){
				System.out.println(chosenWord);
				printPointer(i);
				System.out.println(" y/n?");
				if(input.nextLine().toLowerCase().contains("y")){
					//Filter by correct character
					for(int possibleWord = possibleWords.size() - 1; possibleWord >= 0; --possibleWord){ //Has to be backwards for removing entries, also has to be int not unsigned
						if(possibleWords.get(possibleWord).charAt(i) != chosenWord.charAt(i)){
							possibleWords.remove(possibleWord);
						}
					}
				}
			}
			System.out.println("Is it misplaced?");
			//Stores a count of every letter misplaced
			short[] misplacedCounts = new short[('z'-'a')+1]; //Praise be the garbage collector
			for(int i = 0; i < chosenWord.length(); ++i){
				System.out.println(chosenWord);
				printPointer(i);
				System.out.println(" y/n?");
				if(input.nextLine().toLowerCase().contains("y")){
					//Filter to make sure there's at least as many letters as needed
					++misplacedCounts[(chosenWord.charAt(i) - 'a') - 1];
					for(int possibleWord = possibleWords.size() - 1; possibleWord >= 0; --possibleWord){	//Has to be backwards for removing entries, also has to be int not unsigned
						int count = 0;
						for(int j = 0; j < possibleWords.get(possibleWord).length(); ++j){
							if(possibleWords.get(possibleWord).charAt(j) == chosenWord.charAt(i))
								++count;
						}
						//If there's not enough of the character that we need, then we remove that from the list of possible characters
						if(count < misplacedCounts[(chosenWord.charAt(i) - 'a') - 1]){
							possibleWords.remove(possibleWord);
						}
					}
					//Also filter out words where that letter doesn't belong there
					for(int possibleWord = possibleWords.size() - 1; possibleWord >= 0; --possibleWord){ //Has to be backwards for removing entries, also has to be int not unsigned
						if(possibleWords.get(possibleWord).charAt(i) == chosenWord.charAt(i)){
							possibleWords.remove(possibleWord);
							continue;	//Breaks the current word and moves on in the loop
						}
					}
				}
			}
		}
	}
}

import java.util.Arrays;

public class Main {
    public static int findMinNonCreatableSum(int[] coins) {
        // Sort the array
        Arrays.sort(coins);
        
        // Initialize max creatable sum
        int maxCreatable = 0;
        
        // Iterate through coins
        for (int coin : coins) {
            // If current coin is greater than maxCreatable + 1,
            // we found our answer
            if (coin > maxCreatable + 1) {
                return maxCreatable + 1;
            }
            // Add current coin to maxCreatable
            maxCreatable += coin;
        }
        
        // If we can create all sums up to maxCreatable,
        // the answer is maxCreatable + 1
        return maxCreatable + 1;
    }

    public static void main(String[] args) {
        int[] coins = {2, 9, 1, 2, 7};
        int result = findMinNonCreatableSum(coins);
        System.out.println("Smallest sum that cannot be created: " + result);
    }
}