# Birthday Party

## Problem:-

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

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

Explanation

Test Case 1:

There is no way such that he can distribute 14 chocolates among 5 friends equally.

Test Case 2:

There are 21 chocolates and 3 friends, so he can distribute chocolates eqally. Each friend will get 7 chocolates.

There is no way such that he can distribute 14 chocolates among 5 friends equally.

Test Case 2:

There are 21 chocolates and 3 friends, so he can distribute chocolates eqally. Each friend will get 7 chocolates.

Time Limit:1.0 sec(s) for each input file.

Memory Limit:256 MB

Source Limit:1024 KB

__solution:-__

#include<stdio.h>

int main()

{

int t,n,i;

long int m;

scanf(“%d”,&t);

for(i=1;i<=t;i++)

{

scanf(“%d”,&n);

scanf(“%ld”,&m);

if(m%n==0)

printf(“Yesn”);

else

printf(“Non”);

}

return 0;

}

__Recommended post:-__

__Hackerearth Problems:-__

- Very Cool numbers | Hacker earth solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem

__Data structure:-__

- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree

__Key points:-__

good