본문 바로가기

HackerRank/Algorithms

Library Fine

Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is as follows:

  1. If the book is returned on or before the expected return date, no fine will be charged (i.e.: .
  2. If the book is returned after the expected return day but still within the same calendar month and year as the expected return date, .
  3. If the book is returned after the expected return month but still within the same calendar year as the expected return date, the .
  4. If the book is returned after the calendar year in which it was expected, there is a fixed fine of .

Charges are based only on the least precise measure of lateness. For example, whether a book is due January 1, 2017 or December 31, 2017, if it is returned January 1, 2018, that is a year late and the fine would be .

Input Format

The first line contains  space-separated integers denoting the respective , and  on which the book was returned. 
The second line contains  space-separated integers denoting the respective , and  on which the book was due to be returned.

Constraints

Output Format

Print a single integer denoting the library fine for the book received as input.

Sample Input

9 6 2015
6 6 2015

Sample Output

45

Explanation

Given the following return dates: 
Actual:  
Expected: 

Because , we know it is less than a year late. 
Because , we know it's less than a month late. 
Because , we know that it was returned late (but still within the same month and year).

Per the library's fee structure, we know that our fine will be . We then print the result of  as our output.






'HackerRank > Algorithms' 카테고리의 다른 글

Non-Divisible Subset  (0) 2018.07.19
Cut the sticks  (0) 2018.07.18
Sherlock and Squares  (0) 2018.07.18
Append and Delete  (0) 2018.07.18
Extra Long Factorials  (0) 2018.07.17