1~9这9个数每个数出现两次,一共18个数,将这18个数分成3组,组成3个6位数,求这样的组合个数:每个六位数都是完全平方数。要求时间1s以内
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<string>
#include<algorithm>
#include<time.h>
using namespace std;
//若有相等元素,返回第一个
int binarySearch1(int b,int e,string c[],string s)
{
if(b<=e){
int mid=(b+e)/2;
if(c[mid]<s)
b=mid+1;
else
e=mid-1;
return binarySearch1(b,e,c,s);
}
else{
if(c[b]==s)
return b;
}
return -1;
}
//若有相等元素,返回最后一个
int binarySearch2(int b,int e,string c[],string s)
{
if(b<=e){
int mid=(b+e)/2;
if(c[mid]<=s)
b=mid+1;
else
e=mid-1;
return binarySearch2(b,e,c,s);
}
else{
if(c[e]==s)
return e;
}
return -1;
}
int main()
{
clock_t start, finish;
start = clock();
string square[400];
int p=0;
int j=0;
int i=0;
int count=0;
int flag;
string s;
//判断完全平方数的个数,因只有301个,故选择使用列表法
for(int m=112233;m<=998877;m++)
{
i=m;
flag=0;
p=(int)sqrt((double)i);
if(pow(p,2)==m)
{
char t[9];
sprintf (t,"%d",m);
s= t;
//每个完全平方数表示成9位char数组例如111000201,其中第i位表示i+1在该数中出现的个数,这301个数的char数组存放在square这一string数组中
char temp[10]={'0','0','0','0','0','0','0','0','0','\0'};
for(int k=0;k<s.length();k++){
if(s[k]=='0'){
flag=1;
break;
}
temp[s[k]-'1']=temp[s[k]-'1']-'0'+1+'0';
if( temp[s[k]-'1']-'0'>2){
flag=1;
break;
}}
if(!flag){
square[j++]=temp;
}}}
//对square递增排序,以便用二分查找法
sort(square,square+j);
int cc1=0,cc2=0;
for(int k1=0;k1<j;k1++){
for(int k2=k1+1;k2<j;k2++){
flag=0;
char t[10]={'0','0','0','0','0','0','0','0','0','\0'};
for(int kk=0;kk<9;kk++){
if(square[k1][kk]-'0'+(square[k2][kk]-'0')>2){
flag=1;
break;
}
else{
t[kk]=2-(square[k1][kk]-'0'+(square[k2][kk]-'0'))+'0';
}}
if(!flag){
int f=binarySearch1(k2+1,j-1,square,t);
int l=f;
if(f!=-1){
if(square[f+1]==t){
l=binarySearch2(k2+1,j-1,square,t);
}
count+=l-f+1;
}}}}
cout<<count<<endl;
finish = clock();
double duration= (double)(finish - start) / CLOCKS_PER_SEC;
cout<< duration<<endl;
return;
}