Seungwon Heo hsw0

## Classifier.html
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>Classfier</title>
</head>
<body>

<style>
#testbed td { margin: 0; padding: 0; width: 15px; height: 15px; }

## Solution.java
import java.util.Stack;

/**
 * A word machine is a system that performs a sequence of simple operations
 * on a stack of integers. Initially the stack is empty. The sequence of
 * operations is given as a string. Operations are separated by single spaces.
 * The following operations may be specified:
 *
 *     - an integer X (between 0 and 2^20 - 1): the machine pushes X onto the stack;
 *     - "POP": the machine removes the topmost number from the stack;

## Solution.java
import java.util.Arrays;

/**
 * A nonempty Zero-indexed array A consisting of N integers is given.
 * This array contains a decimal representation of a number V,
 * i.e. element A[K] contains the K-th least significant digit of the decimal
 * representation of V.
 *
 * For example, array A such that:
 *     A[0] = 3

## Solution.java
/**
 * 아나그램이 되기 위해 필요한 최소한의 글자 수
 *
 * An anagram is a word that can be obtained by rearranging the letters of
 * another word, using all the constituent letters exactly once.
 * For example, words "admirer" and "married" are anagrams of one another.
 * However, the words "rather" and "harder" are not anagrams, since "rather"
 * does not contain the letter "d' and "harder" does not contain
 * the letter 't'. Two identical words are anagrams, too.
 * You may also notice that anagram of any word must be of same length as

## citrixautoextend.js
// ==UserScript==
// @name       Citrix Receiver Session timeout Auto extend
// @namespace  http://hsw.syscall.io/
// @version    0.1
// @description  나는 게으르다
// @match      http*://*/Citrix/DesktopWeb/site/default.aspx*
// @match      http*://*/S-VDI/site/default.aspx*
// @copyright  2014+, Seungwon Heo <hsw@syscall.io>
// ==/UserScript==

## 000-README.md

      
              4 files
            
          
              4 forks
            
          
              0 comments
            
          
              9 stars
            
          
                hsw0
                / 000-README.md
            
            
              Last active
              October 18, 2022 07:56
            
              
                Samba AD + OpenSSH LPK Schema
              
          
    Samba AD + openssh-lpk Schema

Add openssh-lpk Schema [1] to Samba 4 ad dc.
Usage

sed -i -e 's/${DOMAINDN}/DC=your,DC=domain,DC=name/' *.ldif'


## secrets
mandrill USERNAME:APIKEY

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                hsw0
                / keybase.md
            
            
              Created
              March 2, 2014 07:33
            
          
    Keybase proof

I hereby claim:

I am hsw0 on github.
I am localhost (https://keybase.io/localhost) on keybase.
I have a public key whose fingerprint is EE03 E2EF 28A7 19C0 F71E  D8EF D25B F2DD 11A4 0D95

To claim this, I am signing this object:
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<title>Classfier</title>
	</head>
	<body>

	<style>
	#testbed td { margin: 0; padding: 0; width: 15px; height: 15px; }
	import java.util.Stack;

	/**
	* A word machine is a system that performs a sequence of simple operations
	* on a stack of integers. Initially the stack is empty. The sequence of
	* operations is given as a string. Operations are separated by single spaces.
	* The following operations may be specified:
	*
	* - an integer X (between 0 and 2^20 - 1): the machine pushes X onto the stack;
	* - "POP": the machine removes the topmost number from the stack;
	import java.util.Arrays;

	/**
	* A nonempty Zero-indexed array A consisting of N integers is given.
	* This array contains a decimal representation of a number V,
	* i.e. element A[K] contains the K-th least significant digit of the decimal
	* representation of V.
	*
	* For example, array A such that:
	* A[0] = 3
	/**
	* 아나그램이 되기 위해 필요한 최소한의 글자 수
	*
	* An anagram is a word that can be obtained by rearranging the letters of
	* another word, using all the constituent letters exactly once.
	* For example, words "admirer" and "married" are anagrams of one another.
	* However, the words "rather" and "harder" are not anagrams, since "rather"
	* does not contain the letter "d' and "harder" does not contain
	* the letter 't'. Two identical words are anagrams, too.
	* You may also notice that anagram of any word must be of same length as
	// ==UserScript==
	// @name Citrix Receiver Session timeout Auto extend
	// @namespace http://hsw.syscall.io/
	// @version 0.1
	// @description 나는 게으르다
	// @match http:///Citrix/DesktopWeb/site/default.aspx*
	// @match http:///S-VDI/site/default.aspx*
	// @copyright 2014+, Seungwon Heo <hsw@syscall.io>
	// ==/UserScript==