hhc0null

// AOJ0008

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <stack>

int main() {
    int i, j, k, l, n, cnt;

hhc0null

// HELP ME!!!!! WHAT'S WRONG!!!!

#include <iostream>

const unsigned int inf = 1 << 26;
const int MAX_OF_INFOMATIONS = 300;
const int MAX_OF_STATIONS = 100;
const int MAX_OF_ENQUIRIES = 200;

int dijk(int m, int n, int s, int g[2][MAX_OF_STATIONS][MAX_OF_STATIONS], int ary[2][MAX_OF_STATIONS][MAX_OF_STATIONS]) {

hhc0null

#!/usr/bin/env python2

# -*- coding: utf-8 -*-


usage = """revstr.py 0.0.1, a reversing tool for common files.

Basic Usage:
        revstr.py < [filename]
        cat [filename]|./revstr.py

hhc0null

#!/usr/bin/env python2

# -*- coding: utf-8 -*-

import sys

# RSA Decipher for SECCON CTF 4(Yokohama)
# Author: Matsukuma Hiroki a.k.a. hhc0null  <hhc.0.null@gmail.com>
# Usage: ./RSA_Decipher < [Crypted Text]

hhc0null

#!/usr/bin/env python2

# -*- coding: utf-8 -*-

import urllib


url = 'http://94.45.252.233/'
for i in range(100):    # from 0 to 100.
    params = urllib.urlencode({'input': '/(^.{'+str(i+1)+'}$)/'})   # search the length of string.

hhc0null

Length of strings:  1: 0
Length of strings:  2: 0
Length of strings:  3: 0
Length of strings:  4: 0
Length of strings:  5: 1: 29C3_
Length of strings:  6: 0
Length of strings:  7: 0
Length of strings:  8: 0
Length of strings:  9: 1: Key: None
Length of strings: 10: 2

hhc0null

#!/usr/bin/env python2

# -*- coding: utf-8 -*-

import sys

argc = len(sys.argv)
argv = sys.argv

def ShowUsage():

hhc0null

#include <cmath>
#include <iostream>
#include <iomanip>
#include <stack>
#include <list>
#include <vector>

int main(void) {
    std::list<int> input;
    std::vector<int> pnums;

hhc0null

; Calc a distance of a thrown object
(define pi (* 4 (atan 1.0))) ; pi = 4atan(-1)
(define gravaccr 9.8) ; gravitial accelaration

(define CalcDistance
  (lambda (v0 deg) 
    (define DegreeToRadian
      (lambda (degree)
  (/ (* degree pi) 180)))
    (define CalcDistanceX

hhc0null

; put tribonacci numbers out with the tail recursion algorithm

(define (tribonacci n)
  (tribo-tail n 0 0 1))

(define (tribo-tail n a b c)
  (cond
    ((= n 0) or (= n 1) 0)
    ((= n 2) c)
    (else