This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?php echo gangmei_get_the_post_thumbnail_url($post->ID, 'large'); ?> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Ruby Prefix expressions problem on codeeval.com | |
File.open(ARGV[0]).each_line do |line| | |
# get operators using a regex | |
operators = line.scan(/[*+\/]/) #return list of operators | |
operators.reverse! | |
# This skips over spaces as well regex here once again |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
using System; | |
using System.Collections.Generic; | |
using System.IO; | |
using System.Linq; | |
class Solution { | |
public static List<int[]> Combinations( List<int> numberList ) | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package primequads; | |
import java.util.ArrayList; | |
import java.util.List; | |
/** | |
* | |
* @author trendsetter37 | |
* | |
* prime quadruplets > 3 Take the form of {p, p+2, p+6, p+8} There should be 7 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
;https://www.hackerrank.com/challenges/halloween-party | |
(defn determine_pieces [number] | |
(if (= (mod number 2) 0) | |
(* (/ number 2) (/ number 2)) | |
(* (quot number 2) (+ (quot number 2) 1)))) ;quot is clojure's version of non-float division | |
(dotimes [i (Integer/parseInt (read-line))] | |
(let [input (Integer/parseInt (read-line))] | |
(println (determine_pieces input)))) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
;; Enter your code here. Read input from STDIN. Print output to STDOUT | |
(defun space-split (string) | |
(loop for start = 0 then (1+ finish) | |
for finish = (position #\Space string :start start) | |
collecting (parse-integer (subseq string start finish)) | |
until (null finish))) | |
(defun min-from-list (list &optional (default 1000)) | |
(reduce #'min list :initial-value default)) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* https://www.codeeval.com/open_challenges/166/ */ | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <string.h> | |
#define MAX 1024 | |
int time_difference(char* time1, char* time2); | |
void seconds_to_time(int seconds); | |
int main(int argc, char** argv) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
; This is to read files into repl for dev work | |
; You would replace println with your function | |
; That you would like to test on each line of | |
; the text file. | |
(defn do-stuff [file] ; file should be a string surrounded by double quotes | |
(with-open [rdr (clojure.java.io/reader file)] | |
(doseq [line (remove empty? (line-seq rdr))] | |
(println line)))) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(defun space-split (string) | |
"works for integers only at this point" | |
(loop for start = 0 then (1+ finish) ;; increments start by the value of finish | |
for finish = (position #\Space string :start start) ;; gives position of the next space begins at start | |
collecting (parse-integer (subseq string start finish)) ;; gathers integers from string list | |
until (null finish))) ;; continue until finish is nil (runs off the end of the string) | |
(defun cut-sticks (sticks) | |
(do ((rest (sort sticks #'<) | |
(remove (car rest) rest))) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import itertools | |
import sys | |
def sort_perm(perm_list): | |
''' This will sort the list of permutations in | |
your into a list of tuples/list''' | |
teh_list = sorted(perm_list) | |
for item in teh_list: | |
if (item == teh_list[len(teh_list) - 1]): |
OlderNewer