![](https://iknow-base.cdn.bcebos.com/lxb/notice.png)
C语言编程: 把1、2、3、4、5、6、7、8、9这九个数组合成三个三位数。要求:每个数字仅用一次 10
C语言编程:把1、2、3、4、5、6、7、8、9这九个数组合成三个三位数。要求:每个数字仅用一次,并且这三个数都 是完全平方数。...
C语言编程: 把1、2、3、4、5、6、7、8、9这九个数组合成三个三位数。要求:每个数字仅用一次,并且这三个数都 是完全平方数。
展开
3个回答
展开全部
3位数的平方数就那么多,从11^2到31^2穷举判断就好
/// <summary>
/// 轮询3位平方数
/// </summary>
static void searchNum()
{
for (int i = 11; i <= 29; i++)
{
for (int j = i + 1; j <= 30; j++)
{
for (int k = j + 1; k <= 31; k++)
{
if (checkNum(i * i, j * j, k * k))
{
Console.WriteLine("符合解:" + (i * i) + "," + (j * j) + "," + (k * k));
}
}
}
}
}
/// <summary>
/// 判断3个三位数是否为不同数字组成
/// </summary>
/// <param name="num1"></param>
/// <param name="num2"></param>
/// <param name="num3"></param>
/// <returns></returns>
static bool checkNum(int num1, int num2, int num3)
{
int[] list = new int[9];
list[0] = num1 / 100;
list[1] = (num1 % 100) / 10;
list[2] = num1 % 10;
list[3] = num2 / 100;
list[4] = (num2 % 100) / 10;
list[5] = num2 % 10;
list[6] = num3 / 100;
list[7] = (num3 % 100) / 10;
list[8] = num3 % 10;
for (int i = 0; i < list.Length - 1; i++)
{
for (int j = i + 1; j < list.Length; j++)
{
if (list[i] == list[j])
{
return false;
}
}
}
return true;
}
/// <summary>
/// 轮询3位平方数
/// </summary>
static void searchNum()
{
for (int i = 11; i <= 29; i++)
{
for (int j = i + 1; j <= 30; j++)
{
for (int k = j + 1; k <= 31; k++)
{
if (checkNum(i * i, j * j, k * k))
{
Console.WriteLine("符合解:" + (i * i) + "," + (j * j) + "," + (k * k));
}
}
}
}
}
/// <summary>
/// 判断3个三位数是否为不同数字组成
/// </summary>
/// <param name="num1"></param>
/// <param name="num2"></param>
/// <param name="num3"></param>
/// <returns></returns>
static bool checkNum(int num1, int num2, int num3)
{
int[] list = new int[9];
list[0] = num1 / 100;
list[1] = (num1 % 100) / 10;
list[2] = num1 % 10;
list[3] = num2 / 100;
list[4] = (num2 % 100) / 10;
list[5] = num2 % 10;
list[6] = num3 / 100;
list[7] = (num3 % 100) / 10;
list[8] = num3 % 10;
for (int i = 0; i < list.Length - 1; i++)
{
for (int j = i + 1; j < list.Length; j++)
{
if (list[i] == list[j])
{
return false;
}
}
}
return true;
}
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询