Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with code-golf
Search options not deleted
user 105257
Code-golf is a competition to solve a particular problem in the fewest bytes of source code.
4
votes
Ascii smiley face challenge
TI-BASIC, 172 bytes (on-calc) / 205 bytes (as text)
Conveniently, the image is exactly as wide as the screen on the TI-84 Plus CE. This should work with an 83/84(+) too, but it won't display properly …
- 101
2
votes
Split a list at the second occurrence of the first element
TI-BASIC, 69 bytes (on-calc) / 104 bytes (as text)
Ans→A
2→I
While ⌊A(I)≠⌊A(1
I+1→I
End
Disp seq(⌊A(J),J,1,I-1
seq(⌊A(J),J,I,dim(⌊A
Explanation
Ans→A: The program stores a list in ⌊A from Ans by cal …
- 101
1
vote
Sum the array times n, except the last
TI-BASIC, 30 bytes (on-calc) / 37 bytes (as text)
Assumes list variable L₁ contains the array and variable N contains n.
dim(L₁
Nsum(L₁,1,Ans-1)+L₁(Ans
Explanation
dim(L₁: Get the size of L₁, to be …
- 101
3
votes
Index and return 3 characters
TI-BASIC, 135 132 bytes (on-calc) / 145 135 bytes (as text)
-3 bytes thanks to MarcMush!
Input Str1
For(I,1,3
int(.5inString(" AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz",sub(Str1,I,1
Disp A …
- 101