2018_2_2_Digital Fortress_字符串处理，打表二分

https://vjudge.net/problem/UVA-11716

打表别小

#include<iostream>
#include<cstdio>
#include<cstring>
#include<fstream>
using namespace std;

const int N=10000+10;
char s[N];
int a[102]={0,1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,484,529,576,625,676,729,784,841,900,961,1024,1089,1156,1225,1296,1369,1444,1521,1600,1681,1764,1849,1936,2025,2116,2209,2304,2401,2500,2601,2704,2809,2916,3025,3136,3249,3364,3481,3600,3721,3844,3969,4096,4225,4356,4489,4624,4761,4900,5041,5184,5329,5476,5625,5776,5929,6084,6241,6400,6561,6724,6889,7056,7225,7396,7569,7744,7921,8100,8281,8464,8649,8836,9025,9216,9409,9604,9801,10000,10201};
int m;

void solve(){
	int len=strlen(s);
	m=lower_bound(a,a+102,len)-a;
	if(m*m!=len){
		puts("INVALID");
		return;
	}
	for(int i=0;i<m;i++)
	for(int j=0;j<m;j++){
		putchar(s[i+j*m]);
	}
	
	putchar('\n');
}

int main(){
	int n;
	scanf("%d",&n);
	getchar();
	while(n--){
		gets(s);
		solve();
	}
}