Deliv-e-droid | 프로그래밍의 벗 PivotOJ
PivotOJ

Deliv-e-droid

시간 제한: 1000ms메모리 제한: 1024MB출처: CCC 2023 JuniorBOJ 28248

문제

In the game, Deliv-e-droid, a robot droid has to deliver packages while avoiding obstacles. At the end of the game, the final score is calculated based on the following point system:

  • Gain 5050 points for every package delivered.
  • Lose 1010 points for every collision with an obstacle.
  • Earn a bonus 500500 points if the number of packages delivered is greater than the number of collisions with obstacles.

Your job is to determine the final score at the end of a game.

입력

The input will consist of two lines. The first line will contain a non-negative integer PP, representing the number of packages delivered. The second line will contain a non-negative integer CC, representing the number of collisions with obstacles.

출력

The output will consist of a single integer FF, representing the final score.

예제

예제 1

입력
5
2
출력
730

예제 2

입력
0
10
출력
-100
코드를 제출하려면 로그인하세요.