#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
char start[5], password[5]; //起始密码,正确密码
int vis[10000]; //每个四位数的访问情况
struct node
{
char str[5]; //密码
int step; //操作次数
};
//广搜
void BFS()
{
queue<node> Q;
node q;
strcpy(q.str, start);
q.step = 0;
Q.push(q);
while (!Q.empty())
{
q = Q.front();
Q.pop();
if (strcmp(q.str, password) == 0)
{
cout << q.step << endl;
return;
}
//将某一位加1
for (int i = 0; i < 4; i++)
{
node p = q;
if (p.str[i] == '9')
p.str[i] = '1';
else
p.str[i] += 1;
p.step++;
int temp;
//将字符串转换为整型
sscanf(p.str, "%d", &temp);
if (!vis[temp])
{
vis[temp] = 1;
Q.push(p);
}
}
//将某一位减1
for (int i = 0; i < 4; i++)
{
node p = q;
if (p.str[i] == '1')
p.str[i] = '9';
else
p.str[i] -= 1;
p.step++;
int temp;
sscanf(p.str, "%d", &temp);
if (!vis[temp])
{
vis[temp] = 1;
Q.push(p);
}
}
//交换相邻两位
for (int i = 0; i < 3; i++)
{
node p = q;
char t;
t = p.str[i];
p.str[i] = p.str[i + 1];
p.str[i + 1] = t;
p.step++;
int temp;
sscanf(p.str, "%d", &temp);
if (!vis[temp])
{
vis[temp] = 1;
Q.push(p);
}
}
}
}
int main()
{
int T;
cin >> T;
while (T--)
{
cin >> start >> password;
memset(vis, 0, sizeof(vis));
BFS();
}
return 0;
}
杭电OJ 1195(C++)
猜你喜欢
转载自blog.csdn.net/Intelligence1028/article/details/104582121
今日推荐
周排行