Cut Down & Plant - Trees

PKJ

 Coding Problem Keys 

 Cut Down & Plant - Trees 

 Problem Statement 

In a garden, there are N trees from left to right. The height of each tree is passed as input to the program. The gardener wants to cut down T trees completely from left to right, but if he cuts a tree of height H, then he must plant certain number of trees based on the following conditions.

    - If H is odd, then he must plant H trees of height ranging from 1 to H on the rightmost end.
    - If H is even, then he must plant H/2 trees of height ranging from H/2 to 1 on the rightmost end.

The value of T is also passed as the input to the program. The program must print the number of trees remaining in the garden after cutting down T trees as the output.

 Boundary Condition(s) 

1 <= N <= 100.
1 <= Height of each tree <= 50.
1 <= T <= 1000.

 Input Format 

The first line contains N.
The second line contains N integer values separated by a space.
The third line contains T.

 Output Format 

The first line contains the number of trees remaining in the garden after cutting down T trees.

 Example Input/Output 1 

 Input 

4
4 3 5 2
6

 Output 

11

 Explanation 

After cutting down the 1st tree, the trees in the garden becomes 3 5 2 2 1.
After cutting down the 2nd tree, the trees in the garden becomes 5 2 2 1 1 2 3.
After cutting down the 3rd tree, the trees in the garden becomes 2 2 1 1 2 3 1 2 3 4 5.
After cutting down the 4th tree, the trees in the garden becomes 2 1 1 2 3 1 2 3 4 5 1.
After cutting down the 5th tree, the trees in the garden becomes 1 1 2 3 1 2 3 4 5 1 1.
After cutting down the 6th tree, the trees in the garden becomes 1 2 3 1 2 3 4 5 1 1 1.
Now 11 trees remaining in the garden, so 11 is printed as the output.

 Example Input/Output 2 

 Input 

7
6 4 2 2 5 13 4
10

 Output 

29

 Note: Max Execution Time Limit: 50 millisecs 

 Solution 

 Programming Language: Python 3 Language 

n=int(input()) 
l=list(map(int,input().split())) 
t=int(input()) 
for i in range(t): 
    a=l[0] 
    l=l[1:] 
    if a%2: l+=list(range(1,a+1)) 
    else: l+=list(range(a//2,0,-1)) 
print(len(l))
#Published By PKJCODERS

 Alter 

n,l=int(input()),[*map(int,input().split())]
t=int(input())
for i in range(t):
    h=l.pop(0)
    if h&1: l+=[*range(1,h+1)]
    else: l+=[*range(h//2,0,-1)]
print(len(l))
#Published By PKJCODERS

 Programming Language: C Language 

#include<stdio.h>
#include<stdlib.h>
int main(){
    int n,t,a[100000],i,j,k;
    scanf("%d\n",&n);
    for(i=0;i<n;i++)
        scanf("%d ",&a[i]);
    scanf("%d",&t);
    for(i=0;i<t;i++){
        if(a[i]%2!=0)
            for(k=1;k<=a[i];k++)
                a[n++]=k;
        else
            for(k=a[i]/2;k>=1;k--)
                a[n++]=k;
    }printf("%d",n-t);
}
//Published By PKJCODERS

 Programming Language: C++ Language 

#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv){
    int i,j,n,t,a[100001];
    cin>>n;
    for(i=0;n>i;i=i+1)
        cin>>a[i];
        cin>>t;
    for(i=0;i<t;i=i+1){
        if(0!=a[i]%2)
            for(j=1;j<=a[i];j=j+1)
                a[n++]=j;
        else
            for(j=a[i]/2;j>=1;j=j-1)
                a[n++]=j;
    }cout<<n-t;
}
//Published By PKJCODERS

 Programming Language: Java Language 

import java.util.*;
public class Hello {
    public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		List<Integer>li=new ArrayList<Integer>();
		for(int i=0;i<n;i++) li.add(sc.nextInt());
		int t=sc.nextInt();
		while(t!=0){
		    int val=li.get(0);
		    li.remove(0);
		    if(val%2!=0){
		        for(int i=1;i<=val;i++) li.add(i);
		    }else{
		        for(int i=val/2;i>=1;i--) li.add(i);
		    }t--;
		}System.out.print(li.size());
	}
}
//Published By PKJCODERS

 Alter 

import java.util.*;
public class Hello {
    public static void main(String[] args){
		Scanner scan=new Scanner(System.in);
		int n=scan.nextInt();
		ArrayList<Integer> ar=new ArrayList<>();
		for(int i=0;i<n;i++)
		ar.add(scan.nextInt());
		int t=scan.nextInt();
		for(int j=0;j<t;j++){
		    int h=ar.get(0);
		    if(h%2!=0){
		        for(int i=1;i<=h;i++)
		        ar.add(i);
		        ar.remove(0);
		    }else{
		        for(int i=h/2;i>=1;i--)
		        ar.add(i);
		        ar.remove(0);
		    }
		}System.out.print(ar.size());
	}
}
//Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Shooting Targets

PKJ
 Coding Problem Keys   Shooting Targets   Problem Statement  N shooting targets are placed in a two dimensional grid and their x and y co-ordinates are provided. The x and y co-ordinates are integer value. When a bullet is fired along a straight line (either parallel to x-axis or y-axis) it eliminates all the targets along it's path. Assuming a bullet can be fired from negative infinity to positive infinity along a straight line parallel to both x and y-axis, find the minimum number of bullets that need to be fired to eliminate all targets.  Boundary Condition(s)  1 <= N <= 100 -100 <= x, y <= 100  Input Format  The first line contains the value of N. The next N lines contain the two integers (x and y) in each line separated by space(s).  Output Format  The first line contains the minimum number of bullets that need to be fired to eliminate all targets.  Example Input/Output 1   Input  9 4 0 4 1 ...
Click to Continue...

Four Strings Rectangle

PKJ
 Coding Problem Keys   Four Strings Rectangle    Problem Statement  Four strings out of which two have the same length L1 and the remaining two have the same length L2 are passed as the input to the program. The four strings must be printed in a L1*L2 rectangular matrix shape as shown in the example input/output. L1>=L2 and a string with L1 must appear on the top of the rectangle. The string which is on the top with length L1 will always be the first string in the input. Other three strings can occur in a random order in the input. The sequence of the string can be identified by the fact that the last letter of a string will be the first letter of another string (and you can safely assume the last letter will not occur more than once).  Input Format  The first line contains the string which represents the top of the rectangular matrix. The next three lines will contain th...
Click to Continue...

String Pattern - Inverted U

PKJ
 Coding Problem Keys   String Pattern - Inverted U   Problem Statement  Three strings S1, S2 and S3 are passed as the input. The program must print the pattern as shown in the Example Input/Output section. Out of these three strings, the two strings that are print along the left most column and the right most column will be of the same length. The string printed along the first row may or may not be equal in length to the other two strings but it's first character will be same as the first character of the string in the left most column and it's last character will be as same as the first character of the string in the right most column. The string values appearing on the top, left, right can appear in any order in the input.  Boundary Condition(s)  2 <= Length of strings <= 1000  Input Format  The first line contains the string value S1. The second line contains the string value S2. The third line contains the string value S3. ...
Click to Continue...

Swap and Reverse the String

PKJ
 Coding Problem Keys   Swap and Reverse the String   Problem Statement  The program must accept a string S as the input. The program must swap the first two characters then swap the next two characters and so on. The program must print the modified string S in the reverse order as the output. Note: The last character is not swapped since it has no pair as the length is odd.  Input Format  The first line contains the value of string S.  Output Format  The first line contains the modified string value.  Boundary Condition(s)  1 <= Length of S <= 10000  Example Input/Output 1   Input  elephant   Output  nthaepel   Explanation  The 1st and 2nd characters are e and l , after swapping the characters are l and e . The 3rd and 4th characters are e and p , after swapping the characters are p and e . The 5th and 6th characters are h and a , after swapping the characters are a and h . T...
Click to Continue...

Same Unit Digit Adjacent Numbers

PKJ
 Coding  Problem  Keys   Same Unit Digit Adjacent Numbers    Problem Statement  A matrix of size R*C (R rows and C columns) containing numbers (positive integer values) is passed as input. The program must print the count C of numbers in a given cell which has at least one adjacent cell (in the same row) containing a number with the same unit digit.  Input Format  The first line contains R and C separated by a space. Next R lines contains C values separated by a space.  Output Format  The first line contains C.  Boundary Conditions  1 <= R, C <= 100.  Example Input/Output 1   Input  4 3 20 27 67 13 74 100 37 90 97 53 75 44  Output  2  Explanation  The numbers are 27 67 in the first row where both have 7 as their unit digit.  Note:  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: C Language  #include<stdio.h...
Click to Continue...

Archery Game

PKJ
 Coding Problem Keys   Archery Game   Problem Statement  In an archery game, a bow and arrow is used to aim at the center of the circular target. The points are awarded based on how close the arrow hits the center of the target. The points for a shoot is calculated by the formula (3 - DISTANCE FROM CENTER OF THE TARGET) * 100 . The target has radius of 3 units and any arrow hitting outside of the target will result in 0 points. Given N records with archer's name and the arrow's landing coordinates print the leaderboard (sorted by the total points, with highest score first) rounded up to 2 decimal places. The archers name could be repeated as a single archer can shoot multiple times.  Boundary Conditions  1 <= N <= 1000.  Input Format  First line contains N. Next N lines contain the archers name and arrow...
Click to Continue...