Codevita 2017 Round-1 Problem-C

Problem:
CodeVita 2017 Round 1 Problem -C
(download from below ...  if any problem in downloading then comment) 
http://s000.tinyupload.com/?file_id=52952119059621072275

Solution:
/*
 Author: Krishankant Ray
 * CodeVita 2017 Round 1
 */

#include<iostream>
#include<vector>

using namespace std;
int main()
{
    int d,k=0;
    string arr;
    cin>>d;
    cin>>arr;
    int n=arr.length();
    char R[n];

    for(int f=0; f<n; )
    {

        R[f]=arr[k++];

        f+=((2*d)-2);
    }
    for(int i=1; i<d-1;i++)
    {
        R[i]=arr[k++];
        for(int j=i; j<n;)
        {

            j+=((2*d)-2-(2*i));
            R[j]=arr[k++];

            j+=((2*i));
            if(j<n)
            R[j]=arr[k++];

        }
    }

    for(int l=d-1; l<n;l+=((2*d)-2))
    {
        R[l]=arr[k++];

    }
    for(int f=0; f<n;f++)
    {
        if(R[f]=='X')
            break;
        else
        cout<<R[f];
    }

    return 0;
}

Comments

Post a Comment

Popular posts from this blog

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 ...
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

LeetCode: 169 Majority Element

LEETCODE : 169. Majority Element Link :  https://leetcode.com/problems/majority-element/ Problem Description :  Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array. For example: Example 1: Input: [3,2,3] Output: 3   Example 2: Input: [2,2,1,1,1,2,2] Output: 2       ______________________________________________________________________________     Explaination :  There is pretty easy way to solve it by using count of every element and then returning the element which has count greater than n/2 . But this solution comes with a cost of O(n) time and O(n) space.  There is a better solution which can do the job in O(n) time and O(1) space. Atleast we are saving some of the space.  How does our space efficient algor...
Keep reading