欧拉计划Problem 26

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

1/2 0.5
1/3 0.(3)
1/4 0.25
1/5 0.2
1/6 0.1(6)
1/7 0.(142857)
1/8 0.125
1/9 0.(1)
1/10 0.1

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

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

#define N 1000
int getbase(int i)
{
 while (i % 2 == 0)
 {
  i/=2;
 
 while (i % 5 == 0)
 {
  i/=5;
 }
 return i;
}

int main()
{
 clock_t te,ts;
 ts=clock();
 int answer = 0,num,max = 0;
 for (int i = 1; i <= N;i++)
 {
  int t = 9,count = 0;
  bool b = false;
  num = getbase(i);
  if (num == 1)
   continue;
  if (t / num != 0)
   b = true;
  while(t % num != 0)
  {
   t = t%num*10+9;
   if (b == true)
   {
    count++;
   }
   if (t / num != 0)
   {
    b=true;
   }

  }
  if (max < count)
  {
   max = count;
   answer = i;
  }
 }
 printf("\nanswer:%d",answer);
 te=clock();
 printf("\ntime difference: %ds\n",(te-ts)/CLOCKS_PER_SEC);
 return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值