牛客练习赛35 C题 函数的魔法 (Floyd)
题目链接：https://ac.nowcoder.com/acm/contest/326/CFloyd变形,dis[i][F(i)]=1,dis[i][G(i)]=1,dis[i][i]=0最后求min(dis[F(A)][B],dis[G(A)][B])#include <iostream>#include <cstdio>#include <al...
