All ASCII characters with a given bit count Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) The PPCG Site design is on its way - help us make it awesome! Sandbox for Proposed ChallengesBiplex: an important useless operatorConvert a “mixed-base” string to ASCIIAll Aboard the ASCII TrainSum of Modulo SumsCount the characters - bit by bit!Calculate the binary split sum of a wordMap inputted ASCII charactersDiluted Integer SumsCount the lucky tickets within the given rangeASCII Art Octagons
How to keep bees out of canned beverages?
Are there existing rules/lore for MTG planeswalkers?
Will I be more secure with my own router behind my ISP's router?
Israeli soda type drink
Protagonist's race is hidden - should I reveal it?
Providing direct feedback to a product salesperson
My admission is revoked after accepting the admission offer
Will I lose my paid in full property
Is there a possibility to generate a list dynamically in Latex?
Translate text contents of an existing file from lower to upper case and copy to a new file
SQL Server placement of master database files vs resource database files
What *exactly* is electrical current, voltage, and resistance?
Putting Ant-Man on house arrest
Can't solve system of linear equations (that need simplification first)
Suing a Police Officer Instead of the Police Department
Why do people think Winterfell crypts is the safest place for women, children & old people?
How to ask rejected full-time candidates to apply to teach individual courses?
Processing ADC conversion result: DMA vs Processor Registers
Raising a bilingual kid. When should we introduce the majority language?
Was Objective-C really a hinderance to Apple software development?
What's parked in Mil Moscow helicopter plant?
Show two Lagrangians are equivalent
How to translate "red flag" into Spanish?
Variable does not exist: sObjectType (Task.sObjectType)
All ASCII characters with a given bit count
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)
The PPCG Site design is on its way - help us make it awesome!
Sandbox for Proposed ChallengesBiplex: an important useless operatorConvert a “mixed-base” string to ASCIIAll Aboard the ASCII TrainSum of Modulo SumsCount the characters - bit by bit!Calculate the binary split sum of a wordMap inputted ASCII charactersDiluted Integer SumsCount the lucky tickets within the given rangeASCII Art Octagons
$begingroup$
(Title with thanks to @ChasBrown)
Sandbox
The Background
This challenge is inspired by a question that I recently posted on Puzzling Stack Exchange. Please feel free to follow the link if you are interested in the original question. If not then I won't bore you with the details here.
The Facts
Every printable standard ASCII character has a decimal value between 32 and 126 inclusive. These can be converted to their corresponding binary numbers in the range 100000 to 1111110 inclusive. When you sum the bits of these binary numbers you will always end up with an integer between 1 and 6 inclusive.
The Challenge
Given an integer between 1 and 6 inclusive as input, write a program or function which will output in any acceptable format all of the printable standard ASCII characters where the sum of the bits of their binary value is equal to the input integer.
Examples (showing output in four possible acceptable formats)
Input: 1
Output:
" "
"@"
Input: 2
Output: '!"$(0ABDHP`'
Input: 3
Output: "#%&)*,1248CEFIJLQRTXabdhp"
Input: 6
Output: ['?', '_', 'o', 'w', '', '', '~']
The Rules
- Assume the input will always be an integer (or string representation of an integer) between 1 and 6 inclusive.
- You may write a program to display the results or a function to return them.
- Output may be in any acceptable format but must be consistent for all inputs. If you choose to output a quoted string then the same type of quotes must be used for all inputs.
- Standard loopholes prohibited as usual.
- This is code golf so shortest code in each language wins.
Test Cases
A full set of expected results is available here (TIO) (ungolfed Python implementation).
code-golf
asked 54 mins ago
ElPedroElPedro
3,5881023
$endgroup$
add a comment |
$begingroup$
(Title with thanks to @ChasBrown)
Sandbox
The Background
This challenge is inspired by a question that I recently posted on Puzzling Stack Exchange. Please feel free to follow the link if you are interested in the original question. If not then I won't bore you with the details here.
The Facts
Every printable standard ASCII character has a decimal value between 32 and 126 inclusive. These can be converted to their corresponding binary numbers in the range 100000 to 1111110 inclusive. When you sum the bits of these binary numbers you will always end up with an integer between 1 and 6 inclusive.
The Challenge
Given an integer between 1 and 6 inclusive as input, write a program or function which will output in any acceptable format all of the printable standard ASCII characters where the sum of the bits of their binary value is equal to the input integer.
Examples (showing output in four possible acceptable formats)
Input: 1
Output:
" "
"@"
Input: 2
Output: '!"$(0ABDHP`'
Input: 3
Output: "#%&)*,1248CEFIJLQRTXabdhp"
Input: 6
Output: ['?', '_', 'o', 'w', '', '', '~']
The Rules
- Assume the input will always be an integer (or string representation of an integer) between 1 and 6 inclusive.
- You may write a program to display the results or a function to return them.
- Output may be in any acceptable format but must be consistent for all inputs. If you choose to output a quoted string then the same type of quotes must be used for all inputs.
- Standard loopholes prohibited as usual.
- This is code golf so shortest code in each language wins.
Test Cases
A full set of expected results is available here (TIO) (ungolfed Python implementation).
code-golf
asked 54 mins ago
ElPedroElPedro
3,5881023
$endgroup$
$begingroup$
Are we allowed to return/print a list of the decimal ascii values or do we need to have them in the form of characters (eg.63vs?)?
$endgroup$
– Benjamin Urquhart
31 mins ago
1
$begingroup$
Must be the actual characters.
$endgroup$
– ElPedro
29 mins ago
$begingroup$
Does the order of characters matter?
$endgroup$
– gwaugh
51 secs ago
add a comment |
$begingroup$
(Title with thanks to @ChasBrown)
Sandbox
The Background
This challenge is inspired by a question that I recently posted on Puzzling Stack Exchange. Please feel free to follow the link if you are interested in the original question. If not then I won't bore you with the details here.
The Facts
Every printable standard ASCII character has a decimal value between 32 and 126 inclusive. These can be converted to their corresponding binary numbers in the range 100000 to 1111110 inclusive. When you sum the bits of these binary numbers you will always end up with an integer between 1 and 6 inclusive.
The Challenge
Given an integer between 1 and 6 inclusive as input, write a program or function which will output in any acceptable format all of the printable standard ASCII characters where the sum of the bits of their binary value is equal to the input integer.
Examples (showing output in four possible acceptable formats)
Input: 1
Output:
" "
"@"
Input: 2
Output: '!"$(0ABDHP`'
Input: 3
Output: "#%&)*,1248CEFIJLQRTXabdhp"
Input: 6
Output: ['?', '_', 'o', 'w', '', '', '~']
The Rules
- Assume the input will always be an integer (or string representation of an integer) between 1 and 6 inclusive.
- You may write a program to display the results or a function to return them.
- Output may be in any acceptable format but must be consistent for all inputs. If you choose to output a quoted string then the same type of quotes must be used for all inputs.
- Standard loopholes prohibited as usual.
- This is code golf so shortest code in each language wins.
Test Cases
A full set of expected results is available here (TIO) (ungolfed Python implementation).
code-golf
asked 54 mins ago
ElPedroElPedro
3,5881023
$endgroup$
(Title with thanks to @ChasBrown)
Sandbox
The Background
This challenge is inspired by a question that I recently posted on Puzzling Stack Exchange. Please feel free to follow the link if you are interested in the original question. If not then I won't bore you with the details here.
The Facts
Every printable standard ASCII character has a decimal value between 32 and 126 inclusive. These can be converted to their corresponding binary numbers in the range 100000 to 1111110 inclusive. When you sum the bits of these binary numbers you will always end up with an integer between 1 and 6 inclusive.
The Challenge
Given an integer between 1 and 6 inclusive as input, write a program or function which will output in any acceptable format all of the printable standard ASCII characters where the sum of the bits of their binary value is equal to the input integer.
Examples (showing output in four possible acceptable formats)
Input: 1
Output:
" "
"@"
Input: 2
Output: '!"$(0ABDHP`'
Input: 3
Output: "#%&)*,1248CEFIJLQRTXabdhp"
Input: 6
Output: ['?', '_', 'o', 'w', '', '', '~']
The Rules
- Assume the input will always be an integer (or string representation of an integer) between 1 and 6 inclusive.
- You may write a program to display the results or a function to return them.
- Output may be in any acceptable format but must be consistent for all inputs. If you choose to output a quoted string then the same type of quotes must be used for all inputs.
- Standard loopholes prohibited as usual.
- This is code golf so shortest code in each language wins.
Test Cases
A full set of expected results is available here (TIO) (ungolfed Python implementation).
code-golf
code-golf
asked 54 mins ago
ElPedroElPedro
3,5881023
asked 54 mins ago
ElPedroElPedro
3,5881023
asked 54 mins ago
ElPedroElPedro
3,5881023
asked 54 mins ago
ElPedroElPedro
3,5881023
asked 54 mins ago
ElPedroElPedro
3,5881023
3,5881023
$begingroup$
Are we allowed to return/print a list of the decimal ascii values or do we need to have them in the form of characters (eg.63vs?)?
$endgroup$
– Benjamin Urquhart
31 mins ago
1
$begingroup$
Must be the actual characters.
$endgroup$
– ElPedro
29 mins ago
$begingroup$
Does the order of characters matter?
$endgroup$
– gwaugh
51 secs ago
add a comment |
$begingroup$
Are we allowed to return/print a list of the decimal ascii values or do we need to have them in the form of characters (eg.63vs?)?
$endgroup$
– Benjamin Urquhart
31 mins ago
1
$begingroup$
Must be the actual characters.
$endgroup$
– ElPedro
29 mins ago
$begingroup$
Does the order of characters matter?
$endgroup$
– gwaugh
51 secs ago
$begingroup$
Are we allowed to return/print a list of the decimal ascii values or do we need to have them in the form of characters (eg.
63 vs ?)?$endgroup$
– Benjamin Urquhart
31 mins ago
$begingroup$
Are we allowed to return/print a list of the decimal ascii values or do we need to have them in the form of characters (eg.
63 vs ?)?$endgroup$
– Benjamin Urquhart
31 mins ago
1
1
$begingroup$
Must be the actual characters.
$endgroup$
– ElPedro
29 mins ago
$begingroup$
Must be the actual characters.
$endgroup$
– ElPedro
29 mins ago
$begingroup$
Does the order of characters matter?
$endgroup$
– gwaugh
51 secs ago
$begingroup$
Does the order of characters matter?
$endgroup$
– gwaugh
51 secs ago
add a comment |
10 Answers
10
active
oldest
votes
$begingroup$
Python 2, 69 bytes
lambda n:[chr(i)for i in range(32,127)if sum(map(int,bin(i)[2:]))==n]
Try it online!
answered 37 mins ago
NeilNeil
2,002324
$endgroup$
$begingroup$
That's exactly what I got when I golfed my ref implementation. +1
$endgroup$
– ElPedro
36 mins ago
add a comment |
$begingroup$
Java 8, 131 bytes
Returns a java.util.stream.Stream<String>
n->java.util.stream.IntStream.range(32,127).filter(i->Long.toBinaryString(i).chars().map(c->c-48).sum()==n).mapToObj(c->(char)c+"")
Try it online!
Using HashSet, 135 bytes. Returns a Set<Object>:
n->new java.util.HashSet()for(int i=31;i++<126;add(Long.toBinaryString(i).chars().map(c->c-48).sum()==n?(char)i+"":""),remove(""));
Try it online!
answered 28 mins ago
Benjamin UrquhartBenjamin Urquhart
688111
$endgroup$
add a comment |
$begingroup$
Wolfram Language (Mathematica), 70 bytes
FromCharacterCode/@Select[32~Range~126,s=#;Tr@IntegerDigits[#,2]==s&]&
Try it online!
answered 43 mins ago
J42161217J42161217
14.3k21354
$endgroup$
add a comment |
$begingroup$
05AB1E, 8 bytes
žQʒÇbSOQ
Try it online!
Explanation
žQ # push the printable ascii characters
ʒ # filter, keep elements whose
Ç # character code
b # converted to binary
SO # has a digit sum
Q # equal to the input
answered 22 mins ago
EmignaEmigna
48.2k434147
$endgroup$
add a comment |
$begingroup$
Gaia, 10 bytes
₵R⟪¤cbΣ=⟫⁇
Try it online!
| implicit input, n
₵R | push printable ascii
⟪ ⟫⁇ | filter the list where:
¤cbΣ | the sum of the code point in binary
= | is equal to n
answered 19 mins ago
GiuseppeGiuseppe
18k31155
$endgroup$
add a comment |
$begingroup$
Python 2, 62 bytes
lambda n:[chr(i)for i in range(32,127)if bin(i).count('1')==n]
Try it online!
answered 12 mins ago
LynnLynn
51.2k899234
$endgroup$
add a comment |
$begingroup$
dzaima/APL, 26 25 bytes
⎕ucs a⌿⍨(+/¨2⊤¨a←32…126)=
Try it online!
answered 9 mins ago
dzaimadzaima
16.1k22060
$endgroup$
add a comment |
$begingroup$
Japt, 9 bytes
;EƶXc¤è1
Try it
;EƶXc¤è1 :Implicit input of integer U
;E :Printable ASCII
Æ :Filter each X
¶ :Test U for equality with
Xc : Character code of X
¤ : To binary string
è1 : Count the 1s
answered 9 mins ago
ShaggyShaggy
19.1k21768
$endgroup$
add a comment |
$begingroup$
JavaScript (Node.js), 70 bytes
n=>(g=x=>x>>7?'':Buffer((h=x=>x&&x%2+h(x>>1))(x)-n?[]:[x])+g(x+1))(32)
Try it online!
answered 7 mins ago
ArnauldArnauld
81.9k798337
$endgroup$
add a comment |
$begingroup$
Jelly, 8 bytes
ØṖOB§=ʋƇ
Try it online!
answered 2 mins ago
ZylviijZylviij
31014
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "200"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f183625%2fall-ascii-characters-with-a-given-bit-count%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
10 Answers
10
active
oldest
votes
10 Answers
10
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Python 2, 69 bytes
lambda n:[chr(i)for i in range(32,127)if sum(map(int,bin(i)[2:]))==n]
Try it online!
answered 37 mins ago
NeilNeil
2,002324
$endgroup$
$begingroup$
That's exactly what I got when I golfed my ref implementation. +1
$endgroup$
– ElPedro
36 mins ago
add a comment |
$begingroup$
Python 2, 69 bytes
lambda n:[chr(i)for i in range(32,127)if sum(map(int,bin(i)[2:]))==n]
Try it online!
answered 37 mins ago
NeilNeil
2,002324
$endgroup$
$begingroup$
That's exactly what I got when I golfed my ref implementation. +1
$endgroup$
– ElPedro
36 mins ago
add a comment |
$begingroup$
Python 2, 69 bytes
lambda n:[chr(i)for i in range(32,127)if sum(map(int,bin(i)[2:]))==n]
Try it online!
answered 37 mins ago
NeilNeil
2,002324
$endgroup$
Python 2, 69 bytes
lambda n:[chr(i)for i in range(32,127)if sum(map(int,bin(i)[2:]))==n]
Try it online!
answered 37 mins ago
NeilNeil
2,002324
answered 37 mins ago
NeilNeil
2,002324
answered 37 mins ago
NeilNeil
2,002324
answered 37 mins ago
NeilNeil
2,002324
2,002324
$begingroup$
That's exactly what I got when I golfed my ref implementation. +1
$endgroup$
– ElPedro
36 mins ago
add a comment |
$begingroup$
That's exactly what I got when I golfed my ref implementation. +1
$endgroup$
– ElPedro
36 mins ago
$begingroup$
That's exactly what I got when I golfed my ref implementation. +1
$endgroup$
– ElPedro
36 mins ago
$begingroup$
That's exactly what I got when I golfed my ref implementation. +1
$endgroup$
– ElPedro
36 mins ago
add a comment |
$begingroup$
Java 8, 131 bytes
Returns a java.util.stream.Stream<String>
n->java.util.stream.IntStream.range(32,127).filter(i->Long.toBinaryString(i).chars().map(c->c-48).sum()==n).mapToObj(c->(char)c+"")
Try it online!
Using HashSet, 135 bytes. Returns a Set<Object>:
n->new java.util.HashSet()for(int i=31;i++<126;add(Long.toBinaryString(i).chars().map(c->c-48).sum()==n?(char)i+"":""),remove(""));
Try it online!
answered 28 mins ago
Benjamin UrquhartBenjamin Urquhart
688111
$endgroup$
add a comment |
$begingroup$
Java 8, 131 bytes
Returns a java.util.stream.Stream<String>
n->java.util.stream.IntStream.range(32,127).filter(i->Long.toBinaryString(i).chars().map(c->c-48).sum()==n).mapToObj(c->(char)c+"")
Try it online!
Using HashSet, 135 bytes. Returns a Set<Object>:
n->new java.util.HashSet()for(int i=31;i++<126;add(Long.toBinaryString(i).chars().map(c->c-48).sum()==n?(char)i+"":""),remove(""));
Try it online!
answered 28 mins ago
Benjamin UrquhartBenjamin Urquhart
688111
$endgroup$
add a comment |
$begingroup$
Java 8, 131 bytes
Returns a java.util.stream.Stream<String>
n->java.util.stream.IntStream.range(32,127).filter(i->Long.toBinaryString(i).chars().map(c->c-48).sum()==n).mapToObj(c->(char)c+"")
Try it online!
Using HashSet, 135 bytes. Returns a Set<Object>:
n->new java.util.HashSet()for(int i=31;i++<126;add(Long.toBinaryString(i).chars().map(c->c-48).sum()==n?(char)i+"":""),remove(""));
Try it online!
answered 28 mins ago
Benjamin UrquhartBenjamin Urquhart
688111
$endgroup$
Java 8, 131 bytes
Returns a java.util.stream.Stream<String>
n->java.util.stream.IntStream.range(32,127).filter(i->Long.toBinaryString(i).chars().map(c->c-48).sum()==n).mapToObj(c->(char)c+"")
Try it online!
Using HashSet, 135 bytes. Returns a Set<Object>:
n->new java.util.HashSet()for(int i=31;i++<126;add(Long.toBinaryString(i).chars().map(c->c-48).sum()==n?(char)i+"":""),remove(""));
Try it online!
answered 28 mins ago
Benjamin UrquhartBenjamin Urquhart
688111
edited 6 mins ago
answered 28 mins ago
Benjamin UrquhartBenjamin Urquhart
688111
answered 28 mins ago
Benjamin UrquhartBenjamin Urquhart
688111
answered 28 mins ago
Benjamin UrquhartBenjamin Urquhart
688111
688111
add a comment |
add a comment |
$begingroup$
Wolfram Language (Mathematica), 70 bytes
FromCharacterCode/@Select[32~Range~126,s=#;Tr@IntegerDigits[#,2]==s&]&
Try it online!
answered 43 mins ago
J42161217J42161217
14.3k21354
$endgroup$
add a comment |
$begingroup$
Wolfram Language (Mathematica), 70 bytes
FromCharacterCode/@Select[32~Range~126,s=#;Tr@IntegerDigits[#,2]==s&]&
Try it online!
answered 43 mins ago
J42161217J42161217
14.3k21354
$endgroup$
add a comment |
$begingroup$
Wolfram Language (Mathematica), 70 bytes
FromCharacterCode/@Select[32~Range~126,s=#;Tr@IntegerDigits[#,2]==s&]&
Try it online!
answered 43 mins ago
J42161217J42161217
14.3k21354
$endgroup$
Wolfram Language (Mathematica), 70 bytes
FromCharacterCode/@Select[32~Range~126,s=#;Tr@IntegerDigits[#,2]==s&]&
Try it online!
answered 43 mins ago
J42161217J42161217
14.3k21354
answered 43 mins ago
J42161217J42161217
14.3k21354
answered 43 mins ago
J42161217J42161217
14.3k21354
answered 43 mins ago
J42161217J42161217
14.3k21354
14.3k21354
add a comment |
add a comment |
$begingroup$
05AB1E, 8 bytes
žQʒÇbSOQ
Try it online!
Explanation
žQ # push the printable ascii characters
ʒ # filter, keep elements whose
Ç # character code
b # converted to binary
SO # has a digit sum
Q # equal to the input
answered 22 mins ago
EmignaEmigna
48.2k434147
$endgroup$
add a comment |
$begingroup$
05AB1E, 8 bytes
žQʒÇbSOQ
Try it online!
Explanation
žQ # push the printable ascii characters
ʒ # filter, keep elements whose
Ç # character code
b # converted to binary
SO # has a digit sum
Q # equal to the input
answered 22 mins ago
EmignaEmigna
48.2k434147
$endgroup$
add a comment |
$begingroup$
05AB1E, 8 bytes
žQʒÇbSOQ
Try it online!
Explanation
žQ # push the printable ascii characters
ʒ # filter, keep elements whose
Ç # character code
b # converted to binary
SO # has a digit sum
Q # equal to the input
answered 22 mins ago
EmignaEmigna
48.2k434147
$endgroup$
05AB1E, 8 bytes
žQʒÇbSOQ
Try it online!
Explanation
žQ # push the printable ascii characters
ʒ # filter, keep elements whose
Ç # character code
b # converted to binary
SO # has a digit sum
Q # equal to the input
answered 22 mins ago
EmignaEmigna
48.2k434147
answered 22 mins ago
EmignaEmigna
48.2k434147
answered 22 mins ago
EmignaEmigna
48.2k434147
answered 22 mins ago
EmignaEmigna
48.2k434147
48.2k434147
add a comment |
add a comment |
$begingroup$
Gaia, 10 bytes
₵R⟪¤cbΣ=⟫⁇
Try it online!
| implicit input, n
₵R | push printable ascii
⟪ ⟫⁇ | filter the list where:
¤cbΣ | the sum of the code point in binary
= | is equal to n
answered 19 mins ago
GiuseppeGiuseppe
18k31155
$endgroup$
add a comment |
$begingroup$
Gaia, 10 bytes
₵R⟪¤cbΣ=⟫⁇
Try it online!
| implicit input, n
₵R | push printable ascii
⟪ ⟫⁇ | filter the list where:
¤cbΣ | the sum of the code point in binary
= | is equal to n
answered 19 mins ago
GiuseppeGiuseppe
18k31155
$endgroup$
add a comment |
$begingroup$
Gaia, 10 bytes
₵R⟪¤cbΣ=⟫⁇
Try it online!
| implicit input, n
₵R | push printable ascii
⟪ ⟫⁇ | filter the list where:
¤cbΣ | the sum of the code point in binary
= | is equal to n
answered 19 mins ago
GiuseppeGiuseppe
18k31155
$endgroup$
Gaia, 10 bytes
₵R⟪¤cbΣ=⟫⁇
Try it online!
| implicit input, n
₵R | push printable ascii
⟪ ⟫⁇ | filter the list where:
¤cbΣ | the sum of the code point in binary
= | is equal to n
answered 19 mins ago
GiuseppeGiuseppe
18k31155
answered 19 mins ago
GiuseppeGiuseppe
18k31155
answered 19 mins ago
GiuseppeGiuseppe
18k31155
answered 19 mins ago
GiuseppeGiuseppe
18k31155
18k31155
add a comment |
add a comment |
$begingroup$
Python 2, 62 bytes
lambda n:[chr(i)for i in range(32,127)if bin(i).count('1')==n]
Try it online!
answered 12 mins ago
LynnLynn
51.2k899234
$endgroup$
add a comment |
$begingroup$
Python 2, 62 bytes
lambda n:[chr(i)for i in range(32,127)if bin(i).count('1')==n]
Try it online!
answered 12 mins ago
LynnLynn
51.2k899234
$endgroup$
add a comment |
$begingroup$
Python 2, 62 bytes
lambda n:[chr(i)for i in range(32,127)if bin(i).count('1')==n]
Try it online!
answered 12 mins ago
LynnLynn
51.2k899234
$endgroup$
Python 2, 62 bytes
lambda n:[chr(i)for i in range(32,127)if bin(i).count('1')==n]
Try it online!
answered 12 mins ago
LynnLynn
51.2k899234
answered 12 mins ago
LynnLynn
51.2k899234
answered 12 mins ago
LynnLynn
51.2k899234
answered 12 mins ago
LynnLynn
51.2k899234
51.2k899234
add a comment |
add a comment |
$begingroup$
dzaima/APL, 26 25 bytes
⎕ucs a⌿⍨(+/¨2⊤¨a←32…126)=
Try it online!
answered 9 mins ago
dzaimadzaima
16.1k22060
$endgroup$
add a comment |
$begingroup$
dzaima/APL, 26 25 bytes
⎕ucs a⌿⍨(+/¨2⊤¨a←32…126)=
Try it online!
answered 9 mins ago
dzaimadzaima
16.1k22060
$endgroup$
add a comment |
$begingroup$
dzaima/APL, 26 25 bytes
⎕ucs a⌿⍨(+/¨2⊤¨a←32…126)=
Try it online!
answered 9 mins ago
dzaimadzaima
16.1k22060
$endgroup$
dzaima/APL, 26 25 bytes
⎕ucs a⌿⍨(+/¨2⊤¨a←32…126)=
Try it online!
answered 9 mins ago
dzaimadzaima
16.1k22060
answered 9 mins ago
dzaimadzaima
16.1k22060
answered 9 mins ago
dzaimadzaima
16.1k22060
answered 9 mins ago
dzaimadzaima
16.1k22060
16.1k22060
add a comment |
add a comment |
$begingroup$
Japt, 9 bytes
;EƶXc¤è1
Try it
;EƶXc¤è1 :Implicit input of integer U
;E :Printable ASCII
Æ :Filter each X
¶ :Test U for equality with
Xc : Character code of X
¤ : To binary string
è1 : Count the 1s
answered 9 mins ago
ShaggyShaggy
19.1k21768
$endgroup$
add a comment |
$begingroup$
Japt, 9 bytes
;EƶXc¤è1
Try it
;EƶXc¤è1 :Implicit input of integer U
;E :Printable ASCII
Æ :Filter each X
¶ :Test U for equality with
Xc : Character code of X
¤ : To binary string
è1 : Count the 1s
answered 9 mins ago
ShaggyShaggy
19.1k21768
$endgroup$
add a comment |
$begingroup$
Japt, 9 bytes
;EƶXc¤è1
Try it
;EƶXc¤è1 :Implicit input of integer U
;E :Printable ASCII
Æ :Filter each X
¶ :Test U for equality with
Xc : Character code of X
¤ : To binary string
è1 : Count the 1s
answered 9 mins ago
ShaggyShaggy
19.1k21768
$endgroup$
Japt, 9 bytes
;EƶXc¤è1
Try it
;EƶXc¤è1 :Implicit input of integer U
;E :Printable ASCII
Æ :Filter each X
¶ :Test U for equality with
Xc : Character code of X
¤ : To binary string
è1 : Count the 1s
answered 9 mins ago
ShaggyShaggy
19.1k21768
answered 9 mins ago
ShaggyShaggy
19.1k21768
answered 9 mins ago
ShaggyShaggy
19.1k21768
answered 9 mins ago
ShaggyShaggy
19.1k21768
19.1k21768
add a comment |
add a comment |
$begingroup$
JavaScript (Node.js), 70 bytes
n=>(g=x=>x>>7?'':Buffer((h=x=>x&&x%2+h(x>>1))(x)-n?[]:[x])+g(x+1))(32)
Try it online!
answered 7 mins ago
ArnauldArnauld
81.9k798337
$endgroup$
add a comment |
$begingroup$
JavaScript (Node.js), 70 bytes
n=>(g=x=>x>>7?'':Buffer((h=x=>x&&x%2+h(x>>1))(x)-n?[]:[x])+g(x+1))(32)
Try it online!
answered 7 mins ago
ArnauldArnauld
81.9k798337
$endgroup$
add a comment |
$begingroup$
JavaScript (Node.js), 70 bytes
n=>(g=x=>x>>7?'':Buffer((h=x=>x&&x%2+h(x>>1))(x)-n?[]:[x])+g(x+1))(32)
Try it online!
answered 7 mins ago
ArnauldArnauld
81.9k798337
$endgroup$
JavaScript (Node.js), 70 bytes
n=>(g=x=>x>>7?'':Buffer((h=x=>x&&x%2+h(x>>1))(x)-n?[]:[x])+g(x+1))(32)
Try it online!
answered 7 mins ago
ArnauldArnauld
81.9k798337
answered 7 mins ago
ArnauldArnauld
81.9k798337
answered 7 mins ago
ArnauldArnauld
81.9k798337
answered 7 mins ago
ArnauldArnauld
81.9k798337
81.9k798337
add a comment |
add a comment |
$begingroup$
Jelly, 8 bytes
ØṖOB§=ʋƇ
Try it online!
answered 2 mins ago
ZylviijZylviij
31014
$endgroup$
add a comment |
$begingroup$
Jelly, 8 bytes
ØṖOB§=ʋƇ
Try it online!
answered 2 mins ago
ZylviijZylviij
31014
$endgroup$
add a comment |
$begingroup$
Jelly, 8 bytes
ØṖOB§=ʋƇ
Try it online!
answered 2 mins ago
ZylviijZylviij
31014
$endgroup$
Jelly, 8 bytes
ØṖOB§=ʋƇ
Try it online!
answered 2 mins ago
ZylviijZylviij
31014
answered 2 mins ago
ZylviijZylviij
31014
answered 2 mins ago
ZylviijZylviij
31014
answered 2 mins ago
ZylviijZylviij
31014
31014
add a comment |
add a comment |
If this is an answer to a challenge…
…Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.
…Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
Explanations of your answer make it more interesting to read and are very much encouraged.…Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.
More generally…
…Please make sure to answer the question and provide sufficient detail.
…Avoid asking for help, clarification or responding to other answers (use comments instead).
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f183625%2fall-ascii-characters-with-a-given-bit-count%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Are we allowed to return/print a list of the decimal ascii values or do we need to have them in the form of characters (eg.
63vs?)?$endgroup$
– Benjamin Urquhart
31 mins ago
1
$begingroup$
Must be the actual characters.
$endgroup$
– ElPedro
29 mins ago
$begingroup$
Does the order of characters matter?
$endgroup$
– gwaugh
51 secs ago