Dado un número N, la tarea es encontrar el N-ésimo (N puede ser hasta 10^18) término de esta serie:
2, 10, 24, 44, 70…..
La respuesta puede ser muy grande, así que imprima la respuesta en el módulo 10^9+9.
Ejemplos:
Input: N = 2 Output: 10 Input: N = 5 Output: 70
Planteamiento: La fórmula para el N-ésimo término será:
N-ésimo término = 3*n*n – n
A continuación se muestra la implementación del enfoque anterior:
C++
// CPP program to find // the Nth term of the series // 2, 10, 24, 44, 70..... #include <bits/stdc++.h> using namespace std; #define mod 1000000009 // function to return nth term of the series int NthTerm(long long n) { long long x = (3 * n * n) % mod; return (x - n + mod) % mod; } // Driver code int main() { // Get N long long N = 4; // Get Nth term cout << NthTerm(N); return 0; }
C
// C program to find // the Nth term of the series // 2, 10, 24, 44, 70..... #include <stdio.h> #define mod 1000000009 // function to return nth term of the series int NthTerm(long long n) { long long x = (3 * n * n) % mod; return (x - n + mod) % mod; } // Driver code int main() { // Get N long long N = 4; // Get Nth term printf("%d",NthTerm(N)); return 0; } // This code is contributed by kothavvsaakash.
Java
// Java program to find N-th // term of the series: import java.util.*; import java.lang.*; import java.io.*; class GFG { // function to return nth term of the series static long NthTerm(long n) { long x = (3 * n * n) % 1000000009; return (x - n + 1000000009) % 1000000009; } // Driver Code public static void main(String args[]) { // Taking n as 4 long N = 4; // Printing the nth term System.out.println(NthTerm(N)); } }
Python3
# Python 3 program to find # N-th term of the series: # Function for calculating # Nth term of series def NthTerm(N) : # return nth term x = (3 * N*N)% 1000000009 return ((x - N + 1000000009)% 1000000009) # Driver code if __name__ == "__main__" : N = 4 # Function Calling print(NthTerm(N))
C#
// C# program to find N-th // term of the series: using System; class GFG { // function to return nth // term of the series static long NthTerm(long n) { long x = (3 * n * n) % 1000000009; return (x - n + 1000000009) % 1000000009; } // Driver Code public static void Main() { // Taking n as 4 long N = 4; // Printing the nth term Console.Write(NthTerm(N)); } } // This code is contributed // by ChitraNayal
PHP
<?php // PHP program to find // the Nth term of the series // 2, 10, 24, 44, 70..... // function to return Nth // term of the series function NthTerm($n) { $mod = 1000000009; $x = (3 * $n * $n) % $mod; return ($x - $n + $mod) % $mod; } // Driver code $N = 4; // Get Nth term echo NthTerm($N); // This code is contributed // by Mahadev99 ?>
Javascript
<script> // Javascript program to find N-th // term of the series: // function to return nth term of the series function NthTerm( n) { let x = (3 * n * n) % 1000000009; return (x - n + 1000000009) % 1000000009; } // Driver Code // Taking n as 4 let N = 4; // Printing the nth term document.write(NthTerm(N)); // This code contributed by Princi Singh </script>
Producción:
44
Publicación traducida automáticamente
Artículo escrito por pawan_asipu y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA