Going to office | hackerearth practice problem solution -

problem:-

Alice has the following two types of taxis:

Online taxi: It can be booked by using an online application from phones
Classic taxi: It can be booked anywhere on the road

The online taxis cost $O_{c}$

$O_{c}$

for the first $O_{f}$

$O_{f}$

km and $O_{d}$

$O_{d}$

for every km afterward. The classic taxis travel at a speed of $C_{s}$

$C_{s}$

km per minute. The cost of classic taxis are $C_{b}$

C_{b}

, $C_{m}$

C_{m}

, and $C_{d}$

$C_{d}$

that represents the base fare, cost for every minute that is spent in the taxi, and cost for each kilometer that you ride.
You are going to the office from your home. Your task is to minimize the cost that you are required to pay. The distance from your home to the office is D. You are required to select whether you want to use online or classic taxis to go to your office. If both the taxis cost the same, then you must use an online taxi.
Input format

First line: Single integer $D$
that denotes the distance from your house to the office
Next line: Three integers $O_{c}$
, $O_{f}$
$O_{f}$
, and $O_{d}$
$O_{d}$
Next line: Four integers $C_{s}$
, $C_{b}$
$C_{b}$
, $C_{m}$
$C_{m}$
, and $C_{d}$
$C_{d}$

Output format
If you select an online taxi to travel, then print a string ‘Online Taxi‘. Otherwise, select ‘Classic Taxi‘. You can print this string in a new, single line.
Constraints
1 $\leq$

\leq

$D, O_{c}, O_{f}, O_{d}, C_{s}, C_{b}, C_{m}, C_{d}$

$\leq$

\leq

10⁹

SAMPLE INPUT

13
6 7 4
4 2 1 2

SAMPLE OUTPUT

Online Taxi

Explanation

If Felix choose to use Online Taxi, it will cost Felix a total of

6 + (13 - 7) \times 4 = 30

Time Limit:1.0 sec(s) for each input file.

Memory Limit:64 MB

Source Limit:1024 KB

solution:-

#include<stdio.h>
int main()
{
 long long int d,oc,of,od,cs,cb,cm,cd;
     long long int cost1,cost2;
     scanf(“%lld”,&d);
     scanf(“%lld %lld %lld”,&oc,&of,&od);
     scanf(“%lld %lld %lld %lld”,&cs,&cb,&cm,&cd);
     cost1=oc+((d–of)*od);
     cost2=cb+((d/cs)*cm)+(d*cd);
     if(cost1<cost2||cost1==cost2)
      printf(“Online Taxi”);
     else
      printf(“Classic Taxi”);
     return 0;
}

Recommended post:-

Hackerearth Problems:-

Data structure:-

Key points:-

Must check this:-

PPS lab all the problems of 1st year

Post

What is file inclusion in C / preprocessor directives / Micros in c

what is Enumerated data types in C

What is Conditional Operator in C

What is type conversion in C

Matrix sum | Infytq solution

Self referential structure (Notation of linklist ) / Singly link list in C

Dynamic memory allocation in c

File Handling in C

Call by value and Call by reference

How to access the value of some variable using pointer

Pointer in C

Union in C

what is Array of structure in C

Structure and Union in c

Predefine function of C in string.h library

string in c.

Reading and writing of string using character array.

Practice questions on 2D array

2D Array ( two dimensional array) in c

string Representation of objects certification test hackerrank solution

Program to delete duplicates from a linked list

Program to find nth fibonacci number by dynamic programming

Program to find the sum of the subsets of an array

Program to generate all the subsets of an array

Recursive program to reverse a number

Program to find the minimum element in an array by recursion

Program to find the largest element in an array by recursion

Checking for Prime number using recursion

Recursive Program to calculate power of a number

Program to check Friendly pair

Going to office | hackerearth practice problem solution

problem:-

solution:-

Leave a Reply Cancel reply