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 string
Search options not deleted
user 26465
A competition to solve a particular problem through the usage and manipulation of strings.
16
votes
Keep the unique characters down
In order to reduce the code needed, I hardcoded the entire string as one binary number (7 bits for each byte). A simple loop extracts the characters and prints them.
Source code on filebin.ca. … "LF" : x}>"
end
data = "lll // pushes string as one large number\n#{bin.join("\n")}\nu"
File.open('prog.h','w') do |fout|
fout << data << "\n"
fout << <<-eos
// output string loop
ulllu // label …
- 1,375
4
votes
Count the number of vowels in each word of a string
Ruby, 38 bytes
$><<$*.map{|x|x.count'AIUEOaiueo'}*' '
Usage:
mad_gaksha@madlab /tmp/ $ ruby t.rb This is the first test case
1 1 1 1 1 2
- 1,375