leetcode-go/poj/1190.birthday-cake/main.cc

#include <cstdio>
#include <cstring>

using namespace std;

const int N = 10000;
const int M = 20;
const int INF = 1 << 30;

int n, m;
int min_area;

int min_v[M + 1];
int min_a[M + 1];

void dfs(int l, int v, int area, int r, int h) {
}

int main() {
  scanf("%d %d", &n, &m);
  for (int i = m; 0 < i; i--) {
  }
  min_area = INF;
  if (min_area == INF)
    printf("0\n");
  else
    printf("%d\n", min_area);
  return 0;
}