커뮤니티
문의드립니다 ^^
2014-01-10 05:31:09
177
글번호 71209
다시 질문을 올리도록 하겠습니다 ^^
감사합니다.
답변 2
예스스탁 예스스탁 답변
2014-01-10 09:23:21
안녕하세요
예스스탁입니다.
아래식 참고하시기 바랍니다.
input : bet(1),N(10);
var : MP(0),Bars(0),HH(0),LL(0),EP(0),XP(0),cnt(0);
Array : PL[50](0);
if MP == 0 and C[1] > highest(H,N)[2] and H >= Highest(H,N)[1]+C[1]*0.001 Then {
MP = 1;
Bars = 0;
HH = 0;
if O >= Highest(H,N)[1]+C[1]*0.001 Then
EP = O;
Else
EP = iff((Highest(H,N)[1]+C[1]*0.001)%PriceScale>0,
int((Highest(H,N)[1]+C[1]*0.001)/PriceScale)*PriceScale+PriceScale,
(Highest(H,N)[1]+C[1]*0.001));
}
if MP == 0 and C[1] < Lowest(L,N)[2] and L <= Lowest(L,N)[1]-C*0.001 Then {
MP = -1;
Bars = 0;
LL = 9999999;
if O <= Lowest(L,N)[1]-C*0.001 Then
EP = O;
Else
EP = iff((Lowest(L,N)[1]-C[1]*0.001)%PriceScale>0,
int((Lowest(L,N)[1]-C[1]*0.001)/PriceScale)*PriceScale,
(Lowest(L,N)[1]-C[1]*0.001));
}
if MP == 1 then {
Bars = Bars+1;
if bars >= 2 and H[1] >= EP*1.1 and L <= lowest(L,N/2)[1] then {
MP = 0;
if O <= lowest(L,N/2)[1] Then
XP = O;
Else
XP = iff((lowest(L,N/2)[1])%PriceScale>0,
int((lowest(L,N/2)[1])/PriceScale)*PriceScale+PriceScale,
lowest(L,N/2)[1]);
PL[1] = (XP-EP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if bars > 1 Then{
if H > HH Then
HH = H;
if Bars > 1 and Bars-1 == (N/2) and HH < EP Then{
MP = 0;
XP = C;
PL[1] = (XP-EP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if L <= EP*0.97 Then{
MP = 0;
if O <= EP*0.97 Then
XP = O;
Else
XP = iff((EP*0.97)%PriceScale > 0,
(int((EP*0.97)/PriceScale)*PriceScale),
(EP*0.97));
PL[1] = (XP-EP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if HH >= EP*1.03 and L <= HH-(HH-EP)*0.10 Then{
MP = 0;
if O <= HH-(HH-EP)*0.10 Then
XP = O;
Else
XP = iff((HH-(HH-EP)*0.10)%PriceScale>0,
int((HH-(HH-EP)*0.10)/PriceScale)*PriceScale,
(HH-(HH-EP)*0.10));
PL[1] = (XP-EP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
}
}
if MP == -1 then {
Bars = Bars+1;
if bars >= 2 and L[1] <= EP*0.9 and H >= highest(H,N/2)[1] then {
MP = 0;
if O >= Highest(H,N/2)[1] Then
XP = O;
Else
XP = iff(highest(H,N/2)[1]%PriceScale > 0,
int(highest(H,N/2)[1]/PriceScale)*PriceScale+PriceScale,
highest(H,N/2)[1]);
PL[1] = (EP-XP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if bars > 1 Then{
if L < LL Then
LL = L;
if Bars > 1 and Bars-1 == (N/2) and LL > EP Then{
MP = 0;
XP = C;
PL[1] = (EP-XP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if H >= EP*1.03 Then{
MP = 0;
if O >= EP*1.03 Then
XP = O;
Else
XP = iff((EP*1.03)%PriceScale > 0,
(int((EP*1.03)/PriceScale)*PriceScale)+PriceScale,
(EP*1.03));
PL[1] = (EP-XP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if LL <= EP*0.97 and H >= LL+(EP-LL)*0.10 Then{
MP = 0;
if O >= LL+(EP-LL)*0.10 Then
XP = O;
Else
XP = iff((LL+(EP-LL)*0.10)%PriceScale>0,
int((LL+(EP-LL)*0.10)/PriceScale)*PriceScale+PriceScale,
(LL+(EP-LL)*0.10));
PL[1] = (EP-XP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
}
}
plot1(PL[1]);
plot2(PL[2]);
plot3(PL[3]);
plot4(PL[4]);
plot5(PL[5]);
즐거운 하루되세요
> 데몬 님이 쓴 글입니다.
> 제목 : 문의드립니다 ^^
> 다시 질문을 올리도록 하겠습니다 ^^
감사합니다.
데몬
2014-01-12 06:51:20
아- 답변 정말 감사합니다.
잘 보겠습니다.
> 예스스탁 님이 쓴 글입니다.
> 제목 : Re : 문의드립니다 ^^
> 안녕하세요
예스스탁입니다.
아래식 참고하시기 바랍니다.
input : bet(1),N(10);
var : MP(0),Bars(0),HH(0),LL(0),EP(0),XP(0),cnt(0);
Array : PL[50](0);
if MP == 0 and C[1] > highest(H,N)[2] and H >= Highest(H,N)[1]+C[1]*0.001 Then {
MP = 1;
Bars = 0;
HH = 0;
if O >= Highest(H,N)[1]+C[1]*0.001 Then
EP = O;
Else
EP = iff((Highest(H,N)[1]+C[1]*0.001)%PriceScale>0,
int((Highest(H,N)[1]+C[1]*0.001)/PriceScale)*PriceScale+PriceScale,
(Highest(H,N)[1]+C[1]*0.001));
}
if MP == 0 and C[1] < Lowest(L,N)[2] and L <= Lowest(L,N)[1]-C*0.001 Then {
MP = -1;
Bars = 0;
LL = 9999999;
if O <= Lowest(L,N)[1]-C*0.001 Then
EP = O;
Else
EP = iff((Lowest(L,N)[1]-C[1]*0.001)%PriceScale>0,
int((Lowest(L,N)[1]-C[1]*0.001)/PriceScale)*PriceScale,
(Lowest(L,N)[1]-C[1]*0.001));
}
if MP == 1 then {
Bars = Bars+1;
if bars >= 2 and H[1] >= EP*1.1 and L <= lowest(L,N/2)[1] then {
MP = 0;
if O <= lowest(L,N/2)[1] Then
XP = O;
Else
XP = iff((lowest(L,N/2)[1])%PriceScale>0,
int((lowest(L,N/2)[1])/PriceScale)*PriceScale+PriceScale,
lowest(L,N/2)[1]);
PL[1] = (XP-EP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if bars > 1 Then{
if H > HH Then
HH = H;
if Bars > 1 and Bars-1 == (N/2) and HH < EP Then{
MP = 0;
XP = C;
PL[1] = (XP-EP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if L <= EP*0.97 Then{
MP = 0;
if O <= EP*0.97 Then
XP = O;
Else
XP = iff((EP*0.97)%PriceScale > 0,
(int((EP*0.97)/PriceScale)*PriceScale),
(EP*0.97));
PL[1] = (XP-EP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if HH >= EP*1.03 and L <= HH-(HH-EP)*0.10 Then{
MP = 0;
if O <= HH-(HH-EP)*0.10 Then
XP = O;
Else
XP = iff((HH-(HH-EP)*0.10)%PriceScale>0,
int((HH-(HH-EP)*0.10)/PriceScale)*PriceScale,
(HH-(HH-EP)*0.10));
PL[1] = (XP-EP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
}
}
if MP == -1 then {
Bars = Bars+1;
if bars >= 2 and L[1] <= EP*0.9 and H >= highest(H,N/2)[1] then {
MP = 0;
if O >= Highest(H,N/2)[1] Then
XP = O;
Else
XP = iff(highest(H,N/2)[1]%PriceScale > 0,
int(highest(H,N/2)[1]/PriceScale)*PriceScale+PriceScale,
highest(H,N/2)[1]);
PL[1] = (EP-XP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if bars > 1 Then{
if L < LL Then
LL = L;
if Bars > 1 and Bars-1 == (N/2) and LL > EP Then{
MP = 0;
XP = C;
PL[1] = (EP-XP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if H >= EP*1.03 Then{
MP = 0;
if O >= EP*1.03 Then
XP = O;
Else
XP = iff((EP*1.03)%PriceScale > 0,
(int((EP*1.03)/PriceScale)*PriceScale)+PriceScale,
(EP*1.03));
PL[1] = (EP-XP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
if LL <= EP*0.97 and H >= LL+(EP-LL)*0.10 Then{
MP = 0;
if O >= LL+(EP-LL)*0.10 Then
XP = O;
Else
XP = iff((LL+(EP-LL)*0.10)%PriceScale>0,
int((LL+(EP-LL)*0.10)/PriceScale)*PriceScale+PriceScale,
(LL+(EP-LL)*0.10));
PL[1] = (EP-XP)*bet;
for cnt = 2 to 49{
PL[cnt] = PL[cnt-1][1];
}
}
}
}
plot1(PL[1]);
plot2(PL[2]);
plot3(PL[3]);
plot4(PL[4]);
plot5(PL[5]);
즐거운 하루되세요
> 데몬 님이 쓴 글입니다.
> 제목 : 문의드립니다 ^^
> 다시 질문을 올리도록 하겠습니다 ^^
감사합니다.