Output a string's cumulative slope

Question

Challenge

Given a string such as Hello World!, break it down into its character values: 72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33.

Then calculate the difference between each consecutive pair of characters: 29, 7, 0, 3, -79, 55, 24, 3, -6, -8, -67.

Finally, sum them and print the final result: -39.

Rules

Standard loopholes apply
No using pre-made functions that perform this exact task
Creative solutions encouraged
Have fun
This is marked as code-golf, the shortest answer in bytes wins but will not be selected.

Dennis's observation shows that this task is phrased in a more complicated way than necessary. — Greg Martin
– Greg Martin, Commented Sep 26, 2016 at 2:47
Can a language accept input as a character array even if it supports string types? — Poke
– Poke, Commented Sep 26, 2016 at 15:13
@GregMartin I actually did not realize that until later. The challenge should stay this way though. — anna328p
– anna328p, Commented Sep 27, 2016 at 20:19
@DJMcMayhem Good to know, all other forms of output are hereby allowed. — anna328p
– anna328p, Commented Sep 27, 2016 at 20:58

The Thonnu · Accepted Answer · 2023-03-05 17:30:00Z

1

+100

APL (Dyalog Extended), 9 bytes

⊢/-⍥⎕UCS⊃

Try it online!

-13 thanks to @Adám

Explanation

 ⎕UCS Codepoints of input ⊃ Last item -⍥ Minus ⊢/ First item

Old:

{ } Define a function (⍴⍵) Length of argument ⎕UCS⍵ Codepoints of input ( ⌷ ) Index in (1-indexed) i.e. get the last item - Minus 1⌷ First item of ⎕UCS⍵ Codepoints of input

edited Mar 5, 2023 at 17:30

answered Mar 2, 2023 at 14:11

The Thonnu

18.7k3 gold badges19 silver badges76 bronze badges

\$\begingroup\$ Doesn't ⊢/-⍥⎕UCS⊃ do the trick? \$\endgroup\$

Adám
– Adám

2023-03-04 19:12:24 +00:00
Commented Mar 4, 2023 at 19:12
\$\begingroup\$ No you give it a name and call it as a function with the string as argument. This is a template I use to exclude the assignment from the byte count. \$\endgroup\$

Adám
– Adám

2023-03-04 23:18:14 +00:00
Commented Mar 4, 2023 at 23:18
\$\begingroup\$ @Adám thanks. I'm still a bit new to APL. \$\endgroup\$

The Thonnu
– The Thonnu

2023-03-05 07:09:04 +00:00
Commented Mar 5, 2023 at 7:09
\$\begingroup\$ @Adám I've looked through APL wiki and I'm still a bit unsure on how that's working. I've added an attempt at an explanation but it probably contains a lot of mistakes. Can you point out any corrections? \$\endgroup\$

The Thonnu
– The Thonnu

2023-03-05 14:03:32 +00:00
Commented Mar 5, 2023 at 14:03
\$\begingroup\$ It is a fork: ⊢/(-⍥⎕UCS )⊃ subtracting - the first ⊃ from the last ⊢/ but preprocessing ⍥ both arguments to - using ⎕UCS. \$\endgroup\$

Adám
– Adám

2023-03-05 16:55:42 +00:00
Commented Mar 5, 2023 at 16:55

| Show 2 more comments

south · Accepted Answer · 2023-03-06 00:05:39Z

J, 12 bytes

1#.2-~/\3&u:

Attempt This Online!

1#.2-~/\3&u: 3&u: NB. convert to codepoints 2 \ NB. for each consecutive pair -~/ NB. minus reduce the first from the second 1#. NB. sum reduce

Alternative 12 bytes

3({:-{.)@u:]

Attempt This Online!

3({:-{.)@u:] 3 u:] NB. convert input to codepoints @ NB. then ({:-{.) NB. monadic fork {. NB. head {: NB. tail - NB. subtract

Bbrk24 · Accepted Answer · 2023-03-22 01:16:51Z

Trilangle, 19 bytes

i2|<_!..>iL.,<@-\S/

Try it in the online interpreter!

Unfolds to this:

 i 2 | < _ ! . . > i L . , < @ - \ S / . .

Roughly equivalent to this C code:

#include <stdio.h> int main() { // RED PATH int a, b; a = b = getchar(); while (1) { int c = getchar(); if (c == EOF) { // BLUE PATH printf("%d\n", b - a); return 0; } else { // GREEN PATH b = c; } } }

The Thonnu · Accepted Answer · 2023-07-05 19:08:36Z

Thunno 2 `SB`, 1 byte

Ṣ

Try it online!

Explanation

 # Implicit input # Convert to ordinals Ṣ # Take the deltas # Sum the list # Implicit output

Sean · Accepted Answer · 2023-07-05 19:44:08Z

Raku, 18 bytes

{[-] .ords[*-1,0]}

Try it online!

.ords returns a list of the ordinal values of the characters in the input string, [* - 1, 0] slices into it to return the last and first values, and [-] reduces that two-element list using subtraction.

joeytwiddle · Accepted Answer · 2016-09-26 06:22:34Z

0

Haskell, 61 bytes

import Data.Char f s=sum$g$ord<$>s g(a:b:r)=b-a:g(b:r) g _=[]

answered Sep 26, 2016 at 6:22

joeytwiddle

6413 silver badges9 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

Java 7, 100 96 bytes

int c(String s){char[]a=s.toCharArray();int r=0,i=a.length-1;for(;i>0;r+=a[i]-a[--i]);return r;}

Ungolfed & test code:

Try it here.

class M{ static int c(String s){ char[] a = s.toCharArray(); int r = 0, i = a.length-1; for(; i > 0; r += a[i] - a[--i]); return r; } public static void main(String[] a){ System.out.println(c("Hello World!")); } }

Output: -39

Michael M · Accepted Answer · 2016-09-26 11:27:58Z

Clojure, 31 bytes

#(-(int(last %))(int(first %)))

Someone reduced the task already to a single operation.

Jörg Hülsermann · Accepted Answer · 2016-09-26 18:05:35Z

0

PHP, 39 Bytes

<?=ord(substr($s=$argv[1],-1))-ord($s);

edited Sep 26, 2016 at 18:05

answered Sep 26, 2016 at 8:13

Jörg Hülsermann

13.4k3 gold badges16 silver badges36 bronze badges

Add a comment |

Julien Kluge · Accepted Answer · 2016-09-26 18:23:14Z

0

Mathematica, 30 bytes

Tr@Differences@ToCharacterCode

answered Sep 26, 2016 at 18:23

Julien Kluge

2932 silver badges7 bronze badges

Add a comment |

ninjalj · Accepted Answer · 2016-09-26 20:22:31Z

Befunge-93, 16 bytes

~:v_$-.@ ~\<^`0:

Befunge-98, 14 bytes

~v >-.@ \>#^~

Reads (~) the first character, and then loops reading (~) a character and swaping (\) the top 2 items in the stack (so the first character keeps being raised to the top of the stack) until EOF, then substracts (-) the top 2 items, outputs (.) the result and ends (@).

score 0 · Accepted Answer · 2016-09-26 23:53:54Z

0

C, 69 bytes

main(i,e,z){while(EOF!=(i =getc(stdin))){z+=e-i;e=i;}putc(z,stdout);}

edited Sep 26, 2016 at 23:53

answered Sep 26, 2016 at 23:42

user60119

\$\begingroup\$ Useless whitespace at i =getc. \$\endgroup\$

Yytsi
– Yytsi

2016-09-28 13:41:22 +00:00
Commented Sep 28, 2016 at 13:41

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

Pyth (fork), 5 bytes

s.+CM

Does not work on the online interpreter, as current online interpreters are based only on the main repo.

Explanation:

 CM Map ordinals over input .+ Deltas, calculates differences between consecutive numbers s Sums the result

Community · Accepted Answer · 2020-06-17 09:04:33Z

Haskell, 27 bytes

\x->(ord.last)x-(ord.head)x

Unfortunately, Haskell has no knowledge of character codes until you import Data.Char. Fortunately, Haskell already treats strings as character arrays.

\x-> --Syntax for anonymous function of 'x' (ord --Character code of... .last) --last element in the array x --Apply to argument - (ord --Character code of... .head) --first element in the array x --Apply to argument

\$\begingroup\$ Don't you have to import ord? \$\endgroup\$

Jo King
– Jo King

2019-08-20 01:05:23 +00:00
Commented Aug 20, 2019 at 1:05 — Jo King
– Jo King, Commented Aug 20, 2019 at 1:05

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

Pyke, 5 bytes

m.o$s

Try it here!

m.o - map(ord, input) $ - delta(^) s - sum(^)

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Sep 27, 2016 at 7:58

Blue

28.8k8 gold badges53 silver badges101 bronze badges

Add a comment |

rnso · Accepted Answer · 2016-09-28 13:35:13Z

Racket 121 bytes

(λ(s)(let((l(map char->integer(string->list s))))(for/sum((i(range 1(length l))))(-(list-ref l i)(list-ref l(- i 1))))))

Ungolfed version

(define f (λ(s) (let ((l (map char->integer (string->list s)))) (for/sum ((i (range 1 (length l)))) (- (list-ref l i) (list-ref l (- i 1)))))))

Testing

(f "Hello World!") -39

Magic Octopus Urn · Accepted Answer · 2016-09-30 17:29:32Z

0

Groovy (80 Bytes)

f={n->s=[];n.eachWithIndex{x,i->s<<(i+1<n.size()?(int)n[i+1]-(int)x:0)};s.sum()}

answered Sep 30, 2016 at 17:29

Magic Octopus Urn

20.9k6 gold badges66 silver badges140 bronze badges

Add a comment |

Kamila Szewczyk · Accepted Answer · 2019-08-18 10:40:44Z

0

brainfuck, 31 bytes

Probably easy to outgolf, any ideas about this code will be appreciated.

>+[>,>,[-<->]<]<<[>[-<+>]<<]>-.

Try it online!

answered Aug 18, 2019 at 10:40

Kamila Szewczyk

12.8k1 gold badge35 silver badges61 bronze badges

\$\begingroup\$ How does this print negative numbers? Also, I don't think this works? \$\endgroup\$

Jo King
– Jo King

2019-08-20 00:31:02 +00:00
Commented Aug 20, 2019 at 0:31

Add a comment |

canttalkjustcode · Accepted Answer · 2019-08-20 00:15:10Z

C# .NET, 156 bytes

public class P{public static void Main(string[]a){int q=0;for(int i=0;i<a[0].Length;i++){q+=i!=a[0].Length-1?a[0][i+1]-a[0][i]:0;}System.Console.Write(q);}}

Try online

emanresu A · Accepted Answer · 2021-09-02 04:32:12Z

0

Jelly, 3 bytes

OIS

Try it online!

A monadic link, I think.

Charcodes, deltas, sum.

answered Sep 2, 2021 at 4:32

emanresu A

46.2k5 gold badges112 silver badges257 bronze badges

Add a comment |

chunes · Accepted Answer · 2021-09-02 04:34:30Z

0

Factor, 25 bytes

[ dup last swap first - ]

Try it online!

answered Sep 2, 2021 at 4:34

chunes

27.8k3 gold badges32 silver badges55 bronze badges

Add a comment |

evanstar3 · Accepted Answer · 2023-03-02 16:53:46Z

C (gcc), 64 bytes

Takes input from command line: ./a.out "<input>"

main(c,v)char**v;{for(v++;1[*v];)c-=**v-*++*v;printf("%d",c-2);}

Try it online!

EzioMercer · Accepted Answer · 2023-03-06 09:45:01Z

JavaScript, 36 bytes

s=>s.at(-1)[x='charCodeAt']()-s[x]()

Try it:

f=s=>s.at(-1)[x='charCodeAt']()-s[x]() input.addEventListener('input', e => result.innerHTML = f(input.value)) result.innerHTML = f(input.value)

<input id="input" value="Hello world!"/> <div id="result"></div>

Stack Exchange Network

Output a string's cumulative slope

Challenge

Rules

53 Answers 53

APL (Dyalog Extended), 9 bytes

Explanation

J, 12 bytes

Alternative 12 bytes

Trilangle, 19 bytes

Thunno 2 `SB`, 1 byte

Explanation

Raku, 18 bytes

Haskell, 61 bytes

Java 7, 100 96 bytes

Clojure, 31 bytes

PHP, 39 Bytes

Mathematica, 30 bytes

Befunge-93, 16 bytes

Befunge-98, 14 bytes

C, 69 bytes

Pyth (fork), 5 bytes

Haskell, 27 bytes

Pyke, 5 bytes

Racket 121 bytes

Groovy (80 Bytes)

brainfuck, 31 bytes

C# .NET, 156 bytes

Jelly, 3 bytes

Factor, 25 bytes

C (gcc), 64 bytes

JavaScript, 36 bytes

Linked

Hot Network Questions

Output a string's cumulative slope

Challenge

Rules

53 Answers 53

APL (Dyalog Extended), 9 bytes

Explanation

J, 12 bytes

Alternative 12 bytes

Trilangle, 19 bytes

Thunno 2 SB, 1 byte

Explanation

Raku, 18 bytes

Haskell, 61 bytes

Java 7, 100 96 bytes

Clojure, 31 bytes

PHP, 39 Bytes

Mathematica, 30 bytes

Befunge-93, 16 bytes

Befunge-98, 14 bytes

C, 69 bytes

Pyth (fork), 5 bytes

Haskell, 27 bytes

Pyke, 5 bytes

Racket 121 bytes

Groovy (80 Bytes)

brainfuck, 31 bytes

C# .NET, 156 bytes

Jelly, 3 bytes

Factor, 25 bytes

C (gcc), 64 bytes

JavaScript, 36 bytes

Linked

Related

Hot Network Questions

Thunno 2 `SB`, 1 byte