在一张圆桌周围排列N个人的排列-yiteyi-C++库

给定N，人数。任务是把N个人安排在一张圆桌周围。例子 :

null

Input: N = 4Output: 6Input: N = 5Output: 24

推荐：请尝试你的方法 {IDE} 首先，在进入解决方案之前。

方法： 这是一个概念 循环置换 i、 e.安排中没有具体的起点，任何元素都可以被视为安排的起点。 对于N=4，安排如下：

图片[1]-在一张圆桌周围排列N个人的排列-yiteyi-C++库

下面是求循环置换的公式：

Circular Permutations = (N - 1)!

以下是上述理念的实施：

C++

                         // C++ code to demonstrate Circular Permutation                       
                         #include <bits/stdc++.h>                       
                         using                                     namespace                                     std;                       
           
                         // Function to find no. of permutations                       
                         int                                     Circular(                                     int                                     n)                       
                         {                       
           
                                                 int                                     Result = 1;                       
           
                                                 while                                     (n > 0) {                       
                                                 Result = Result * n;                       
                                                 n--;                       
                                                 }                       
           
                                                 return                                     Result;                       
                         }                       
           
                         // Driver Code                       
                         int                                     main()                       
                         {                       
                                                 int                                     n = 4;                       
           
                                                 cout << Circular(n - 1);                       
                         }                       

JAVA

                         // Java code to demonstrate                       
                         // Circular Permutation                       
                         import                                     java.io.*;                       
           
                         class                                     GFG                       
                         {                       
                         // Function to find no.                       
                         // of permutations                       
                         static                                     int                                     Circular(                                     int                                     n)                       
                         {                       
           
                                                 int                                     Result =                                     1                                     ;                       
           
                                                 while                                     (n >                                     0                                     )                       
                                                 {                       
                                                 Result = Result * n;                       
                                                 n--;                       
                                                 }                       
           
                                                 return                                     Result;                       
                         }                       
           
                         // Driver Code                       
                         public                                     static                                     void                                     main(String[] args)                       
                         {                       
                                                 int                                     n =                                     4                                     ;                       
                                   
                                                 System.out.println(Circular(n -                                     1                                     ));                       
                         }                       
                         }                       
           
                         // This code is contributed                       
                         // by Naman_Garg                       

Python 3

                         # Python 3 Program to demonstrate Circular Permutation                       
           
                         # Function to find no. of permutations                       
                         def                                     Circular(n) :                       
                                                 Result                                     =                                     1                       
           
                                                 while                                     n >                                     0                                     :                       
                                                 Result                                     =                                     Result                                     *                                     n                       
                                                 n                                     -                                     =                                     1                       
           
                                                 return                                     Result                       
                                   
                         # Driver Code                       
                         if                                     __name__                                     =                                     =                                     "__main__"                                     :                       
                                                 n                                     =                                     4                       
           
                                                 # function calling                       
                                                 print                                     (Circular(n                                     -                                     1                                     ))                       
           
                         # This code is contributed by ANKITRAI1                       

C#

                         // C# code to demonstrate                       
                         // Circular Permutation                       
                         using                                     System;                       
                                   
           
                         public                                     class                                     GFG {                       
           
                         // Function to find no.                       
                         // of permutations                       
                         static                                     int                                     Circular(                                     int                                     n)                       
                         {                       
                                   
                                                 int                                     Result = 1;                       
                                   
                                                 while                                     (n > 0)                       
                                                 {                       
                                                 Result = Result * n;                       
                                                 n--;                       
                                                 }                       
                                   
                                                 return                                     Result;                       
                         }                       
                                   
                         // Driver Code                       
                         public                                     static                                     void                                     Main()                       
                         {                       
                                                 int                                     n = 4;                       
                                   
                                                 Console.Write(Circular(n - 1));                       
                         }                       
                         }                       
                                   
                         /* This Java code is contributed by 29AjayKumar*/                       

PHP

                         <?php                       
                         // PHP code to demonstrate Circular Permutation                       
           
                         // Function to find no. of permutations                       
                         function                                     Circular(                                     $n                                     )                       
                         {                       
                                                 $Result                                     = 1;                       
           
                                                 while                                     (                                     $n                                     > 0)                       
                                                 {                       
                                                 $Result                                     =                                     $Result                                     *                                     $n                                     ;                       
                                                 $n                                     --;                       
                                                 }                       
           
                                                 return                                     $Result                                     ;                       
                         }                       
           
                         // Driver Code                       
                         $n                                     = 4;                       
           
                         echo                                     Circular(                                     $n                                     - 1);                       
           
                         // This code is contributed by mits                       
                         ?>                       

Javascript

                         <script>                       
                         // javascript code to demonstrate                       
                         // Circular Permutation                       
           
                                                 // Function to find no.                       
                                                 // of permutations                       
                                                 function                                     Circular(n)                       
                                                 {                       
                                                 var                                     Result = 1;                       
                                                 while                                     (n > 0)                       
                                                 {                       
                                                 Result = Result * n;                       
                                                 n--;                       
                                                 }                       
           
                                                 return                                     Result;                       
                                                 }                       
           
                                                 // Driver Code                       
                                                 var                                     n = 4;                       
                                                 document.write(Circular(n - 1));                       
           
                         // This code is contributed by Rajput-Ji                       
                         </script>                       

输出：

文章版权归作者所有，未经允许请勿转载。

THE END

技术文章