더블릿|dovelet - 2번째 계단 - 약수 판별/div_mul

문제

#include <iostream>
 
using namespace std;
 
int main()
{
    int m, n;
    cin >> m >> n;
    if (m != 0 && n%m == 0)
        cout << m << " | " << n;
    else
        cout << m << " !| " << n;
 
    return 0;
}