canvas (flower)
来源:互联网 发布:mac 10.10.5 编辑:程序博客网 时间:2024/05/16 17:18
运行后会发现…
来自https://www.zhihu.com/question/21082867
<script> let b = document.body; let c = document.createElement('canvas'); b.appendChild(c); let a = c.getContext('2d'); document.body.clientWidth; with (m = Math) C = cos, S = sin, P = pow, R = random; c.width = c.height = f = 600; h = -250; function p(a, b, c) { if (c > 60) return [S(a * 7) * (13 + 5 / (.2 + P(b * 4, 4))) - S(b) * 50, b * f + 50, 625 + C(a * 7) * (13 + 5 / (.2 + P(b * 4, 4))) + b * 400, a * 1 - b / 2, a]; A = a * 2 - 1; B = b * 2 - 1; if (A * A + B * B < 1) { if (c > 37) { n = (j = c & 1) ? 6 : 4; o = .5 / (a + .01) + C(b * 125) * 3 - a * 300; w = b * h; return [o * C(n) + w * S(n) + j * 610 - 390, o * S(n) - w * C(n) + 550 - j * 350, 1180 + C(B + A) * 99 - j * 300, .4 - a * .1 + P(1 - B * B, -h * 6) * .15 - a * b * .4 + C(a + b) / 5 + P(C((o * (a + 1) + (B > 0 ? w : -w)) / 25), 30) * .1 * (1 - B * B), o / 1e3 + .7 - o * w * 3e-6]; } if (c > 32) { c = c * 1.16 - .15; o = a * 45 - 20; w = b * b * h; z = o * S(c) + w * C(c) + 620; return [o * C(c) - w * S(c), 28 + C(B * .5) * 99 - b * b * b * 60 - z / 2 - h, z, (b * b * .3 + P((1 - (A * A)), 7) * .15 + .3) * b, b * .7]; } o = A * (2 - b) * (80 - c * 2); w = 99 - C(A) * 120 - C(b) * (-h - c * 4.9) + C(P(1 - b, 7)) * 50 + c * 2; z = o * S(c) + w * C(c) + 700; return [o * C(c) - w * S(c), B * 99 - C(P(b, 7)) * 50 - c / 3 - z / 1.35 + 450, z, (1 - b / 1.2) * .9 + a * .1, P((1 - b), 20) / 4 + .05]; } } setInterval('for(i=0;i<1e4;i++)if(s=p(R(),R(),i%46/.74)){z=s[2];x=~~(s[0]*f/z-h);y=~~(s[1]*f/z-h);if(!m[q=y*f+x]|m[q]>z)m[q]=z,a.fillStyle="rgb("+~(s[3]*h)+","+~(s[4]*h)+","+~(s[3]*s[3]*-80)+")",a.fillRect(x,y,1,1)}', 0);</script>
阅读全文
0 0
- canvas (flower)
- Flower
- flower?
- ZOJ 3691 Flower(最大流+二分)
- (noip 模拟 flower 种花)<贪心+后悔>
- 【开源项目】花密(Flower Password)之入门指南
- poj 2750 Potted Flower 数据结构(线段树)
- POJ 2750 Potted Flower(线段树 + DP)
- poj 2750 Potted Flower(线段树+动态规划)
- 【POJ 2750】 Potted Flower(线段树套dp)
- poj2750 Potted Flower(线段树单点更新)
- URAL2020 Traffic Jam in Flower Town (模拟)
- POJ 2750 Potted Flower (线段树+动归)
- poj_2750 Potted Flower(环形区间+线段树+单点更新)
- poj2750 Potted Flower(区间连续子序列的和)
- URAL 2020. Traffic Jam in Flower Town(模拟)
- Flower.c
- sun Flower
- 大事记
- 读阿里热修复总结
- 正则表达式语法
- same-tree Java code
- 30*24*60*60*1000等于多少
- canvas (flower)
- 2017第22届中国国际厨房、卫浴设施展览会会刊(参展商名录)
- arcmap解决shp提示unknon spaitial(添加投影)
- C++删除目标文件夹下所有文件
- 曹可爱之最可爱-Vue.js入门(五)Class与Style绑定
- indices should be one-based and in ascending order
- Python爬取中国天气网天气数据
- react_native 项目实战 (6) 趋势页面 列表抽取 popover使用
- WireMock 伪造 REST 服务