Skip to main content

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 ExamplesOutput 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

Popular posts from this blog

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 Online Judge Solution 1151 Easy Fibonacci

URI Online Judge Solution 1151 Easy Fibonacci using C Programming Language. he following sequence of numbers 0 1 1 2 3 5 8 13 21 ... is known as the Fibonacci Sequence. Thereafter, each number after the first 2 is equal to the sum of the previous two numbers. Write an algorithm that reads an integer N (N < 46) and that print the first N numbers of this sequence. Input The input file contains an integer number N (0 < N < 46). Output The numbers ​​should be printed on the same line, separated by a blank space. There is no space after the last number. Thanks to Cássio F. Input Sample Output Sample 5 0 1 1 2 3 Solution using C : #include <stdio.h> int main() {     int n,i,n1,n2,t;     scanf("%d",&n);     for(i=1; i<=n; i++)     {         if(i==1)         {             n1 = 0;             printf("%d",n1);         }         else if(i==2)         {             n2 = 1;             printf("%d",n2);         }

URI Online Judge Solution 1149 Summing Consecutive Integers

URI Online Judge Solution 1149 Summing Consecutive Integers using C Programming Language. Write an algorithm to read a value A and a value N. Print the sum of N numbers from A (inclusive). While N is negative or ZERO, a new N (only N) must be read. All input values are in the same line. Input The input contains only integer values, ​​can be positive or negative. Output The output contains only an integer value. Input Sample Output Sample 3 2 7 3 -1 0 -2 2 7 Solution using C : #include <stdio.h> int main() {     int a,n,s=0;         scanf("%d%d",&a,&n);         while(n<=0)             scanf("%d",&n);         while(n)         {             s += a++;             n--;         }         printf("%d\n",s);     return 0; }