Question

Suppose the corridor in which you live has n tiles in a row from one end
to the other. There is a lot of junk strewn in the corridor.
E.g Suppose the corridor has only 5 tiles, and the junk consists of a solitary
shoe on Tile 2 and a chips packet and a piece of paper on Tile 5. The
junk may be represented in array form as [0, 1, 0, 0, 2], where each array
element a[i] represents the number of pieces of trash on the corresponding
tile.
Suppose you start from Tile s and you want to go to Tile e (s < e). The
junk blocks whatever tiles they are on, so you have to pick them up in
order to go down the corridor. Write programs in C and Python that will
return the array after you have cleared the trash in your path.
Enter your code in the indicated sections below and do not change the pre-existing code:
(a) cleaner.c
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main(){
int n; //Number of tiles in the corridor
int s; //start position
int e; //end position (s < e)
int i;
scanf("%d",&n);
scanf("%d", &s);
scanf("%d", &e);
int *hall = malloc(n*sizeof(int)); //Array with quantities
8
of litter
for(i=0;i<n;i++){
scanf("%d",&hall[i]);
}
//printf("%d\n", hall[3]);
//Your code here
for(i=0;i<n;i++){
printf("%d\n", hall[i]);
}
return 0;
}
(b) cleaner.py
n = int(input()) #Number of tiles in the corridor
s = int(input()) #start position
e = int(input()) #end position (s < e)
hall = [] #List with quantities
for i in range(n):
hall.append(int(input()))
#Your code here
for i in range(n):
print(hall[i])

(c) Implement this program in Coffeescript as cleaner.coffee.

Additional requirements:
(1) Your program should run for e < s as ell, i.e when you want to move
from right to left in the corridor.
(2) Your program should clear the trash on the start and end tiles as well.

Answer 1

a) Cleaner.c

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main(){
int n; //Number of tiles in the corridor
int s; //start position
int e; //end position (s < e)
int i;
scanf("%d",&n);
scanf("%d", &s);
scanf("%d", &e);
int *hall = malloc(n*sizeof(int)); //Array with quantities 8 of litter
for(i=0;i<n;i++){
scanf("%d",&hall[i]);
}
if(s<n+1&&s>0&&e<n+1&&e>0){ //to check whether the index is available
if(s>e){ //to arrange start and end in order
s=s+e;
e=s-e;
s=s-e;
}
for(i=s-1;i<e;i++){
hall[i]=0; //cleaning the trash
}
for(i=0;i<n;i++){
printf("%d\n", hall[i]); //printing tiles after cleaning process
}
}
else{
printf("oops tile not found"); //informing user that the specified tile is not found
}
return 0;
}

input :

5
4
2
1 0 5 6 2

Output :

1
0
0
0
2

b) cleaner.py

n = int(input()) #Number of tiles in the corridor
s = int(input()) #start position
e = int(input()) #end position (s < e)
hall = [] #List with quantities
for i in range(n):
hall.append(int(input()))
if(s in range(n) and e in range(n)) : #to check the tiles availabillity
if(s>e) : # arranging start and end in order
s=s+e
e=s-e
s=s-e
for i in range(s-1,e):
hall[i]=0 #cleaning trash
for i in range(n):
print(hall[i]) #display tiles after cleaning trash
else :
print ("oops tile not found")

Input

5
2
4
1
0
8
6
5

Output

1
0
0
0
5

c) cleaner.coffee:

(->
  
  n = prompt('Enter total no. of tiles')
  s = prompt('Enter the start position')
  e = prompt('Enter the End position')
  if s < n + 1 and s > 0 and e < n + 1 and e > 0
    if s > e
      ref1 = s
      s = e
      e = ref1
  hall = []
  i = 0
  len = n
  while i < len
    hall[i] = prompt('enter tile dust')
    i += 1
  x = s - 1
  while x < e
    hall[x] = 0
    x++
  i = 0
  while i < n
    x = hall[i]
    console.log x
    i++
  return
).call this

Input

3
1
2
1
10
7

Output

0
0
7

NOTE: Explanation done step by step.