Skip to main content

URI Problem 2738 Solution Contest - URI Online Judge Solution

URI Online Judge Solution 2738 Contest Using PostgreSQL Query Language. 
The Mars Technology University has Open Positions for researchers. However, the computer responsible for processing the candidates' data is broken. You must present the candidate list, containing the name and final score (with two decimal places of precision) of each candidate. Remember to show the list ordered by score (highest first). 
The score is given by the weighted average described as:

Schema

candidate
ColumnType
id (PK)integer
namevarchar
 
score
ColumnType
candidate_id (FK)integer
mathnumeric
specificnumeric
project_plannumeric

Tables

candidate
idname
1Michael P Cannon
2Barbra J Cable
3Ronald D Jones
4Timothy K Fitzsimmons
5Ivory B Morrison
6Sheila R Denis
7Edward C Durgan
8William K Spencer
9Donna D Pursley
10Ann C Davis
 
score
candidate_idmathspecificproject_plan
1765821
24522
3155912
4414299
522909
6827715
7829956
811422
9162994
101759

Output Sample

nameavg
Edward C Durgan74.10
Timothy K Fitzsimmons70.30
Donna D Pursley58.90
Sheila R Denis47.00
Michael P Cannon43.10
Ivory B Morrison35.90
Ann C Davis31.80
Ronald D Jones26.70
William K Spencer14.40
Barbra J Cable13.30

URI 2738 Solution in PostgreSQL:


SELECT Candidate.name,ROUND(((Score.math*2) + (specific*3) + (project_plan*5))/10,2)  as avg
FROM Candidate
INNER JOIN Score
ON Candidate.id = Score.candidate_id
ORDER BY avg DESC

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