RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
USACO0207 파일 입출력

Promotion Counting

Bronze I 브론즈 I
난이도
2s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

Bessie the cow is helping Farmer John run the USA Cow Olympiad (USACO), an
on-line contest where participants answer challenging questions to demonstrate
their mastery of bovine trivia.

In response to a wider range of participant backgrounds, Farmer John recently
expanded the contest to include four divisions of difficulty: bronze, silver,
gold, and platinum. All new participants start in the bronze division, and any
time they score perfectly on a contest they are promoted to the next-higher
division. It is even possible for a participant to be promoted several times
within the same contest. Farmer John keeps track of a list of all contest
participants and their current divisions, so that he can start everyone out at
the right level any time he holds a contest.

When publishing the results from his most recent contest, Farmer John wants to
include information on the number of participants who were promoted from bronze
to silver, from silver to gold, and from gold to platinum. However, he
neglected to count promotions as they occurred during the contest. Bessie,
being the clever bovine she is, realizes however that Farmer John can deduce the
number of promotions that occurred solely from the number of participants at
each level before and after the contest. Please help her perform this
computation!

Problem credits: Brian Dean

제약

Problem credits: Brian Dean

입력 형식

Input consists of four lines, each containing two integers in the range
0..1,000,000. The first line specifies the number of bronze participants
registered before and after the contest. The second line specifies the number of
silver participants before and after the contest. The third line specifies the
number of gold participants before and after the contest. The last line
specifies the number of platinum participants before and after the contest.

출력 형식

Please output three lines, each containing a single integer. The first line
should contain the number of participants who were promoted from bronze to
silver. The second line should contain the number of participants who were
promoted from silver to gold. The last line should contain the number of
participants who were promoted from gold to platinum.

파일 입력 / 출력
이 문제는 표준 입출력을 사용하지 않습니다. 프로그램은 다음 파일을 읽고 써야 합니다:
입력을 읽을 파일 promote.in
출력을 쓸 파일 promote.out
예제 1
입력
1 2
1 1
1 1
1 2
출력
1
1
1
설명

In this example, 1 participant was registered in each division prior to the
contest. At the end of the contest, 2 participants were registered in bronze
and platinum. One way this could have happened is that 2 new participants
joined during the contest; one was promoted all the way to platinum, and the
other stayed in bronze.

문제 정보

riseoj 작성

출처 올림피아드 > USACO > 2015-2016 > January > Bronze

태그

평가 및 의견

Promotion Counting

개요
출제자 난이도 Bronze I 브론즈 I 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Promotion Counting

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8