Skip to content

Instantly share code, notes, and snippets.

@gvoze32
Last active November 12, 2021 03:48
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save gvoze32/612d289f9b34a819679777b6df260d53 to your computer and use it in GitHub Desktop.
Save gvoze32/612d289f9b34a819679777b6df260d53 to your computer and use it in GitHub Desktop.
int min, max;
min=jam[0];
max=jam[0];
for(int i=0;i<2;i++)
{
if(min>jam[i])
{
min=jam[i];
}
else if(max<jam[i])
{
max = jam[i];
}
}
for (int t = 0; t < 2; t++)
{
selisih += menit[t];
}
total = (max-min)*60 + selisih;
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment