Clever Code

<script type="text/javascript" language="javascript">
        //-------------------function hardcode to perform on checklist box--------
        var total = 0;
        var histvalue = 0;
        var valueOfbx = 0;
        var currvalue = 0;
        function MutExChkList(chk) {
            if (chk.checked) {
                valueOfbx = 0;
                var chklst = chk.parentNode.parentNode.parentNode;
                var chkbx = chklst.getElementsByTagName("input");
                for (var i = 0; i < chkbx.length; i++) {
                    if ((chkbx[i].checked == true) && (chkbx[i].value != chk.value)) {
                        valueOfbx = Number(chkbx[i].value);
                        histvalue = -1;
                        chkbx[i].checked = false;
                    }
                    else if ((chkbx[i].checked == true) && (chkbx[i].value == chk.value)) {
                        currvalue = Number(chkbx[i].value);
                    }
                }
                total = total + currvalue;
                if (histvalue == -1) {
                    total = total - valueOfbx;
                    histvalue = 0;
                }
                if (total > 1) {
                    total = total - Number(chk.value);
                    chk.checked = false;
                    alert("exceeds");
                }
                else
                    chkbx[i].checked = false;
            }
            else {
                total = total - Number(chk.value);
            }
        }
 
    </script>

 

#include<iostream>
#include<iomanip>
using namespace std;
 
void line() { cout << setw(12) << setfill('-') << endl;}
 
int main() {
 
int binary[8];
int num;
int bits[8] = {128,64,32,16,8,4,2,1};
 
do {
    
    
 
line();
cout << "write in the number to be converted into binary." << endl;
cin >> num;
 

for(int i = 0;i < 8;i++) {
 
        
if(num >= bits[i]){
       
binary[i] = true;
num = num - bits[i];
 
}
 
else if(num < bits[i]) {
     
binary[i] = false;
}
 

}
 
for(int i = 0;i < 8;i++) { 
        
cout << binary[i] ;
 
}
}while (1);
 

system("pause");
return 0;
}
 

for (int i = 0; i < 8; i++)
   {
   cout << (num & 0x80) != 0 ? "1" : "0";
   num <<= 1;
   }

private List<string> LoadUniqueList(List<string> doubledList)
        {
            List<string> UniqueList = new List<string>();
            foreach (string item in doubledList)
            {
                bool x = true;
                foreach (string compare in UniqueList)
                {
                    if (item == compare)
                    {
                        x = false;
                    }
                    if (!x) break;
                }
                if (x) UniqueList.Add(item);
            }
            return UniqueList;
        }

MSDN wrote:

The HashSet(Of T) class provides high-performance set operations. A set is a collection that contains no duplicate elements, and whose elements are in no particular order.

Luc Pattyn wrote:

You're in the wrong forum.

UniqueList = doubledList.distinct 

private List<string> LoadUniqueList(List<string> doubledList)
{
  return doubledList.Distinct().ToList();
}