Submit | All submissions | Best solutions | Back to list |
FUACM002 - Problems 2: DIV, MOD and IF |
A set of (a, b, c, d) is called FNUM-SET if both conditions are met:
- a div b = c.
- a mod b = d.
Given set of (a, b, c, d) and your mission is check whether the set is an FNUM-SET, print "Yes", else print "No".
Input
Integers a, b, c, d. (0 <= a, b, c, d <= 100)
Output
Yes or No.
Example
Input 1: 6 4 1 2 Output 1: Yes
Input 2: 6 4 0 2 Output 2: No
Added by: | Gầy :)) |
Date: | 2014-11-12 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |