#include
#include
#define N 20
void welcome
();
void initqipan
();
void showqi
(int i
);
void save
(int p
);
void panduan
(int p
);
void heqi
();
void over
();
int zouqihang
();
int zouqilie
();
/******************结构体*****************/
struct zuobiao
{
int x[N*N];
int y[N*N];
}weizhi[N*N];
/******************主函数*****************/
void main
()
{
int p=0;
welcome
();
initqipan
();
for
(p=1;p<=N*N;p++
)
{
if
(p%2==0
)
weizhi[p].x[p]=weizhi[p-1].x[p-1];
else
weizhi[p].x[p]=zouqihang
();
if
(p%2==0
)
weizhi[p].y[p]=weizhi[p-1].y[p-1]+1;
else
weizhi[p].y[p]=zouqilie
();
save
(p
);
showqi
(p
);
panduan
(p
);
}
if
(p==N*N
)
heqi
();
over
();
}
/******************建立棋盘*****************/
void initqipan
()
{char f[N]={' ','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s'};
int i,j;
for
(i=0;i<N;i++
)
{
printf
("%c",f[i]
);
printf
(" "
);
}
printf
("\n"
);
for
(i=1;i<N;i++
)
{
for
(j=0;j<N;j++
)
{
if
(j==0
)
printf
("%c",f[i]
);
else
printf
(" ·"
);
}
printf
("\n"
);
}
}
/******************显示棋子*****************/
void showqi
(int p
)
{
int i,j,k,m;
int a[N*N],b[N*N];
FILE *fp;
fp=fopen
("wuzi_list","rb"
);
for
(i=1;i<=N*N;i++
)
{
fread
(&weizhi[i],sizeof
(struct zuobiao
),1,fp
);
a[i]=weizhi[i].x[i];
b[i]=weizhi[i].y[i];
}
for
(m=1;m<p;m++
)
{
while
(weizhi[p].x[p]==a[m]&&weizhi[p].y[p]==b[m]
)
{
printf
("error!\n"
);
weizhi[p].x[p]=zouqihang
();
weizhi[p].y[p]=zouqilie
();
m=1;
}
}
for
(i=0;i<N;i++
)
{
printf
("%d",i
);
printf
(" "
);
}
printf
("\n"
);
for
(i=1;i<N;i++
)
{
for
(j=1;j<N;j++
)
{
if
(j==1
)
printf
("%
扫一扫
8775
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
