shuzu

#include <iostream>


using namespace std;


void main()
{


int a[10][10]={0,0,1,1,0,0,0,0,0,0,
0,0,0,0,2,2,2,0,0,0,
0,0,0,0,0,0,3,0,0,0,
4,4,0,5,0,6,0,0,0,0,
0,0,0,5,0,6,0,7,7,0,
0,8,8,0,0,6,0,0,0,0,
0,0,0,0,0,6,0,0,0,0,
0,9,9,10,0,6,11,11,11,0,
0,0,0,0,0,6,0,0,0,0,
12,12,12,12,12,12,12,12,0,0};
int A[1000]={0,};
int B[1000]={0,};
int index=0;
int N=10;
int i,j;

for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
int hnum=1,vnum=1;
bool stop=false;
//up
int num=0;
if(a[i][j]>0){
int nV=j;
while((--nV)>=0)
{
if(a[i][nV]==a[i][j])
{
stop=true;
break;
}
else
break;
}


if(stop)
continue;


//left
int nH=i;
while((--nH)>=0)
{
if(a[nH][j]==a[i][j]){
stop=true;
break;
}
else
break;
}


if(stop)
continue;
//down


nV=j;
while((++nV)<N)
{
if(a[i][nV]==a[i][j])
{
vnum++;
}
else
break;
}


//right
nH=i;
while((++nH)<N)
{
if(a[nH][j]==a[i][j])
{
hnum++;
}else
break;
}


if(vnum==1&&hnum==1)
{
B[index]=1;
A[index]=1;
}
if(vnum>1)
{
B[index]=2;
A[index]=vnum;
}


if(hnum>1)
{
B[index]=3;
A[index]=hnum;
}
index++;
}


}
}
int hsum=0,vsum=0,zsum=0;
for(i=0;i<index;i++)
{
cout<<A[i]<<" "<<B[i]<<endl;
if(B[i]==1)
zsum++;
if(B[i]==2)
hsum++;
if(B[i]==3)
vsum++;
}
cout<<zsum<<" "<<hsum<<" "<<vsum<<endl;
for(i=0;i<index;i++)
{
if(B[i]==1)
zsum*=A[i];
if(B[i]==2)
hsum*=A[i];
if(B[i]==3)
vsum*=A[i];
}


cout<<zsum<<" "<<hsum<<" "<<vsum<<endl;


}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值