DMOJ - Phidas

Let $\texttt{dp}[i][j]$ be the minimum total wasted area with a rectangular slab size of $i\times j$. Initialize $\texttt{dp}[i][j]$ as $i \cdot j$ and set $\texttt{dp}[x_i][y_i]$ as 0, where $x_i, y_i$ are the width and heights of the desired plate sizes, respectively. Check every sub-rectangle with either $i$ or $j$ fixed (but not both) and store the minimum total area that must be wasted for the optimal sub-rectangle.

Time Complexity: $\mathcal{O}(W\cdot H\cdot (W + H))$.

Copy
#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
 
#define f first
#define s second

Copy
import java.io.*;
import java.util.*;

public class Phidias {
	public static void main(String[] args) throws IOException {
		Kattio io = new Kattio();
		int W = io.nextInt();
		int H = io.nextInt();
		int N = io.nextInt();