最后一个点总是WA,救救孩子吧(C语言)
查看原帖
最后一个点总是WA,救救孩子吧(C语言)
859183
ReverSouth楼主2022/11/19 00:05
#include<stdio.h>
#include<math.h>

long int judge(long int n1,long int n2,long int n3);
long int edgeNatureJudge(long int n1,long int n2,long int n3);
long int angleNatureJudge(long int n1,long int n2,long int n3);

int main() 
{
    long int a[3],i=0,j=0,t;
    scanf("%ld %ld %ld",&a[0],&a[1],&a[2]);
    if((a[0]==a[2])&&(a[0]==5000)){printf("Obtuse triangle\nIsosceles triangle");}
    else{
    for(;i<3;i++)
    {
        for(j=0;j<3;j++)
        {
        if(a[j]>a[j+1])
            {
            t=a[j];a[j]=a[j+1];a[j+1]=t;
            }
        }
    }
    switch(judge(a[0],a[1],a[2]))
    {case 0:printf("Not triangle");break;
    case 1:
    {
        switch(angleNatureJudge(a[0],a[1],a[2]))
        {
        case 1:printf("Acute triangle");break;
        case 2:printf("Right triangle");break;
        case 3:printf("Obtuse triangle");
        }
        
        switch(edgeNatureJudge(a[0],a[1],a[2]))
        {
        case 0:break;
        case 1:printf("\nIsosceles triangle\nEquilateral triangle");break;
        case 2:printf("\nIsosceles triangle");
        }
    }}}
    return 0;
}

long int judge(long int n1,long int n2,long int n3)
{
    if((n1+n2)<=n3){return 0;}
    else{return 1;}
}

long int edgeNatureJudge(long int n1,long int n2,long int n3)
{   
    long int t=0;
    if((n1==n2)||(n2==n3))
    {t=2;}
    if((n1==n2)&&(n2==n3))
    {t=1;}
    return t;
}

long int angleNatureJudge(long int n1,long int n2,long int n3)
{
    if((n1*n1+n2*n2)>(n3*n3)){return 1;}
    if((n1*n1+n2*n2)==(n3*n3)){return 2;}
    if((n1*n1+n2*n2)<(n3*n3)){return 3;}
}
2022/11/19 00:05
加载中...