Project Euler：Problem 45 Triangular, pentagonal, and hexagonal

最新推荐文章于 2018-06-27 23:14:11 发布

要个男盆友扭蛋

最新推荐文章于 2018-06-27 23:14:11 发布

阅读量601

点赞数

分类专栏： C++ 欧拉计划文章标签： C++ Project Euler

本文链接：https://blog.csdn.net/youb11/article/details/46377435

版权

C++ 同时被 2 个专栏收录

89 篇文章 0 订阅

订阅专栏

欧拉计划

85 篇文章 0 订阅

订阅专栏

Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:

Triangle	T_n=n(n+1)/2	1, 3, 6, 10, 15, ...
Pentagonal	P_n=n(3n−1)/2	1, 5, 12, 22, 35, ...
Hexagonal	H_n=n(2n−1)	1, 6, 15, 28, 45, ...

It can be verified that T₂₈₅ = P₁₆₅ = H₁₄₃ = 40755.

Find the next triangle number that is also pentagonal and hexagonal.

真是哔了狗了没注意到int类型的数转换成long long类型的数，结果一直不对。。

#include <iostream>
#include <map>
using namespace std;

int main()
{
	map<unsigned long long, int>mp;
	for (unsigned long long i = 143; i <= 100000; i++)
	{
		unsigned long long a = i*(i + 1) / 2;
		mp[a]++;
		a = i*(3 * i - 1) / 2;
		mp[a]++;
		a = i*(2 * i - 1);
		mp[a]++;
	}
	int diff = numeric_limits<int>::max();
	int res = 0;
	map<unsigned long long, int>::iterator iter;
	for (iter = mp.begin(); iter != mp.end(); iter++)
	{
		if (iter->first > 40755)
		{
			if (mp[iter->first] == 3)
			{
				if (iter->first - 40755 < diff)
				{
					diff = iter->first - 40755;
					res = iter->first;
				}
			}
		}
	}
	cout << res << endl;
	system("pause");

	return 0;
}