请高手帮忙把这个飞狐的公式改为金字塔，谢谢！！
input:N(15,2,122);
DIRECTION:=(CLOSE - REF(CLOSE,n));
XX:=ABS((CLOSE - REF(CLOSE,1)));
VOLATILITY:=SUM(XX,n);
ER:=ABS((DIRECTION / VOLATILITY));
FASTC:=(2 / (2 + 1));
SLOWC:=(2 / (30 + 1));
SSC:=((ER * (FASTC - SLOWC)) + SLOWC);
CONSTANT:=(SSC * SSC);
CC:=CLOSE;
YY:(REF(CLOSE,1) + (CONSTANT * (CLOSE - REF(CLOSE,1))));
IF DATACOUNT > N THEN
DD[N]:=CC[(N + 1)];
FOR I=N + 1 to DATACOUNT DO
DD[I]:=(DD[(I - 1)] + (CONSTANT[I] * (CC[I] - DD[(I - 1)])));
AMA:(DD),LINETHICK2,colorFFFF;
在金字塔里已经有函数了，变得很简单。
input:N(15,2,122);
FASTC:=(2 / (2 + 1));
SLOWC:=(2 / (30 + 1));
AMA:MD(C,N,FASTC,SLOWC),LINETHICK2,colorFFFF;