Dado un número N , la tarea es imprimir N filas donde cada K -ésima fila consiste en la tabla de multiplicar de K hasta K -esimo término.
Ejemplos:
Entrada: N = 3
Salida:
1
2 4
3 6 9
Explicación:
En la serie anterior, en cada fila K, se imprime la tabla de multiplicar de K hasta K términos.
Entrada: N = 5
Salida:
1
2 4
3 6 9
4 8 12 16
5 10 15 20 25
Planteamiento: La idea es usar dos bucles for para imprimir la tabla de multiplicar . El ciclo externo en ‘i’ sirve como el valor de ‘K’ y el ciclo interno en ‘j’ sirve como los términos de la tabla de multiplicar de cada ‘i’. Cada término de la tabla de ‘i’ se puede obtener con la fórmula ‘i * j’.
A continuación se muestra la implementación del enfoque anterior:
C++
// C++ program to print multiplication table // till N rows where every Kth row // is the table of K up to Kth term #include <iostream> using namespace std; // Function to print the multiplication table // upto K-th term void printMultiples(int N) { // For loop to iterate from 1 to N // where i serves as the value of K for (int i = 1; i <= N; i++) { // Inner loop which at every // iteration goes till i for (int j = 1; j <= i; j++) { // Printing the table value for i cout << (i * j) << " "; } // New line after every row cout << endl; } } // Driver code int main() { int N = 5; printMultiples(N); return 0; } // This code is contributed by Rajput-Ji
Java
// Java program to print multiplication table // till N rows where every Kth row // is the table of K up to Kth term class GFG { // Function to print the multiplication table // upto K-th term public static void printMultiples(int N) { // For loop to iterate from 1 to N // where i serves as the value of K for (int i = 1; i <= N; i++) { // Inner loop which at every // iteration goes till i for (int j = 1; j <= i; j++) { // Printing the table value for i System.out.print((i * j) + " "); } // New line after every row System.out.println(); } } // Driver code public static void main(String args[]) { int N = 5; printMultiples(N); } }
Python3
# Python3 program to pr multiplication table # till N rows where every Kth row # is the table of K up to Kth term # Function to pr the multiplication table # upto K-th term def prMultiples(N): # For loop to iterate from 1 to N # where i serves as the value of K for i in range(1, N + 1): # Inner loop which at every # iteration goes till i for j in range(1, i + 1): # Printing the table value for i print((i * j), end = " ") # New line after every row print() # Driver code if __name__ == '__main__': N = 5 prMultiples(N) # This code is contributed by mohit kumar 29
C#
// C# program to print multiplication table // till N rows where every Kth row // is the table of K up to Kth term using System; class GFG { // Function to print the multiplication table // upto K-th term public static void printMultiples(int N) { // For loop to iterate from 1 to N // where i serves as the value of K for (int i = 1; i <= N; i++) { // Inner loop which at every // iteration goes till i for (int j = 1; j <= i; j++) { // Printing the table value for i Console.Write((i * j) + " "); } // New line after every row Console.WriteLine(); } } // Driver code public static void Main(String []args) { int N = 5; printMultiples(N); } } // This code is contributed by Rajput-Ji
Javascript
<script> // javascript program to print multiplication table // till N rows where every Kth row // is the table of K up to Kth term // Function to print the multiplication table // upto K-th term function printMultiples( N) { // For loop to iterate from 1 to N // where i serves as the value of K for (let i = 1; i <= N; i++) { // Inner loop which at every // iteration goes till i for (let j = 1; j <= i; j++) { // Printing the table value for i document.write((i * j) + " "); } // New line after every row document.write("<br/>"); } } // Driver code let N = 5; printMultiples(N); // This code is contributed by todaysgaurav </script>
1 2 4 3 6 9 4 8 12 16 5 10 15 20 25
Complejidad del tiempo: O(N 2 )
Espacio Auxiliar: O(1)
Publicación traducida automáticamente
Artículo escrito por jinisusan1999 y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA