个人中心
gpt4 book ai didi

c++ - 全等、相似和直角三角形

转载 作者：行者123 更新时间：2023-11-28 07:21:50 25 4
gpt4 key购买 nike

<分区>

我必须测试两个三角形是否相似、全等，以及给定的边是否为直角三角形。我已经包含了一个头文件。我试着运行这个程序，但我总是得到错误的答案。

标题:

/*
 * triangles.h
 * Header file for triangle class.
*/
// make sure this file is not included multiple times:
#pragma once

#include <vector>
using std::vector;

class triangle {
    public:
        // member functions:
        // constructor:
        triangle(unsigned long a=3, unsigned long b=4, unsigned long c=5):
            s1(a),s2(b),s3(c) {}
        unsigned long perimeter();
        unsigned long area();
        void print();  // prints to standard output
        // member variables:
        // integers for the 3 sides:
        unsigned long s1;
        unsigned long s2;
        unsigned long s3;
};

vector<triangle> findRightTriangles(unsigned long l, unsigned long h);
bool congruent(triangle t1, triangle t2);
bool similar(triangle t1, triangle t2);

函数

#include <vector>
using std::vector;
#include <algorithm>
using std::sort;

// note the "triangle::" part.  We need to specify the function's
// FULL name to avoid confusion.  Else, the compiler will think we
// are just defining a new function called "perimeter"
unsigned long triangle::perimeter() {
    return s1+s2+s3;
}

unsigned long triangle::area() {
    // TODO: write this function.
    // Note: why is it okay to return an integer here?  Recall that
    // all of our triangles have integer sides, and are right triangles...
     // put the sides in an array:
    unsigned long sides[3] = {s1,s2,s3};
    // sort the array:
    sort(sides,sides+3);
    // at this point, sides[0] <= sides[1] <= sides[2]

    unsigned long b = sides[0];
    unsigned long h = sides[1];
    return (b*h)/2;
}

void triangle::print() {
    cout << "[" << s1 << "," << s2 << "," << s3 << "]";
}

bool congruent(triangle t1, triangle t2) {
        // TODO: write this function.
     int a, b, c;
     a = t1.s1;
     b = t1.s2;
     c = t1.s3;
     unsigned long tr1[3] = {a,b,c};
    // sort the array:
    sort(tr1,tr1+3);
    // at this point, tr1[0]<= tr1[1] <= tr1[2]
    int d,e,f;
    d = t2.s1;
    e = t2.s2;
    f = t2.s3;
     unsigned long tr2[3] = {d,e,f};
    // sort the array:
    sort(tr2,tr2+3);
    // at this point, tr2[0] <= tr2[1] <= tr2[2]

    if(tr1[0] == tr2[0] && tr1[1] == tr2[1] && tr1[2] == tr2[2]){
    true;
    }

    else false;
}

bool similar(triangle t1, triangle t2) {
    // TODO: write this function.
     int a, b, c;
     a = t1.s1;
     b = t1.s2;
     c = t1.s3;
     unsigned long tr1[3] = {a,b,c};
    // sort the array:
    sort(tr1,tr1+3);
    // at this point, tr1[0]<= tr1[1] <= tr1[2]
    int d,e,f;
    d = t2.s1;
    e = t2.s2;
    f = t2.s3;
     unsigned long tr2[3] = {d,e,f};
    // sort the array:
    sort(tr2,tr2+3);
    // at this point, tr2[0] <= tr2[1] <= tr2[2

    if(tr1[0]%tr2[0] == 0 && tr1[1]%tr2[1] == 0 && tr1[2]%tr2[2] == 0){
    true;
    }

    else false;
}

vector<triangle> findRightTriangles(unsigned long l, unsigned long h) {
    // TODO: find all the right triangles with integer sides,
    // subject to the perimeter bigger than l and less than h
    vector<triangle> retval; // storage for return value.
    triangle t1;
    t1.s1=l;
    t1.s3=h;

    for (unsigned long p = 0; p < t1.s3; p++) {
        t1.s2=p;
        if ( p >= t1.s1 && p <= t1.s3 && (((t1.s1*t1.s1)+(p*p)) == (t1.s3*t1.s3))){
            retval.push_back(t1);

            break;
        }
    }

    return retval;
}

25 4 0
文章推荐： c++ - Qt线程同步设计
文章推荐： ios - 如何使用相同的模型对象在 View Controller 之间传递模型数据
文章推荐： c++ - 编译和使用 OpenCV
文章推荐： c++ - 实例化模板类时出现链接器错误
行者123
个人简介

我是一名优秀的程序员,十分优秀！

滴滴打车优惠券免费领取
滴滴打车优惠券
全站热门文章
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com