for(int i =1;i<= n;i++)
for(int j =1;j<= n;j++){
c[i][j]=0.0;
for(int k =1;k<= n;k++)
c[i][j]= c[i][j]+ a[i][k]* b[k][j];}
x =0;y =0;
for(int i =1;i<= n;i++)
for(int j =1;j<= i;j++)
for(int k =1;k<= j;k++)
x = x + y;
int i =1;
do{for(int j =1;j <= n;j ++)
i = i + j;
}while(i <100+ n);
int Prime(int n){int i =2,x =(int)sqrt(n);
while(i<= x){if(n % i ==0)break;
i++;
}if(i > x )return1;elsereturn0;}
int sum2(int n){int s =0;
for(int i =1;i <= n;i++){int p =1;
for(int j =1;j<= i;j++)p *= j;
s += p;
}return s;
}
int sum1(int n){int p =1,s =0;
for(int i =1;i<= n; i++){p *= i ; s += p;}return s;
}
template<classT>
LinkNode<T>*List<T>::Locate(int i ){//函数返回表中第 i 个元素的地址。若i < 0或 i 超出//表中结点个数,则返回NULL。if(i <0)returnNULL;// i不合理
LinkNode<T>* current = first;int k =0;while( current !=NULL&& k < i ){
current = current->link;
k++;}return current;//返回第 i号结点地址或NULL};