-
Notifications
You must be signed in to change notification settings - Fork 16
/
birthday party
47 lines (37 loc) · 1.08 KB
/
birthday party
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/*
Mr. X's birthday is in next month. This time he is planning to invite N of his friends. He wants to distribute some chocolates to all of his
friends after party. He went to a shop to buy a packet of chocolates.
At chocolate shop, each packet is having different number of chocolates. He wants to buy such a packet which contains number of chocolates,
which can be distributed equally among all of his friends.
Help Mr. X to buy such a packet.
Input:
First line contains T, number of test cases.
Each test case contains two integers, N and M. where is N is number of friends and M is number number of chocolates in a packet.
Output:
In each test case output "Yes" if he can buy that packet and "No" if he can't buy that packet.
Constraints:
1<=T<=20
1<=N<=100
1<=M<=10^5
Problem Setter:
Akash Rakshit
SAMPLE INPUT
2
5 14
3 21
SAMPLE OUTPUT
No
Yes
*/
#include <iostream>
using namespace std;
int main() {
int num;
cin >> num; // Reading input from STDIN
while(num--)
{
int friends, choc; cin>>friends>>choc;
if(choc%friends==0) cout<<"Yes\n";
else cout<<"No\n";
}
}