*codeforces 3A. Shortest path of the king模拟
*codeforces 3A. Shortest path of the king模拟模拟即可#include<bits/stdc++.h>int main(){ char a[3],b[3]; scanf("%s%s",a,b); int t,i,j,T; t=abs(a[1]-'0'-(b[1]-'0')); T=abs(a[0]-'a'-(b[0]-'a')); if(t>...
