Skip to content

Instantly share code, notes, and snippets.

View alucky0707's full-sized avatar

Hoshinoma Araki alucky0707

View GitHub Profile
@alucky0707
alucky0707 / tak.js
Last active December 17, 2015 09:59
竹内関数のベンチマーク(http://qiita.com/items/b3f9ab63c63e9e6399e6)
/**
* @fileOverview 竹内関数のベンチマーク
* node tak.js name x y z
* と実行してください。
* @author あらっきぃ(twitter:alucky0707)
* @license <a href="http://en.wikipedia.org/wiki/MIT_License">X11/MIT License</a>
*/
var
util = require('util');
while s = gets
break if s.strip == ""
_ = s.match /([0-9X]+)\+([0-9X]+)\=([0-9X]+)/
a = _[1]
b = _[2]
c = _[3]
answer = nil
(0..9).each do|i|
next if i == 0 && (a != 'X' && a[0] == 'X' ||
b != 'X' && b[0] == 'X' ||
function main() {
var
i,
line, words,
dict = {},
len = input.length;
input.forEach(function(line) {
if(line.trim() === '') return;
line = line.split(' ');
if(!dict[line[0]]) {
function main() {
var
i, j, w, h, t, l,
line, cache, map, isLoop,
len = input.length;
for(i = 0; i < len; i++) {
line = input[i].split(' ');
h = parseInt(line[0], 10);
w = parseInt(line[1], 10);
if(w === 0 && h === 0) break;
function main() {
function dfs(n,l,r){
if(n.length === 0) return true;
return (n[0] > l[0] && dfs(n.slice(1), [n[0]].concat(l), r)) ||
(n[0] > r[0] && dfs(n.slice(1), l, [n[0]].concat(r)));
}
var
i,
n = parseInt(input[0], 10),
nums = input.slice(1);
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
/**
* @param args
@alucky0707
alucky0707 / aoj109.js
Created April 28, 2013 00:11
AOJ 109
var
input = '';
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
input += chunk;
});
process.stdin.on('end', function() {
input = input.split('\n');
@alucky0707
alucky0707 / POJ3627.java
Last active December 16, 2015 09:19
POJ 3627 & POJ 3628
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
final int N = scan.nextInt();
@alucky0707
alucky0707 / MinGW-require-options-using-IUP.md
Created April 10, 2013 12:02
MinGWでIUPを使うときに渡すオプション

MinGWでIUPを使うときに渡すオプション

gcc sample.c -o sample -liup - mwindows -lole32 -lcomctl32 -luuid

@alucky0707
alucky0707 / file0.txt
Created April 10, 2013 11:36
JavaScriptでRubyのように配列をスライスする ref: http://qiita.com/items/de269eddf2b359c3f490
var
arr = [0,1,2,3,4,5,6,7,8,9], //元となる配列
sli = toSlicer(arr); //配列を拡張
// 範囲代入と取得
sli["1..3"] = [10,11,12];
console.log(sli["0..2"]); //=>0,10,11
//複数代入と取得
sli["4,6,8"] = [13,14,15];