import java.io.PrintWriter;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Map;
import java.util.TreeMap;

/**
 *
 *
 * DO NOT MODIFY THIS FILE!
 *
 *
 * Simply place it in the folder where you have your own .java files,
 * and use it as in the usage example below.
 *
 *
 *
 *
 *
 *
 *
 * @author Magnus Espeland <magnuesp@ifi.uio.no>
 * @author Oliver Jahren <oliverrj@ifi.uio.no>
 * @changed 2024-02-21
 *
 *          Class for ensuring unified output from Oblig 3, IN3030 - Spring 2025
 *
 *
 *          Usage:
 *          --
 *          Oblig3Precode precode = new Oblig3Precode(n);
 *
 *          <Do this in a loop fitting your program and how you store the
 *          results>
 *          precode.addFactor(3999999999999999999L, 3);
 *          precode.addFactor(3999999999999999999L, 31);
 *          precode.addFactor(3999999999999999999L, 64516129);
 *          precode.addFactor(3999999999999999999L, 666666667);
 *
 *          precode.writeFactors();
 *          --
 *
 *          Note: This is meant to be run at the end of your program,
 *          when the results are ready
 *
 *          It is NOT thread safe and NOT efficient
 *
 *          The only reason for this program is to make the correcting of the
 *          oblig
 *          easier for the TAs.
 *
 *          Please ask questions in Discourse* (or by mail or Mattermost).
 *
 */

public class Oblig3Precode {

    int n;

    TreeMap<Long, LinkedList<Long>> factors = new TreeMap<Long, LinkedList<Long>>();

    /**
     * Create an object for unified factor printing
     *
     *
     * @param n The n given at startup
     */

    public Oblig3Precode(int n) {
        this.n = n;
    }

    /**
     * Add a factor to a number
     *
     *
     * @param base   This is the number you started to factorize (ie
     *               3999999999999999999)
     * @param factor This is the factor you have found
     */

    public void addFactor(long base, long factor) {

        Long longObj = Long.valueOf(base);

        if (!factors.containsKey(longObj))
            factors.put(longObj, new LinkedList<Long>());

        // System.out.printf("Adding %d to %d\n",factor, base);

        factors.get(longObj).add(factor);

    }

    /**
     * Writes the factors you found to a file named "Factors_n.txt"
     *
     */

    public void writeFactors() {
        String filename = "Factors_" + n + ".txt";

        try (PrintWriter writer = new PrintWriter(filename)) {
            writer.printf("Factors for n=%d\n", n);

            for (Map.Entry<Long, LinkedList<Long>> entry : factors.entrySet()) {

                // Starting a new line with the base
                writer.print(entry.getKey() + " : ");

                // Sort the factors
                Collections.sort(entry.getValue());

                // Then print the factors
                String out = "";
                for (Long l : entry.getValue())
                    out += l + "*";

                // Removing the trailing '*'
                writer.println(out.substring(0, out.length() - 1));

            }

            writer.flush();
            writer.close();

        } catch (Exception e) {
            System.out.printf("Got exception when trying to write file %s : ", filename, e.getMessage());
        }

    }

}