A. Entertainment in MAC

time limit per test

1 second

memory limit per test

256 megabytes

Congratulations, you have been accepted to the Master's Assistance Center! However, you were extremely bored in class and got tired of doing nothing, so you came up with a game for yourself.

You are given a string ss and an even integer nn. There are two types of operations that you can apply to it:

  1. Add the reversed string ss to the end of the string ss (for example, if s=s= cpm, then after applying the operation s=s= cpmmpc).
  2. Reverse the current string ss (for example, if s=s= cpm, then after applying the operation s=s= mpc).

It is required to determine the lexicographically smallest†† string that can be obtained after applying exactly nn operations. Note that you can apply operations of different types in any order, but you must apply exactly nn operations in total.

††A string aa is lexicographically smaller than a string bb if and only if one of the following holds:

  • aa is a prefix of bb, but a≠ba≠b;
  • in the first position where aa and bb differ, the string aa has a letter that appears earlier in the alphabet than the corresponding letter in bb.

Input

Each test consists of multiple test cases. The first line contains a single integer tt (1≤t≤5001≤t≤500) --- the number of test cases. The description of the test cases follows.

The first line of each test case contains a single even integer nn (2≤n≤1092≤n≤109) --- the number of operations applied to the string ss.

The second line of each test case contains a single string ss (1≤|s|≤1001≤|s|≤100), consisting of lowercase English letters, --- the string to which the operations are applied.

Output

For each test case, output a single line --- the lexicographically smallest string that can be obtained after applying exactly nn operations.

Example

Input

Copy

复制代码

5

4

cpm

2

grib

10

kupitimilablodarbuz

1000000000

capybara

6

abacaba

Output

Copy

复制代码
cpm
birggrib
kupitimilablodarbuz
arabypaccapybara
abacaba

Note

In the first test case, you can apply the operation of the second type (i.e., reverse the string ss) 44 times. Then the string ss will remain equal to cpm.

In the second test case, you can do the following:

  • Apply the operation of the second type, after which ss will become equal to birg.
  • Apply operation of the first type (i.e., add the reversed string ss to the end of the string ss), after which ss will become equal to birggrib.

解题说明:此题是一道字符串题,找规律能发现如果这个字符串翻转后更大,那么我们就可以进行n次翻转,这样最终的字符串就是原先的字符串,也就实现最小了。如果这个字符串s在反转后更小了,那么我们就必须执行奇数次翻转,才能保证这个s最终是较小的。但题目中说n是偶数,所以就至少一次拼接操作,拼接操作进行的越少越好, 因此翻转n − 1次,拼接一次。

cpp 复制代码
#include<iostream>
#include <cstring>
#include <algorithm>
#include<vector>
using namespace std;

void solve() 
{
	int n;
	cin >> n;
	string str;
	cin >> str;
	string rs = str;
	reverse(rs.begin(), rs.end());
	if (rs < str) 
	{
		cout << (rs + str) << '\n';
	}
	else
	{
		cout << str << '\n';
	}
}
int main() 
{
	int T = 1;
	cin >> T;
	while (T--)
	{
		solve();
	}
	return 0;
}
相关推荐
only-qi8 分钟前
leetcode110. 平衡二叉树
数据结构·算法
要做朋鱼燕44 分钟前
【C++】Vector核心实现:类设计到迭代器陷阱
开发语言·c++·笔记·算法·职场和发展
Go_Zezhou1 小时前
在线性代数里聊聊word embedding
线性代数·算法·机器学习·nlp
Christo31 小时前
TFS-2005《A Possibilistic Fuzzy c-Means Clustering Algorithm》
人工智能·算法·机器学习
hansang_IR1 小时前
【题解】洛谷P1776 宝物筛选 [单调队列优化多重背包]
c++·算法·动态规划·题解·背包·多重背包·单调队列
jndingxin2 小时前
c++多线程(1)------创建和管理线程td::thread
开发语言·c++·算法
SuperCandyXu2 小时前
洛谷 P3128 [USACO15DEC] Max Flow P -普及+/提高
c++·算法·图论·洛谷
你说今年的枫叶好像不够红啊2 小时前
LeetCode[两数之和] java版
数据结构·算法·leetcode
YC汐宇2 小时前
数据结构:顺序栈与链栈的原理、实现及应用
数据结构·算法·链表
_不会dp不改名_2 小时前
leetcode_234 回文链表
算法·leetcode·链表