Start New Discussion within our **Software Development Community** Not Yet Answered # How to calculate the sum & product of dis-similar numbers of an array[10].

Discussion Starter fashxfreak 3 Discussion Starter fashxfreak 3 Aslan89

**Donate $1 now to see this question answered quickly**

Sponsored questions offer a monetary incentive to answerers to produce quality responses.

Be **intelligently matched** with 5 likely answerers who will be alerted to help.

0

Let's see what you have

```
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
int i, j, k, sum, c;
sum = 0;
int[] m = new int[10];
for (k = 0; k < 10; k++)
{
Console.Write("Enter Value: ");
m[k] = Convert.ToInt16(Console.ReadLine());
}
for (i = 0; i < 10; i++)
{
c = 0;
for (j = i + 1; j < 10; j++)
{
if (m[i] == m[j] && c==0)
{
sum = sum + m[i];
sum = sum + m[j];
m[j] = 0;
c++;
}
else if (m[i] == m[j])
{
sum = sum + m[j];
m[j] = 0;
}
}
}
Console.WriteLine("sum of similar numbers : " + sum);
Console.ReadLine();
}
}
}
```

// sum of dissimilar numbers can simply be found by subtracting the sum of similar numbers from the total sum.....

0

```
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
int i, j, k, p;
p = 1;
int[] m = new int[4];
for (k = 0; k < 4; k++)
{
Console.Write("Enter Value: ");
m[k] = Convert.ToInt16(Console.ReadLine());
}
for (i = 0; i < 4; i++)
{
for (j = i + 1; j < 4; j++)
{
if (m[i] == m[j])
{
m[j] = 1;
if (j == 3)
{
m[i] = 1;
}
}
}
}
for (k = 0; k < 4; k++)
{
p = p * m[k];
}
if (p == 1)
{
Console.WriteLine("Product of dis-similar numbers : 0");
}
else
{
Console.WriteLine("sum of similar numbers : " + p);
}
Console.ReadLine();
}
}
}
```

Let's see what you have

0

```
using System;
namespace ConsoleApplication5
{
class Program
{
static void Main(string[] args)
{
int[] arr = { 3, 5, 7, 1, 3, 8, 7, 1, 1, 10, 15, 32, 3 };
int sum = 0;
int mul = 1;
int count = 0;
for (int k = 0; k < arr.Length; k++ )
{
for (int i = 0; i < arr.Length; i++)
if (arr[k] == arr[i])
count++;
if (count == 1)
{
sum += arr[k];
mul *= arr[k];
}
count = 0;
}
Console.WriteLine("Sum = : {0}\nMul = : {1}", sum, mul);
Console.ReadKey();
}
}
}
```

This article has been dead for over six months. Start a new discussion instead.