Array sum after dividing numbers from previous

Find the sum of number of series after dividing the element of array from previous element.

Examples:

Input : 3 7 9 10 12 18
Explanation:  3 + 7/3 + 9/7 + 10/9 + 
12/10 + 18/12 = 9 (taking only integer 
part)   
Output : 9

Input : 1 12 24 30 60
Output : 18

Approach: We take elements in an array and divide the element from previous element. We do this process for all the elements of an array except very first element. Add the result after division and very first element.

Note: If any element is zero in an array then it fails to do the task and return minus one.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++  program for divide and
// sum the number of series
#include <bits/stdc++.h>
using namespace std;
  
int divideAndSum(int arr[], int n)
{
    int sum = 0;
    for (int i = 0; i < n; i++) {
          
        // checking whether element 
        // is zero or not
        if (arr[i] == 0) 
            return -1;
          
        if (i == 0)
            sum += arr[i];
        else
  
            // divide element from
            // previous element
            sum += arr[i] / arr[i - 1];
    }
      
    return sum;
}
  
// Driver code
int main()
{
    int arr[] = { 3, 7, 9, 10, 12, 18 };
    int n = sizeof(arr)/sizeof(arr[0]);
    cout << divideAndSum(arr, n);
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// java program for divide and
// sum the number of series
import java.io.*;
  
class GFG 
{
      
    static int divideAndSum(int arr[], int n)
    {
        int sum = 0;
        for (int i = 0; i < n; i++) {
              
            // checking whether element 
            // is zero or not
            if (arr[i] == 0
                return -1;
              
            if (i == 0)
                sum += arr[i];
            else
      
                // divide element from
                // previous element
                sum += arr[i] / arr[i - 1];
        }
          
        return sum;
    }
      
    // Driver code
    public static void main (String[] args) 
    {
        int arr[] = { 3, 7, 9, 10, 12, 18 };
        int n = arr.length;
        System.out.println( divideAndSum(arr, n));
  
    }
}
  
// This code is contributed by vt_m

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python 3 program for divide and
# sum the number of series
  
def divideAndSum(arr, n):
   
    sum = 0 
    for i in range(0,n):  
          
         # checking whether element 
         # is zero or not
        if (arr[i] == 0): 
            return -1 
          
        if (i == 0):
            sum += arr[i] 
        else:
  
                     # divide element from
             # previous element
             sum += int(arr[i] / arr[i - 1]) 
       
      
    return int(sum
   
  
# Driver code
arr =   [3, 7, 9, 10, 12, 18]   
  
n = len(arr)
print(divideAndSum(arr, n))
  
# This code is contributed by
# Smitha Dinesh Semwal 

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program for divide and
// sum the number of series
using System;
  
class GFG 
{
      
    static int divideAndSum(int []arr, int n)
    {
        int sum = 0;
        for (int i = 0; i < n; i++) {
              
            // checking whether element 
            // is zero or not
            if (arr[i] == 0) 
                return -1;
              
            if (i == 0)
                sum += arr[i];
            else
      
                // divide element from
                // previous element
                sum += arr[i] / arr[i - 1];
        }
          
        return sum;
    }
      
    // Driver code
    public static void Main () 
    {
        int []arr = { 3, 7, 9, 10, 12, 18 };
        int n = arr.Length;
        Console.WriteLine( divideAndSum(arr, n));
  
    }
}
  
// This code is contributed by vt_m

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// php program for divide and
// sum the number of series
  
function divideAndSum($arr, $n)
{
    $sum = 0;
    for ($i = 0; $i < $n; $i++) {
          
        // checking whether element 
        // is zero or not
        if ($arr[$i] == 0) 
            return -1;
          
        if ($i == 0)
            $sum += $arr[$i];
        else
  
            // divide element from
            // previous element
            $sum += floor($arr[$i] / 
                    $arr[$i - 1]);
    }
      
    return $sum;
}
  
// Driver code
{
    $arr = array(3, 7, 9, 10, 12, 18);
    $n = sizeof($arr) / sizeof($arr[0]);
    echo divideAndSum($arr, $n);
    return 0;
}
  
// This code is contributed by nitin mittal.
?>

chevron_right



Output:

9


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Improved By : nitin mittal



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.