Quote from: DJ Omnimaga on August 05, 2014, 11:43:48 am

Quote from: Matrefeytontias on July 31, 2014, 07:18:47 pm

Excepting Full, there's nothing Axe provides that doesn't work on 83+s.

Even with Full, the program would still run fine on the 83+. It would just run over twice slower.

Anyway I hope that isn't cancelled or anything, as it would be nice to see an Axe remake. If the Axe remake comes to fruition, will it feature the full game including map exploration or will it just be a battle arena like when Persona 4 was ported from the PS2/Vita to the PS3?

I'm not really in charge of this anymore, JWins is if he chooses so (so it's not cancelled). I don't see why it won't include map exploration, since I don't see why JWins (if he chooses to run the development) would throw out the existing map exploration code.

Well, actually, I would be CREATING the code. But it shouldn't be too hard.

I'll try to make it as much like the original as possible, to start it out.

Already, every entry has beaten my TI-BASIC entry...the last contest, that didn't happen until SysRPL...

But yeah, interesting solutions so far!

You know the drill.

NEXT: Here
PREVIOUS: Here

Challenge 4
To clear anything up, a tie will result in the earlier solution becoming the winner in the category.

Problem
For a given string input consisting of only uppercase letters and numbers, add the ASCII value of each alphabetical character (that's 65-90 for uppercase A-Z) and subtract every number. Display the result, but printed vertically with each digit on a new line.

You CAN end up with a negative number, in which case the first line should have a - sign.

Deadline
August 11, 2014, 1:00 AM EST

Sample input 1
A45FTUX
Sample output 1
3
8
3
Sample input 2
99A874512995
Sample output 2
-
3
Sample input 3
CODEGOLF
Sample output 3
5
7
9

If any further clarification is necessary, contact me or willrandship. We will try to keep your heads from exploding.

TI-83+ BASIC

Rank	User	Size	Date	Code
1	Runer112	139	8/7/2014 11:54:17 PM	Spoiler For Spoiler: Ans->Str1 DelVar BFor(A,1,length(Str1 inString("876543210ABCDEFGHIJKLMNOPQRSTUVWXYZ",sub(Str1,A,1 B+Ans-9+64(Ans>9->B End "      If B<0 Disp Ans+Ans+Ans+"~ For(A,int(~log(abs(B)+not(B)+.1)),~1 Disp iPart(10fPart(abs(B10^(A End
2	JWinslow23	141	8/4/2014 4:34:15 PM	Spoiler For Spoiler: DelVar CInput Str1 For(X,1,length(Str1 64+inString("ABCDEFGHIJKLMNOPQRSTUVWXYZ",sub(Str1,X,1 If Ans=64 ~expr(sub(Str1,X,1 C+Ans->C End "      If C<0 Pause Ans+Ans+Ans+"~ For(X,~int(log(abs(C))),0 Pause int(abs(C10^(X abs(C)-Ans10^(~X->C End

Ruby2

Rank	User	Size	Date	Code
1	Juju	98	8/4/2014 8:02:43 PM	Spoiler For Spoiler: a=0;gets.chomp.each_char{|b|c=('0'..'9')===b&&1||-1;a-=c*b.ord-(24*c+24)};a.to_s.each_char{|b|p b}

Haskell

Rank	User	Size	Date	Code
1	bb010g	68	8/8/2014 12:54:03 PM	Spoiler For Spoiler: mapM(putStrLn.(:[])).show.sum.map((\x->x+(48-2*x)*div 57x).fromEnum)
2	3298	70	8/7/2014 6:55:04 AM	Spoiler For Spoiler: g s=mapM(putStrLn.(:[]))$show$sum$map(n.fromEnum)s n c|c<58=48-c|c>0=c

SysRPL

Rank	User	Size	Date	Code
1	3298	63.5	8/7/2014 9:07:43 AM	Spoiler For Spoiler: ::   %0 OVERLEN$ #1+_ONE_DO     OVERINDEX@ SUB$1#     BINT58 OVER#> IT     :: UNCOERCE %- BINT48 ;     UNCOERCE %+   LOOP   xR>I DO>STR ONE MINUSONE   FPTR2 ^StrCutNchr2_ DROPSWAPDROP ;

Java

Rank	User	Size	Date	Code
1	Runer112	137 (requires Java 8 )	8/10/2014 12:43:30 PM	Spoiler For Spoiler: class D{public static void main(String[]a){System.out.print(Long.toString(a[0].chars().map(c->c<65?48-c:c).sum()).replaceAll("","\n"));}}
2	3298	156	8/9/2014 5:14:28 AM	Spoiler For Spoiler: class G{public static void main(String[]c){Long n=0L;for(int p:c[0].getBytes())n+=p<58?48-p:p;for(char p:n.toString().toCharArray())System.out.println(p);}}

XTend

Rank	User	Size	Date	Code
1	3298	125	8/9/2014 5:14:28 AM	Spoiler For Spoiler: class G{def static main(String[]c){for(p:c.head.getBytes.fold(0)[n,p|n+if(p<58)48-p else p].toString.toCharArray)println(p)}}

Perl

Rank	User	Size	Date	Code
1	willrandship	68	8/5/2014 7:50:40 PM	Spoiler For Spoiler: for(split//,<>){$b+=ord($_)>64?ord($_):-$_;}$b=~s/(.)/$1\n/g;print$b

NSpire Lua

Rank	User	Size	Date	Code
1	LDStudios	105	8/10/2014 1:27:16 PM	Spoiler For Spoiler: n=0 function on.charIn(c)n=tonumber(c)and n-c or n+c:byte()s=""..n for i=0,#s do print(s:sub(i,i))end end
2	Adriweb	107 (function body)	8/10/2014 5:48:57 PM	Spoiler For Spoiler: function codegolf4(s)     n=0;for i=1,#s do t=s:sub(i,i):byte()n=n-(t<58 and t-48 or-t)end;z=""..n;for i=1,#z do print(z:sub(i,i))endend
3	Jens_K	115	8/9/2014 5:46:04 PM	Spoiler For Spoiler: n=0 for c in clipboard.getText():gmatch"."do n=n+(tonumber(c)and -c or c:byte())..""end print((n:gsub(".","%1\n")))

Golfscript

Rank	User	Size	Date	Code
1	Runer112	22	8/7/2014 11:54:17 PM	Spoiler For Spoiler: 0\{.65<\[.48\-]=+}/`n*

CJam

Rank	User	Size	Date	Code
1	Runer112	22	8/7/2014 11:54:17 PM	Spoiler For Spoiler: 0q{i_'A<{48\}0?-+}/`N*

TI-83+ z80

Rank	User	Size	Date	Code
1	Runer112	59	8/7/2014 11:54:17 PM	Spoiler For Spoiler: ;#SECTION "MAIN", CODE    org   userMem - 2    db   0BBh, 6Dh Start:    B_CALL   _RclAns    rst   rFINDSYM    B_CALL   _OP1Set0    ex   de, hl    ld   c, (hl)    inc   hl    ld   b, (hl)    add   hl, bc SumLoop:    push   hl    cp   10    jq   nc, Letter    B_CALL   _SetXXOP2    B_CALL   _FPSub    jq   Continue Letter:    add   a, '0'    B_CALL   _SetXXOP2    rst   rFPADD Continue:    pop   hl    ld   a, (hl)    dec   hl    sub   '0'    jq   nc, SumLoop    B_CALL   _FormEReal    ld   l, OP3 & 0FFh DispLoop:    ld   a, (hl)    or   a    ret   z    inc   hl    push   hl    B_CALL   _PutC    B_CALL   _NewLine    pop   hl    jq   DispLoop

C

Rank	User	Size	Date	Code
1	3298	154	8/9/2014 5:14:18 AM	Spoiler For Spoiler: #include <stdio.h> main(int x,char**c){char s[12],*p=c[1];int n=0;for(;*p>0;++p){n+=*p<58?48-*p:*p;}sprintf(s,"%i",n);for(p=s;*p>0;++p)printf("%c\n",*p);}

Language Ranking

Rank	Lang	User	Size	Date
1	CJam	Runer112	22	8/7/2014 11:54:17 PM
2	Golfscript	Runer112	22	8/7/2014 11:54:17 PM
3	TI-83+ z80	Runer112	59	8/7/2014 11:54:17 PM
4	SysRPL	3298	63.5	8/7/2014 9:07:43 AM
5	Perl	willrandship	68	8/5/2014 7:50:40 PM
6	Haskell	bb010g	68	8/8/2014 12:54:03 PM
7	Ruby2	Juju	98	8/4/2014 8:02:43 PM
8	NSpire Lua	LDStudios	105	8/10/2014 1:27:16 PM
9	XTend	3298	125	8/9/2014 5:14:28 AM
10	Java	Runer112	137 (requires Java 8 )	8/10/2014 12:43:30 PM
11	TI-83+ BASIC	Runer112	139	8/7/2014 11:54:17 PM
12	C	3298	154	8/9/2014 5:14:18 AM

Bump.

Last day for submissions! Be swift with any works in progress!

Wow, this looks REALLY good! I don't have an Nspire, but now I kinda wish I did.

You have earned one more internet...

Nice challenge! I might use it. I already have a 140 byte solution in TI-BASIC, assuming ENTER must be pressed after each digit, and the numbers and negative sign are aligned to the right.

So, I have a couple of questions.

Can we assume the input is at least 2? Otherwise, largest prime factor doesn't actually exist.
Also, can my output have a trailing space? That makes things easier in TI-BASIC because of silly string limitations.

If yes to both of these, then I have a 67-byte TI-BASIC solution.

I actually don't know the rules on valid input. My 90 byte solution assumes input is any integer. Ask willrandship for confirmation, I don't know.