散分 WHAT LANGUAGE DO YOU SPEAK

@a = sort{$a <=> $b} @a
procedure union(i, j : longint);
 begin i := getpr(i);
mx(i) <- List.sort compare mx.(i);
(let((counts(sort(mapcar#'buckets(gethash name * items *))#'>)))
double ang2 = Math.atan2(tr2[1].y-tr2[0].y,tr2[1].x-tr2[0].x);
for ps in perms(ts) : yield |x| + ps
[>>>+<<<-]<<[>>>+<<<<-]>>>>> >>>>>
For I = 0 To 2 * (2^2((M+1)/2)-1) Step 2
ms = [1...m].map[gets.split.map[6:to_i]]
int[,] distFromBase = simipleBFS[map, startX, startY,"#T",false,out cx, out cy];
while (n-- > 0) if (!(n&(n+1))) cout << n + 1;

抄的，细节上抄错的请见谅。
发在技术区的，按技术性回答给分吧。