Skip to main content

URI Problem 2740 Solution League - URI Online Judge Solution

URI Online Judge Solution 2740 League Using PostgreSQL Query Language.
The International Underground Excavation League is a success between alternative sports, however the staff responsible for organizing the events doesn’t understand computers at all, they only know how to dig and the sport rule set. As such, you were hired to solve the League’s problem. 

Select the three first placed with the initial phrase "Podium: " and select the last two, which will be demoted to a lower league with the initial phrase “Demoted:".

Schema

league
ColumnType
position (PK)integer
teamvarchar

Tables

league
positionteam
1The Quack Bats
2The Responsible Hornets
3The Bawdy Dolphins
4The Abstracted Sharks
5The Nervous Zebras
6The Oafish Owls
7The Unequaled Bison
8The Keen Kangaroos
9The Left Nightingales
10The Terrific Elks
11The Lumpy Frogs
12The Swift Buffalo
13The Big Chargers
14The Rough Robins
15The Silver Crocs

Output Sample

name
Podium: The Quack Bats
Podium: The Responsible Hornets
Podium: The Bawdy Dolphins
Demoted: The Rough Robins
Demoted: The Silver Crocs

URI 2740 Solution in PostgreSQL:


SELECT Concat('Podium: ', team) as name
FROM League
WHERE position IN (SELECT MIN(position) FROM League)
UNION ALL
SELECT Concat('Podium: ', team) 
FROM League
WHERE position IN (SELECT MIN(position)+1 FROM League)
UNION ALL
SELECT Concat('Podium: ', team) 
FROM League
WHERE position IN (SELECT MIN(position)+2 FROM League)
UNION ALL
SELECT Concat('Demoted: ', team) 
FROM League
WHERE position IN (SELECT MAX(position)-1 FROM League)
UNION ALL
SELECT Concat('Demoted: ', team) 
FROM League
WHERE position IN (SELECT MAX(position) FROM League)
Labels:

Comments

  1. MAHIBIAApril 2, 2022 at 3:36 AM

    (select concat('Podium: ',team) as name from league
    where position in (select position from league order by position limit 3))
    union all
    (select concat('Demoted: ',team) as name from league
    where position in (select position from league order by position desc limit 2))

    ReplyDelete

Post a Comment

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; }
Post a Comment
Read more

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...
Post a Comment
Read more

URI Problem 1186 Solution Below the Secundary Diagonal - URI Online Judge Solution

URI Online Judge Solution 1186 Below the Secundary Diagonal   Using C, Python Programming Language. Read an uppercase character that indicates an operation that will be performed in an array M[12][12]. Then, calculate and print the sum or average considering only that numbers that are below of the Secundary diagonal of the array, like shown in the following figure (green area). Input The first line of the input contains a single uppercase character O ('S' or 'M'), indicating the operation Sum or Average (Média in portuguese) to be performed with the elements of the array. Follow 144 floating-point numbers of the array. Output Print the calculated result (sum or average), with one digit after the decimal point. Input Sample Output Sample S 5.0 0.0 -3.5 2.5 4.1 ... 12.6 Solution Using C: #include <stdio.h> int main() {     double a=0.0, M[12][12];     char T[2];     int x,y,c=0;     scanf("%s", &T);     for(x=0;x<=1...
Post a Comment
Read more