遇到支付问题请联系客服：19921075275 ｜ 官方QQ群：1034330872
查看完整曲谱
第一片雪花
/*
Topok and by (, ) to to in
For full code and to this, visit
*/
//这里可以设置要飘落的图片
var="../pu/2005///"
// 雪花的数量
var no = 15;
var ns4up = () ? 1 : 0; //
var ie4up = () ? 1 : 0;
var dx, xp, yp; // and
var am, stx, sty; // and step
var i, = 800, =2600;
if (ns4up) { = ; = ;
} else if (ie4up) { =.; =.;
}
dx = new Array();
xp = new Array();
yp = new Array();
am = new Array();
stx = new Array();
sty = new Array();
for (i = 0; i < no; ++ i) {
dx[i] = 0; // set
xp[i] = ()*(); // set
yp[i] = ()*;
am[i] = ()*20; // set
stx[i] = 0.02 + ()/10; // set step
sty[i] = 0.7 + (); // set step
if (ns4up) { // set
if (i == 0) {.write("");
} else {.write("");
}
} else if (ie4up) {
if (i == 0) {.write("");
} else {.write("");
}
}
}() { // main
for (i = 0; i < no; ++ i) { // for every dot
yp[i] += sty[i];
if (yp[i] >) {
xp[i] = ()*([i]-30);
yp[i] = 0;
stx[i] = 0.02 + ()/10;
sty[i] = 0.7 + (); = ; = ;
}
dx[i] += stx[i];.["dot"+i].top = yp[i];.["dot"+i].left = xp[i] + am[i]*(dx[i]);
}("()", 10);
}() { // IE main
for (i = 0; i < no; ++ i) { // for every dot
yp[i] += sty[i];
if (yp[i] >) {
xp[i] = ()*([i]-30);
yp[i] = 0;
stx[i] = 0.02 + ()/10;
sty[i] = 0.7 + (); =.; =.;
}
dx[i] += stx[i];.all["dot"+i]. = yp[i];.all["dot"+i]. = xp[i] + am[i]*(dx[i]);
}("()", 10);
}
if (ns4up) {();
} else if (ie4up) {();
}
展开
更多其他版本 更多
519252893@qq.com还上传了 更多
00:00 / 00:00
1/2
x1.0
当前为预览页面，购买后查看全部
查看完整曲谱 >
曲谱报错
评论共0条评论
精彩评论