Daily Math Puzzle 2026/10/23
English
Several teams play a round-robin tournament in which each pair of teams plays exactly once. When a win is worth \(2\) points, a draw \(1\) point, and a loss \(0\) points, three teams \(A,B,C\) have point totals satisfying \(A>B>C\). The results are then scored again with only the value of a win changed to \(3\) points, and the three teams' point totals now satisfy \(C>B>A\). Find the smallest number of teams for which this can happen.
日本語
いくつかのチームが総当たり戦を行い,どの \(2\) チームも \(1\) 回ずつ対戦した. 勝ち \(2\) 点,引き分け \(1\) 点,負け \(0\) 点として集計すると,ある \(3\) チーム \(A,B,C\) の勝ち点は \(A>B>C\) だった. 試合結果を変えず,勝ちだけを \(3\) 点にして集計し直すと,この \(3\) チームの勝ち点は \(C>B>A\) となった. このようなことが起こりうるチーム数の最小値を求めよ.