Project Euler：Problem 26 Reciprocal cycles

最新推荐文章于 2019-07-26 20:09:38 发布

要个男盆友扭蛋

最新推荐文章于 2019-07-26 20:09:38 发布

阅读量851

点赞数

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

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

版权

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

89 篇文章 0 订阅

订阅专栏

欧拉计划

85 篇文章 0 订阅

订阅专栏

A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:

¹/₂ = 0.5
¹/₃ = 0.(3)
¹/₄ = 0.25
¹/₅ = 0.2
¹/₆ = 0.1(6)
¹/₇ = 0.(142857)
¹/₈ = 0.125
¹/₉ = 0.(1)
¹/₁₀ = 0.1

Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that ¹/₇ has a 6-digit recurring cycle.

Find the value of d < 1000 for which ¹/_d contains the longest recurring cycle in its decimal fraction part.

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

int rc(int n, int d)
{
	int a[10010];       //记录每一次除法的被除数
	int b[10010];
	memset(a, 0, sizeof(a));
	memset(b, 0, sizeof(b));
	int count = 0;
	while (n%d != 0)
	{
		while (n < d)
			n = n * 10;
		int tmp = n / d;
		count++;
		if (a[n] == 1)
			return count - b[n];
		a[n] = 1;
		b[n] = count;   //最近的一次被除数为n时的位置
		n = n - tmp*d;
	}
	return 0;
}

int main()
{
	int maxlen = 0, maxn = 0;
	for (int i = 1; i < 1000; i++)
	{
		int tmp = rc(1, i);
		if (tmp>maxlen)
		{
			maxn = i;
			maxlen = tmp;
		}
	}
	cout << maxn << endl;
	system("pause");
	return 0;
}