yuki2006 yuki2006

## gist:4104351
# ビッグエンディアン，bomなしutf-8
11100011100000101011001111100011100000111001111111100011100000111010010111100011100000111000101111100011100000101011000111100011100000111011110011100011100000101011011111100011100000111010011111100011100000111011001111100101100010101001101111100100101110001000110111101000101101101011001111100011100000011010011111100011100000011000001011100011100000101000111111100011100000101000010011100101101001001010011111100110100000111010100011100100101110101000101111101111101111001000110011100011100000101011011111100011100000111011001111100011100000101011100011100011100000011001010111100011100000101001001111100011100000011000110011100011100000101011011111100011100000111011001111100011100000101011100011100011100000011000111111100011100000101001001111100011100000011010101111101001100110011000110111100110101000001011110011101111101111001000110011100101101111001000111111100110101100111010001011100011100000011001010111100011100000101001001100101000001100100011100000101001

## index.html
<!DOCTYPE html>
<html>
<head>
  <meta charset="UTF-8">

  <!-- JavaScript plugins (requires jQuery) -->
    <script src="//ajax.googleapis.com/ajax/libs/jquery/1.10.2/jquery.min.js"></script>
    <script type="text/javascript" src="script.js"></script>

</head>

## gist:6339434
#include<stdio.h>
int main(){
  char a=123;
	const char* c=&a;
	int d;
	sscanf(c,"%d",&d);
	//出力用
	printf("%d",d);
}

## gist:6741868
  public void hoge(){
    int N = 10;//順列を求めるサイズ
    int[] hit = new int[N];
		int[] list = new int[N];
		for (int i = 0; i < list.length; i++) {
			list[i] = i + 1;
		}
		permutaion(hit, list, N);
  }
  //　順列を求める再起関数

## gist:6765365
if (args.length==1){
  Builder builder;
  if (args[0].equals("plain"))
  {
    builder=new TextBuilder();
  }else{
    builder=new HTMLBuilder();
  }
  Director director=new Director(builder);
  director.construct();

## yukicoder8.txt
100
114568 4712
45494 678
77079 65438
70552 10407
73197 89347
43353 54207
80003 4705
53291 364
8017 28735

## yukicoder9.txt
1500
3916 6251 7875 5989 4292 4667 9037 7289 9724 7714 623 8718 257 8458 2353 1060 5381 5479 2774 1120 8654 429 6566 3773 5768 1532 7849 1293 6101 4729 4975 8896 7717 874 9245 3695 5488 3469 1507 5430 2256 8501 40 172 9132 7603 3286 5216 6463 9901 8259 7537 8920 7709 7860 9546 8026 9353 7446 4249 1347 858 5223 2155 1689 1835 5454 3878 912 5472 1531 9457 9001 3552 2825 5764 3493 8033 4288 2584 6647 6127 7399 9194 3735 4872 3895 113 9634 6039 9627 5929 4191 2554 6180 540 6060 1827 56 3453 9911 5192 2522 7760 2858 263 6869 7817 7085 5225 705 9679 3311 401 9 1213 6335 7698 7587 2885 4340 5258 7246 689 5453 6639 1370 9944 4931 5701 2209 1417 2650 7817 9236 1206 1142 4956 9184 9152 2539 5967 1999 4139 3500 6312 4298 8398 4293 6063 460 5322 9556 5079 8210 1956 754 1468 4591 6577 944 4549 9980 2701 2812 3702 9996 7272 531 5510 6110 8589 528 9895 1500 9983 7027 7639 4416 2275 7693 1426 7990 5621 6455 9890 1980 7608 3890 3748 6869 6429 7689 4472 398 1902 354 8837 2376 5384 8708 1478 1812 3603 6339 7925 2380 3136 9030 4

## yukicoder10.txt
50
100000
4 6 1 8 10 2 6 4 8 9 10 8 2 1 9 5 9 1 4 1 1 6 1 9 10 9 2 7 3 8 1 4 2 7 6 10 8 7 5 5 4 2 10 8 4 8 9 5 5 9

## yukicoder11.txt
1000000
1000000
100
951371 687892
763520 79651
139331 273467
298132 432173
92127 81816
719371 666421
543011 291692

## sample5
100 100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="UTF-8">

	<!-- JavaScript plugins (requires jQuery) -->
	<script src="//ajax.googleapis.com/ajax/libs/jquery/1.10.2/jquery.min.js"></script>
	<script type="text/javascript" src="script.js"></script>

	</head>
	#include<stdio.h>
	int main(){
	char a=123;
	const char* c=&a;
	int d;
	sscanf(c,"%d",&d);
	//出力用
	printf("%d",d);
	}
	public void hoge(){
	int N = 10;//順列を求めるサイズ
	int[] hit = new int[N];
	int[] list = new int[N];
	for (int i = 0; i < list.length; i++) {
	list[i] = i + 1;
	}
	permutaion(hit, list, N);
	}
	//　順列を求める再起関数
	if (args.length==1){
	Builder builder;
	if (args[0].equals("plain"))
	{
	builder=new TextBuilder();
	}else{
	builder=new HTMLBuilder();
	}
	Director director=new Director(builder);
	director.construct();
	100
	114568 4712
	45494 678
	77079 65438
	70552 10407
	73197 89347
	43353 54207
	80003 4705
	53291 364
	8017 28735
	50
	100000
	4 6 1 8 10 2 6 4 8 9 10 8 2 1 9 5 9 1 4 1 1 6 1 9 10 9 2 7 3 8 1 4 2 7 6 10 8 7 5 5 4 2 10 8 4 8 9 5 5 9
	1000000
	1000000
	100
	951371 687892
	763520 79651
	139331 273467
	298132 432173
	92127 81816
	719371 666421
	543011 291692
	100 100
	1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
	1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
	1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
	1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
	1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
	1 1 1 1 1 1 1 1