没有合适的资源?快使用搜索试试~ 我知道了~
仅上传2023年竞赛真题_junior_1。
资源推荐
资源详情
资源评论
Problem J1: Deliv-e-droid
Problem Description
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 50 points for every package delivered.
• Lose 10 points for every collision with an obstacle.
• Earn a bonus 500 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.
Input Specification
The input will consist of two lines. The first line will contain a non-negative integer P ,
representing the number of packages delivered. The second line will contain a non-negative
integer C, representing the number of collisions with obstacles.
Output Specification
The output will consist of a single integer F , representing the final score.
Sample Input 1
5
2
Output for Sample Input 1
730
Explanation of Output for Sample Input 1
There are 5 packages delivered, so 5 × 50 = 250 points are gained. There are 2 collisions, so
2 × 10 = 20 points are lost. Since 5 > 2, a bonus 500 points are earned. Therefore, the final
score is 250 − 20 + 500 = 730.
Sample Input 2
0
10
Output for Sample Input 2
-100
Explanation of Output for Sample Input 2
There are 0 packages delivered, so 0 × 50 = 0 points are gained. There are 10 collisions, so
10 × 10 = 100 points are lost. Since 0 ≤ 10, no bonus points are earned. Therefore, the final
score is 0 − 100 + 0 = −100.
La version fran¸caise figure `a la suite de la version anglaise.
资源评论
Atlas_sy
- 粉丝: 16
- 资源: 1
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功