Rhomboid

#include <stdio.h>
#include <string.h>

int main(void)
{
    char t[] = "abcdefghijklmnopqrstuvwxyz";
    for (int i = 0, n = strlen(t); i < n; i++)
    {
        if (t[i] >= 'a' && t[i] <= 'z')
        {

Rhomboid

#include <iostream>
#include <sstream>
#include <vector>
#include <chrono>
#include <random>
#include <algorithm>
using namespace std;
using namespace std::chrono;

int main()

Rhomboid

# http://projecteuler.net/problem=7  (should print 104743)
from operator import itemgetter
from timeit import repeat

def ver1(n):
    '''Original, baseline version that uses a dict'''
    eratosthenes = dict.fromkeys(range(2, n), True)

    for i in range(2, n):
        if eratosthenes[i]:

Rhomboid

http://databases.lovd.nl/shared/genes/A1BG
http://proteomics.bio21.unimelb.edu.au/lovd/genes/A1BG
http://databases.lovd.nl/shared/genes/A1BG-AS1
http://proteomics.bio21.unimelb.edu.au/lovd/genes/A1BG-AS1
http://databases.lovd.nl/shared/genes/A1CF
http://proteomics.bio21.unimelb.edu.au/lovd/genes/A1CF
http://databases.lovd.nl/shared/genes/A2LD1
http://databases.lovd.nl/shared/genes/A2M
http://proteomics.bio21.unimelb.edu.au/lovd/genes/A2M
http://databases.lovd.nl/shared/genes/A2M-AS1

Rhomboid

#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <string>
#include <limits>
#include <iterator>
#include <algorithm>
#include <utility>
using namespace std;

Rhomboid

#include <stdio.h>
#include <stdbool.h>

struct node {
    void *val;
    struct node *left, *right;
};

void in_order_traverse(const struct node *n, void (*callback)(const void *), size_t depth)
{

Rhomboid

from itertools import groupby

state_capitals = ['Montgomery', 'Juneau', 'Phoenix', 'Little Rock', 'Sacramento', 'Denver',
                  'Hartford', 'Dover', 'Tallahassee', 'Atlanta', 'Honolulu', 'Boise', 'Springfield',
                  'Indianapolis', 'Des Moines', 'Topeka', 'Frankfort', 'Baton Rouge', 'Augusta',
                  'Annapolis', 'Boston', 'Lansing', 'Saint Paul', 'Jackson', 'Jefferson City',
                  'Helena', 'Lincoln', 'Carson City', 'Concord', 'Trenton', 'Santa Fe', 'Albany',
                  'Raleigh', 'Bismarck', 'Columbus', 'Oklahoma City', 'Salem', 'Harrisburg',
                  'Providence', 'Columbia', 'Pierre', 'Nashville', 'Austin', 'Salt Lake City',
                  'Montpelier', 'Richmond', 'Olympia', 'Charleston', 'Madison', 'Cheyenne']

Rhomboid

/* http://codegolf.stackexchange.com/questions/16226/trolling-homework-questions-sorting */
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <sys/wait.h>

void read_some_doubles(double **data, size_t *size)
{
    char buf[512], *endptr;

Rhomboid

Atl+1           Switch to Standard mode
Alt+2           Switch to Scientific mode
Alt+3           Switch to Programmer mode
Alt+4           Switch to Statistics mode
Ctrl+E          Open date calculations
Ctrl+H          Turn calculation history on or off
Ctrl+U          Open unit conversion
Alt+C           Calculate or solve date calculations and worksheets
F1              Open Calculator Help
Ctrl+Q          Press the M- button

Rhomboid

#include <stdio.h>

main(t,_,a)
char *a;
{return!0<t?t<3?main(-79,-13,a+main(-87,1-_,
main(-86, 0, a+1 )+a)):1,t<_?main(t+1, _, a ):3,main ( -94, -27+t, a
)&&t == 2 ?_<13 ?main ( 2, _+1, "%s %d %d\n" ):9:16:t<0?t<-72?main(_,
t,"@n'+,#'/*{}w+/w#cdnr/+,{}r/*de}+,/*{*+,/w{%+,/w#q#n+,/#{l,+,/n{n+\
,/+#n+,/#;#q#n+,/+k#;*+,/'r :'d*'3,}{w+K w'K:'+}e#';dq#'l q#'+d'K#!/\
+k#;q#'r}eKK#}w'r}eKK{nl]'/#;#q#n'){)#}w'){){nl]'/+#n';d}rw' i;# ){n\