URI Problem 2615 Solution Expanding the Business

URI Problem 2615 Solution Expanding the Business - URI Online Judge Solution

URI Online Judge Solution 2615 Expanding the Business Using PostgreSQL Query Language.

The video store company has the objectives of creating several franchises spread throughout Brazil. For this we want to know in which cities our customers live.

For you to help us select the name of all the cities where the rental company has clients. But please do not repeat the name of the city.

Schema

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

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	Uberlândia
5	João Almeida Lima	Rua Rio Taiuva	Ponta Grossa
6	Diogo Melo Dias	Rua Duzentos e Cinqüenta	Várzea Grande

Output Sample

city

Uberlândia

Canoas

Ponta Grossa

Várzea Grande

Salvador

URI 2615 Solution in SQL:


SELECT 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 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) { ...

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