Skip to main content

URI Problem 2454 Solution Flipper - URI Online Judge Solution

URI Online Judge Solution 2454 Flipper Using Python Programming Language.
Flipper is a type of game where a metal ball falls through a maze of paths until it reaches the bottom of the maze. The amount of points the player earns depends on the path the ball takes. The player can control the path of the ball by changing the position of some small doors in the maze. Each small door can be in position 0, which means facing left, or in position 1, which means facing right. Consider the flipper in the figure below, which has two small doors. Door P is in position 1 and door R is in position 0. This way, the ball will fall down path B.
You must write a program that, given the positions of the doors P and R, on this flipper in the figure, tell which of the three paths, A, B or C, the ball will fall!
Input
The entrance consists of only one line containing two numbers P (0 or 1) and R (0 or 1), indicating the positions of the two flaps on the figure flipper.
Output
The output of your program should also be just one line, containing a capital letter that indicates the path where the ball will fall: 'A', 'B' or 'C'.
Entry ExamplesOutput Examples

1 0

B

0 0

Ç


URI 2454 Solution in Python:


X,Y = map(int,input().split())
if X==0:
    print("C")
elif X==1 and Y==0:
    print("B")
else:
    print("A")

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; }