TopCoder SRM604: FoxAndWord
全探索。
public class FoxAndWord { public int howManyPairs(string[] words) { int n = words.Length; int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { for (int k = 0; k < words[i].Length; k++) { if (words[i].Substring(k) + words[i].Substring(0, k) == words[j]) { ans++; break; } } } } return ans; } }