My Github repository

Check out my github account for more programs :

https://github.com/krishankantray/

Comments

Post a Comment

Popular posts from this blog

ProjectEuler -01 Multiple of 3 and 5

PROBLEM :  https://www.hackerrank.com/contests/projecteuler/challenges/euler001 If we list all the natural numbers below that are multiples of or , we get and . The sum of these multiples is . Find the sum of all the multiples of or below . Input Format First line contains that denotes the number of test cases. This is followed by lines, each containing an integer, . Constraints Output Format For each test case, print an integer that denotes the sum of all the multiples of or below . Sample Input 0 2 10 100 Sample Output 0 23 2318 Explanation 0 For , if we list all the natural numbers below that are multiples of or , we get and . The sum of these multiples is . Similarly for , we get . Solution : #include <iostream> using namespace std; int main () { int t; cin >> t; while (t -- ) { long long int n, x, y, z, m3, m5, m15, sum = 0 ; ...
Keep reading

Codechef MAY17 chef and his daily routine ( code: CHEFROUT )

Problem : https://www.codechef.com/problems/CHEFROUT Chef's daily routine is very simple. He starts his day with cooking food, then he eats the food and finally proceeds for sleeping thus ending his day. Chef carries a robot as his personal assistant whose job is to log the activities of Chef at various instants during the day. Today it recorded activities that Chef was doing at N different instants. These instances are recorded in chronological order (in increasing order of time). This log is provided to you in form of a string s of length N, consisting of characters 'C', 'E' and 'S'. If s [i] = 'C', then it means that at the i-th instant Chef was cooking, 'E' denoting he was eating and 'S' means he was sleeping. You have to tell whether the record log made by the robot could possibly be correct or not. Input The first line of the input contains an integer T denoting the number of test cases. The description of T te...
Keep reading

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