Java (JDK), 109108 bytes
n->{Stringvar r="",s=r+n;fors=""+n;for(int b=n.highestOneBit(n),i=0;b>0;b/=2,i++)if((b&n)>0)r+=System.out.print((s+=s).charAt(i);return r;);}
Credits
- -67 bytes thanks to Kevin Cruijssen
Java (JDK), 109 bytes
n->{String r="",s=r+n;for(int b=n.highestOneBit(n),i=0;b>0;b/=2,i++)if((b&n)>0)r+=(s+=s).charAt(i);return r;}
Credits
- -6 bytes thanks to Kevin Cruijssen
Java (JDK), 108 bytes
n->{var s=""+n;for(int b=n.highestOneBit(n),i=0;b>0;b/=2,i++)if((b&n)>0)System.out.print((s+=s).charAt(i));}
Credits
- -7 bytes thanks to Kevin Cruijssen
Java (JDK), 115109 bytes
n->{String r="",s=r+n;for(int b=n.highestOneBit(n),i=0;b>0;b/=2,i++)if((b&n)>0)r+=s.charAtr+=(i%ss+=s).lengthcharAt()i);return r;}
Credits
- -6 bytes thanks to Kevin Cruijssen
Java (JDK), 115 bytes
n->{String r="",s=r+n;for(int b=n.highestOneBit(n),i=0;b>0;b/=2,i++)if((b&n)>0)r+=s.charAt(i%s.length());return r;}
Java (JDK), 109 bytes
n->{String r="",s=r+n;for(int b=n.highestOneBit(n),i=0;b>0;b/=2,i++)if((b&n)>0)r+=(s+=s).charAt(i);return r;}
Credits
- -6 bytes thanks to Kevin Cruijssen
Java (JDK), 123115 bytes
n->{String r="",s=r+n,b=n.toString(n,2);fors=r+n;for(int i=0;i<bb=n.lengthhighestOneBit(n);i++,i=0;b>0;b/=2,i++)if(b.charAt(ib&n)>48>0)r+=s.charAt(i%s.length());return r;}
I didn't expect that much issue to get a binary count. In the end, I didn't use bit operations, but rather a String because it was way too hard to get it working. So this might certainly be an optimization.Try it online!
Java (JDK), 123 bytes
n->{String r="",s=r+n,b=n.toString(n,2);for(int i=0;i<b.length();i++)if(b.charAt(i)>48)r+=s.charAt(i%s.length());return r;}
I didn't expect that much issue to get a binary count. In the end, I didn't use bit operations, but rather a String because it was way too hard to get it working. So this might certainly be an optimization.
Java (JDK), 115 bytes
n->{String r="",s=r+n;for(int b=n.highestOneBit(n),i=0;b>0;b/=2,i++)if((b&n)>0)r+=s.charAt(i%s.length());return r;}
Loading