# Hackerrank “30 Days of Code” Çözümleri – Day 26: Nested Logic

Hackerrank’in 30 Days of Code içerisinde bulunan “Day 26: Nested Logic” sorusunun açıklaması ve çözümü. Bu soruda iç içe koşul ifadelerine göz attık.

► Hackerrank 30 Days of Code Çözümleri – Day 26: Nested Logic: https://www.hackerrank.com/challenges/30-nested-logic/problem

► Problem açıklaması:

Objective

Today’s challenge puts your understanding of nested conditional statements to the test. You already have the knowledge to complete this challenge, but check out the Tutorial tab for a video on testing.

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:

If the book is returned on or before the expected return date, no fine will be charged (i.e.: . fine = 0)

If the book is returned after the expected return day but still within the same calendar month and year as the expected return date, . fine = 15 Hackos * (the number of days late)

If the book is returned after the expected return month but still within the same calendar year as the expected return date, the . fine = 500 Hackos * (the number of months late)

If the book is returned after the calendar year in which it was expected, there is a fixed fine of 10000 Hackos.

Input Format The first line contains space-separated integers denoting the respective , , and on which the book was actually returned. The second line contains space-separated integers denoting the respective , , and on which the book was expected to be returned (due date).

Output Format

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

Sample Input

STDIN Function —– ——–

9 6 2015 day = 9, month = 6, year = 2015 (date returned)

6 6 2015 day = 6, month = 6, year = 2015 (date due)

Sample Output

45

This site uses Akismet to reduce spam. Learn how your comment data is processed.