hdu 2053隐藏的快速算法，求约数即可【复习】

最新推荐文章于 2026-03-31 10:32:57 发布

原创最新推荐文章于 2026-03-31 10:32:57 发布 · 208 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

本文探讨了无限次操作后一排灯中第n盏灯的状态变化问题。通过数学分析得出结论，灯的状态取决于其编号的因数个数。若因数个数为奇数，则灯亮；若为偶数，则灯灭。

Switch Game

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7429 Accepted Submission(s): 4413

Problem Description

There are many lamps in a line. All of them are off at first. A series of operations are carried out on these lamps. On the i-th operation, the lamps whose numbers are the multiple of i change the condition ( on to off and off to on ).

Input

Each test case contains only a number n ( 0< n<= 10^5) in a line.

Output

Output the condition of the n-th lamp after infinity operations ( 0 - off, 1 - on ).

Sample Input

1
5

Sample Output

1
0

#include<iostream>
using namespace std;
char str[1000000];
main()
{
long n,k,i,j;

      while(cin>>n);
      {
          for(k=n;k>=1;k=k-1)
          {
          str[k]=0;
          }
            for(i=1;i<=n;i=i+1)    //i表示每一次操作 
            {
                for(j=1;j<=n;j=j+1)    //j表示对第j个数操作 
                {
                    if(j%i==0) 
                    {
                     if(str[j]==0) str[j]=1;
                     if(str[j]==1) str[j]=0;
                    }
                }
            }
      cout<<str[n]<<endl;
      
      }
return 0;
}

优化后的代码，求第n个数有多少约数即可