first commit

Author: wesLaptop

228easy/Makefile

@@ -0,0 +1,2 @@
+order: order.c
+	c99 -Wall -Werror order.c -o order

228easy/order.c

@@ -0,0 +1,66 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+
+int is_ordered(char* word);
+int is_reverse_ordered(char* word);
+char* output_message(char* word);
+
+int main(int argc, char* argv[]) {
+
+    if (argc != 2) {
+        printf("Must provide text file as only command line argument!\n");
+    }
+
+    FILE* infile = fopen(argv[1], "r");
+
+    if (infile) {
+        char line[80];
+        while(fgets(line, 80, infile)) {    
+            // Strip the \n from the end of the word
+            char word[strlen(line) - 1];            
+            for (int i = 0; i < strlen(line) - 1; i++) {
+                word[i] = line[i];
+            }
+            printf("%s %s\n", word, output_message(word));
+        }
+    }
+    return 0;
+}
+
+int is_ordered(char* word) {
+    int low = 'a';
+    for (int i = 0; i < strlen(word); i++) {
+        int c = tolower(word[i]);
+        if (c >= low) {
+            low = c;
+        } else {
+            return 0;
+        }
+    }
+    return 1;
+}
+
+int is_reverse_ordered(char* word) {
+    int high = 'z';
+    for (int i = 0; i < strlen(word); i++) {
+        int c = tolower(word[i]); 
+        if (c <= high) {
+            high = c;
+        } else {
+            return 0;
+        }
+    }
+    return 1;
+}
+
+char* output_message(char* word) {
+    if (is_ordered(word)) {
+        return "IN ORDER";
+    } else if (is_reverse_ordered(word)) {
+        return "REVERSE ORDER";
+    } else {
+        return "NOT IN ORDER";
+    }
+}

228easy/readme.md

@@ -0,0 +1 @@
+[Letters in Alphabetical Order](https://www.reddit.com/r/dailyprogrammer/comments/3h9pde/20150817_challenge_228_easy_letters_in/)

228easy/words.txt

@@ -0,0 +1,12 @@
+billowy
+biopsy
+chinos
+defaced
+chintz
+sponged
+bijoux
+abhors
+fiddle
+begins
+chimps
+wronged

228hard/golomb.py

@@ -0,0 +1,37 @@
+import itertools
+import time
+
+
+def check(mark_combo):
+    diffs = set()
+    for pair in itertools.combinations(mark_combo, 2):
+        diff = abs(pair[0] - pair[1])
+        if diff in diffs:
+            return False
+        diffs.add(diff)
+    return True
+
+
+def find(order):
+    found = False
+    for max_mark in itertools.count(order):
+            marks = range(0, max_mark)
+            for mark_combo in [x for x in itertools.combinations(marks, order)]:
+                if check(mark_combo):
+                    found = True
+                    print(str(order) + '   ' + str(max(mark_combo)) + '   ' +
+                          ' '.join(str(mark) for mark in mark_combo))
+            if found:
+                return
+
+
+def main():
+    for order in [3, 4, 5, 6, 7, 8]:
+        start = time.clock()
+        find(order)
+        elapsed = time.clock() - start
+        print(elapsed)
+
+
+if __name__ == '__main__':
+    main()

228hard/readme.md

@@ -0,0 +1 @@
+[Golomb Rulers](https://www.reddit.com/r/dailyprogrammer/comments/3hsgr0/08212015_challenge_228_hard_golomb_rulers/)

228int/bitcoins.py

@@ -0,0 +1,16 @@
+import requests
+import csv
+import sys
+
+
+def main():
+    market = sys.argv[1]
+    currency = sys.argv[2]
+    r = requests.get('http://api.bitcoincharts.com/v1/trades.csv?symbol=' + market + currency)
+    result = float([row for row in csv.reader(r.text.splitlines())][0][1])
+    print(result)
+    return 0
+
+
+if __name__ == '__main__':
+    main()

228int/readme.md

@@ -0,0 +1 @@
+[Use a Web Service to Find Bitcoin Prices](https://www.reddit.com/r/dailyprogrammer/comments/3hj4o2/20150819_challenge_228_intermediate_use_a_web/)

readme.md

@@ -0,0 +1 @@
+My solutions to [/r/dailyprogrammer](https://www.reddit.com/r/dailyprogrammer/) challenges.