博客
关于我
1079 三角形
阅读量:626 次
发布时间:2019-03-13

本文共 1456 字,大约阅读时间需要 4 分钟。

???????????????????ai???????????????????????????????????ai?????????????????????????????ai??????????????????????????????????

????

  • ?????

    • ????????????(a^2 + b^2 = c^2)???c????
    • ??????ai????????????
  • ?????

    • ?ai?????????c????ai????(c^2 = ai^2 + b^2)?
    • ?ai?????????a????ai????(a^2 + b^2 = ai^2)?
  • ?????

    • ???????c?????????b??????
    • ????????a?????????b??????
  • ?????

    • ???????????????????????
    • ???????????
  • ????

    #include 
    #include
    #include
    #include
    #include
    using namespace std;void work(int d) { // ?d??????????c for (int c = d + 1; c <= 2 * d * d; ++c) { int b_sq = c * c - d * d; if (b_sq <= 0) continue; int b = sqrt(b_sq); if (b * b == b_sq && b < c) { cout << c << "," << b << endl; } } // ?d??????????a for (int a = 1; a < d; ++a) { int b_sq = d * d - a * a; if (b_sq <= 0) continue; int b = sqrt(b_sq); if (b * b == b_sq && a > b) { cout << a << "," << b << endl; } } cout << endl;}int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; ++i) { int d; cin >> d; work(d); } return 0;}

    ????

  • ?????

    • ??n??????
    • ?????????????d?
  • ????work(d)?

    • ?d?????????????c???b?????????
    • ?d?????????????a???b?????????
  • ?????

    • ???????????????????????
    • ??????????????????
  • ?????

    • ?????????????????
  • ???????????????????????????????????

    转载地址:http://elraz.baihongyu.com/

    你可能感兴趣的文章
    poj1988(并查集)
    查看>>
    POJ2007+几何+极角排序
    查看>>
    poj2039
    查看>>
    poj2135(简单的最小费用流问题)
    查看>>
    poj2195 bfs+最小权匹配
    查看>>
    POJ2251
    查看>>
    POJ2253-Frogger
    查看>>
    poj2309
    查看>>
    POJ2390 Bank Interest【水题】
    查看>>
    poj2398
    查看>>
    poj2478欧拉函数
    查看>>
    poj2546
    查看>>
    POJ2728 Desert King
    查看>>
    POJ2794 Double Patience[离散概率 状压DP]
    查看>>
    poj2828(线段树查找序列第k小的值)
    查看>>
    POJ2891:Strange Way to Express Integers——题解
    查看>>
    poj3045 Cow Acrobats(二分最大化最小值)
    查看>>
    poj3061 Subsequence(尺取法)
    查看>>
    poj3074 DLX精确覆盖
    查看>>
    poj3252(组合数)
    查看>>