Módulo de todos los elementos consecutivos por pares en una array

Dada una serie de  elementos. La tarea es imprimir el módulo de todos los elementos consecutivos por pares. Es decir, para todos los pares de elementos consecutivos ((a[i], a[i+1])), print (a[i] % a[i+1]) .
Nota : Los pares consecutivos de una array de tamaño N son (a[i], a[i+1]) para todos los i que van de 0 a N-2.
Ejemplos : 
 

Input: arr[] = {8, 5, 4, 3, 15, 20}
Output: 3 1 1 3 15 

Input: arr[] = {5, 10, 15, 20}
Output: 5 10 15 

Enfoque: La solución es atravesar la array y calcular e imprimir el módulo de cada par (arr[i], arr[i+1]).
A continuación se muestra la implementación del enfoque anterior: 
 

// C++ program to print the modulus
// of the consecutive elements
#include <iostream>
using namespace std;
 
// Function to print pairwise modulus
// of consecutive elements
void pairwiseModulus(int arr[], int n)
{
    for (int i = 0; i < n - 1; i++) {
 
        // Modulus of consecutive numbers
        cout << (arr[i] % arr[i + 1]) << " ";
    }
}
 
// Driver Code
int main()
{
    int arr[] = { 8, 5, 4, 3, 15, 20 };
    int n = sizeof(arr) / sizeof(arr[0]);
 
    pairwiseModulus(arr, n);
 
    return 0;
}

// C program to print the modulus
// of the consecutive elements
#include <stdio.h>
 
// Function to print pairwise modulus
// of consecutive elements
void pairwiseModulus(int arr[], int n)
{
    for (int i = 0; i < n - 1; i++) {
 
        // Modulus of consecutive numbers
        printf("%d ",arr[i] % arr[i + 1]);
    }
}
 
// Driver Code
int main()
{
    int arr[] = { 8, 5, 4, 3, 15, 20 };
    int n = sizeof(arr) / sizeof(arr[0]);
 
    pairwiseModulus(arr, n);
 
    return 0;
}
 
// This code is contributed by kothavvsaakash.

// Java program to print the modulus
// of the consecutive elements
import java.util.*;
 
class Geeks {
     
// Function to print pairwise modulus
// of consecutive elements
static void pairwiseModulus(int arr[], int n)
{
    for (int i = 0; i < n - 1; i++) {
 
        // Modulus of consecutive numbers
        System.out.println((arr[i] % arr[i + 1]));
    }
}
 
// Driver Code
public static void main(String args[])
{
    int arr[] = { 8, 5, 4, 3, 15, 20 };
    int n = arr.length;
 
    pairwiseModulus(arr, n);
}
}
 
// This code is contributed by ankita_saini

# Python 3 program to print the modulus
# of the consecutive elements
 
# Function to print pairwise modulus
# of consecutive elements
def pairwiseModulus(arr, n):
    for i in range(0, n - 1, 1):
         
        # Modulus of consecutive numbers
        print((arr[i] % arr[i + 1]),
                         end = " ")
     
# Driver Code
if __name__ == '__main__':
    arr = [8, 5, 4, 3, 15, 20]
    n = len(arr)
    pairwiseModulus(arr, n)
 
# This code is contributed
# by Surendra_Gangwar

// C# program to print the modulus
// of the consecutive elements
using System;
 
class Geeks {
     
// Function to print pairwise modulus
// of consecutive elements
static void pairwiseModulus(int[] arr, int n)
{
    for (int i = 0; i < n - 1; i++) {
 
        // Modulus of consecutive numbers
        Console.WriteLine((arr[i] % arr[i + 1]));
    }
}
 
// Driver Code
public static void Main(String []args)
{
    int[] arr = {8, 5, 4, 3, 15, 20};
    int n = arr.Length;
 
    pairwiseModulus(arr, n);
}
}
 
// This code is contributed by ankita_saini

<?php
//PHP program to print the modulus
// of the consecutive elements
 
// Function to print pairwise modulus
// of consecutive elements
function pairwiseModulus( $arr, $n)
{
    for ($i = 0; $i < $n - 1; $i++) {
 
        // Modulus of consecutive numbers
        echo  ($arr[$i] % $arr[$i + 1]), " ";
    }
}
 
// Driver Code
    $arr = array( 8, 5, 4, 3, 15, 20 );
    $n = sizeof($arr) / sizeof($arr[0]);
 
    pairwiseModulus($arr, $n);
 
 
// This code is contributed by ajit
?>

<script>
// javascript program to print the modulus
// of the consecutive elementsclass Geeks {
 
    // Function to print pairwise modulus
    // of consecutive elements
    function pairwiseModulus(arr , n) {
        for (i = 0; i < n - 1; i++) {
 
            // Modulus of consecutive numbers
            document.write((arr[i] % arr[i + 1]) + " ");
        }
    }
 
    // Driver Code
     
        var arr = [ 8, 5, 4, 3, 15, 20 ];
        var n = arr.length;
 
        pairwiseModulus(arr, n);
 
// This code contributed by gauravrajput1
</script>

3 1 1 3 15

Complejidad temporal : O(n)
 Espacio auxiliar : O(1)