URI Problem 2619 Solution Super Luxury - URI Online Judge Solution

URI Online Judge Solution 2619 Super Luxury Using PostgreSQL Query Language.

Our company is looking to make a new contract for the supply of new super luxury products, and for this we need some data of our products.Your job is to display the name of the products, the name of the providers and the price, for the products whose price is greater than 1000 and its category is' Super Luxury.

Schema

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

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

categories
Column Type
id (PK) numeric
name character varying (255)

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

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

categories
Column	Type
id (PK)	numeric
name	character varying (255)

Tables

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

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

categories
id name
1 Super Luxury
2 Imported
3 Tech
4 Vintage
5 Supreme

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

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

categories
id	name
1	Super Luxury
2	Imported
3	Tech
4	Vintage
5	Supreme

Output Sample

name name price
Red Chair Sansul SA 2150.00
URI 2619 Solution in SQL:


SELECT products.name,providers.name,products.price
FROM products
INNER JOIN providers ON products.id_providers = providers.id
INNER JOIN categories ON products.id_categories = categories.id
WHERE price > 1000 AND categories.name = 'Super Luxury'

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

URI Online Judge Solution

Search This Blog