Contact Us

Your Name:

Your Email: *(required)

Your Message: *(required)

Comments

Post a Comment

Popular posts from this blog

URI Online Judge | 1041 Coordinates of a Point (Solution)

Image
Problem Link: https://www.urionlinejudge.com.br/judge/en/problems/view/1041 URI Online Judge | 1041 Coordinates of a Point Adapted by Neilor Tonin, URI   Brazil Timelimit: 1 Write an algorithm that reads two floating values (x and y), which should represent the coordinates of a point in a plane. Next, determine which quadrant the point belongs, or if you are over one of the Cartesian axes or the origin (x = y = 0). If the point is at the origin, write the message "Origem". If the point is over X axis write "Eixo X", else if the point is over Y axis write "Eixo Y". Input The input contains the coordinates of a point. Output The output should display the quadrant in which the point is. Sample Input Sample Output 4.5 -2.2 Q4 0.1 0.1 Q1 0.0 0.0 Origem Solution: #include <stdio.h> int main() {      double x, y;      scanf ( "%lf %lf" , &x, &y);     ...
Read more

URI Online Judge | 1021 Banknotes and Coins (Solution)

Image
Problem Link: https://www.urionlinejudge.com.br/judge/en/problems/view/1021 URI Online Judge | 1021 Banknotes and Coins By Neilor Tonin, URI   Brazil Timelimit: 1 Read a floating point value with two decimal places. This represents a monetary value. Next, calculate the fewest possible  notes  and  coins  in which the value can be decomposed. The considered notes are of 100, 50, 20, 10, 5, 2. The possible coins are of 1, 0.50, 0.25, 0.10, 0.05 and 0.01. Print the message “NOTAS:” followed by the list of notes and the message “MOEDAS:” followed by the list of coins. Input The input file contain float point number  N  (0 ≤  N  ≤ 1000000.00). Output Print the minimum quantity of banknotes and coins necessary to change the initial value, like as the given example. Sample Input Sample Output 576.73 NOTAS: 5 nota(s) de R$ 100.00 1 nota(s) de R$ 50.00 1 nota(s) de R$ 20.00 0 nota(s) de R$ 10.00 1 nota(s) de R$ 5.0...
Read more

URI Online Judge | 1036 Bhaskara's Formula (Solution)

Image
Problem Link: https://www.urionlinejudge.com.br/judge/en/problems/view/1036 URI Online Judge | 1036 Bhaskara's Formula Adapted by Neilor Tonin, URI   Brazil Timelimit: 1 Read 3 floating-point numbers. After, print the roots of bhaskara’s formula. If was impossible to calculate the roots because a division by zero or a square root of a negative number, presents the message  “Impossivel calcular” . Input Read 3 floating-point numbers A, B and C. Output Print the result with 5 digits after the decimal point or the message if it is impossible to calculate. Sample Inputs Sample Outputs 10.0 20.1 5.1 R1 = -0.29788 R2 = -1.71212 0.0 20.0 5.0 Impossivel calcular 10.3 203.0 5.0 R1 = -0.02466 R2 = -19.68408 10.0 3.0 5.0 Impossivel calcular Solution: #include<stdio.h> #include<math.h> int main() {      double a,b,c,r1,r2,del;      scanf ( "%lf %lf %lf" ,&a,&b,&c);...
Read more