#include <iostream>
using namespace std;
int main()
{
int key;
int b[6];
int temp;
for (int i = 100; i < 1000; ++i)
{
for(int j = 100; j < 1000; ++j)
{
int n=0;
key = i*j;
while (key != 0)
{
key /= 10;
++n;
}
key = i*j;
if (n == 6)
{
b[0] = key % 10;
b[1] = key / 10 % 10;
b[2] = key / 100 % 10;
b[3] = key / 1000 % 10;
b[4] = key / 10000 % 10;
b[5] = key / 100000;
}
if (b[0] == b[5] && b[1] == b[4] && b[2] == b[3]&&b[5]==9)//本题不需要排序,直接限制最高位即可
{
cout << key << endl;
}
}
}
system("pause");
}
转载于:https://my.oschina.net/u/3772904/blog/1803124