Couch 2048: How much more till 2048?
up vote
19
down vote
favorite
I have just tried a game called Couch 2048.
(Note: You should have a look to better understand this question.)
Since it wasn't very exciting for me, I've been asking myself 'How much more till 2048!?'
That inspired me to post a challenge, because calculating this in not as easy as I thought.
Your goal:
Given a list of balls on the sofa, you have to output how many balls with a value of 2 have to fall from the sky so that one can win the game (by reaching the 2048 ball).
- Assume the input is valid.
- Assume the player won't drop any balls.
- Assume the balls which fall from the sky always have a value of 2, as I've said.
- Valid output examples: 3, "4", [5], ["6"]
Edit:
I should clarify something:
- You have to print the smallest amount of 2s needed.
Test cases:[2048] -> 0
You've already won[1024,1024] -> 0
You don't need any more balls to win[1024,512,256,128,64,32,16,8,4,2] -> 1
One ball required to 'activate the chain'[512] -> 768
[512,2] -> 767
[4,16,64] -> 982
Notes:
I'm not a native speaker - Tell me if you spotted a typo or some non-grammatical text.
If something's unclear, ask in comments.
code-golf
|
show 7 more comments
up vote
19
down vote
favorite
I have just tried a game called Couch 2048.
(Note: You should have a look to better understand this question.)
Since it wasn't very exciting for me, I've been asking myself 'How much more till 2048!?'
That inspired me to post a challenge, because calculating this in not as easy as I thought.
Your goal:
Given a list of balls on the sofa, you have to output how many balls with a value of 2 have to fall from the sky so that one can win the game (by reaching the 2048 ball).
- Assume the input is valid.
- Assume the player won't drop any balls.
- Assume the balls which fall from the sky always have a value of 2, as I've said.
- Valid output examples: 3, "4", [5], ["6"]
Edit:
I should clarify something:
- You have to print the smallest amount of 2s needed.
Test cases:[2048] -> 0
You've already won[1024,1024] -> 0
You don't need any more balls to win[1024,512,256,128,64,32,16,8,4,2] -> 1
One ball required to 'activate the chain'[512] -> 768
[512,2] -> 767
[4,16,64] -> 982
Notes:
I'm not a native speaker - Tell me if you spotted a typo or some non-grammatical text.
If something's unclear, ask in comments.
code-golf
why[4,16,64] -> 22
?
– l4m2
Nov 12 at 12:43
3
Welcome to PPCG. It looks like this challenge is: add all the elements in the array, subtract from2048
and divide by2
- if so, you might want to double check the last test case - if not, please use it as an example to explain why the output isn't982
.
– Shaggy
Nov 12 at 12:45
1
@Shaggy thx for noticing a silly mistake
– user83982
Nov 12 at 12:47
4
Woah, I haven't thought my first challenge will have 7 answers and 2 upvotes in the first hour! And I reached to ~28 people!
– user83982
Nov 12 at 13:31
2
Hey, downvoter: explain your point of view! It's necessary for the challenge to improve!
– user83982
Nov 13 at 15:41
|
show 7 more comments
up vote
19
down vote
favorite
up vote
19
down vote
favorite
I have just tried a game called Couch 2048.
(Note: You should have a look to better understand this question.)
Since it wasn't very exciting for me, I've been asking myself 'How much more till 2048!?'
That inspired me to post a challenge, because calculating this in not as easy as I thought.
Your goal:
Given a list of balls on the sofa, you have to output how many balls with a value of 2 have to fall from the sky so that one can win the game (by reaching the 2048 ball).
- Assume the input is valid.
- Assume the player won't drop any balls.
- Assume the balls which fall from the sky always have a value of 2, as I've said.
- Valid output examples: 3, "4", [5], ["6"]
Edit:
I should clarify something:
- You have to print the smallest amount of 2s needed.
Test cases:[2048] -> 0
You've already won[1024,1024] -> 0
You don't need any more balls to win[1024,512,256,128,64,32,16,8,4,2] -> 1
One ball required to 'activate the chain'[512] -> 768
[512,2] -> 767
[4,16,64] -> 982
Notes:
I'm not a native speaker - Tell me if you spotted a typo or some non-grammatical text.
If something's unclear, ask in comments.
code-golf
I have just tried a game called Couch 2048.
(Note: You should have a look to better understand this question.)
Since it wasn't very exciting for me, I've been asking myself 'How much more till 2048!?'
That inspired me to post a challenge, because calculating this in not as easy as I thought.
Your goal:
Given a list of balls on the sofa, you have to output how many balls with a value of 2 have to fall from the sky so that one can win the game (by reaching the 2048 ball).
- Assume the input is valid.
- Assume the player won't drop any balls.
- Assume the balls which fall from the sky always have a value of 2, as I've said.
- Valid output examples: 3, "4", [5], ["6"]
Edit:
I should clarify something:
- You have to print the smallest amount of 2s needed.
Test cases:[2048] -> 0
You've already won[1024,1024] -> 0
You don't need any more balls to win[1024,512,256,128,64,32,16,8,4,2] -> 1
One ball required to 'activate the chain'[512] -> 768
[512,2] -> 767
[4,16,64] -> 982
Notes:
I'm not a native speaker - Tell me if you spotted a typo or some non-grammatical text.
If something's unclear, ask in comments.
code-golf
code-golf
edited Nov 12 at 14:06
asked Nov 12 at 12:34
user83982
why[4,16,64] -> 22
?
– l4m2
Nov 12 at 12:43
3
Welcome to PPCG. It looks like this challenge is: add all the elements in the array, subtract from2048
and divide by2
- if so, you might want to double check the last test case - if not, please use it as an example to explain why the output isn't982
.
– Shaggy
Nov 12 at 12:45
1
@Shaggy thx for noticing a silly mistake
– user83982
Nov 12 at 12:47
4
Woah, I haven't thought my first challenge will have 7 answers and 2 upvotes in the first hour! And I reached to ~28 people!
– user83982
Nov 12 at 13:31
2
Hey, downvoter: explain your point of view! It's necessary for the challenge to improve!
– user83982
Nov 13 at 15:41
|
show 7 more comments
why[4,16,64] -> 22
?
– l4m2
Nov 12 at 12:43
3
Welcome to PPCG. It looks like this challenge is: add all the elements in the array, subtract from2048
and divide by2
- if so, you might want to double check the last test case - if not, please use it as an example to explain why the output isn't982
.
– Shaggy
Nov 12 at 12:45
1
@Shaggy thx for noticing a silly mistake
– user83982
Nov 12 at 12:47
4
Woah, I haven't thought my first challenge will have 7 answers and 2 upvotes in the first hour! And I reached to ~28 people!
– user83982
Nov 12 at 13:31
2
Hey, downvoter: explain your point of view! It's necessary for the challenge to improve!
– user83982
Nov 13 at 15:41
why
[4,16,64] -> 22
?– l4m2
Nov 12 at 12:43
why
[4,16,64] -> 22
?– l4m2
Nov 12 at 12:43
3
3
Welcome to PPCG. It looks like this challenge is: add all the elements in the array, subtract from
2048
and divide by 2
- if so, you might want to double check the last test case - if not, please use it as an example to explain why the output isn't 982
.– Shaggy
Nov 12 at 12:45
Welcome to PPCG. It looks like this challenge is: add all the elements in the array, subtract from
2048
and divide by 2
- if so, you might want to double check the last test case - if not, please use it as an example to explain why the output isn't 982
.– Shaggy
Nov 12 at 12:45
1
1
@Shaggy thx for noticing a silly mistake
– user83982
Nov 12 at 12:47
@Shaggy thx for noticing a silly mistake
– user83982
Nov 12 at 12:47
4
4
Woah, I haven't thought my first challenge will have 7 answers and 2 upvotes in the first hour! And I reached to ~28 people!
– user83982
Nov 12 at 13:31
Woah, I haven't thought my first challenge will have 7 answers and 2 upvotes in the first hour! And I reached to ~28 people!
– user83982
Nov 12 at 13:31
2
2
Hey, downvoter: explain your point of view! It's necessary for the challenge to improve!
– user83982
Nov 13 at 15:41
Hey, downvoter: explain your point of view! It's necessary for the challenge to improve!
– user83982
Nov 13 at 15:41
|
show 7 more comments
27 Answers
27
active
oldest
votes
up vote
11
down vote
Java 8, 17 bytes
s->1024-s.sum()/2
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online.
Explanation:
s-> // Method with IntStream parameter and int return-type
1024- // Return 1024, minus:
s.sum() // The sum of the input-IntStream
/2 // Divided by 2
11
That feeling when Java is beating both python(because lambda syntax) and javascript(because sum)
– Quintec
Nov 12 at 14:06
add a comment |
up vote
8
down vote
Brain-Flak, 72 bytes
({{}})({<({}[()()])>()}{})([{}]((((((((()()()()){}){}){}){}){}){}){}){})
Try it online!
({{}}) # Sum entire stack
( ) # Push:
{< >()}{} # The number of times you can...
({}[()()]) # Subtract 2 before reaching 0
([{}] ) # Subtract that from...
((((((((()()()()){}){}){}){}){}){}){}){} # 1024
Thank you! I'm interested in learning Brain-Flak and your explanation was useful.
– Galen Ivanov
Nov 13 at 7:49
add a comment |
up vote
6
down vote
Python 2, 22 bytes
lambda x:4**5-sum(x)/2
Y'know, I just realized that 4**5
is the same length as 1024
.
Try it online!
add a comment |
up vote
6
down vote
MathGolf, 6 5 bytes
Σc/◘+
First MathGolf answer. :)
Try it online or verify all test cases.
Explanation:
Σ # Sum of the (implicit) input-list
c/ # Divide it by -2
◘+ # Add 1024 to it (and output implicitly)
add a comment |
up vote
5
down vote
05AB1E, 5 bytes
O;žBα
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online or verify all test cases.
Explanation:
O # Sum of the (implicit) input-list
; # Halved
žB # Push 1024
α # Absolute difference between the two (and output implicitly)
add a comment |
up vote
3
down vote
APL (Dyalog Unicode), 10 bytes
2÷⍨2048-+/
Try it online!
add a comment |
up vote
3
down vote
JavaScript (Node.js), 25 bytes
Based on @Shaggys' comment and answer
-3 bytes from @Arnauld =D
_=>1024-eval(_.join`+`)/2
Try it online!
add a comment |
up vote
2
down vote
J, 10 bytes
2048-:@-+/
Try it online!
Alternative:
J, 10 bytes
1024-1#.-:
Try it online!
add a comment |
up vote
2
down vote
Ruby, 17 bytes
->l{1024-l.sum/2}
Try it online!
add a comment |
up vote
2
down vote
TI-Basic, 8 bytes
4^5-.5sum(Ans
add a comment |
up vote
1
down vote
JavaScript, 28 bytes
a=>a.map(n=>x-=n/2,x=1024)|x
Try it online
add a comment |
up vote
1
down vote
Jelly, 7 6 bytes
HSạ⁽¡ç
Try it online!
Explanation:
HSạ⁽¡ç Example input: [4,16,64]
H Halve input. [2, 8, 32]
S Sum. 42
⁽¡ç Number 1024.
ạ Difference. 982
-1 byte by using a base-250 number
add a comment |
up vote
1
down vote
Catholicon, 5 bytes
-`L̇½Ṗ
Explanation:
- subtract
`L̇ 1024
from
½ half of the
Ṗ sum [of the input]
1
Is that a new golfing language I smell? :)
– ETHproductions
Nov 12 at 21:37
1
+1 for the new language. Another one to learn </sigh>
– ElPedro
Nov 12 at 22:10
add a comment |
up vote
1
down vote
Japt, 7 6 bytes
xz nH²
Try it or verify all test cases
z :(Floor) divide each by 2
x :Reduce by addition
n :Subtract from
H : 32
² : Squared
add a comment |
up vote
0
down vote
JavaScript (Node.js), 33 bytes
a=>!a.map(n=>x-=n/2,x=1024)>x?0:x
Try it online!
Why you don't do on [1024,1024,1024]
?
add a comment |
up vote
0
down vote
R, 17 bytes
4^5-sum(scan())/2
Try it online!
add a comment |
up vote
0
down vote
TeaScript, 11 bytes
4p5)-(xx)/2
Try it online!
add a comment |
up vote
0
down vote
Stax, 6 bytes
ë3i─♠÷
Run and debug it
add a comment |
up vote
0
down vote
perl -aE, 27 bytes
$"=$:;say eval"(2048-@F)/2"
This reads a line with numbers (whitespace separated) from STDIN
, and writes the answer to STDOUT
.
What it does is subtract all the numbers from the input from 2048, and it divides the remainder by 2. The -a
switch puts the in the array @F
(one number per element). If we interpolate an array into a string (which is what we are doing here), perl puts the value of $"
between the elements. The little used variable $:
is be default n-
; and since white space between tokens is ignored, the result is subtracting all the numbers from 2048. The eval
does the calculation.
add a comment |
up vote
0
down vote
Perl 6, 12 bytes
1024-*.sum/2
Try it online!
Anonymous Whatever lambda that takes a list and returns a number.
add a comment |
up vote
0
down vote
AWK, 26 bytes
{s+=$1}END{print 1024-s/2}
Input numbers are separated by newlines (i.e. one per line)
add a comment |
up vote
0
down vote
Neim, 6 bytes
Pretty new to Neim but got it working
𝐬ᚺςᚫᛦ𝕤
Explanation:
𝐬 : Sum input
ᚺ : Divide by 2 (stack now [input summed and divided by 2])
ς : Variable set to 16 pushed to stack
ᚫ : Multiply by 2
ᛦ : Square (stack now [input summed and divided by 2, 1024])
𝕤 : Subtract then absolute
Try it online!
add a comment |
up vote
0
down vote
JAVA, 30 bytes
2048-IntStream.of(a).sum()/2;
add a comment |
up vote
0
down vote
RAD, 10 bytes
1024-+/ω÷2
Try it online!
add a comment |
up vote
0
down vote
Clojure, 24 bytes
#(- 1024(/(apply + %)2))
Try it online!
add a comment |
up vote
0
down vote
Haskell, 16 bytes
(1024-).(/2).sum
An anonymous function, takes a list and returns a float.
Try it online!
add a comment |
up vote
0
down vote
F#, 24 bytes
fun f->1024-List.sum f/2
1024 minus the sum divided by 2.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
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',
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%2f175765%2fcouch-2048-how-much-more-till-2048%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
27 Answers
27
active
oldest
votes
27 Answers
27
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
11
down vote
Java 8, 17 bytes
s->1024-s.sum()/2
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online.
Explanation:
s-> // Method with IntStream parameter and int return-type
1024- // Return 1024, minus:
s.sum() // The sum of the input-IntStream
/2 // Divided by 2
11
That feeling when Java is beating both python(because lambda syntax) and javascript(because sum)
– Quintec
Nov 12 at 14:06
add a comment |
up vote
11
down vote
Java 8, 17 bytes
s->1024-s.sum()/2
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online.
Explanation:
s-> // Method with IntStream parameter and int return-type
1024- // Return 1024, minus:
s.sum() // The sum of the input-IntStream
/2 // Divided by 2
11
That feeling when Java is beating both python(because lambda syntax) and javascript(because sum)
– Quintec
Nov 12 at 14:06
add a comment |
up vote
11
down vote
up vote
11
down vote
Java 8, 17 bytes
s->1024-s.sum()/2
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online.
Explanation:
s-> // Method with IntStream parameter and int return-type
1024- // Return 1024, minus:
s.sum() // The sum of the input-IntStream
/2 // Divided by 2
Java 8, 17 bytes
s->1024-s.sum()/2
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online.
Explanation:
s-> // Method with IntStream parameter and int return-type
1024- // Return 1024, minus:
s.sum() // The sum of the input-IntStream
/2 // Divided by 2
answered Nov 12 at 13:37
Kevin Cruijssen
35.5k554186
35.5k554186
11
That feeling when Java is beating both python(because lambda syntax) and javascript(because sum)
– Quintec
Nov 12 at 14:06
add a comment |
11
That feeling when Java is beating both python(because lambda syntax) and javascript(because sum)
– Quintec
Nov 12 at 14:06
11
11
That feeling when Java is beating both python(because lambda syntax) and javascript(because sum)
– Quintec
Nov 12 at 14:06
That feeling when Java is beating both python(because lambda syntax) and javascript(because sum)
– Quintec
Nov 12 at 14:06
add a comment |
up vote
8
down vote
Brain-Flak, 72 bytes
({{}})({<({}[()()])>()}{})([{}]((((((((()()()()){}){}){}){}){}){}){}){})
Try it online!
({{}}) # Sum entire stack
( ) # Push:
{< >()}{} # The number of times you can...
({}[()()]) # Subtract 2 before reaching 0
([{}] ) # Subtract that from...
((((((((()()()()){}){}){}){}){}){}){}){} # 1024
Thank you! I'm interested in learning Brain-Flak and your explanation was useful.
– Galen Ivanov
Nov 13 at 7:49
add a comment |
up vote
8
down vote
Brain-Flak, 72 bytes
({{}})({<({}[()()])>()}{})([{}]((((((((()()()()){}){}){}){}){}){}){}){})
Try it online!
({{}}) # Sum entire stack
( ) # Push:
{< >()}{} # The number of times you can...
({}[()()]) # Subtract 2 before reaching 0
([{}] ) # Subtract that from...
((((((((()()()()){}){}){}){}){}){}){}){} # 1024
Thank you! I'm interested in learning Brain-Flak and your explanation was useful.
– Galen Ivanov
Nov 13 at 7:49
add a comment |
up vote
8
down vote
up vote
8
down vote
Brain-Flak, 72 bytes
({{}})({<({}[()()])>()}{})([{}]((((((((()()()()){}){}){}){}){}){}){}){})
Try it online!
({{}}) # Sum entire stack
( ) # Push:
{< >()}{} # The number of times you can...
({}[()()]) # Subtract 2 before reaching 0
([{}] ) # Subtract that from...
((((((((()()()()){}){}){}){}){}){}){}){} # 1024
Brain-Flak, 72 bytes
({{}})({<({}[()()])>()}{})([{}]((((((((()()()()){}){}){}){}){}){}){}){})
Try it online!
({{}}) # Sum entire stack
( ) # Push:
{< >()}{} # The number of times you can...
({}[()()]) # Subtract 2 before reaching 0
([{}] ) # Subtract that from...
((((((((()()()()){}){}){}){}){}){}){}){} # 1024
answered Nov 12 at 14:01
Riley
10.9k11448
10.9k11448
Thank you! I'm interested in learning Brain-Flak and your explanation was useful.
– Galen Ivanov
Nov 13 at 7:49
add a comment |
Thank you! I'm interested in learning Brain-Flak and your explanation was useful.
– Galen Ivanov
Nov 13 at 7:49
Thank you! I'm interested in learning Brain-Flak and your explanation was useful.
– Galen Ivanov
Nov 13 at 7:49
Thank you! I'm interested in learning Brain-Flak and your explanation was useful.
– Galen Ivanov
Nov 13 at 7:49
add a comment |
up vote
6
down vote
Python 2, 22 bytes
lambda x:4**5-sum(x)/2
Y'know, I just realized that 4**5
is the same length as 1024
.
Try it online!
add a comment |
up vote
6
down vote
Python 2, 22 bytes
lambda x:4**5-sum(x)/2
Y'know, I just realized that 4**5
is the same length as 1024
.
Try it online!
add a comment |
up vote
6
down vote
up vote
6
down vote
Python 2, 22 bytes
lambda x:4**5-sum(x)/2
Y'know, I just realized that 4**5
is the same length as 1024
.
Try it online!
Python 2, 22 bytes
lambda x:4**5-sum(x)/2
Y'know, I just realized that 4**5
is the same length as 1024
.
Try it online!
answered Nov 12 at 14:04
Quintec
1,3551620
1,3551620
add a comment |
add a comment |
up vote
6
down vote
MathGolf, 6 5 bytes
Σc/◘+
First MathGolf answer. :)
Try it online or verify all test cases.
Explanation:
Σ # Sum of the (implicit) input-list
c/ # Divide it by -2
◘+ # Add 1024 to it (and output implicitly)
add a comment |
up vote
6
down vote
MathGolf, 6 5 bytes
Σc/◘+
First MathGolf answer. :)
Try it online or verify all test cases.
Explanation:
Σ # Sum of the (implicit) input-list
c/ # Divide it by -2
◘+ # Add 1024 to it (and output implicitly)
add a comment |
up vote
6
down vote
up vote
6
down vote
MathGolf, 6 5 bytes
Σc/◘+
First MathGolf answer. :)
Try it online or verify all test cases.
Explanation:
Σ # Sum of the (implicit) input-list
c/ # Divide it by -2
◘+ # Add 1024 to it (and output implicitly)
MathGolf, 6 5 bytes
Σc/◘+
First MathGolf answer. :)
Try it online or verify all test cases.
Explanation:
Σ # Sum of the (implicit) input-list
c/ # Divide it by -2
◘+ # Add 1024 to it (and output implicitly)
edited Nov 12 at 14:55
answered Nov 12 at 14:45
Kevin Cruijssen
35.5k554186
35.5k554186
add a comment |
add a comment |
up vote
5
down vote
05AB1E, 5 bytes
O;žBα
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online or verify all test cases.
Explanation:
O # Sum of the (implicit) input-list
; # Halved
žB # Push 1024
α # Absolute difference between the two (and output implicitly)
add a comment |
up vote
5
down vote
05AB1E, 5 bytes
O;žBα
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online or verify all test cases.
Explanation:
O # Sum of the (implicit) input-list
; # Halved
žB # Push 1024
α # Absolute difference between the two (and output implicitly)
add a comment |
up vote
5
down vote
up vote
5
down vote
05AB1E, 5 bytes
O;žBα
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online or verify all test cases.
Explanation:
O # Sum of the (implicit) input-list
; # Halved
žB # Push 1024
α # Absolute difference between the two (and output implicitly)
05AB1E, 5 bytes
O;žBα
Port of @LuisFelipeDeJesusMunoz' JavaScript answer.
Try it online or verify all test cases.
Explanation:
O # Sum of the (implicit) input-list
; # Halved
žB # Push 1024
α # Absolute difference between the two (and output implicitly)
answered Nov 12 at 13:27
Kevin Cruijssen
35.5k554186
35.5k554186
add a comment |
add a comment |
up vote
3
down vote
APL (Dyalog Unicode), 10 bytes
2÷⍨2048-+/
Try it online!
add a comment |
up vote
3
down vote
APL (Dyalog Unicode), 10 bytes
2÷⍨2048-+/
Try it online!
add a comment |
up vote
3
down vote
up vote
3
down vote
APL (Dyalog Unicode), 10 bytes
2÷⍨2048-+/
Try it online!
APL (Dyalog Unicode), 10 bytes
2÷⍨2048-+/
Try it online!
answered Nov 12 at 13:03
J. Sallé
1,903322
1,903322
add a comment |
add a comment |
up vote
3
down vote
JavaScript (Node.js), 25 bytes
Based on @Shaggys' comment and answer
-3 bytes from @Arnauld =D
_=>1024-eval(_.join`+`)/2
Try it online!
add a comment |
up vote
3
down vote
JavaScript (Node.js), 25 bytes
Based on @Shaggys' comment and answer
-3 bytes from @Arnauld =D
_=>1024-eval(_.join`+`)/2
Try it online!
add a comment |
up vote
3
down vote
up vote
3
down vote
JavaScript (Node.js), 25 bytes
Based on @Shaggys' comment and answer
-3 bytes from @Arnauld =D
_=>1024-eval(_.join`+`)/2
Try it online!
JavaScript (Node.js), 25 bytes
Based on @Shaggys' comment and answer
-3 bytes from @Arnauld =D
_=>1024-eval(_.join`+`)/2
Try it online!
edited Nov 12 at 13:08
answered Nov 12 at 12:57
Luis felipe De jesus Munoz
4,03421254
4,03421254
add a comment |
add a comment |
up vote
2
down vote
J, 10 bytes
2048-:@-+/
Try it online!
Alternative:
J, 10 bytes
1024-1#.-:
Try it online!
add a comment |
up vote
2
down vote
J, 10 bytes
2048-:@-+/
Try it online!
Alternative:
J, 10 bytes
1024-1#.-:
Try it online!
add a comment |
up vote
2
down vote
up vote
2
down vote
J, 10 bytes
2048-:@-+/
Try it online!
Alternative:
J, 10 bytes
1024-1#.-:
Try it online!
J, 10 bytes
2048-:@-+/
Try it online!
Alternative:
J, 10 bytes
1024-1#.-:
Try it online!
edited Nov 12 at 13:39
answered Nov 12 at 13:29
Galen Ivanov
6,19711032
6,19711032
add a comment |
add a comment |
up vote
2
down vote
Ruby, 17 bytes
->l{1024-l.sum/2}
Try it online!
add a comment |
up vote
2
down vote
Ruby, 17 bytes
->l{1024-l.sum/2}
Try it online!
add a comment |
up vote
2
down vote
up vote
2
down vote
Ruby, 17 bytes
->l{1024-l.sum/2}
Try it online!
Ruby, 17 bytes
->l{1024-l.sum/2}
Try it online!
answered Nov 12 at 14:31
G B
7,6661328
7,6661328
add a comment |
add a comment |
up vote
2
down vote
TI-Basic, 8 bytes
4^5-.5sum(Ans
add a comment |
up vote
2
down vote
TI-Basic, 8 bytes
4^5-.5sum(Ans
add a comment |
up vote
2
down vote
up vote
2
down vote
TI-Basic, 8 bytes
4^5-.5sum(Ans
TI-Basic, 8 bytes
4^5-.5sum(Ans
answered Nov 12 at 17:20
Timtech
11.5k13759
11.5k13759
add a comment |
add a comment |
up vote
1
down vote
JavaScript, 28 bytes
a=>a.map(n=>x-=n/2,x=1024)|x
Try it online
add a comment |
up vote
1
down vote
JavaScript, 28 bytes
a=>a.map(n=>x-=n/2,x=1024)|x
Try it online
add a comment |
up vote
1
down vote
up vote
1
down vote
JavaScript, 28 bytes
a=>a.map(n=>x-=n/2,x=1024)|x
Try it online
JavaScript, 28 bytes
a=>a.map(n=>x-=n/2,x=1024)|x
Try it online
answered Nov 12 at 12:59
Shaggy
18.7k21663
18.7k21663
add a comment |
add a comment |
up vote
1
down vote
Jelly, 7 6 bytes
HSạ⁽¡ç
Try it online!
Explanation:
HSạ⁽¡ç Example input: [4,16,64]
H Halve input. [2, 8, 32]
S Sum. 42
⁽¡ç Number 1024.
ạ Difference. 982
-1 byte by using a base-250 number
add a comment |
up vote
1
down vote
Jelly, 7 6 bytes
HSạ⁽¡ç
Try it online!
Explanation:
HSạ⁽¡ç Example input: [4,16,64]
H Halve input. [2, 8, 32]
S Sum. 42
⁽¡ç Number 1024.
ạ Difference. 982
-1 byte by using a base-250 number
add a comment |
up vote
1
down vote
up vote
1
down vote
Jelly, 7 6 bytes
HSạ⁽¡ç
Try it online!
Explanation:
HSạ⁽¡ç Example input: [4,16,64]
H Halve input. [2, 8, 32]
S Sum. 42
⁽¡ç Number 1024.
ạ Difference. 982
-1 byte by using a base-250 number
Jelly, 7 6 bytes
HSạ⁽¡ç
Try it online!
Explanation:
HSạ⁽¡ç Example input: [4,16,64]
H Halve input. [2, 8, 32]
S Sum. 42
⁽¡ç Number 1024.
ạ Difference. 982
-1 byte by using a base-250 number
edited Nov 12 at 14:21
answered Nov 12 at 13:54
Comrade SparklePony
3,26611252
3,26611252
add a comment |
add a comment |
up vote
1
down vote
Catholicon, 5 bytes
-`L̇½Ṗ
Explanation:
- subtract
`L̇ 1024
from
½ half of the
Ṗ sum [of the input]
1
Is that a new golfing language I smell? :)
– ETHproductions
Nov 12 at 21:37
1
+1 for the new language. Another one to learn </sigh>
– ElPedro
Nov 12 at 22:10
add a comment |
up vote
1
down vote
Catholicon, 5 bytes
-`L̇½Ṗ
Explanation:
- subtract
`L̇ 1024
from
½ half of the
Ṗ sum [of the input]
1
Is that a new golfing language I smell? :)
– ETHproductions
Nov 12 at 21:37
1
+1 for the new language. Another one to learn </sigh>
– ElPedro
Nov 12 at 22:10
add a comment |
up vote
1
down vote
up vote
1
down vote
Catholicon, 5 bytes
-`L̇½Ṗ
Explanation:
- subtract
`L̇ 1024
from
½ half of the
Ṗ sum [of the input]
Catholicon, 5 bytes
-`L̇½Ṗ
Explanation:
- subtract
`L̇ 1024
from
½ half of the
Ṗ sum [of the input]
answered Nov 12 at 15:42
Okx
12.5k127100
12.5k127100
1
Is that a new golfing language I smell? :)
– ETHproductions
Nov 12 at 21:37
1
+1 for the new language. Another one to learn </sigh>
– ElPedro
Nov 12 at 22:10
add a comment |
1
Is that a new golfing language I smell? :)
– ETHproductions
Nov 12 at 21:37
1
+1 for the new language. Another one to learn </sigh>
– ElPedro
Nov 12 at 22:10
1
1
Is that a new golfing language I smell? :)
– ETHproductions
Nov 12 at 21:37
Is that a new golfing language I smell? :)
– ETHproductions
Nov 12 at 21:37
1
1
+1 for the new language. Another one to learn </sigh>
– ElPedro
Nov 12 at 22:10
+1 for the new language. Another one to learn </sigh>
– ElPedro
Nov 12 at 22:10
add a comment |
up vote
1
down vote
Japt, 7 6 bytes
xz nH²
Try it or verify all test cases
z :(Floor) divide each by 2
x :Reduce by addition
n :Subtract from
H : 32
² : Squared
add a comment |
up vote
1
down vote
Japt, 7 6 bytes
xz nH²
Try it or verify all test cases
z :(Floor) divide each by 2
x :Reduce by addition
n :Subtract from
H : 32
² : Squared
add a comment |
up vote
1
down vote
up vote
1
down vote
Japt, 7 6 bytes
xz nH²
Try it or verify all test cases
z :(Floor) divide each by 2
x :Reduce by addition
n :Subtract from
H : 32
² : Squared
Japt, 7 6 bytes
xz nH²
Try it or verify all test cases
z :(Floor) divide each by 2
x :Reduce by addition
n :Subtract from
H : 32
² : Squared
edited Nov 12 at 17:38
answered Nov 12 at 12:49
Shaggy
18.7k21663
18.7k21663
add a comment |
add a comment |
up vote
0
down vote
JavaScript (Node.js), 33 bytes
a=>!a.map(n=>x-=n/2,x=1024)>x?0:x
Try it online!
Why you don't do on [1024,1024,1024]
?
add a comment |
up vote
0
down vote
JavaScript (Node.js), 33 bytes
a=>!a.map(n=>x-=n/2,x=1024)>x?0:x
Try it online!
Why you don't do on [1024,1024,1024]
?
add a comment |
up vote
0
down vote
up vote
0
down vote
JavaScript (Node.js), 33 bytes
a=>!a.map(n=>x-=n/2,x=1024)>x?0:x
Try it online!
Why you don't do on [1024,1024,1024]
?
JavaScript (Node.js), 33 bytes
a=>!a.map(n=>x-=n/2,x=1024)>x?0:x
Try it online!
Why you don't do on [1024,1024,1024]
?
answered Nov 12 at 13:05
l4m2
4,6081634
4,6081634
add a comment |
add a comment |
up vote
0
down vote
R, 17 bytes
4^5-sum(scan())/2
Try it online!
add a comment |
up vote
0
down vote
R, 17 bytes
4^5-sum(scan())/2
Try it online!
add a comment |
up vote
0
down vote
up vote
0
down vote
R, 17 bytes
4^5-sum(scan())/2
Try it online!
R, 17 bytes
4^5-sum(scan())/2
Try it online!
answered Nov 12 at 14:25
ngm
3,11923
3,11923
add a comment |
add a comment |
up vote
0
down vote
TeaScript, 11 bytes
4p5)-(xx)/2
Try it online!
add a comment |
up vote
0
down vote
TeaScript, 11 bytes
4p5)-(xx)/2
Try it online!
add a comment |
up vote
0
down vote
up vote
0
down vote
TeaScript, 11 bytes
4p5)-(xx)/2
Try it online!
TeaScript, 11 bytes
4p5)-(xx)/2
Try it online!
answered Nov 12 at 18:03
Luis felipe De jesus Munoz
4,03421254
4,03421254
add a comment |
add a comment |
up vote
0
down vote
Stax, 6 bytes
ë3i─♠÷
Run and debug it
add a comment |
up vote
0
down vote
Stax, 6 bytes
ë3i─♠÷
Run and debug it
add a comment |
up vote
0
down vote
up vote
0
down vote
Stax, 6 bytes
ë3i─♠÷
Run and debug it
Stax, 6 bytes
ë3i─♠÷
Run and debug it
answered Nov 12 at 18:34
recursive
5,0041221
5,0041221
add a comment |
add a comment |
up vote
0
down vote
perl -aE, 27 bytes
$"=$:;say eval"(2048-@F)/2"
This reads a line with numbers (whitespace separated) from STDIN
, and writes the answer to STDOUT
.
What it does is subtract all the numbers from the input from 2048, and it divides the remainder by 2. The -a
switch puts the in the array @F
(one number per element). If we interpolate an array into a string (which is what we are doing here), perl puts the value of $"
between the elements. The little used variable $:
is be default n-
; and since white space between tokens is ignored, the result is subtracting all the numbers from 2048. The eval
does the calculation.
add a comment |
up vote
0
down vote
perl -aE, 27 bytes
$"=$:;say eval"(2048-@F)/2"
This reads a line with numbers (whitespace separated) from STDIN
, and writes the answer to STDOUT
.
What it does is subtract all the numbers from the input from 2048, and it divides the remainder by 2. The -a
switch puts the in the array @F
(one number per element). If we interpolate an array into a string (which is what we are doing here), perl puts the value of $"
between the elements. The little used variable $:
is be default n-
; and since white space between tokens is ignored, the result is subtracting all the numbers from 2048. The eval
does the calculation.
add a comment |
up vote
0
down vote
up vote
0
down vote
perl -aE, 27 bytes
$"=$:;say eval"(2048-@F)/2"
This reads a line with numbers (whitespace separated) from STDIN
, and writes the answer to STDOUT
.
What it does is subtract all the numbers from the input from 2048, and it divides the remainder by 2. The -a
switch puts the in the array @F
(one number per element). If we interpolate an array into a string (which is what we are doing here), perl puts the value of $"
between the elements. The little used variable $:
is be default n-
; and since white space between tokens is ignored, the result is subtracting all the numbers from 2048. The eval
does the calculation.
perl -aE, 27 bytes
$"=$:;say eval"(2048-@F)/2"
This reads a line with numbers (whitespace separated) from STDIN
, and writes the answer to STDOUT
.
What it does is subtract all the numbers from the input from 2048, and it divides the remainder by 2. The -a
switch puts the in the array @F
(one number per element). If we interpolate an array into a string (which is what we are doing here), perl puts the value of $"
between the elements. The little used variable $:
is be default n-
; and since white space between tokens is ignored, the result is subtracting all the numbers from 2048. The eval
does the calculation.
answered Nov 12 at 20:57
Abigail
41717
41717
add a comment |
add a comment |
up vote
0
down vote
Perl 6, 12 bytes
1024-*.sum/2
Try it online!
Anonymous Whatever lambda that takes a list and returns a number.
add a comment |
up vote
0
down vote
Perl 6, 12 bytes
1024-*.sum/2
Try it online!
Anonymous Whatever lambda that takes a list and returns a number.
add a comment |
up vote
0
down vote
up vote
0
down vote
Perl 6, 12 bytes
1024-*.sum/2
Try it online!
Anonymous Whatever lambda that takes a list and returns a number.
Perl 6, 12 bytes
1024-*.sum/2
Try it online!
Anonymous Whatever lambda that takes a list and returns a number.
answered Nov 12 at 22:38
Jo King
20.4k246108
20.4k246108
add a comment |
add a comment |
up vote
0
down vote
AWK, 26 bytes
{s+=$1}END{print 1024-s/2}
Input numbers are separated by newlines (i.e. one per line)
add a comment |
up vote
0
down vote
AWK, 26 bytes
{s+=$1}END{print 1024-s/2}
Input numbers are separated by newlines (i.e. one per line)
add a comment |
up vote
0
down vote
up vote
0
down vote
AWK, 26 bytes
{s+=$1}END{print 1024-s/2}
Input numbers are separated by newlines (i.e. one per line)
AWK, 26 bytes
{s+=$1}END{print 1024-s/2}
Input numbers are separated by newlines (i.e. one per line)
answered Nov 13 at 12:53
iBug
1,187729
1,187729
add a comment |
add a comment |
up vote
0
down vote
Neim, 6 bytes
Pretty new to Neim but got it working
𝐬ᚺςᚫᛦ𝕤
Explanation:
𝐬 : Sum input
ᚺ : Divide by 2 (stack now [input summed and divided by 2])
ς : Variable set to 16 pushed to stack
ᚫ : Multiply by 2
ᛦ : Square (stack now [input summed and divided by 2, 1024])
𝕤 : Subtract then absolute
Try it online!
add a comment |
up vote
0
down vote
Neim, 6 bytes
Pretty new to Neim but got it working
𝐬ᚺςᚫᛦ𝕤
Explanation:
𝐬 : Sum input
ᚺ : Divide by 2 (stack now [input summed and divided by 2])
ς : Variable set to 16 pushed to stack
ᚫ : Multiply by 2
ᛦ : Square (stack now [input summed and divided by 2, 1024])
𝕤 : Subtract then absolute
Try it online!
add a comment |
up vote
0
down vote
up vote
0
down vote
Neim, 6 bytes
Pretty new to Neim but got it working
𝐬ᚺςᚫᛦ𝕤
Explanation:
𝐬 : Sum input
ᚺ : Divide by 2 (stack now [input summed and divided by 2])
ς : Variable set to 16 pushed to stack
ᚫ : Multiply by 2
ᛦ : Square (stack now [input summed and divided by 2, 1024])
𝕤 : Subtract then absolute
Try it online!
Neim, 6 bytes
Pretty new to Neim but got it working
𝐬ᚺςᚫᛦ𝕤
Explanation:
𝐬 : Sum input
ᚺ : Divide by 2 (stack now [input summed and divided by 2])
ς : Variable set to 16 pushed to stack
ᚫ : Multiply by 2
ᛦ : Square (stack now [input summed and divided by 2, 1024])
𝕤 : Subtract then absolute
Try it online!
answered Nov 13 at 14:39
LiefdeWen
2,507936
2,507936
add a comment |
add a comment |
up vote
0
down vote
JAVA, 30 bytes
2048-IntStream.of(a).sum()/2;
add a comment |
up vote
0
down vote
JAVA, 30 bytes
2048-IntStream.of(a).sum()/2;
add a comment |
up vote
0
down vote
up vote
0
down vote
JAVA, 30 bytes
2048-IntStream.of(a).sum()/2;
JAVA, 30 bytes
2048-IntStream.of(a).sum()/2;
answered Nov 13 at 15:49
isaace
1714
1714
add a comment |
add a comment |
up vote
0
down vote
RAD, 10 bytes
1024-+/ω÷2
Try it online!
add a comment |
up vote
0
down vote
RAD, 10 bytes
1024-+/ω÷2
Try it online!
add a comment |
up vote
0
down vote
up vote
0
down vote
RAD, 10 bytes
1024-+/ω÷2
Try it online!
RAD, 10 bytes
1024-+/ω÷2
Try it online!
answered Nov 13 at 15:59
Zacharý
5,14511035
5,14511035
add a comment |
add a comment |
up vote
0
down vote
Clojure, 24 bytes
#(- 1024(/(apply + %)2))
Try it online!
add a comment |
up vote
0
down vote
Clojure, 24 bytes
#(- 1024(/(apply + %)2))
Try it online!
add a comment |
up vote
0
down vote
up vote
0
down vote
Clojure, 24 bytes
#(- 1024(/(apply + %)2))
Try it online!
Clojure, 24 bytes
#(- 1024(/(apply + %)2))
Try it online!
answered Nov 24 at 2:33
TheGreatGeek
614
614
add a comment |
add a comment |
up vote
0
down vote
Haskell, 16 bytes
(1024-).(/2).sum
An anonymous function, takes a list and returns a float.
Try it online!
add a comment |
up vote
0
down vote
Haskell, 16 bytes
(1024-).(/2).sum
An anonymous function, takes a list and returns a float.
Try it online!
add a comment |
up vote
0
down vote
up vote
0
down vote
Haskell, 16 bytes
(1024-).(/2).sum
An anonymous function, takes a list and returns a float.
Try it online!
Haskell, 16 bytes
(1024-).(/2).sum
An anonymous function, takes a list and returns a float.
Try it online!
answered Nov 24 at 3:28
LyricLy
2,3931935
2,3931935
add a comment |
add a comment |
up vote
0
down vote
F#, 24 bytes
fun f->1024-List.sum f/2
1024 minus the sum divided by 2.
add a comment |
up vote
0
down vote
F#, 24 bytes
fun f->1024-List.sum f/2
1024 minus the sum divided by 2.
add a comment |
up vote
0
down vote
up vote
0
down vote
F#, 24 bytes
fun f->1024-List.sum f/2
1024 minus the sum divided by 2.
F#, 24 bytes
fun f->1024-List.sum f/2
1024 minus the sum divided by 2.
answered Nov 28 at 5:35
Embodiment of Ignorance
2088
2088
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).
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
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%2f175765%2fcouch-2048-how-much-more-till-2048%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
why
[4,16,64] -> 22
?– l4m2
Nov 12 at 12:43
3
Welcome to PPCG. It looks like this challenge is: add all the elements in the array, subtract from
2048
and divide by2
- if so, you might want to double check the last test case - if not, please use it as an example to explain why the output isn't982
.– Shaggy
Nov 12 at 12:45
1
@Shaggy thx for noticing a silly mistake
– user83982
Nov 12 at 12:47
4
Woah, I haven't thought my first challenge will have 7 answers and 2 upvotes in the first hour! And I reached to ~28 people!
– user83982
Nov 12 at 13:31
2
Hey, downvoter: explain your point of view! It's necessary for the challenge to improve!
– user83982
Nov 13 at 15:41