URI Problem 2617 Solution Provider Ajax SA

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
Column Type
id (PK) numeric
name character varying (255)
street character varying (255)
city character varying (255)
state char (2)

products
Column Type
id (PK) numeric
name character varying (255)
amount numeric
price numeric
id_providers (FK) numeric

providers
Column	Type
id (PK)	numeric
name	character varying (255)
street	character varying (255)
city	character varying (255)
state	char (2)

products
Column	Type
id (PK)	numeric
name	character varying (255)
amount	numeric
price	numeric
id_providers (FK)	numeric

Tables

providers
id name street city state
1 Ajax SA Presidente Castelo Branco Porto Alegre RS
2 Sansul SA Av Brasil Rio de Janeiro RJ
3 South Chairs Av Moinho Santa Maria RS
4 Elon Electro Apolo São Paulo SP
5 Mike Electro Pedro da Cunha Curitiba PR

products
id name amount value id_providers
1 Blue Chair 30 300.00 5
2 Red Chair 50 2150.00 1
3 Disney Wardrobe 400 829.50 4
4 Blue Toaster 20 9.90 3
5 Solar Panel 30 3000.25 4

providers
id	name	street	city	state
1	Ajax SA	Presidente Castelo Branco	Porto Alegre	RS
2	Sansul SA	Av Brasil	Rio de Janeiro	RJ
3	South Chairs	Av Moinho	Santa Maria	RS
4	Elon Electro	Apolo	São Paulo	SP
5	Mike Electro	Pedro da Cunha	Curitiba	PR

products
id	name	amount	value	id_providers
1	Blue Chair	30	300.00	5
2	Red Chair	50	2150.00	1
3	Disney Wardrobe	400	829.50	4
4	Blue Toaster	20	9.90	3
5	Solar Panel	30	3000.25	4

Output Sample

name name
Red Chair Ajax 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

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

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 Online Judge Solution

Search This Blog