Given two positive integers determine the greatest common divisor (gcd). Take the right most digit of the gcd to represent the number of rows in a pattern and the second right most digit to represent the columns

Enter POsitive integer:462
Enter positive integer:363
462%363 = 99
363%99 = 66
99%66=33
66%33=0
33 is the gcd

Number of rows = 3
Number of columns = 3
3**
33*
333

I tried compiling this but all i get was errors and warnings and unlimited loops

You tried compiling what? Do you have code?

As fakepoo says, post your code, and we'll take a look.