URI Problem 2620 Solution Orders in First Half

URI Problem 2620 Solution Orders in First Half - URI Online Judge Solution

URI Online Judge Solution 2620 Orders in First Half Using PostgreSQL Query Language.

The company's financial audit is asking us for a report for the first half of 2016. Then display the customers name and order number for customers who placed orders in the first half of 2016.

Schema

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

orders
Column	Type
id (PK)	numeric
orders_date	date (ISO/YMD)
id_customers (FK)	numeric

Tables

customers
id	name	street	city	state	credit_limit
1	Nicolas Diogo Cardoso	Acesso Um	Porto Alegre	RS	475
2	Cecília Olivia Rodrigues	Rua Sizuka Usuy	Cianorte	PR	3170
3	Augusto Fernando Carlos Eduardo Cardoso	Rua Baldomiro Koerich	Palhoça	SC	1067
4	Nicolas Diogo Cardoso	Acesso Um	Porto Alegre	RS	475
5	Sabrina Heloisa Gabriela Barros	Rua Engenheiro Tito Marques Fernandes	Porto Alegre	RS	4312
6	Joaquim Diego Lorenzo Araújo	Rua Vitorino	Novo Hamburgo	RS	2314

orders
id	orders_date	id_customers
1	2016-05-13	3
2	2016-01-12	2
3	2016-04-18	5
4	2016-09-07	4
5	2016-02-13	6
6	2016-08-05	3

Output Sample

name	id
Augusto Fernando Carlos Eduardo Cardoso	1
Cecília Olivia Rodrigues	2
Sabrina Heloisa Gabriela Barros	3
Joaquim Diego Lorenzo Araújo	5

URI 2620 Solution in SQL:


SELECT customers.name,orders.id
FROM customers
INNER JOIN orders 
ON customers.id = orders.id_customers
WHERE orders.orders_date>='2016-01-01' 
  AND orders.orders_date <= '2016-06-30'

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