Vector <int> _ N1;
Bool isDiff3 (int x)
{
Int a = x % 10, B = x/10% 10, c = x/100;
Return! = B & B! = C &! = C;
}
Template <class T>
Inline T Taxis (T * A, int iMax)
{
For (int I = 0; I <iMax; ++ I)
{
T tmp = A [I];
For (int j = I; j <iMax; ++ j)
{
If (tmp <A [j])
{
A [I] = A [j];
A [j] = tmp;
Tmp = A [I];
}
}
}
Return A [0];
}
Bool isDiff9 (int x1, int x2, int x3)
{
Int v [9];
* V = x1/100;
* (V + 1) = x1/10% 10;
* (V + 2) = x1 % 10;
* (V + 3) = x2/100;
* (V + 4) = x2/10% 10;
* (V + 5) = x2 % 10;
* (V + 6) = x3/100;
* (V + 7) = x3/10% 10;
* (V + 8) = x3 % 10;
Taxis (v, 9 );
Return * v = * (v + 1) |
* (V + 1) = * (v + 2) |
* (V + 2) = * (v + 3) |
* (V + 3) = * (v + 4) |
* (V + 4) = * (v + 5) |
* (V + 5) = * (v + 6) |
* (V + 6) = * (v + 7) |
* (V + 7) = * (v + 8) |
* (V + 8) = * (v );
}
Void DisplayNum ()
{
For (int I = 13; I <32; ++ I)
{
Int v = I * I;
If (isDiff3 (v ))
_ N1.push _ back (v );
}
Size_t N = _ N1.size ();
Int f = 0;
For (int I = 0; I <N; ++ I)
{
For (int j = 0; j <N & I! = J; ++ j)
{
For (int k = 0; k <N & j! = K & I! = K; ++ k)
{
Int a = _ N1 [I], B = _ N1 [j], c = _ N1 [k];
If (! IsDiff9 (a, B, c ))
Printf ("% d-% d", a, B, c, f ++ );
}
}
}
Printf ("have % d group number", f );
}