Position Of A Man

 A man from origin can move in below direction,

10 Mts right in first turn,
20 Mts up in second turn,
30 Mts left in third turn,
40 Mts down in fourth turn,
50 Mts right in fifth turn,

10 Mts right in sixth turn,
20 Mts up in seventh turn,
30 Mts left in eighth turn,
40 Mts down in ninth turn,
50 Mts right in tenth turn and so on


Write a program to print the position of man from origin in nth turn.
where 2<=n <= 1000.
n = no of turns.

Input Format:
Take integer from stdin.

Output Format:
print the position of man from origin.

Example Input:
3

Output:
-20 20

Explanation

  1. In each turn the step size increases by 10. Also, the turns move from right, up, left, down and right then the same steps keeps repeating
  2. In our case, man starts from (0,0) --> (10,0) --> (10,20) --> (-20,20)
  3. Hence answer is (-20,20)





SOLUTION:




n=int(input())
x=0
y=0
i=1
while i<=n:
    t=i%5         #since after 5 turns for 6th turn we have to start like 1st turn
    if(t==1):
        x=x+10    #first turn add 10 means to travel towrads right
    if(t==2):
        y=y+20    #second turn add 20 to travel towards up
        
    if(t==3):
        x=x-30     #3rd turn travel 30 towards left so subtract
    if(t==4):
        y=y-40     #4th to travel down 40 mts so subtract
    if(t==0):
        x=x+50    #5th to travel 50 towrads right so add
    i=i+1
print(x,y)



NOTE:  during left and right  VALUES wont be changing in Y values
             and During UP and DOWN  Values wont Changes in X values




Comments

Post a Comment

Popular posts from this blog

Efficient Janitor

  The janitor of a high school is insanely efficient. By the end of the day, all of the waster from the trash cans in the school has been shifted into plastic bags which can carry waster weighting between 1.01 pounds and 3.00 pounds. All of the plastic bags must be dumped into the trash cans outside the school. The janitor can carry at most 3.00 pounds at once. One trip is described as selecting a few bags which together don't weigh more than 3.00 pounds, dumping them in the outdoor trash can and returning to the school. The janitor wants to make minimum number of trips to the outdoor trash can. Given the number of plastic bags, n and the weights of each bag, determine the minimum number of trips if the janitor selects bags in the optimal way. For example, given  n=5 , plastic bags weighing weights  [1.01, 1.99, 2.5, 1.5, 1.01] , the janitor can carry all of the trash out in 3 trips:  [1.01+1.99, 2.5, 1.5+1.01] Constraints 1 <= n <= 1000 1.01 <= weight <=...
Read more

Right Arrow Pattern

Write a program to print the Right Arrow Pattern. Input Format: Take an input Integer which is from stdin. Output Format: print Right Arrow pattern Example Input: 5 Output: ***** **** *** ** * ** *** **** ***** SOLUTION: n=int(input()) for i in range(n):     for j in range(2*i):      #for spaces as each i th row has 2*i spaces         print(" ",end="")     for k in range(n-i):     #for stars as each i th row has n-i stars         print("*",end="")          print("")                     # half pattern is completed here for i in range(2,n+1):     #range started from 2 as the single star at middle is already                                         ...
Read more

X Pattern

  Write a program to take String if the length of String is odd print X pattern otherwise print INVALID. Input Format: Take a String as input from stdin. Output Format: print the desired Pattern or INVALID. Example Input: edyst Output: e t d s y d s e t SOLUTION: s=input() l=len(s) if(l%2 != 0): for i in range(0,l): j=l-i-1 for k in range(0,l): if(k==i or k==j): print(s[k],end="") else: print(end=" ") print("") else: print("INVALID")
Read more