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
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
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 Search options user 42606

A competition to solve a particular problem through the usage and manipulation of strings.

8
votes
, // if so, xor the bit which represents case *s^=u // for both characters in the string. :0; // end ternary statement … (endif) *s=10; // replace null terminator in first string puts(a[1]); // with newline. This allows both output to } // be printed out all at once edit: replaced && with * …
answered Jul 27 '15 by Vartan
2
votes
REPL/Javascript, 109 Bytes Uses false string to whittle down the original string Abuses substring with larger numbers to grow the second one, stops when its about to print the same word as last …
answered Sep 3 '16 by Vartan
0
votes
Java, 167 bytes public class G{public static void main(String[]e){for(String n:e[0].split(" ")){System.out.print(n.length()<1?"":n.substring(0,1).toUpperCase()+n.substring(1)+" ");}}} Ungolfed … : public class G { public static void main(String[] e) { for (String n: e[0].split(" ")) { System.out.print(n.length() < 1 ? "" : n.substring(0, 1).toUpperCase() + n.substring(1) + " "); } } } …
answered Aug 5 '15 by Vartan