BOJ 19698 - 헛간 청약 [C++]

문제

링크

풀이

#include <iostream>
#include <algorithm>
using namespace std;
 
void solve(void) {
  int n, w, h, l; cin >> n >> w >> h >> l;
 
  cout << min(n, (w/l)*(h/l));
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}