每日一题 第四十九期 Codeforces Round 937 (Div. 4)

E. Nearly Shortest Repeating Substring

time limit per test: 2 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

Input

The first line contains a single integer $t$ ($1\le t\le 10^3$) — the number of test cases.

The first line of each test case contains a single integer $n$ ($1\le n\le 2\cdot 10^5$) — the length of string $s$.

The second line of each test case contains the string $s$, consisting of lowercase Latin characters.

The sum of $n$ over all test cases does not exceed $2\cdot 10^5$.

Output

For each test case, print the length of the shortest string $k$ satisfying the constraints in the statement.

Example
inputCopy
5
4
abaa
4
abba
13
slavicgslavic
8
hshahaha
20
stormflamestornflame
outputCopy
1
4
13
2
10

Note

In the first test case, you can select $k=\text{a}$ and $k+k+k+k=\text{aaaa}$, which only differs from $s$ in the second position.

In the second test case, you cannot select $k$ of length one or two. We can have $k=\text{abba}$, which is equal to $s$.

AC代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
//#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=998244353;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e8 + 10;

int t, n, v[N];
string a, b;
bool check(int x)
{
	int cnt1 = 0, cnt2 = 0;
	for(int i = x; i < n; i ++)
	{
		if(a[i % x] != a[i]) cnt1 ++;
		if(b[i % x] != b[i]) cnt2 ++;
	}
	if(cnt1 <= 1 || cnt2 <= 1) return true;
	return false;
}
int main()
{
	cin >> t;
	while(t --){
		memset(v, 0, sizeof v);
		cin >> n;
		cin >> a;
		b = a;
		reverse(a.begin(), a.end());
		int cnt = 0;
		for(int i = 1; i <= n; i ++)
		{
			if(n % i == 0)
			{
				if(check(i))
				v[++ cnt] = i; //v[++ cnt] = n / i;
			}
		}
		sort(v + 1, v + 1 + cnt);
		if(v[1] != 0) cout << v[1] << endl;
		else cout << n << endl;
	}
	return 0;
}