Skip to main content

URI Online Judge Solution 1047 Game Time with Minutes


URI Online Judge Solution 1047 Game Time with Minutes using C Programming Language.

Read the start time and end time of a game, in hours and minutes (initial hour, initial minute, final hour, final minute). Then print the duration of the game, knowing that the game can begin in a day and finish in another day,
Obs.: With a maximum game time of 24 hours and the minimum game time of 1 minute.

Input

Four integer numbers representing the start and end time of the game.

Output

Print the duration of the game in hours and minutes, in this format: “O JOGO DUROU XXX HORA(S) E YYY MINUTO(S)” . Which means: the game lasted XXX hour(s) and YYY minutes.
Input SampleOutput Sample
7 8 9 10
O JOGO DUROU 2 HORA(S) E 2 MINUTO(S)
7 7 7 7
O JOGO DUROU 24 HORA(S) E 0 MINUTO(S)
7 10 8 9
O JOGO DUROU 0 HORA(S) E 59 MINUTO(S)

URI 1047 Solution in C :

#include <stdio.h>
int main() {
   int h1, m1, h2, m2, h,m;
    scanf("%d %d %d %d", &h1, &m1, &h2, &m2);
    h = h2 - h1;
    if (h < 0)
    {
        h = 24 + (h2 - h1);
    }
    m = m2 - m1;
    if (m < 0)
    {
        m = 60 + (m2 - m1);
        h--;
    }
    if (h2 == h1 && m2 == m1)
    {
        printf("O JOGO DUROU 24 HORA(S) E 0 MINUTO(S)\n");
    }
    else printf("O JOGO DUROU %d HORA(S) E %d MINUTO(S)\n", h, m);

    return 0;
}
Labels:

Comments

  1. UnknownOctober 13, 2020 at 1:37 AM

    //Uri 1047 solution (wrong error 5% sliver)

    #include
    int main()
    {
    int s_hr,s_min,e_hr,e_min,d_hr,d_min;
    scanf("%d%d%d%d",&s_hr,&s_min,&e_hr,&e_min);
    d_hr=e_hr-s_hr;
    if(d_hr<0)
    {
    d_hr=24+d_hr;
    }
    d_min=e_min-s_min;
    if(d_min<0)
    {
    d_min=60+d_min;
    d_hr--;
    if(d_hr<0)
    {
    d_hr=24+d_hr;
    }
    }
    if(d_hr==0&&d_min==0)
    {
    printf("O JOGO DUROU 24 HORA(S) E 0 MINUTO(S)\n");

    }
    else
    {
    printf("O JOGO DUROU %d HORA(S) E %d MINUTO(S)\n",d_hr,d_min);

    }
    return 0;
    }//end of line

    ReplyDelete

Post a Comment

Popular posts from this blog

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; }
Post a Comment
Read more

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)         {         ...
Post a Comment
Read more

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...
Post a Comment
Read more