0分求调

#include <bits/stdc++.h>
using namespace std;
bool vis[100005];
int jlx,jly;
int t,x,y,ans;
void dfs(int a,int b)
{
	if (a==b){
		return;
	}
	if (!vis[x])
	{
		vis[x]=1;
		dfs(x+1,y);
		a++;
		ans++;
		dfs(x-1,y);
		a--;
		ans++;
		dfs(x*2,y);
		a*=2;
		ans++;
		vis[x]=0;
	}
}
int main()
{
    cin >> t;
    for (int i=1;i<=t;i++)
    {
    	cin >> x >> y;
    	jlx=x;
    	jly=y;
    	dfs(x,y);
	}
	cout << ans;
}