## Algorithm

There are lots of number games for children. These games are pretty easy to play but not so easy to
make. We will discuss about an interesting game here. Each player will be given N positive integer.
(S)He can make a big integer by appending those integers after one another. Such as if there are
4 integers as 123, 124, 56, 90 then the following integers can be made — 1231245690, 1241235690,
5612312490, 9012312456, 9056124123, etc. In fact 24 such integers can be made. But one thing is sure
that 9056124123 is the largest possible integer which can be made.
You may think that it’s very easy to find out the answer but will it be easy for a child who has just
got the idea of number?
Input
Each input starts with a positive integer N (≤ 50). In next lines there are N positive integers. Input
is terminated by N = 0, which should not be processed.
Output
For each input set, you have to print the largest possible integer which can be made by appending all
the N integers.

## Code Examples

### #1 Code Example with C Programming

Code - C Programming

#include <bits/stdc++.h>

using namespace std;

int main()
{
int t,m,n,q;
int a,b;
char grid[101][101];
cin >> t;
while(t--){
cin >> m >> n >> q;
for(int i=0;i < m;i++) scanf("%s",grid[i]);

printf("%d %d %d\n",m,n,q);
while(q--){
cin >> a >> b;
bool valid = true;
int len = 3,res=1;
char cur = grid[a][b];
while(valid){
int rowStart = a-len/2;
int rowEnd = a+len/2;
int colStart = b-len/2;
int colEnd = b+len/2;
if(rowStart < 0 || colStart  <  0> valid = false;
if(rowEnd >= m || colEnd >= n) valid = false;
for(int i=rowStart; i<=rowEnd && valid; i++){
if(grid[i][colStart] != cur) valid = false;
if(grid[i][colEnd] != cur) valid = false;
}
for(int i=colStart; i < =colEnd && valid; i++){
if(grid[rowStart][i] != cur) valid = false;
if(grid[rowEnd][i] != cur) valid = false;
}
if(valid> res = len;
len += 2;
}
cout << res << endl;
}
}
}
Copy The Code &

Input

cmd
4
123 124 56 90
5
123 124 56 90 9
5
9 9 9 9 9
0

Output

cmd
9056124123
99056124123
99999