URI Problem 2742 Solution Richard's Multiverse

URI Problem 2742 Solution Richard's Multiverse - URI Online Judge Solution

URI Online Judge Solution 2742 Richard's Multiverse Using PostgreSQL Query Language.

Richard is a famous scientist because of his multiverse theory, where he describes every hypothetical set of parallel universes by means of a database. Thanks to that you now have a job..

As your first task, you must select every Richard from dimensions C875 and C774, together with its existence probability (the famous factor N) with three decimal places of precision.

Remember that the N factor is calculated by multiplying the omega value by 1,618. The data must be sorted by the least omega value.

Schema

dimensions
Column	Type
id (PK)	numeric
name	varchar

life_registry
Column	Type
id (PK)	numeric
name	varchar
omega	numeric
dimensions_id (FK)	numeric

Tables

dimensions
id	name
1	C774
2	C784
3	C794
4	C824
5	C875

life_registry
id	name	omega	dimensions_id
1	Richard Postman	5.6	2
2	Simple Jelly	1.4	1
3	Richard Gran Master	2.5	1
4	Richard Turing	6.4	4
5	Richard Strall	1.0	3

Output Sample

name	The N Factor
Richard Gran Master	4.045

URI 2742 Solution in PostgreSQL:


SELECT life_registry.name, ROUND(life_registry.omega*1.618,3) "The N Factor"
FROM life_registry
INNER JOIN dimensions
ON life_registry.dimensions_id = dimensions.id
WHERE dimensions.name IN ('C875','C774') 
  AND life_registry.name LIKE 'Richard%';

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) { n1 = 0; printf("%d",n1); } else if(i==2) { n2 = 1; printf("%d",n2); }

URI Online Judge Solution 1149 Summing Consecutive Integers

URI Online Judge Solution 1149 Summing Consecutive Integers using C Programming Language. Write an algorithm to read a value A and a value N. Print the sum of N numbers from A (inclusive). While N is negative or ZERO, a new N (only N) must be read. All input values are in the same line. Input The input contains only integer values, can be positive or negative. Output The output contains only an integer value. Input Sample Output Sample 3 2 7 3 -1 0 -2 2 7 Solution using C : #include <stdio.h> int main() { int a,n,s=0; scanf("%d%d",&a,&n); while(n<=0) scanf("%d",&n); while(n) { s += a++; n--; } printf("%d\n",s); return 0; }

URI Online Judge Solution

Search This Blog