UVa 10055 - Hashmat the Brave Warrior solution

 

UVa 10055 - Hashmat the Brave Warrior

 Must watch:  More UVa Problem solution

Solution: 

#include<stdio.h>


int main() {
  long long int a, b, c;
  while (scanf("%lld%lld", & a, & b) == 2) {
    if (a > b)
      c = a - b;
    else
      c = b - a;
    printf("%lld\n", c);
  }
  return 0;
}

Keywords: jolly jumpers uva solution, jolly jumper program in c,uva 10127, 10038 - jolly jumpers, jolly jumper sequence, uva 10038, uva10055, 3n+1 problem solution