Skip to main content

URI Problem 2617 Solution Provider Ajax SA - URI Online Judge Solution


URI Online Judge Solution 2617 Provider Ajax SA Using PostgreSQL Query Language.

The financial sector has encountered some problems in the delivery of one of our providers, the delivery of the products does not match the invoice.
Your job is to display the name of the products and the name of the provider, for the products supplied by the provider 'Ajax SA'.

Schema

providers
ColumnType
id (PK)numeric
namecharacter varying (255)
streetcharacter varying (255)
citycharacter varying (255)
statechar (2)
 
products
ColumnType
id (PK)numeric
namecharacter varying (255)
amountnumeric
pricenumeric
id_providers (FK)numeric

Tables

providers
idnamestreetcitystate
1Ajax SAPresidente Castelo BrancoPorto AlegreRS
2Sansul SAAv BrasilRio de JaneiroRJ
3South ChairsAv MoinhoSanta MariaRS
4Elon ElectroApoloSão PauloSP
5Mike ElectroPedro da CunhaCuritibaPR
 
products
idnameamountvalueid_providers
1Blue Chair30300.005
2Red Chair502150.001
3Disney Wardrobe400829.504
4Blue Toaster209.903
5Solar Panel303000.254

Output Sample

namename
Red ChairAjax SA

URI 2617 Solution in SQL:


SELECT products.name, providers.name
FROM products
INNER JOIN providers ON products.id_providers = providers.id
WHERE providers.name = 'Ajax SA'

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)         {         ...

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...