# Stone Division, Revisited

### Problem Statement :

```You have a pile of  stones that you want to split into multiple piles, as well as a set, , of  distinct integers. We define a move as follows:

First, choose a pile of stones. Let's say that the chosen pile contains  stones.
Next, look for some  such that  and  is divisible by  (i.e.,  is a factor of ); if such an  exists, you can split the pile into  equal smaller piles.
You are given  queries where each query consists of  and . For each query, calculate the maximum possible number of moves you can perform and print it on a new line

Input Format

The first line contains an integer, , denoting the number of queries. The  subsequent lines describe each query in the following format:

The first line contains two space-separated integers describing the respective values of  (the size of the initial pile in the query) and  (the size of the set in the query).
The second line contains  distinct space-separated integers describing the values in set .

Output Format

For each query, calculate the maximum possible number of moves you can perform and print it on a new line.```

### Solution :

```                        ```Solution in C++ :

In  C++  :

#include <bits/stdc++.h>
#include<assert.h>
#define pf printf
#define sf scanf
#define vlong lobg long
using namespace std;

map<vlong, vlong>dp;
map<vlong, bool>done;
vlong arr[1003], n;
int m;

vlong rec(vlong pile)
{
if(done[pile] == 1)
{
return dp[pile];
}

vlong ans = 0;
for(int i=0; i<m; i++)
{
if(pile%arr[i] == 0 && (pile/arr[i])>1)
{
//ans = max(ans, (1LL + ( ( ( (pile/arr[i]) % mod) * rec(arr[i]) ) % mod ) % mod) );
ans = max(ans, 1LL + ( (pile/arr[i]) * rec(arr[i]) ) );
}
}

done[pile] = 1;
return dp[pile] = ans;
}
void solution() {

int q;
sf("%d", &q);
for(int k=0; k<q; k++){

//dp.clear();
done.clear();

sf("%lld %d", &n, &m);
for(int i=0; i<m; i++)
sf("%lld", &arr[i]);

vlong ans = rec(n);

cout<<ans<<endl;
}
}

int main () {

//freopen("input.txt", "r", stdin);
solution();

return 0;
}```
```

## View More Similar Problems

Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should point to head and the data value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty. Function Description: Complete the function insertNodeAtHead in the editor below

## Insert a node at a specific position in a linked list

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, insert this node at the desired position and return the head node. A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is e

## Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

## Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio