查找系列1、8、54、384的第n项…

给定一个数字N。任务是编写一个程序,在下面的系列中查找第N项:

null
1, 8, 54, 384...

例如:

Input : 3Output : 54For N = 3Nth term = ( 3*3) * 3!         = 54Input : 2 Output : 8

仔细观察,上述系列中的第n项可概括为:

Nth term = ( N*N ) * ( N! )

以下是上述方法的实施情况:

C++

// CPP program to find N-th term of the series:
// 1, 8, 54, 384...
#include <iostream>
using namespace std;
// calculate factorial of N
int fact( int N)
{
int i, product = 1;
for (i = 1; i <= N; i++)
product = product * i;
return product;
}
// calculate Nth term of series
int nthTerm( int N)
{
return (N * N) * fact(N);
}
// Driver Function
int main()
{
int N = 4;
cout << nthTerm(N);
return 0;
}


JAVA

// Java program to find N-th term of the series:
// 1, 8, 54, 384...
import java.io.*;
// Main class for main method
class GFG {
public static int fact( int N)
{
int i, product = 1 ;
// Calculate factorial of N
for (i = 1 ; i <= N; i++)
product = product * i;
return product;
}
public static int nthTerm( int N)
{
// By using above formula
return (N * N) * fact(N);
}
public static void main(String[] args)
{
int N = 4 ; // 4th term is 384
System.out.println(nthTerm(N));
}
}


Python 3

# Python 3 program to find
# N-th term of the series:
# 1, 8, 54, 384...
# calculate factorial of N
def fact(N):
product = 1
for i in range ( 1 , N + 1 ):
product = product * i
return product
# calculate Nth term of series
def nthTerm(N):
return (N * N) * fact(N)
# Driver Code
if __name__ = = "__main__" :
N = 4
print (nthTerm(N))
# This code is contributed
# by ChitraNayal


C#

// C# program to find N-th
// term of the series:
// 1, 8, 54, 384...
using System;
class GFG
{
public static int fact( int N)
{
int i, product = 1;
// Calculate factorial of N
for (i = 1; i <= N; i++)
product = product * i;
return product;
}
public static int nthTerm( int N)
{
// By using above formula
return (N * N) * fact(N);
}
// Driver Code
public static void Main(String[] args)
{
int N = 4; // 4th term is 384
Console.WriteLine(nthTerm(N));
}
}
// This code is contributed
// by Kirti_Mangal


PHP

<?php
// PHP program to find N-th
/// term of the series:
// 1, 8, 54, 384...
// calculate factorial of N
function fact( $N )
{
$product = 1;
for ( $i = 1; $i <= $N ; $i ++)
$product = $product * $i ;
return $product ;
}
// calculate Nth term of series
function nthTerm( $N )
{
return ( $N * $N ) * fact( $N );
}
// Driver Code
$N = 4;
echo nthTerm( $N );
// This code is contributed
// by ChitraNayal
?>


Javascript

<script>
// JavaScript program to find N-th term of the series:
// 1, 8, 54, 384...
// calculate factorial of N
function fact( N)
{
let i, product = 1;
for (i = 1; i <= N; i++)
product = product * i;
return product;
}
// calculate Nth term of series
function nthTerm( N)
{
return (N * N) * fact(N);
}
// Driver Function
let N = 4;
document.write(nthTerm(N));
// This code contributed by Rajput-Ji
</script>


输出:

384

时间复杂性: O(N)

© 版权声明
THE END
喜欢就支持一下吧
点赞10 分享