Count divisible pairs in an array

Here given code implementation process.

//C++ Program 
//Count divisible pairs in an array
#include <stdio.h>

//Function which is counting all divisible pairs
void divisible_pair(int collection[],int size)
{
  int result = 0;

  for (int i = 0; i < size; ++i)
  {
    for (int j = i+1; j < size; ++j)
    {
      //Check if  [i] and [j] element are divisible ?
      if(collection[i]%collection[j]==0 || collection[j]%collection[i]==0)
      {
        result++;
      }
    }
  }
  printf("Total divisible pairs : %d\n",result );

}
int main()
{
  //Define array elements
  int collection[]={5,8,2,4,9,3};

  //Get the size of array
  int size=sizeof(collection)/sizeof(collection[0]);

  divisible_pair(collection,size);
  
  return 0;
}

Output

Total divisible pairs : 4
/*
  C++ Program
  Count divisible pairs in an array
*/
#include<iostream>
using namespace std;

class MyArray {
	public:

		//Function which is counting all divisible pairs
		void divisible_pair(int collection[], int size) {
			int result = 0;
			for (int i = 0; i < size; ++i) {
				for (int j = i + 1; j < size; ++j) {
					//Check if  [i] and [j] element are divisible ?

					if (collection[i] % collection[j] == 0 || collection[j] % collection[i] == 0) {
						result++;
					}
				}
			}
			cout << " Total divisible pairs : " << result << "\n";
		}
};
int main() {
	MyArray obj ;
	//Define array elements
	int collection[] = {
		5,
		8,
		2,
		4,
		9,
		3
	};
	//Get the size of array
	int size = sizeof(collection) / sizeof(collection[0]);
	obj.divisible_pair(collection, size);
	return 0;
}

Output

 Total divisible pairs : 4
/*
  Java Program
  Count divisible pairs in an array
*/
public class MyArray {
  //Function which is counting all divisible pairs
  public void divisible_pair(int []collection,int size)
  {
    int result = 0;

    for (int i = 0; i < size; ++i)
    {
      for (int j = i+1; j < size; ++j)
      {
        //Check if  [i] and [j] element are divisible ?
        if(collection[i]%collection[j]==0 || collection[j]%collection[i]==0)
        {
          result++;
        }
      }
    }
    System.out.print(" Total divisible pairs :  "+result+"\n" );

  }

  public static void main(String[] args) 
  {
  

    MyArray obj = new MyArray();
    //Define array elements
    int collection[]={5,8,2,4,9,3};

    //Get the size of array
    int size=collection.length;

    obj.divisible_pair(collection,size);

  }
}

Output

 Total divisible pairs : 4
/*
  C# Program
  Count divisible pairs in an array
*/
using System;

public class MyArray {
	//Function which is counting all divisible pairs
	public void divisible_pair(int[] collection, int size) {
		int result = 0;
		for (int i = 0; i < size; ++i) {
			for (int j = i + 1; j < size; ++j) {
				//Check if  [i] and [j] element are divisible ?

				if (collection[i] % collection[j] == 0 || collection[j] % collection[i] == 0) {
					result++;
				}
			}
		}
		Console.Write(" Total divisible pairs : " + result + "\n");
	}
	public static void Main(String[] args) {
		MyArray obj = new MyArray();
		//Define array elements
		int []collection = {
			5,
			8,
			2,
			4,
			9,
			3
		};
		//Get the size of array
		int size = collection.Length;
		obj.divisible_pair(collection, size);
	}
}

Output

 Total divisible pairs : 4
<?php
/*
  Php Program
  Count divisible pairs in an array
*/
class MyArray {
	//Function which is counting all divisible pairs

	public 	function divisible_pair($collection, $size) {
		$result = 0;
		for ($i = 0; $i < $size; ++$i) {
			for ($j = $i + 1; $j < $size; ++$j) {
				//Check if  [i] and [j] element are divisible ?

				if ($collection[$i] % $collection[$j] == 0 || $collection[$j] % $collection[$i] == 0) {
					$result++;
				}
			}
		}
		echo(" Total divisible pairs : ". $result ."\n");
	}
}

function main() {
	$obj = new MyArray();
	//Define array elements
	$collection = array(5, 8, 2, 4, 9, 3);
	//Get the size of array
	$size = count($collection);
	$obj->divisible_pair($collection, $size);

}
main();

Output

 Total divisible pairs : 4
/*
  Node Js Program
  Count divisible pairs in an array
*/
class MyArray {
	//Function which is counting all divisible pairs
	divisible_pair(collection, size) {
		var result = 0;
		for (var i = 0; i < size; ++i) {
			for (var j = i + 1; j < size; ++j) {
				//Check if  [i] and [j] element are divisible ?

				if (collection[i] % collection[j] == 0 || collection[j] % collection[i] == 0) {
					result++;
				}
			}
		}

		process.stdout.write(" Total divisible pairs : " + result + "\n");
	}
}

function main(args) {
	var obj = new MyArray();
	//Define array elements
	var collection = [5, 8, 2, 4, 9, 3];
	//Get the size of array
	var size = collection.length;
	obj.divisible_pair(collection, size);
}

main();

Output

 Total divisible pairs : 4
# Python 3 Program
# Count divisible pairs in an array
class MyArray :
	# Function which is counting all divisible pairs
	def divisible_pair(self, collection, size) :
		result = 0
		i = 0
		while (i < size) :
			j = i + 1
			while (j < size) :
				# Check if  [i] and [j] element are divisible ?

				if (collection[i] % collection[j] == 0 or collection[j] % collection[i] == 0) :
					result += 1
				
				j += 1
			
			i += 1
		
		print(" Total divisible pairs : ", result ,"\n", end = "")
	

def main() :
	obj = MyArray()
	collection = [5, 8, 2, 4, 9, 3]
	size = len(collection)
	obj.divisible_pair(collection, size)


if __name__ == "__main__":
	main()

Output

 Total divisible pairs :  4
# Ruby Program
# Count divisible pairs in an array
class MyArray 
	# Function which is counting all divisible pairs
	def divisible_pair(collection, size) 
		result = 0
		i = 0
		while (i < size) 
			j = i + 1
			while (j < size) 
				# Check if  [i] and [j] element are divisible ?

				if (collection[i] % collection[j] == 0 || collection[j] % collection[i] == 0) 
					result += 1
				end
				j += 1
			end
			i += 1
		end
		print(" Total divisible pairs  :", result ,"\n")
	end
end
def main() 
	obj = MyArray.new()
	collection = [5, 8, 2, 4, 9, 3]
	size = collection.length
	obj.divisible_pair(collection, size)
end
main()

Output

 Total divisible pairs  :4
/*
  Scala Program
  Count divisible pairs in an array
*/
class MyArray {
	//Function which is counting all divisible pairs
	def divisible_pair(collection: Array[Int], size: Int): Unit = {
		var result: Int = 0;
		var i: Int = 0;
		while (i < size) {
			var j: Int = i + 1;
			while (j < size) {
				//Check if  [i] and [j] element are divisible?

				if (collection(i) % collection(j) == 0 || collection(j) % collection(i) == 0) {
					result += 1;
				}
				j += 1;
			}
			i += 1;
		}
		print(" Total divisible pairs : " + result + "\n");
	}
}
object Main {
	def main(args: Array[String]): Unit = {
		val obj: MyArray = new MyArray();
		val collection: Array[Int] = Array(5, 8, 2, 4, 9, 3);
		val size: Int = collection.length;
		obj.divisible_pair(collection, size);
	}
}

Output

 Total divisible pairs : 4
/*
  Swift Program
  Count divisible pairs in an array
*/
class MyArray {
	//Function which is counting all divisible pairs
	func divisible_pair(_ collection: [Int], _ size: Int) {
		var result: Int = 0;
		var i: Int = 0;
		while (i < size) {
			var j: Int = i + 1;
			while (j < size) {
				//Check if  [i] and [j] element are divisible?

				if (collection[i] % collection[j] == 0 || collection[j] % collection[i] == 0) {
					result += 1;
				}
				j += 1;
			}
			i += 1;
		}
		print(" Total divisible pairs : ", result ,"\n", terminator: "");
	}
}
func main() {
	let obj: MyArray = MyArray();
	let collection: [Int] = [5, 8, 2, 4, 9, 3];
	let size: Int = collection.count;
	obj.divisible_pair(collection, size);
}
main();

Output

 Total divisible pairs :  4


Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment







© 2021, kalkicode.com, All rights reserved