Project_Euler-45 题解

最新推荐文章于 2024-09-26 00:03:11 发布

若亦_Royi

最新推荐文章于 2024-09-26 00:03:11 发布

阅读量381

点赞数 9

分类专栏： Project_Euler题解文章标签：算法数据结构 c++ c语言

本文链接：https://blog.csdn.net/weixin_74239689/article/details/136306273

版权

Project_Euler题解专栏收录该内容

24 篇文章 0 订阅

订阅专栏

文章介绍了如何使用C语言解决ProjectEuler问题45，通过枚举六边形数字并判断其是否为三角形和五边形数，最后优化代码避免重复检查。

摘要由CSDN通过智能技术生成

Project_Euler-45 题解

题目

思路

非常简单，枚举六边形数字，然后判断他们是不是三角形和五边形数，如果是，那么输出。

代码

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <time.h>

typedef long long ll;

ll triangle(ll n) {
    return (n * (n + 1)) >> 1;
}

ll pentagonal(ll n) {
    return (n * (3 * n - 1)) >> 1;
}

ll hexagonal(ll n) {
    return n * (2 * n - 1);
}

ll is_triangle(ll n) {
    printf("is_triangle: %lld...\n", n);
    ll head = 1, tail = n, mid;
    while (head <= tail) {
        mid = (head + tail) >> 1;
        if (triangle(mid) == n) return 1;
        if (triangle(mid) < n) head = mid + 1;
        else tail = mid - 1;
    }
    printf("is_triangle: %lld is not a triangle.\n", n);
    return 0;
}

ll is_pentagonal(ll n) {
    printf("is_pentagonal: %lld...\n", n);
    ll head = 1, tail = n, mid;
    while (head <= tail) {
        mid = (head + tail) >> 1;
        if (pentagonal(mid) == n) return 1;
        if (pentagonal(mid) < n) head = mid + 1;
        else tail = mid - 1;
    }
    printf("is_pentagonal: %lld is not a pentagonal.\n", n);
    return 0;
}

ll main() {
    ll num = 0;
    for (ll i = 2; num < 2; i++) {
        ll tar = hexagonal(i);
        if (!is_pentagonal(tar)) continue;
        if (!is_triangle(tar)) continue;
        num++;
        printf("%lldth = %lld\n", num, tar);
    }
    return 0;
}

优化思路

发现六边形数字一定是三角形数字，因此枚举六边形数字的画就不需要再判断三角形数字了。

优化代码

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <time.h>

typedef long long ll;

ll pentagonal(ll n) {
    return (n * (3 * n - 1)) >> 1;
}

ll hexagonal(ll n) {
    return n * (2 * n - 1);
}

ll is_pentagonal(ll n) {
    printf("is_pentagonal: %lld...\n", n);
    ll head = 1, tail = n, mid;
    while (head <= tail) {
        mid = (head + tail) >> 1;
        if (pentagonal(mid) == n) return 1;
        if (pentagonal(mid) < n) head = mid + 1;
        else tail = mid - 1;
    }
    printf("is_pentagonal: %lld is not a pentagonal.\n", n);
    return 0;
}

ll main() {
    ll num = 0;
    for (ll i = 2; num < 2; i++) {
        ll tar = hexagonal(i);
        if (!is_pentagonal(tar)) continue;
        num++;
        printf("%lldth = %lld\n", num, tar);
    }
    return 0;
}