BFS算法

#include<bits/stdc++.h>
using namespace std;
int n,m;
bool vis[N];
viod bfs( ){

queue <pair<int,int>>q;
q.push(make_pair(n,,0));
while(!q.empty){
    
  int x=q.front().first;
  int len=q.front().second;
  q.pop();
  if(x==m)
    {
        cout<<len;
    }
  if(!vis[x]){
    q.push(make_pair(x+1,len+1));
    if(x*2<=m)q.push(make_pair(x*2,len+1));
    if(x*3<=m)q.push(make_pair(x*3,len+1));

  }
  vis[x]=1;
}
    
   
}













}