Sock Merchant

L : https://www.hackerrank.com/challenges/sock-merchant/problem

 

Q : 짝수개인 숫자를 2개 단위로 묶기

 

A : 코딜리티에서 배웠던 xor연산으로 처리

 

program sockMerchant;
uses Classes, SysUtils;
var
  ia, ii, iResult : Integer;
  arr : array of integer; 
  TList : TStringList;
  sVal : String;
begin
  Readln(ia);
 
  SetLength(arr,ia);
 
  iResult := 0;
  
  TList := TStringList.Create;
  
  for ii := 0 to ia - 1 do 
  begin
    Read(arr[ii]);
    sVal := IntToStr(arr[ii]); 
    TList.Values[sVal] := IntToStr(StrToIntDef(TList.Values[sVal],0) xor arr[ii]);
    if TList.Values[sVal] = '0' then Inc(iResult);
  end;
 
  Writeln(iResult);
end.