RARS in GitHub

Find Leap Year:

• given an unsigned 32bit integer representing the year, in x10
• figure out if input is a leap year or not.
• if leap year return 1, if not return 0, if bad input return -1

Greates Common Divisor:

• Calculate grates common divisor of two 32bit unsigned integers.
• input from x10, x11
• return to x10.
• if bad input return -1

Nth Prime Number:

• Given unsigned 32bit integer N.
• Find Nth prime number, return in x10

Find Palindrome:

• Given unsigned 32bit integer in x10.
• Return 1 if given number is palindrome, else return 0
• if bad input return 0
• Ex:
  • 12321 - return 1
  • 1451 - return 0