Canadian Computing Competition: 2000 Stage 1, Junior #2
The digits 
~0~, 
~1~, and 
~8~ look much the same if rotated 
~180~ degrees on the page (turned upside down). Also, the digit 
~6~ looks much like a 
~9~, and vice versa, when rotated ~180~ degrees on the page. A multi-digit number may also look like itself when rotated on the page; for example 
~9966~ and 
~10\,801~ do, but 
~999~ and 
~1234~ do not.
You are to write a program to count how many numbers from a given interval look like themselves when rotated ~180~ degrees on the page. For example, in the interval ![[1 \dots 100]](//static.dmoj.ca/mathoid/1fb9c7149d7a1f23f02745131e9c247ebf384b1b/svg)
~[1 \dots 100]~ there are six: ~1~, ~8~, 
~11~, 
~69~, 
~88~, and 
~96~.
Your program should take as input two integers, 
~m~ and 
~n~, which define the interval to be checked, 
~1 \le m \le n \le 32\,000~. The output from your program is the number of rotatable numbers in the interval.
You may assume that all input is valid.
Sample Input
1
100
Sample Output
6
Comments
this one is a bit tricky, but its not too complicated if you have done an ambigram before. you really want to focus on reversing the numbers(list) and then configureing the 6's and 9's so that you will reverse its positions by looping (for loop would be easiest).
This comment is hidden due to too much negative feedback. Show it anyway.
man stfu
Says the one who didn't even solve it yet.
(Please don't just say things are "easy" for no reason, it may make others feel bad)
That's how you deal with them!
nice one