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 :



title-img 




                        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

Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →

Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →