# Tower Breakers

### Problem Statement :

```Two players are playing a game of Tower Breakers! Player  always moves first, and both players always play optimally.The rules of the game are as follows:

Initially there are  towers.
Each tower is of height .
The players move in alternating turns.
In each turn, a player can choose a tower of height  and reduce its height to , where  and  evenly divides .
If the current player is unable to make a move, they lose the game.
Given the values of  and , determine which player will win. If the first player wins, return . Otherwise, return .

Function Description

Complete the towerBreakers function in the editor below.

towerBreakers has the following paramter(s):

int n: the number of towers
int m: the height of each tower
Returns

int: the winner of the game

Input Format

The first line contains a single integer , the number of test cases.
Each of the next  lines describes a test case in the form of  space-separated integers,  and .```

### Solution :

```                            ```Solution in C :

In  C  :

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
long int cnt(long int a,int k)
{
if(k*k>a)
return a!=1;
return a%k?cnt(a,k+1):1+cnt(a/k,k+1);
}
int main() {

int t;
long int n,m,s;
char a={'2','1'};
scanf("%d",&t);
while(t--)
{
s=0;
scanf("%ld%ld",&n,&m);
while(m%4==0)
m/=2;
if(n%2==0)
s=0;
else
s^=cnt(m,2);
printf("%c\n",a[!!s]);
}
return 0;
}```
```

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

In  C++  :

#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

int main()
{
long nTest,n,m;
scanf("%ld",&nTest);
while (nTest--)
{
scanf("%ld%ld",&n,&m);
if (m==1) puts("2");
else puts((n&1)?"1":"2");
}
}```
```

```                        ```Solution in Java :

In  Java :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

private static int numPrimeFactors(int n) {
for (int i=2; i<=n; i++) {
if (n%i == 0) {
n /= i;
i = 1;
}
}
}

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
for (int t=0; t<T; t++) {
int n = sc.nextInt();
int m = sc.nextInt();
if (m == 1) {
System.out.println(2);
continue;
}
if (n%2 == 0) {
System.out.println(2);
} else {
System.out.println(1);
}

}

}
}```
```

```                        ```Solution in Python :

In  Python3 :

test = int(input())
for _ in range(test):
n,m = map(int,input().strip().split())
if m==1:
print(2)
else:
if n%2==1:
print(1)
else:
print(2)```
```

## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .