> 데이터 베이스 > MySQL 튜토리얼 > CODEFORCE 246 Div.2 B题

CODEFORCE 246 Div.2 B题

WBOY
풀어 주다: 2016-06-07 15:18:28
원래의
1454명이 탐색했습니다.

Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i -th team has color x i and the kit for away games of this team has color y i ( x

Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi (xi?≠?yi).

In the tournament, each team plays exactly one home game and exactly one away game with each other team (n(n?-?1) games in total). The team, that plays the home game, traditionally plays in its home kit. The team that plays an away game plays in its away kit. However, if two teams has the kits of the same color, they cannot be distinguished. In this case the away team plays in its home kit.

Calculate how many games in the described tournament each team plays in its home kit and how many games it plays in its away kit.

관련 라벨:
f
원천:php.cn
본 웹사이트의 성명
본 글의 내용은 네티즌들의 자발적인 기여로 작성되었으며, 저작권은 원저작자에게 있습니다. 본 사이트는 이에 상응하는 법적 책임을 지지 않습니다. 표절이나 침해가 의심되는 콘텐츠를 발견한 경우 admin@php.cn으로 문의하세요.
인기 튜토리얼
더>
최신 다운로드
더>
웹 효과
웹사이트 소스 코드
웹사이트 자료
프론트엔드 템플릿