Counting Garlic - Divisibility Problem

1 Problem description

Judging whether a number is divisible by another integer is a very simple problem. Generally, a modulo operation can be done. The lazy Xiaomeng still doesn't want to do it by himself, so he finds you to help him write the code, and you can help him.

input format

The input consists of two integers M separated by spaces $M$ 和 $N(1\le M,N\le 500)$。

output format

The output includes a line if  $M$  can be replaced by $Output\; if\; N$  is divisibleYES, otherwise outputNO(result is case sensitive).

sample input

Sample output

2 Reference code

#include<iostream>
using namespace std;
intmain()
{
    int m,n;
    cin>>m>>n;
    if(m%n==0)
        cout<<"YES";
    else
        cout<<"NO";
    return 0;
}