/index.html

## index.html
<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <meta name="viewport" content="width=device-width">
  <title>JS Bin</title>
</head>
<body>

<script id="jsbin-javascript">
// find unordered pairs of indices i and j such that
// i != j
// (arr[i] + arr[j]) % k = x
// (arr[i] * arr[j]) % k = y
function unorderedPairsInArray(k, x, y, arr) {
  var result = 0;
	var resultArr = [[]];
	var j;
	var len = arr.length;
	arr.forEach((ival, i) => {
		for(j = i+1; j < len; j++) {
			var jval = arr[j];
			if ((ival + jval) % k === x && (ival * jval) % k === y) {
				result++;
				// console.log('[arr[' + i + '], arr[' + j + ']] = ' + '[' + ival + ',' + jval + ']');
			}
		}
	});
	// console.log('result = ' + result);
	return result;
}

var k = 2;
var x = 1;
var y = 0;
var arr = [1,2,3,2,1];
unorderedPairsInArray(k,x,y,arr);
</script>


<script id="jsbin-source-javascript" type="text/javascript">
// find unordered pairs of indices i and j such that
// i != j
// (arr[i] + arr[j]) % k = x
// (arr[i] * arr[j]) % k = y
function unorderedPairsInArray(k, x, y, arr) {
  var result = 0;
	var resultArr = [[]];
	var j;
	var len = arr.length;
	arr.forEach((ival, i) => {
		for(j = i+1; j < len; j++) {
			var jval = arr[j];
			if ((ival + jval) % k === x && (ival * jval) % k === y) {
				result++;
				// console.log('[arr[' + i + '], arr[' + j + ']] = ' + '[' + ival + ',' + jval + ']');
			}
		}
	});
	// console.log('result = ' + result);
	return result;
}

var k = 2;
var x = 1;
var y = 0;
var arr = [1,2,3,2,1];
unorderedPairsInArray(k,x,y,arr);</script></body>
</html>

## jsbin.naxabek.js
// find unordered pairs of indices i and j such that
// i != j
// (arr[i] + arr[j]) % k = x
// (arr[i] * arr[j]) % k = y
function unorderedPairsInArray(k, x, y, arr) {
  var result = 0;
	var resultArr = [[]];
	var j;
	var len = arr.length;
	arr.forEach((ival, i) => {
		for(j = i+1; j < len; j++) {
			var jval = arr[j];
			if ((ival + jval) % k === x && (ival * jval) % k === y) {
				result++;
				// console.log('[arr[' + i + '], arr[' + j + ']] = ' + '[' + ival + ',' + jval + ']');
			}
		}
	});
	// console.log('result = ' + result);
	return result;
}

var k = 2;
var x = 1;
var y = 0;
var arr = [1,2,3,2,1];
unorderedPairsInArray(k,x,y,arr);
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<meta name="viewport" content="width=device-width">
	<title>JS Bin</title>
	</head>
	<body>

	<script id="jsbin-javascript">
	// find unordered pairs of indices i and j such that
	// i != j
	// (arr[i] + arr[j]) % k = x
	// (arr[i] * arr[j]) % k = y
	function unorderedPairsInArray(k, x, y, arr) {
	var result = 0;
	var resultArr = [[]];
	var j;
	var len = arr.length;
	arr.forEach((ival, i) => {
	for(j = i+1; j < len; j++) {
	var jval = arr[j];
	if ((ival + jval) % k === x && (ival * jval) % k === y) {
	result++;
	// console.log('[arr[' + i + '], arr[' + j + ']] = ' + '[' + ival + ',' + jval + ']');
	}
	}
	});
	// console.log('result = ' + result);
	return result;
	}

	var k = 2;
	var x = 1;
	var y = 0;
	var arr = [1,2,3,2,1];
	unorderedPairsInArray(k,x,y,arr);
	</script>



	<script id="jsbin-source-javascript" type="text/javascript">
	// find unordered pairs of indices i and j such that
	// i != j
	// (arr[i] + arr[j]) % k = x
	// (arr[i] * arr[j]) % k = y
	function unorderedPairsInArray(k, x, y, arr) {
	var result = 0;
	var resultArr = [[]];
	var j;
	var len = arr.length;
	arr.forEach((ival, i) => {
	for(j = i+1; j < len; j++) {
	var jval = arr[j];
	if ((ival + jval) % k === x && (ival * jval) % k === y) {
	result++;
	// console.log('[arr[' + i + '], arr[' + j + ']] = ' + '[' + ival + ',' + jval + ']');
	}
	}
	});
	// console.log('result = ' + result);
	return result;
	}

	var k = 2;
	var x = 1;
	var y = 0;
	var arr = [1,2,3,2,1];
	unorderedPairsInArray(k,x,y,arr);</script></body>
	</html>