https://codeforces.com/gym/101498/problem/J
思路:暴力直接查找。
#include<bits/stdc++.h>
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ld long double
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b)/(__gcd((a),(b))))
#define mod 1000000007
#define MP make_pair
#define PI pair<int,int>
using namespace std;
const int N = 1e5 + 100;
int t, arr[N];
char s[N];
int main() {
cin >> t;
cin.get();
while(t--) {
s[0] = ' ';
gets(s + 1);
int shi = 0, len = strlen(s);
s[len] = ' ';
for(int k, i = 2; i <= len / 2; i++) {
for(k = i; k <= len; k += i)
if(s[k] != ' ')
break;
if(k - i == len) {
shi = 1;
break;
}
}
if(shi)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}