**Library Fine**

### Problem Statement :

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.: fine = 0). 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, fine = 15 Hackos * (the number of days late). 3. 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). 4. If the book is returned after the calendar year in which it was expected, there is a fixed fine of 10000 Hackos. 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 10000 Hackos. Example d1, m1, y1 = 14, 7, 2018 d2, m2, y2 = 5, 7, 2018 The first values are the return date and the second are the due date. The years are the same and the months are the same. The book is 14 - 5 = 9 days late. Return 9 * 5 = 135. Function Description Complete the libraryFine function in the editor below. libraryFine has the following parameter(s): d1, m1, y1: returned date day, month and year, each an integer d2, m2, y2: due date day, month and year, each an integer Returns int: the amount of the fine or 0 if there is none Input Format The first line contains 3 space-separated integers, d1, m1, y1, denoting the respective day, month and year on which the book was returned. The second line contains 3 space-separated integers, d2, m2, y2, denoting the respective day, month and year on which the book was due to be returned. Constraints 1 <= d1, d2 <= 31 1 <= m1, m2 <=12 1 <= y1, y2 <= 3000 It is guaranteed that the dates will be valid Gregorian calender dates.

### Solution :

` ````
Solution in C :
C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int edd, emm, eyyyy, add, amm, ayyyy;
int fine =0;
scanf("%d%d%d%d%d%d", &add, &amm, &ayyyy, &edd, &emm, &eyyyy);
if(ayyyy < eyyyy){
fine = 0;
}
else if(ayyyy > eyyyy){
fine = 10000;
}
else if(ayyyy == eyyyy){
if(amm < emm){
fine = 0;
}
else if(amm > emm){
fine = 500 * (amm - emm);
}
else if(amm == emm){
if(add <= edd){
fine = 0;
}
else if(add > edd){
fine = 15 * (add - edd);
}
}
}
printf("%d", fine);
return 0;
}
C ++ :
#include<iostream>
using namespace std;
int main()
{
int actual[3],expected[3],i,j;
for(i=0;i<3;i++)
cin>>actual[i];
for(i=0;i<3;i++)
cin>>expected[i];
if(actual[2]-expected[2]<0)
cout<<0;
else if(actual[2]-expected[2]>0)
cout<<10000;
else if(actual[1]-expected[1]<0)
cout<<0;
else if(actual[1]-expected[1]>0)
cout<<500*(actual[1]-expected[1]);
else if(actual[0]-expected[0]>0)
cout<<15*(actual[0]-expected[0]);
else
cout<<0;
}
Java :
import java.util.Scanner;
class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int d2 = sc.nextInt(), m2 = sc.nextInt(), y2 = sc.nextInt();
int d1 = sc.nextInt(), m1 = sc.nextInt(), y1 = sc.nextInt();
if (y2 > y1) {
System.out.println(10000);
} else if (y2 < y1 || m2 < m1 || m2 == m1 && d2 <= d1) {
System.out.println(0);
} else if (m1 == m2) {
System.out.println(15 * (d2 - d1));
} else {
System.out.println(500 * (m2 - m1));
}
}
}
python 3 :
"""libraryfine.py"""
def main(N):
sum0 = 0
D = N[0][0]-N[1][0]
M = N[0][1]-N[1][1]
Y = N[0][2]-N[1][2]
if D > 0 and M == 0 and Y == 0:
sum0 = 15*(D)
elif M > 0 and Y == 0:
sum0 = 500*(M)
elif Y > 0:
sum0 = 10000*(Y)
print(sum0)
if __name__ == '__main__':
N = [list(map(int,input().split(" "))) for i in [1,2]]
main(N)
```

## View More Similar Problems

## Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →## No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →## Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →## Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →## Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →## Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →