（二维数组打表）F. 342 and Xiangqi

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
//二维数组打表
int f[7][7] = {0,1,1,2,3,3,4, 1,0,2,1,2,2,3, 1,2,0,1,2,2,3, 2,1,1,0,1,1,2,   3,2,2,1,0,2,1,   3,2,2,1,2,0,1,   4,3,3,2,1,1,0};
int main(){
    int t;
    cin >> t;
    while(t--){
    int res = 0;
    int s1,s2,e1,e2;
    cin >> s1 >> s2 >> e1 >> e2;
    s1--,s2--,e1--,e2--;
    int ans=0;
    ans = f[s1][e1] + f[s2][e2];
    res = f[s1][e2] + f[s2][e1];
    cout << min(ans,res) << endl;
    }
    return 0;
}