URI Problem 2455 Solution Gangorra - URI Online Judge Solution

URI Online Judge Solution 2455 Gangorra Using Python Programming Language.

Joãozinho has just changed schools and the first thing he noticed at the new school is that the seesaw of the playground is not symmetrical, one end is longer than the other. After playing a few times with a friend of the same weight, he realized that when he is at one end, the seesaw unbalances towards his side (that is, he is at the bottom, and the friend at the top), they switch sides, the seesaw is unbalanced towards the friend's side. Without understanding the situation, Joãozinho asked for help from another friend from another series, who explained that the length of the side interferes with the balance of the seesaw, as the seesaw will be balanced when

P 1 ∗ C 1 = P 2 ∗ C 2

where P 1 and P 2 are the child's weights on the left and right side, respectively, and C 1 and C 2 are the lengths of the seesaw on the left and right side, respectively.

Input

The first and only line of the entry contains 4 integers, P1 , C1 , P2 and C2 , (10 ≤ P1 , C1 , P2 and C2 ≤ 100) in that order.

Output
If the seesaw is balanced, print '0'. If it is unbalanced so that the left child is at the bottom, print '-1', otherwise, print '1'.

Entry Examples	Output Examples
30 100 60 50	0

40 40 38 60	1

35 80 35 75	-1

URI 2455 Solution in Python:


P1,C1,P2,C2 = map(int,input().split())
P1 = P1 * C1
P2 = P2 * C2
if P1 == P2:
    print("0")
elif P1>P2:
    print("-1")
else:
    print("1")

Comments

URI Problem 1001 Solution Extremely Basic - - URI Online Judge Solution

URI Online Judge Problem 1001 Extremely Basic Solution using C, Python Programming Language. Read 2 variables, named A and B and make the sum of these two variables, assigning its result to the variable X . Print X as shown below. Print endline after the result otherwise you will get “ Presentation Error ”. Input The input file will contain 2 integer numbers. Output Print the letter X (uppercase) with a blank space before and after the equal signal followed by the value of X, according to the following example. Obs.: don't forget the endline after all. Samples Input Samples Output 10 9 X = 19 -10 4 X = -6 15 -7 X = 8 URI 1001 Solution in Python A = int(input()) B = int(input()) X = A + B print("X =",X); URI 1001 Solution in C: #include int main() { int A,B,X; scanf ("%d %d", &A, &B); X=A+B; printf("X = %d\n",X); return 0; }

URI Problem 1179 Solution Array Fill IV - URI Online Judge Solution

URI Online Judge Solution 1179 Array Fill IV Using C, Python Programming Language. In this problem you need to read 15 numbers and must put them into two different arrays: par if the number is even or impar if this number is odd. But the size of each of the two arrrays is only 5 positions. So every time you fill one of two arrays, you must print the entire array to be able to use it again for the next numbers that are read. At the end, all remaining numbers of each one of these two arrays must be printed beginning with the odd array. Each array can be filled how many times are necessary. Input The input contains 15 integer numbers. Output Print the output like the following example. Input Sample Output Sample 1 3 4 -4 2 3 8 2 5 -7 54 76 789 23 98 par[0] = 4 par[1] = -4 par[2] = 2 par[3] = 8 par[4] = 2 impar[0] = 1 impar[1] = 3 impar[2] = 3 impar[3] = 5 impar[4] = -7 impar[0] = 789 impar[1] = 23 par[0] = 54 par[1] = 76 par[2] = 98 Solution Using C: #include <stdi...

URI Online Judge Solution 1069 Diamonds and Sand

URI Online Judge Solution 1069 Diamonds and Sand using Python Programming Language. John is working in a diamond mine, trying to extract the highest number of diamond "<>". He must exclude all sand particles found "." in this process and after a diamond can be extracted, new diamonds can be formed. If he has as an input. <... << .. >> ....> .... >>>. three diamonds are formed. The first is taken from <..> resulting. <... <> ....> .... >>>. The second diamond is then removed, leaving. <.......> .... >>>. The third diamond is then removed, leaving at the end ..... >>>. without the possibility of extracting new diamonds. Input Read an integer N that is the number of test cases. Then follows N lines each up to 1000 characters, including "<" ,">" and "." Output You must print the amount of diamonds that can be extrated in each test ca...

URI Online Judge Solution

Search This Blog