时间限制：1秒

空间限制：262144K

 #include <iostream>

 #include <queue>

 #include <cstdio>

 using namespace std;

 int main() {

     int x, y;

     int cnt = ;

     bool flag = false;

     scanf("%d,%d", &x, &y);

     queue<int> q;

     q.push(x);

     while (!q.empty()) {

         int len = q.size();

         for (int i = ; i < len; i++) {

             int tmp = q.front();

             q.pop();

             if (tmp == y) {

                 flag = true;

                 break;

             } else {

                 q.push(tmp + );

                 q.push(tmp - );

                 q.push(tmp * );

             }

         }

         if (flag)

             break;

         cnt++;

     }

     cout << cnt << endl;

     return ;

 }

 #include <iostream>

 #include <queue>

 #include <cstdio>

 using namespace std;

 int main() {

     int x, y;

     scanf("%d,%d", &x, &y);

     queue<pair<int, int> > q;

     pair<int, int> tmp({x, });

     q.push(tmp);

     while (!q.empty()) {

         tmp = q.front();

         q.pop();

         if (tmp.first == y) {

             cout << tmp.second << endl;

             break;

         } else {

             q.push({tmp.first + , tmp.second + });

             q.push({tmp.first - , tmp.second + });

             q.push({tmp.first * , tmp.second + });

         }

     }

     return ;

 }