#include <stdio.h>
#include<unistd.h>
#include<time.h>
#include<stdlib.h>
int main(int argc, char** argv)
{
int sum_step = 0;
int n;
int p = 0;
printf("系统正在随机产生路径!\n");
sleep(1);
srand(time(NULL));
while(1)
{
if(n = rand()%11);
break;
}
int path[n*n];
for(int k= 0;k<n*n;k++)
{
int m = rand()%10;
path[k] = m;
printf("path[%d]=%d\n",k,path[k]);
}
printf("你开始现在最优路径,从第一行走到最后一行!(0表示没有路)\n");
sleep(1);
int temp;
int square[n][n];
for(int l = 0;l<n;l++)
{
for(int o = 0;o<n;o++)
{
square[l][o] = path[p++];
}
}
for(int y = 0;y<n;y++)
{
for(int z = 0;z<n;z++)
{
printf("%d ",square[y][z]);
}
printf("\n");
}
for(int i = 0;i<n;i++)
{
for(int x = 0;x<n-1;x++)
{
for(int j = 0;j<n;j++)
{
if(square[i][j]>square[i][j+1])
{
temp = square[i][j];
square[i][j] = square[i][j+1];
square[i][j+1] = temp;
}
}
}
sleep(1);
printf("你从第[%d]行的:[%d]号路走!\n",i,square[i][0]);
sum_step += square[i][0];
}
printf("你总共走了[%d]条路\n",n);
printf("你总共走了[%d]步!\n",sum_step);
return 0;
}
最优路径
最新推荐文章于 2023-09-09 20:17:49 发布