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 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 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