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
require 'trello' | |
require 'json' | |
require 'base64' | |
require 'open-uri' | |
Trello.configure do |config| | |
config.developer_public_key = 'KEY' | |
config.member_token = 'TOKEN' | |
end |
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 Gaim plugin reverses/1337s text before sending it. | |
*/ | |
#include <glib.h> | |
#include "internal.h" | |
#include "debug.h" | |
#include "conversation.h" | |
#include "notify.h" | |
#include "signals.h" |
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
/* | |
* Monty Hall problem. | |
* http://en.wikipedia.org/wiki/Monty_Hall_problem | |
*/ | |
#include <stdio.h> | |
#ifdef DEBUG | |
#define verbose printf | |
#else |
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
public class HelloWorld {public static void main(String[] args){ | |
int[][] t = new int[][]{{202,1026,1100,396,324,1080,192,609,555,888,72,432}, | |
{3,9,8,5},{2,2,5,9},{4,6,1,9,2,11},{4,6,1,9,3,2,11,7,0,5,10},{2,1,5,9},{1,9,2,5},{0,2,10,5,1,6,3,11,8,4},{10,4,2,6}, | |
{1,10,2,3,5,9,7,4,11,6},{7,0,3,6},{2,9,10,1},{7,1,10,6},{12,0,-0}};do{while(t[13][1]+1<t[t[13][0]].length){ | |
t[13][2]=t[0][t[t[13][0]][t[13][1]]];t[0][t[t[13][0]][t[13][1]]]=t[0][t[t[13][0]][++t[13][1]]];t[0][t[t[13][0]][t[13][1]++]]=t[13][2];} | |
}while(!(--t[13][0]<=(int)Math.sin(Math.PI))&&((t[13][1]=0)<1)); | |
while(t[4][2]<=t[9][5]+3)System.out.print((char)(t[0][t[4][2]-1]/t[4][2]++));}} |