Permutation

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 835 Accepted Submission(s): 493

Problem Description

There is an arrangement of N numbers and a permutation relation that alter one arrangement into another.

For example, when N equals to 6 the arrangement is 123456 at first. The replacement relation is 312546 (indicate 1->2, 2->3, 3->1, 4->5, 5->4, 6->6, the relation is also an arrangement distinctly).

After the first permutation, the arrangement will be 312546. And then it will be 231456.

In this permutation relation (312546), the arrangement will be altered into the order 312546, 231456, 123546, 312456, 231546 and it will always go back to the beginning, so the length of the loop section of this permutation relation equals to 6.

Your task is to calculate how many kinds of the length of this loop section in any permutation relations.

Input

Input contains multiple test cases. In each test cases the input only contains one integer indicates N. For all test cases, N<=1000.

Output

For each test case, output only one integer indicates the amount the length of the loop section in any permutation relations.

Sample Input

Sample Output

Author

HIT

Source

题意：

求和为n的一些数的最小公倍数有多少种。

题解：

循环节的长度为各独立置换环长度的最小公倍数。问题即求相加和为N的正整数的最小公倍数的可能数。由于1不影响最小公倍数，问题转化为相加小于等于N的若干正整数的最小公倍数的可能数。如果这些正整数包含大于一个质因子，只会使得正整数的和更大。因而问题再次转化为相加小于等于N的若干质数的最小公倍数的可能数。

记忆化搜索写法上面的参考题解有。

递推写法：

#include
   
    #include
    
     #include
     
      #include
      
       #include
       
        #include
        
         #include
         
          using namespace std;#define rep(i,a,n) for (int i=a;i
          
           =a;i--)#define pb push_back#define fi first#define se secondtypedef vector
           
             VI;typedef long long ll;typedef pair
            
              PII;const int inf=0x3fffffff;const ll mod=1000000007;const int maxn=1000+10;int prime[maxn];void init(){ for(int i=2;i
             
              i) continue; int p=prime[j]; while(i>=p) d[i][j]+=d[i-p][j-1],p*=prime[j]; } } int n; while(~scanf("%d",&n)) { printf("%lld\n",d[n][prime[0]]); } return 0;}

转载地址：https://blog.csdn.net/fouzhe/article/details/56495333 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！

上一篇：Codeforces Round #398 (Div. 2) E. Change-free(想法题,贪心,好题)

下一篇：hdu 4348 To the moon(主席树,区间更新节省内存,经典)

发表评论

关于作者

喝酒易醉，品茶养心，人生如梦，品茶悟道，何以解忧？唯有杜康！

-- 愿君每日到此一游！

Permutation

发表评论

最新留言

关于作者

推荐文章