HackerRank - 101 Hack 51 - Fair Cake Cutting

Problem: Fair Cake Cutting

Leha is a young man from Belarus. He loves cakes really much. In Leha's country, cakes are always evenly divided between people.
Leha wants to know how many people he should invite to his party if he has a cake whose size is equal to units and he wants each person to get exactly units of cake. Note that Leha doesn't take a piece for himself; in other words, the cake is only divided among the people he invited to the party.


Input Format
The first line contains three space-separated integers describing the respective values of , , and .

Constraints

    • It is guaranteed that the answer is an integer.

      Output Format

      Print a single integer denoting , the number of people he should invite to his party.


      Sample Input 0
       
      5 10 1

      Sample Output 0
       
      2

      Explanation 0
      In this sample case, , and . Leha wants each person to get units of cake. He has a cake whose size is unit, so if he invites people and the cake is distributed evenly among them, each person gets units of cake. Therefore, the answer is b=2 .

      Solutions : 

      #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    unsigned long int A,B,a,x;
    double p;
    cin>>A>>B>>a;
    p=((B*a)/A);
    
    x= floor(p);
    cout<<x;
    return 0;
}


      Comments

      Post a Comment

      Popular posts from this blog

      CodeChef : Breaking Bricks || Problem Code: BRKBKS

      CodeChef : https://www.codechef.com/JAN20B/problems/BRKBKS Problem: For her next karate demonstration, Ada will break some bricks. Ada stacked three bricks on top of each other. Initially, their widths (from top to bottom) are W1,W2,W3. Ada's strength is S. Whenever she hits a stack of bricks, consider the largest k≥0 such that the sum of widths of the topmost k bricks does not exceed S; the topmost k bricks break and are removed from the stack. Before each hit, Ada may also decide to reverse the current stack of bricks, with no cost. Find the minimum number of hits Ada needs in order to break all bricks if she performs the reversals optimally. You are not required to minimise the number of reversals. Input The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. The first and only line of each test case contains four space-separated integers S, W1, W2 and W3. Output For each test case, pri
      Keep reading

      HackerRank Problem : Reverse and capitalise first alphabet of each word.

        Problem : ( Link : Click here to visit this problem on HackerRank. ) Reverse the words in a string and capitalize the first letter of each reversed word, preserving the capitalization in the original stri. For eg: "Hello World" would be transformed to "OlleH DlroW". Input : The first line of input would be the number of test cases followed by each string in a line. Output : Output should be the string with each word reversed and first letter of each reversed word capitalized. Each output string should be printed to a new line.   Sample Input Sample Output 1 Hello World OlleH DlroW ------------------------------------------------------------------------------------------------------------------------------------------------------------------------ Solution : ( in C++ ) #include   <iostream> #include   <string> #include   <algorithm> #include   <cctype> using   namespace std ; int main (
      Keep reading

      CodeChef (AUG17 LunchTime) : Mathison and pangrams - MATPAN

      Problem: Mathison and pangrams Mathison recently inherited an ancient papyrus that contained some text. Unfortunately, the text was not a pangram . Now, Mathison has a particular liking for holoalphabetic strings and the text bothers him. The good news is that Mathison can buy letters from the local store in order to turn his text into a pangram. However, each letter has a price and Mathison is not very rich. Can you help Mathison find the cheapest way to obtain a pangram? Input  The first line of the input file will contain one integer, T , representing the number of tests. Each test will be formed from two lines. The first one contains 26 space-separated integers, representing the prices of all letters. The second will contain Mathison's initial text (a string of N lowercase letters). Output  The output file will contain T lines, one for each test. Each line will contain the answer for the corresponding test. Constraints : 1 ≤ T ≤ 10 1 ≤ N ≤ 50,0
      Keep reading