URI Problem 2624 Solution Number of Cities per Customers

URI Problem 2624 Solution Number of Cities per Customers - URI Online Judge Solution

URI Online Judge Solution 2624 Number of Cities per Customers Using PostgreSQL Query Language.

The company board asked you for a simple report on how many cities the company has already reached. To do this you must display the number of distinct cities in the customers table.

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

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

Output Sample

count

URI 2624 Solution in SQL:


SELECT COUNT(Distinct City) 
FROM Customers

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 Problem 1186 Solution Below the Secundary Diagonal - URI Online Judge Solution

URI Online Judge Solution 1186 Below the Secundary Diagonal Using C, Python Programming Language. Read an uppercase character that indicates an operation that will be performed in an array M[12][12]. Then, calculate and print the sum or average considering only that numbers that are below of the Secundary diagonal of the array, like shown in the following figure (green area). Input The first line of the input contains a single uppercase character O ('S' or 'M'), indicating the operation Sum or Average (Média in portuguese) to be performed with the elements of the array. Follow 144 floating-point numbers of the array. Output Print the calculated result (sum or average), with one digit after the decimal point. Input Sample Output Sample S 5.0 0.0 -3.5 2.5 4.1 ... 12.6 Solution Using C: #include <stdio.h> int main() { double a=0.0, M[12][12]; char T[2]; int x,y,c=0; scanf("%s", &T); for(x=0;x<=1...

URI Online Judge Solution

Search This Blog