usaco 1.2.5 dual palindromes

这题。。相当的简单。尤其是跟在前一题后面，由于数据小，比上一题还要便当，还不需要输出转换进制后的数，但是。。还是有所收获的。。- -

唉。

Dual Palindromes
Mario Cruz (Colombia) & Hugo Rickeboer (Argentina)

A number that reads the same from right to left as when read from left to right is called a palindrome. The number 12321 is a palindrome; the number 77778 is not. Of course, palindromes have neither leading nor trailing zeroes, so 0220 is not a palindrome.

The number 21 (base 10) is not palindrome in base 10, but the number 21 (base 10) is, in fact, a palindrome in base 2 (10101).

Write a program that reads two numbers (expressed in base 10):

• N (1 <= N <= 15)
• S (0 < S < 10000)

and then finds and prints (in base 10) the first N numbers strictly greater than S that are palindromic when written in two or more number bases (2 <= base <= 10).

Solutions to this problem do not require manipulating integers larger than the standard 32 bits.

PROGRAM NAME: dualpal

INPUT FORMAT

A single line with space separated integers N and S.

SAMPLE INPUT (file dualpal.in)

3 25

OUTPUT FORMAT

N lines, each with a base 10 number that is palindromic when expressed in at least two of the bases 2..10. The numbers should be listed in order from smallest to largest.

SAMPLE OUTPUT (file dualpal.out)

26
27
28

1.函数还是很重要的。如果上题不偷懒把转换进制和回文判断写个函数的话，这题就不用重写了啊混蛋！偷懒什么的给我去面壁！

2.虽然队长大人一定看不到这文，还是忍不住说，队长大人我错了！以前（一直到现在）读题都是跳着读，差不多知道它在讲什么了，对一下sample没问题就急急忙忙的去码代码了，一直被队长骂，一直虚心接受屡教不改- -。觉得这样做也没啥错嘛~~今天这题就悲剧了。其实看到标题就应该意识到……每个数至少要在两个进制下是回文啊你妹！开始我居然还大胆+脑残的去怀疑数据了，11明明是回文嘛- -。。。泪。这次幸好只要略略改下就可以了，要是遇上由于没仔细读题导致整个数据结构用错才真是……说白了，这也是懒吧混蛋！

3.码到一半居然有人提醒我明天是情人节……………………………………说到底没妹子也是懒吧……………………………………

T-T

懒人是没有前途的，都去死就好了。