Cut the sticks

Cut the sticks

  •  
  •  
You are given  sticks, where the length of each stick is a positive integer. A cut operation is performed on the sticks such that all of them are reduced by the length of the smallest stick.
---Solution---

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int compare (const void * a, const void * b)
{
  return ( *(int*)a - *(int*)b );
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int element,k;
    cin>>element;
    int array[element];
    for(int i=0;i<element;i++)
        {
            cin>>array[i];
    }      qsort (array, element, sizeof(int), compare);
    int p=element;
    for(int i=0;i<element;i++)
        { 
         
      
         if(array[i]!=0)
             {cout<<p<<endl;
         if(p<=1)
         {break;}
            for(int j=element-1;j>=i;j--)
                {k=array[j]-array[i];
                if(k==0)
                {
                    array[j]=0;
                    p--;
                }
                 else
                     array[j]=k;
                }}
    }
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

HackeRank Problem John Watson performs an operation called a  right circular rotation  on an array of integers,  . After performing one  right circular rotation  operation, the array is transformed from   to  . Watson performs this operation   times. To test Sherlock's ability to identify the current element at a particular position in the rotated array, Watson asks   queries, where each query consists of a single integer,  , for which you must print the element at index   in the rotated array (i.e., the value of  ). -----Solution---- #include <math.h> #include <stdio.h> #include <string.h> #include <stdlib.h> #include <assert.h> #include <limits.h> #include <stdbool.h> int main(){     int n,k,q     scanf("%d %d %d",&n,&k,&q);     int *a = malloc(sizeof(int) * n);     for(int a_i = 0; a_i ...
Read more

Save the Prisoner!

Save the Prisoner! A jail has   prisoners, and each prisoner has a unique id number,  , ranging from   to  . There are   sweets that must be distributed to the prisoners. The jailer decides the fairest way to do this is by sitting the prisoners down in a circle (ordered by ascending  ), and then, starting with some random  , distribute one candy at a time to each sequentially numbered prisoner until all   candies are distributed. For example, if the jailer picks prisoner  , then his distribution order would be   until all   sweets are distributed. But wait—there's a catch—the very last sweet is poisoned! Can you find and print the ID number of the last prisoner to receive a sweet so he can be warned? --Solution--- #include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int main() {     /* Enter your code here. Read...
Read more