paullewallencom

public class Cat
{
    private Cat() { }

    public static void main( String[] args )
    { 
        Out out = new Out( args[ args.length - 1 ] );

        for ( int i = 0; i < args.length - 1; i++ )
        {

paullewallencom

public class Knuth
{ 
    private Knuth() { }

    public static void shuffle( Object[] a )
    {
        int n = a.length;

        for ( int i = 0; i < n; i++ )
        {

paullewallencom

import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.net.URL;
import java.net.Socket;
// import java.net.HttpURLConnection;
import java.net.URLConnection;
import java.util.ArrayList;

paullewallencom

import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.net.Socket;
import java.util.Locale;

public class Out
{

paullewallencom

import java.util.ArrayList;
import java.util.InputMismatchException;
import java.util.Locale;
import java.util.NoSuchElementException;
import java.util.Scanner;
import java.util.regex.Pattern;

public final class StdIn
{
    private static final String CHARSET_NAME = "UTF-8";

paullewallencom

import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.UnsupportedEncodingException;
import java.util.Locale;

public final class StdOut
{
    private static final String CHARSET_NAME = "UTF-8";
    private static final Locale LOCALE = Locale.US;
    private static PrintWriter out;

paullewallencom

public class UF
{
    private int[] parent;  // parent[i] = parent of i
    private byte[] rank;   // rank[i] = rank of subtree rooted at i (never more than 31)
    private int count;     // number of components

    public UF( int n )
    {
        if ( n < 0 ) throw new IllegalArgumentException();

paullewallencom

public class QuickUnionUF
{
    private int[] parent;  // parent[i] = parent of i
    private int count;     // number of components

    public QuickUnionUF( int n )
    {
        parent = new int[ n ];
        count = n;

paullewallencom

public class QuickFindUF
{
    private int[] id;    // id[i] = component identifier of i
    private int count;   // number of components

    public QuickFindUF( int n )
    {
        count = n;
        id = new int[ n ];
        

paullewallencom

public class WeightedQuickUnionUF
{
    private int[] parent;   // parent[i] = parent of i
    private int[] size;     // size[i] = number of sites in subtree rooted at i
    private int count;      // number of components

    public WeightedQuickUnionUF( int n )
    {
        count = n;
        parent = new int[ n ];