Fraction Class Difficulty: HARD

 Problem Statement

Suggest Edit

Implement Fraction Class with the following properties and functions.

Properties :

1.Numerator

2.Denominator

Functions :
1. Parametrized Constructor-

Sets the numerator and denominator values.

2. Add-

This function adds the two fraction following the adding up of two fraction rules and updates the first fractional number.

e.g.

if f1 = 1/4 and f2 = 3/5
f1.add(f2); results in: 
f1 = 17/20 and f2 = 3/5
3.Multiply-

This function multiplies the two fraction and updates the first fractional number.

e.g.

if f1 = 1/4 and f2 = 3/5
f1.multiply(f2); results in: 
f1 = 3/20 and f2 = 3/5
4.Simplify

This function simplifies the fractional value. Use inbuilt __gcd() function.

e.g.

if f1=5/20, which can be further simplified as 1/4 so this 
simplify will perform this.
8. Print() -

Prints the final answer in numerator/denominator form.

Input Format:
The first line of input contains two space-separated integer values, which represent numerator and denominator.

The second line of input contains an integer N representing queries to define how many times the operation must occur.

Next, N lines contain 3 space-separated integers representing the type of query, numerator, and denominator.
Output Format:
Print the value of the fraction after every query in a separate line.
Input Constraints:
 1 <= numerator <= 100
 1 <=denominator <= 100
 1 <= N <= 15
 type = 1 or 2
Sample Input 1:
67 14
1
2 7 78
Sample Output 1:
67/156
Explanation Of Sample Input 1:
Fist fraction is 67/14 and no. of queries is 1. So now 
in the next line 2 7 8 means type=2 which defines 
multiplication and second fraction is 7/78 so 67/74 * 7/78=67/156.
Sample Input 2:
47 71
3
1 91 78
2 67 75
1 36 74
Sample Output 2:
779/426
52193/31950
2506241/1182150
Explanation Of Sample Input 2:
Given fraction is 47/71 and no. of queries is 3. So now in the next 3 lines 1 91 78 means type = 1 which defines addition and second fraction is 91/78 so 47/71 + 91/78= 779/426.   
Next query is 2 67 75 means type=2 which defines multiplication and second fraction is 67/75 so 52193/31950 * 67/75= 52193/31950.  
Last query is 1 36 74 means type=1 which defines addition and second fraction is 36/74 so 52193/31950 + 36/74 = 2506241/1182150.

import math
class Fraction:
    def __init__(self,num,den):
        self.num=num
        self.den=den
    def printer(self):
        print(str(self.num)+'/'+str(self.den))
    #Create your fraction class here.

    def add(self,f2):
        self.num=self.num*f2.den+self.den*f2.num
        self.den=self.den*f2.den
        
    def multiply(self,f2):
        self.num*=f2.num
        self.den*=f2.den

    def simplify(self):
        gcd1=math.gcd(self.num,self.den)
        self.num=int(self.num/gcd1)
        self.den=int(self.den/gcd1)
        
        
        
a,b = input().split()
queries=int(input())
f1=Fraction(int(a),int(b))
for i in range(queries):
    dec,c,d = input().split()
    f2=Fraction(int(c),int(d))
    if int(dec)==1:
        f1.add(f2)
        f1.simplify()
        f1.printer()
    else:
        f1.multiply(f2)
        f1.simplify()
        f1.printer()

Comments

Post a Comment

Popular posts from this blog

Sum of Even Numbers till N

Given a number N, print sum of all even numbers from 1 to N. #include<iostream> using namespace std; int main(){        /*  Read input as specified in the question. * Print output as specified in the question. */     int sum,n;     cin>>n;     sum=0;     for (int i=1;i<=n;i++){         if (i%2==0){             sum=sum+i;         }     }     cout<<sum;    } ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include<iostream> using namespace std; int main(){        /*  Read input as specified in the question. * Print output as specified in the question. */     int sum,n;     cin>>n;     sum=0;     for (int i=1;i<=n;i++){     ...
Read more

Find the Runner-Up Score!

  Given the participants' score sheet for your University Sports Day, you are required to find the runner-up score. You are given     scores. Store them in a list and find the score of the runner-up. Input Format The first line contains  . The second line contains an array     of   integers each separated by a space. Constraints Output Format Print the runner-up score. Sample Input 0 5 2 3 6 6 5 Sample Output 0 5 Explanation 0 Given list is  . The maximum score is  , second maximum is  . Hence, we print   as the runner-up score. ### OPTIMIZED ### from   collections   import   Counter if  __ name__  ==  '__main__' :      n  =  int ( input ())      arr  =  map ( int ,   input () . split ())           lis = list ( Counter ( arr ) . keys ())      lis . sort ()  ...
Read more

Print All Substrings

  For a given input string(str), write a function to print all the possible substrings. Substring A substring is a contiguous sequence of characters within a string. Example: "cod" is a substring of "coding". Whereas, "cdng" is not as the characters taken are not contiguous Input Format: The first and only line of input contains a string without any leading and trailing spaces. All the characters in the string would be in lower case. Output Format: Print the total number of substrings possible, where every substring is printed on a single line and hence the total number of output lines will be equal to the total number of substrings. Note: The order in which the substrings are printed, does not matter. Constraints: 0 <= N <= 10^6 Where N is the length of the input string. Time Limit: 1 second Sample Input 1: abc Sample Output 1: a ab abc b bc c  Sample Input 2: co Sample Output 2: c co o #include <iostream> #include <cstring> us...
Read more