BOJ 6609 - 모기곱셈 [C++]

문제

링크

풀이

#include <iostream>
#include <tuple>
using namespace std;
 
void solve(void) {
  int m, p, l, e, r, s, n;
  
  while (cin >> m >> p >> l >> e >> r >> s >> n) {
    while (n--) tie(m, p, l) = make_tuple(p/s, l/r, m*e);
    cout << m << "\n";
  }
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}