Question

C语言：输入数值N，求N内所有勾股数

C语言：输入数值N，求N内所有勾股数，最后printf所有勾股数的数量，这些组勾股数的数值，和最大一组勾股数的值，顺序不能改变
试成功之后还可以加赏，急急急急急急急急急

Answer 1

#include<stdio.h>
#include<math.h>
int main() {
void PrintPythNum(unsigned int max);
unsigned int n;
scanf("%u", &n);
if (n < 3)
return 0;
unsigned int iSquareNum;
for (int i = 0;i < n;i++) {
iSquareNum = (unsigned int)pow(i + 1, 2);
PrintPythNum(iSquareNum);
}
return 0;
}

int isSquareNum(unsigned int num)//判断是否是平方数
{
double result = sqrt((double)num);
if ((int)result == result)
return 1;
return 0;
}
void PrintPythNum(unsigned int max)//判断是否是勾股数，并且打印
{
int isSquareNum(unsigned int num);
unsigned int min=1, mid,i=2;
static int count = 0;
while(min < max / 2)
{
mid = max - min;
if (isSquareNum(mid)) {
count++;
printf("NO.%d : %u^2+%u^2=%u^2\n",count,(int)sqrt(min), (int)sqrt(mid), (int)sqrt(max));
}
min = (unsigned int)pow(i, 2);
i++;
}
}

追问

不太对啊。。最后还是只求出了那几组勾股数

追答

运行结果：n=50, 50以内的所有勾股数都打印了。总共有20组勾股数，最大的是 30， 40， 50 

追问

我还需要在n组之内最大的勾股数，需要显示出来这个，还有一共有多少组勾股数

追答

#include
#include
int main() {
void PrintPythNum(unsigned int max, int *count, unsigned int *maxNum);
unsigned int n;
int count = 0;
unsigned int maxNum = 0;
scanf("%u", &n);
if (n < 3)
return 0;
unsigned int iSquareNum;
for (int i = 0;i < n;i++) {
iSquareNum = (unsigned int)pow(i + 1, 2);
PrintPythNum(iSquareNum, &count, &maxNum);
}
printf("The count of PythNums in %u is %d\n", n,count);
printf("The max num of PythNums in %u is %u\n",n, maxNum);
return 0;
}
int isSquareNum(unsigned int num)
{
double result = sqrt((double)num);
if ((int)result == result)
return 1;
return 0;
}
void PrintPythNum(unsigned int max, int *count, unsigned int *pmaxNum)
{
int isSquareNum(unsigned int num);
unsigned int min=1, mid,i=2;

while(min < max / 2)
{
mid = max - min;
if (isSquareNum(mid)) {
(*count)++;
if((*pmaxNum)<max)
(*pmaxNum) = (unsigned int)sqrt(max);
printf("NO.%d : %u^2+%u^2=%u^2\n",*count,(int)sqrt(min), (int)sqrt(mid), (int)sqrt(max));
}
min = (unsigned int)pow(i, 2);
i++;
}
}

追问

不好意思哈，你这code我看不太懂。。下面的可以，所以不能采纳你的啦，抱歉

追答

没关系，慢慢来

Answer 2

没时间限制的话：
#include<stdio.h>

int main()
{
int n;

while(scanf("%d",&n){
for(int i=1;i<=n;++i)
for(int j=i+1;j<=m;++j)
for(int k=j+1;k<=n;++k)
if(i*i+j*j==k*k) printf("%d,%d,%d\n",i,j,k);
}

return 0;

}

追问

还有在范围N内所有勾股数的数量和范围内最大的一组勾股数呢？

追答

#include

int main()
{
int n;
while(scanf("%d",&n)){
int x,y,z,count=0;
for(int i=1;i<=n;++i)
for(int j=i+1;j<=n;++j)
for(int k=j+1;k<=n;++k)
if(i*i+j*j==k*k) {
printf("%d,%d,%d\n",i,j,k);
count++;
x=i,y=j,z=k;
}
printf("total number: %d\n",count);
printf("max: %d,%d,%d\n",x,y,z);
}
return 0;

}

追问

谢谢谢谢，不过我需要这三个按照顺序的，类似于
There are 3 Pythagorean triples in this range:
(3, 4, 5)
(5, 12, 13)
(6, 8, 10)
The triple with the largest value of c is (5, 12, 13).
这个样子的
怎样才能把第一句话放到loop里面但是不会重复显示呢？

追答

#include

int main()
{
int n;
while(scanf("%d",&n)){
int x,y,z,count=0;
for(int i=1;i<=n;++i)
for(int j=i+1;j<=n;++j)
for(int k=j+1;k<=n;++k)
if(i*i+j*j==k*k){
count++;
x=i,y=j,z=k;
}
printf("There are %d Pythagorean triples in this range:\n",count);
for(int i=1;i<=n;++i)
for(int j=i+1;j<=n;++j)
for(int k=j+1;k<=n;++k)
if(i*i+j*j==k*k)
printf("%d,%d,%d\n",i,j,k);
printf("The triple with the largest value of c is (%d, %d, %d)\n",x,y,z);
}
return 0;

}