URI Problem 2625 Solution CPF Validation - URI Online Judge Solution

URI Online Judge Solution 2625 CPF Validation Using PostgreSQL Query Language.

Your company's communications managers want a report on the natural person customer data that is registered in the database. But the old report had a problem. customers CPF data came without validation.

So your job now is to select all the CPFs of all the customers, and apply a mask on the return of the data.

The CPF mask looks like: '000.000.000-00'.

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

natural_person
Column	Type
id_customers (FK)	numeric
cpf	char (14)

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

natural_person
id_customers	cpf
1	26774287840
2	97918477200

Output Sample

CPF

267.742.878-40

979.184.772-00

URI 2625 Solution in SQL:


SELECT CONCAT(substr(cpf,1,3),'.',SUBSTR(cpf,4,3),'.',
       SUBSTR(cpf,7,3),'-',SUBSTR(cpf,10,2)) "CPF"
FROM natural_person;

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 1002 Solution Area of a Circle - URI Online Judge Solution

URI Online Judge Problem 1002 Solution Area of a Circle using Python Programming Language. The formula to calculate the area of a circumference is defined as A = π . R2. Considering to this problem that π = 3.14159: Calculate the area using the formula given in the problem description. Input The input contains a value of floating point (double precision), that is the variable R. Output Present the message "A=" followed by the value of the variable, as in the example bellow, with four places after the decimal point. Use all double precision variables. Like all the problems, don't forget to print the end of line after the result, otherwise you will receive "Presentation Error". Input Samples Output Samples 2.00 A=12.5664 100.64 A=31819.3103 150.00 A=70685.7750 URI 1002 Solution in Python R = float(input()); R = R*R*3.14159; print("A=%.4f" % R); URI 1002 Solution in C: #include #define A 3.14159 int main() {...

URI Problem 1173 Solution Array fill I - URI Online Judge Solution

URI Online Judge Solution 1173 Array fill I Using C, Python Programming Language. Read a number and make a program which puts this number in the first position of an array N[10]. In each subsequent position, put the double of the previous position. For example, if the input number is 1, the array numbers must be 1,2,4,8, and so on. Input The input contains an integer number V (V < 50). Output Print the stored number of each array position, in the form "N[i] = X", where i is the position of the array and x is the stored number at the position i. The first number for X is V. Solution Using C: #include <stdio.h> int main() { int n[10],x,i; scanf("%d",&x); for(i=0; i<10; i++) { if(i==0) n[i] = x; else n[i] = n[i-1]*2; } for(i=0; i<10; i++) ...

URI Online Judge Solution

Search This Blog