URI Problem 2614 Solution September Rentals

URI Problem 2614 Solution September Rentals - URI Online Judge Solution

URI Online Judge Solution 2614 September Rentals Using PostgreSQL Query Language.

The video store is making its semi-annual report and needs your help. All you have to do is select the name of the clients and the date of rental, from the rentals made in September 2016.

Schema

customers
Column	Type
id (PK)	numeric
name	varchar
street	varchar
city	varchar

rentals
Column	Type
id (PK)	numeric
rentals_date	date (ISO/YMD)
id_customers (FK)	numeric

Tables

customers
id	name	street	city
1	Giovanna Goncalves Oliveira	Rua Mato Grosso	Canoas
2	Kauã Azevedo Ribeiro	Travessa Ibiá	Uberlândia
3	Rebeca Barbosa Santos	Rua Observatório Meteorológico	Salvador
4	Sarah Carvalho Correia	Rua Antônio Carlos da Silva	Apucarana
5	João Almeida Lima	Rua Rio Taiuva	Ponta Grossa
6	Diogo Melo Dias	Rua Duzentos e Cinqüenta	Várzea Grande

rentals
id	rentals_date	id_customers
1	2016-10-09	3
2	2016-09-02	1
3	2016-08-02	4
4	2016-08-02	2
5	2016-03-02	6
6	2016-04-04	4

Output Sample

name	rentals_date
Giovanna Goncalves Oliveira	2016-09-02

URI 2614 Solution in SQL:


SELECT customers.name "name",rentals.rentals_date "rentals_date"
FROM customers
INNER JOIN rentals ON customers.id = rentals.id_customers
WHERE rentals.rentals_date >= '2016-09-01' 
AND rentals.rentals_date <= '2016-09-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