hello world
Any conversation
๐
let N=6,D0=[0,1,0,-1],D1=[1,0,-1,0],s=[],g={},d=x=y=xa=xb=ya=yb=0;
for(let n=0;n<N;n++){s=s.concat([1]).concat(s.map(x=>!x).reverse())}
for(let i=0;i<s.length;i++) {
x<xa && (xa=x);y<ya && (ya=y);x>xb && (xb=x);y>yb && (yb=y);
let t=s[i]?1:-1,e=(d+t+4)%4;
g[x]||(g[x]={});
g[x][y]=g[x][y]?"โผ":"โโโโ"[(t*(D0[d]+D0[e])>0?0:2)+(t*(D1[d]+D1[e])>0?0:1)];
x+=D0[e];y+=D1[e];d=e;
}
for(j=yb;j>=ya;j--) {
let u=""; for(i=xa;i<=xb;i++){u+=(g[i][j]||"ยท")} console.log(u);
}ยทโโโโยทยทยทยทยทยทยท
โโโโผโยทยทยทยทโโยท
โยทยทโโโโยทยทยทโโ
ยทยทยทโโผโผโยทยทยทโโ
ยทยทยทโโผโผโโโโโผโ
ยทยทยทโโผโโโผโผโโโ
ยทยทยทโโผโยทโโผโยทยท
ยทยทยทยทโโยทยทโโยทยทIโm using textlog to explore the intersection of and tech, with the goal of building an app that solves a problem in this space. Named , it's word represented as a hex color.
Of all the words there, it is a cocoa-ish color and is an appropriate name for this idea.
Vรฅr konges livsgjerning gรฅr mot slutten, landet samler seg for รฅ ta farvel med en konge som har vรฆrt samlende og god for landet. Mรฅ Gud velsigne hans minne og hans etterfรธlger.
Our king's life's work is coming to an end, the country comes together to say goodbye to a king who has been unifying and good for the country. May God bless his memory and his successor.
