diff options
| -rw-r--r-- | challenge-195/adam-russell/prolog/ch-2.p | 9 |
1 files changed, 3 insertions, 6 deletions
diff --git a/challenge-195/adam-russell/prolog/ch-2.p b/challenge-195/adam-russell/prolog/ch-2.p index 8af05aeacc..c56d00742b 100644 --- a/challenge-195/adam-russell/prolog/ch-2.p +++ b/challenge-195/adam-russell/prolog/ch-2.p @@ -27,12 +27,9 @@ most_frequent_even(ListNumbers, MostFrequentEven):- nth(1, FrequenciesSorted, F1), nth(2, FrequenciesSorted, F2), F1 == F2, - nth(N1, Frequencies, F1), - nth(N2, Frequencies, F2), - nth(N1, EvenNumbers, MostFrequentEven1), - nth(N2, EvenNumbers, MostFrequentEven2), - ((MostFrequentEven1 < MostFrequentEven2, MostFrequentEven = MostFrequentEven1); - (MostFrequentEven1 > MostFrequentEven2, MostFrequentEven = MostFrequentEven2)) + findall(MFE, (member(FX, FrequenciesSorted), FX == F1, nth(N, Frequencies, FX), nth(N, EvenNumbers, MFE)), MostFrequentEvens), + sort(MostFrequentEvens, MostFrequentEvensSorted), + nth(1, MostFrequentEvensSorted, MostFrequentEven) ) ), !. |