URI Problem 2605 Solution Executive Representatives

URI Problem 2605 Solution Executive Representatives - URI Online Judge Solution

URI Online Judge Solution 2605 Executive Representatives Using PostgreSQL Query Language.

The financial sector needs a report on the providers of the products we sell. The reports include all categories, but for some reason, providers of products whose category is the executive, are not in the report.
Your job is to return the names of the products and providers whose category ID is 6.

Schema

products
Column	Type
id (PK)	numeric
name	varchar
amount	numeric
price	numeric
id_providers (FK)	numeric
id_categories (FK)	numeric

providers
Column	Type
id (PK)	numeric
name	varchar
street	varchar
city	varchar
state	char

categories
Column	Type
id (PK)	numeric
name	varchar

Tables

products
id	name	amount	price	id_providers	id_categories
1	Two-door wardrobe	100	800	6	8
2	Dining table	1000	560	1	9
3	Towel holder	10000	25.50	5	1
4	Computer desk	350	320.50	4	6
5	Chair	3000	210.64	3	6
6	Single bed	750	460	1	2

providers
id	name	street	city	state
1	Henrique	Av Brasil	Rio de Janeiro	RJ
2	Marcelo Augusto	Rua Imigrantes	Belo Horizonte	MG
3	Caroline Silva	Av São Paulo	Salvador	BA
4	Guilerme Staff	Rua Central	Porto Alegre	RS
5	Isabela Moraes	Av Juiz Grande	Curitiba	PR
6	Francisco Accerr	Av Paulista	São Paulo	SP

categories
id	name
1	old stock
2	new stock
3	modern
4	commercial
5	recyclable
6	executive
7	superior
8	wood
9	super luxury
10	vintage

Output Sample

name	name
Computer desk	Guilerme Staff
Chair	Caroline Silva

URI 2605 Solution in SQL


SELECT products.name,providers.name 
FROM products,providers
WHERE id_categories=6 
AND products.id_providers=providers.id;

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