//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 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");
    }
  
 }

import javax.mail.*;
import javax.mail.internet.*;
import java.util.*;
 
public void postMail( String recipients[ ], String subject, String message , String from) throws MessagingException
{
    boolean debug = false;
 
     //Set the host smtp address
     Properties props = new Properties();
     props.put("mail.smtp.host", "smtp.example.com");
 
    // create some properties and get the default Session
    Session session = Session.getDefaultInstance(props, null);
    session.setDebug(debug);
 
    // create a message
    Message msg = new MimeMessage(session);
 
    // set the from and to address
    InternetAddress addressFrom = new InternetAddress(from);
    msg.setFrom(addressFrom);
 
    InternetAddress[] addressTo = new InternetAddress[recipients.length]; 
    for (int i = 0; i < recipients.length; i++)
    {
        addressTo[i] = new InternetAddress(recipients[i]);
    }
    msg.setRecipients(Message.RecipientType.TO, addressTo);
    
 
    // Optional : You can also set your custom headers in the Email if you Want
    msg.addHeader("MyHeaderName", "myHeaderValue");
 
    // Setting the Subject and Content Type
    msg.setSubject(subject);
    msg.setContent(message, "text/plain");
    Transport.send(msg);
}

import java.io.File;
import java.io.IOException;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class SimpleWordCounter {
    
    public static void main(String[] args) {
        try {
            File f = new File("ciaFactBook2008.txt");
            Scanner sc;
            sc = new Scanner(f);
            // sc.useDelimiter("[^a-zA-Z']+");
            Map<String, Integer> wordCount = new TreeMap<String, Integer>();
            while(sc.hasNext()) {
                String word = sc.next();
                if(!wordCount.containsKey(word))
                    wordCount.put(word, 1);
                else
                    wordCount.put(word, wordCount.get(word) + 1);
            }
            
            // show results
            for(String word : wordCount.keySet())
                System.out.println(word + " " + wordCount.get(word));
            System.out.println(wordCount.size());
        }
        catch(IOException e) {
            System.out.println("Unable to read from file.");
        }
    }
}

public class Factorial
{
	public static void main(String[] args)
	{	final int NUM_FACTS = 100;
		for(int i = 0; i < NUM_FACTS; i++)
			System.out.println( i + "! is " + factorial(i));
	}
	
	public static int factorial(int n)
	{	int result = 1;
		for(int i = 2; i <= n; i++)
			result *= i;
		return result;
	}
}

public static String addBinary(){
 // The two input Strings, containing the binary representation of the two values:
    String input0 = "1010";
    String input1 = "10";

    // Use as radix 2 because it's binary    
    int number0 = Integer.parseInt(input0, 2);
    int number1 = Integer.parseInt(input1, 2);

    int sum = number0 + number1;
    return Integer.toBinaryString(sum); //returns the answer as a binary value;
}