snarkbait

package Advent2017;

import util.FileIO;

import java.util.*;
import java.util.stream.Collectors;

public class Day6 {

    private static int firstMax(List<Integer> a) {

snarkbait

package Advent2017;

import util.FileIO;

import java.util.*;

public class Day7 {

    private static int sumOfChildren(List<Leaf> children) {
        if (children.size() == 0) return 0;

snarkbait

package Advent2017;

import util.FileIO;
import util.Timer;

import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.function.BiPredicate;

snarkbait

package Advent2017;

import util.FileIO;
import util.Timer;

import java.util.HashMap;
import java.util.Map;

public class Day9 {

snarkbait

package Advent2017;

import util.ArrayUtils;
import util.BitUtils;
import util.FileIO;
import util.Timer;

import java.util.Arrays;
import java.util.stream.IntStream;

snarkbait

package Advent2017;


import util.FileIO;


public class Day11 {

    enum HexDir {
        n(0, -1), ne(1, -1), se(1, 0), s(0, 1), sw(-1, 1), nw(-1, 0);

snarkbait

package Advent2017

import util.FileIO

fun hexDistance(x: Int, y: Int): Int {
    return maxOf(Math.abs(x), Math.abs(y), Math.abs(x + y))
}

snarkbait

package Advent2017;

import graph.SearchType;
import graph.UGraph;
import util.FileIO;
import util.Timer;

import java.util.HashSet;
import java.util.List;
import java.util.Set;

snarkbait

package Advent2017;

import util.FileIO;
import util.Timer;

import java.util.List;
import java.util.Map;
import java.util.stream.Collectors;

public class Day13 {

snarkbait

package Advent2017;

import util.*;

import java.math.BigInteger;
import java.util.List;

public class Day14 extends AdventOfCode{

    private BigInteger[] hashes;