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