BOJ 16625 - Das Blinkenlights [C++]

문제

링크

풀이

#include <iostream>
using namespace std;
 
int gcd(int a, int b) {
  return b ? gcd(b, a % b) : a;
}
 
bool solve(void) {
  int p, q, s; cin >> p >> q >> s;
 
  return p * q / gcd(p, q) <= s;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  cout << (solve() ? "yes" : "no");
  return 0;
}