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

Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →

Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

View Solution →

Fibonacci Numbers Tree

Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T

View Solution →

Pair Sums

Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v

View Solution →

Lazy White Falcon

White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi

View Solution →

Ticket to Ride

Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o

View Solution →