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)

Comments

  1. (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; }

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 Problem 2764 Solution Date Input and Output - URI Online Judge Solution

URI Online Judge Solution 2764 Date Input and Output Using Python Programming Language.   Your teacher would like to make a program with the following characteristics: Read a date in the DD/MM/YY format; Print the date in MM/DD/YY format; Print the date in the YY/MM/DD format ; Print the date in DD-MM-YY format.  Input   The input consists of several test files. In each test file there is one line. The line has the following DD/MM/YY format where DD, MM and YY are integers. As shown in the following input example.  Output   For each file in the entry, you have an output file. The output file has three lines according to procedures 2, 3, and 4. As shown in the following output example. Input Samples Output Samples 02/08/10 08/02/10 10/08/02 02-08-10 29/07/03 07/29/03 03/07/29 29-07-03 URI 2764 Solution in Python: D = input() DD = D[0]+D[1] MM = D[3]+D[4] YY = D[6]+D[7] print(MM+'/'+DD+'/'+YY) print(YY+'/'+MM+'/'+DD) print(DD+'-'+MM+'-'+...