From 2e39dd2b852accb2f0c73ed457441cabc7e7254e Mon Sep 17 00:00:00 2001
From: RryLee <qq215672398@126.com>
Date: Sat, 5 Mar 2016 15:07:30 +0800
Subject: [PATCH] sorting

---
 Sorting/1-tutorial-intro.cpp                  |  25 ++++
 Sorting/1-tutorial-intro.php                  |   8 ++
 Sorting/10-quicksort4.php                     |  53 ++++++++
 Sorting/11-countingsort1.php                  |  22 ++++
 Sorting/12-countingsort2.php                  |  24 ++++
 Sorting/13-countingsort3.php                  |  20 +++
 Sorting/14-countingsort4.cpp                  |  38 ++++++
 Sorting/14-countingsort4.php                  |  27 ++++
 Sorting/15-closest-numbers.php                |  24 ++++
 Sorting/16-find-median.php                    |   9 ++
 Sorting/17-sherlock-and-watson.php            |  18 +++
 Sorting/18-almost-sorted.cpp                  |  59 +++++++++
 Sorting/18-almost-sorted.php                  |  41 ++++++
 Sorting/19-sherlock-and-pairs.php             |  27 ++++
 Sorting/2-insertionsort1.php                  |  29 ++++
 Sorting/20-insertion-sort.cpp                 |  68 ++++++++++
 Sorting/20-insertion-sort.php                 |  59 +++++++++
 Sorting/3-insertionsort2.php                  |  26 ++++
 Sorting/4-correctness-invariant.php           |  25 ++++
 Sorting/5-runningtime.php                     |  27 ++++
 Sorting/6-quicksort1.php                      |  25 ++++
 Sorting/7-quicksort2.php                      |  41 ++++++
 Sorting/8-quicksort3.cpp                      |  50 +++++++
 Sorting/8-quicksort3.php                      |  31 +++++
 Sorting/9-bigger-is-greater.cpp               |  25 ++++
 Sorting/9-bigger-is-greater.php               |  48 +++++++
 Sorting/a.out                                 | Bin 0 -> 9448 bytes
 {string => String}/1-pangrams.c               |   0
 {string => String}/1-pangrams.php             |   0
 {string => String}/10-palindrome-index.php    |   0
 .../11-reverse-shuffle-merge.php              |   0
 .../12-the-love-letter-mystery.cpp            |   0
 .../12-the-love-letter-mystery.php            |   0
 {string => String}/13-common-child.cpp        |   0
 String/14-morgan-and-a-string.php             |  29 ++++
 String/15-sherlock-and-valid-string.php       |  22 ++++
 String/16-count-string.php                    |   3 +
 String/17-string-function-calculation.cpp     |  11 ++
 String/17-string-function-calculation.php     |  37 ++++++
 {string => String}/2-funny-string.cpp         |   0
 {string => String}/2-funny-string.php         |   0
 String/22-string-similarity.cpp               | 124 ++++++++++++++++++
 String/22-string-similarity.php               |  28 ++++
 .../3-alternating-characters.cpp              |   0
 .../3-alternating-characters.php              |   0
 {string => String}/4-game-of-thrones.cpp      |   0
 {string => String}/4-game-of-thrones.php      |   0
 {string => String}/5-gem-stones.cpp           |   0
 {string => String}/5-gem-stones.php           |   0
 {string => String}/6-make-it-anagram.cpp      |   0
 {string => String}/6-make-it-anagram.php      |   0
 {string => String}/7-anagram.cpp              |   0
 {string => String}/7-anagram.php              |   0
 {string => String}/8-two-string.cpp           |   0
 {string => String}/8-two-string.php           |   0
 .../9-sherlock-and-anagrams.cpp               |   0
 String/a.out                                  | Bin 0 -> 9112 bytes
 string/13-common-child                        | Bin 14104 -> 0 bytes
 string/a.out                                  | Bin 14208 -> 0 bytes
 59 files changed, 1103 insertions(+)
 create mode 100644 Sorting/1-tutorial-intro.cpp
 create mode 100644 Sorting/1-tutorial-intro.php
 create mode 100644 Sorting/10-quicksort4.php
 create mode 100644 Sorting/11-countingsort1.php
 create mode 100644 Sorting/12-countingsort2.php
 create mode 100644 Sorting/13-countingsort3.php
 create mode 100644 Sorting/14-countingsort4.cpp
 create mode 100644 Sorting/14-countingsort4.php
 create mode 100644 Sorting/15-closest-numbers.php
 create mode 100644 Sorting/16-find-median.php
 create mode 100644 Sorting/17-sherlock-and-watson.php
 create mode 100644 Sorting/18-almost-sorted.cpp
 create mode 100644 Sorting/18-almost-sorted.php
 create mode 100644 Sorting/19-sherlock-and-pairs.php
 create mode 100644 Sorting/2-insertionsort1.php
 create mode 100644 Sorting/20-insertion-sort.cpp
 create mode 100644 Sorting/20-insertion-sort.php
 create mode 100644 Sorting/3-insertionsort2.php
 create mode 100644 Sorting/4-correctness-invariant.php
 create mode 100644 Sorting/5-runningtime.php
 create mode 100644 Sorting/6-quicksort1.php
 create mode 100644 Sorting/7-quicksort2.php
 create mode 100644 Sorting/8-quicksort3.cpp
 create mode 100644 Sorting/8-quicksort3.php
 create mode 100644 Sorting/9-bigger-is-greater.cpp
 create mode 100644 Sorting/9-bigger-is-greater.php
 create mode 100755 Sorting/a.out
 rename {string => String}/1-pangrams.c (100%)
 rename {string => String}/1-pangrams.php (100%)
 rename {string => String}/10-palindrome-index.php (100%)
 rename {string => String}/11-reverse-shuffle-merge.php (100%)
 rename {string => String}/12-the-love-letter-mystery.cpp (100%)
 rename {string => String}/12-the-love-letter-mystery.php (100%)
 rename {string => String}/13-common-child.cpp (100%)
 create mode 100644 String/14-morgan-and-a-string.php
 create mode 100644 String/15-sherlock-and-valid-string.php
 create mode 100644 String/16-count-string.php
 create mode 100644 String/17-string-function-calculation.cpp
 create mode 100644 String/17-string-function-calculation.php
 rename {string => String}/2-funny-string.cpp (100%)
 rename {string => String}/2-funny-string.php (100%)
 create mode 100644 String/22-string-similarity.cpp
 create mode 100644 String/22-string-similarity.php
 rename {string => String}/3-alternating-characters.cpp (100%)
 rename {string => String}/3-alternating-characters.php (100%)
 rename {string => String}/4-game-of-thrones.cpp (100%)
 rename {string => String}/4-game-of-thrones.php (100%)
 rename {string => String}/5-gem-stones.cpp (100%)
 rename {string => String}/5-gem-stones.php (100%)
 rename {string => String}/6-make-it-anagram.cpp (100%)
 rename {string => String}/6-make-it-anagram.php (100%)
 rename {string => String}/7-anagram.cpp (100%)
 rename {string => String}/7-anagram.php (100%)
 rename {string => String}/8-two-string.cpp (100%)
 rename {string => String}/8-two-string.php (100%)
 rename {string => String}/9-sherlock-and-anagrams.cpp (100%)
 create mode 100755 String/a.out
 delete mode 100755 string/13-common-child
 delete mode 100755 string/a.out

diff --git a/Sorting/1-tutorial-intro.cpp b/Sorting/1-tutorial-intro.cpp
new file mode 100644
index 0000000..046bae9
--- /dev/null
+++ b/Sorting/1-tutorial-intro.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    int n, V;
+    cin >> V >> n;
+
+    int temp = 0;
+    for (int i = 0; i < n; ++i)
+    {
+        cin >> temp;
+        if (temp == V)
+        {
+            cout << i << endl;
+            return 0;
+        }
+    }
+
+    cout << -1 << endl;
+
+    return 0;
+}
diff --git a/Sorting/1-tutorial-intro.php b/Sorting/1-tutorial-intro.php
new file mode 100644
index 0000000..4afe4ad
--- /dev/null
+++ b/Sorting/1-tutorial-intro.php
@@ -0,0 +1,8 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%s", $V);
+fscanf($handle, "%n", $n);
+$ar = explode(' ', trim(fgets($handle)));
+
+echo array_search($V, $ar);
diff --git a/Sorting/10-quicksort4.php b/Sorting/10-quicksort4.php
new file mode 100644
index 0000000..f3895b5
--- /dev/null
+++ b/Sorting/10-quicksort4.php
@@ -0,0 +1,53 @@
+<?php
+
+function insertionSort($arr){
+    $times = 0;
+
+    for ($i=1; $i < count($arr); $i++) {
+        $val = $arr[$i];
+        for ($j=$i - 1; $j >= 0; $j--) {
+            if ($val < $arr[$j]) {
+                $arr[$j + 1] = $arr[$j];
+                $arr[$j] = $val;
+                $times ++;
+            } else {
+                break;
+            }
+        }
+    }
+
+    return $times;
+}
+
+function quickSort($arr, $start, $end) {
+    global $times_2;
+
+    if ($end - $start < 2)
+        return;
+    $p = $arr[$end - 1];
+    $i = $start;
+    for ($j=$start; $j < $end; $j++) {
+        if ($arr[$j] <= $p) {
+            $temp = $arr[$i];
+            $arr[$i] = $arr[$j];
+            $arr[$j] = $temp;
+            $times_2 ++;
+            $i ++;
+        }
+    }
+
+    quickSort($arr, $start, $i - 1);
+    quickSort($arr, $i, $end);
+
+    return $times_2;
+}
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+$arr = explode(' ', trim(fgets($handle)));
+
+global $times_2;
+$times_2 = 0;
+
+echo insertionSort($arr) - quickSort($arr, 0, count($arr)) . PHP_EOL;
diff --git a/Sorting/11-countingsort1.php b/Sorting/11-countingsort1.php
new file mode 100644
index 0000000..c81b8e1
--- /dev/null
+++ b/Sorting/11-countingsort1.php
@@ -0,0 +1,22 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+$arr = explode(' ', trim(fgets($handle)));
+
+$max = max($arr);
+
+$results = [];
+
+for ($i=0; $i <= $max; $i++) {
+    $results[$i] = 0;
+}
+
+foreach ($arr as $a) {
+    $results[$a] ++;
+}
+
+for ($i=0; $i <= $max; $i++) {
+    echo $results[$i] . ' ';
+}
diff --git a/Sorting/12-countingsort2.php b/Sorting/12-countingsort2.php
new file mode 100644
index 0000000..324bcbc
--- /dev/null
+++ b/Sorting/12-countingsort2.php
@@ -0,0 +1,24 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+$arr = explode(' ', trim(fgets($handle)));
+$max = max($arr);
+$results = [];
+
+for ($i=0; $i <= $max; $i++) {
+    $results[$i] = 0;
+}
+
+foreach ($arr as $a) {
+    $results[$a] ++;
+}
+
+$results = array_filter($results, function($result) {
+    return $result != 0;
+});
+
+foreach ($results as $key => $value) {
+    echo str_repeat("$key ", $value);
+}
diff --git a/Sorting/13-countingsort3.php b/Sorting/13-countingsort3.php
new file mode 100644
index 0000000..0f80424
--- /dev/null
+++ b/Sorting/13-countingsort3.php
@@ -0,0 +1,20 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+$str = [];
+$a = [];
+$count = array_fill(0, 101, 0);
+for ($i=0; $i < $t; $i++) {
+    fscanf($handle, "%d %s", $a[$i], $str[]);
+    $count[$a[$i]] ++;
+}
+
+for ($i=0; $i < 100; $i++) {
+    if ($i != 0) {
+        $count[$i] = $count[$i] + $count[$i - 1];
+    }
+
+    printf("%d ", $count[$i]);
+}
diff --git a/Sorting/14-countingsort4.cpp b/Sorting/14-countingsort4.cpp
new file mode 100644
index 0000000..27efab2
--- /dev/null
+++ b/Sorting/14-countingsort4.cpp
@@ -0,0 +1,38 @@
+#include <iostream>
+#include <string>
+#include <vector>
+
+using namespace std;
+
+vector <string> a[100];
+string str;
+int n, i, j, x;
+
+int main(int argc, char const *argv[])
+{
+    cin >> n;
+    for (i = 0; i < n / 2; ++i)
+    {
+        cin >> x;
+        cin >> str;
+        a[x].push_back("-");
+    }
+
+    for (; i < n; ++i)
+    {
+        cin >> x;
+        cin >> str;
+        a[x].push_back(str);
+    }
+
+    for (i = 0; i < 100; ++i)
+    {
+        x = a[i].size();
+        for (int j = 0; j < x; ++j)
+        {
+            cout << a[i][j] << " ";
+        }
+    }
+
+    return 0;
+}
diff --git a/Sorting/14-countingsort4.php b/Sorting/14-countingsort4.php
new file mode 100644
index 0000000..f5aef67
--- /dev/null
+++ b/Sorting/14-countingsort4.php
@@ -0,0 +1,27 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+$array = [];
+$out = [];
+
+$i = 0;
+while ($ar = trim(fgets($handle))) {
+    $i ++;
+    list($a, $s) = explode(' ', $ar);
+    if ($i <= $t / 2) {
+        $s = '-';
+    }
+    $array[(int)$a][] = $s;
+}
+
+ksort($array);
+
+foreach ($array as $s) {
+    foreach ($s as $x) {
+        $out[] = $x;
+    }
+}
+
+echo implode(' ', $out);
diff --git a/Sorting/15-closest-numbers.php b/Sorting/15-closest-numbers.php
new file mode 100644
index 0000000..09b26b8
--- /dev/null
+++ b/Sorting/15-closest-numbers.php
@@ -0,0 +1,24 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $n);
+
+$arr = explode(' ', trim(fgets($handle)));
+sort($arr);
+
+$results = [];
+$min = $arr[1] - $arr[0];
+$mins = [1];
+
+for ($i=2; $i < $n; $i++) {
+    if ($arr[$i] - $arr[$i - 1] < $min) {
+        $min = $arr[$i] - $arr[$i - 1];
+        $mins = [$i];
+    } else if ($arr[$i] - $arr[$i - 1] == $min) {
+        $mins[] = $i;
+    }
+}
+
+foreach ($mins as $a) {
+    echo $arr[$a - 1] . ' ' . $arr[$a] . ' ';
+}
diff --git a/Sorting/16-find-median.php b/Sorting/16-find-median.php
new file mode 100644
index 0000000..e502bbf
--- /dev/null
+++ b/Sorting/16-find-median.php
@@ -0,0 +1,9 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $n);
+
+$arr = explode(' ', trim(fgets($handle)));
+sort($arr);
+
+echo $arr[floor($n / 2)];
diff --git a/Sorting/17-sherlock-and-watson.php b/Sorting/17-sherlock-and-watson.php
new file mode 100644
index 0000000..3d1b2cf
--- /dev/null
+++ b/Sorting/17-sherlock-and-watson.php
@@ -0,0 +1,18 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d %d %d", $N, $K, $Q);
+
+$A = explode(' ', trim(fgets($handle)));
+
+$times = $K % $N;
+
+while ($Q --) {
+    fscanf($handle, "%d", $a);
+
+    if ($a - $times >= 0) {
+        echo $A[$a - $times] . PHP_EOL;
+    } else {
+        echo $A[$a - $times + $N] . PHP_EOL;
+    }
+}
diff --git a/Sorting/18-almost-sorted.cpp b/Sorting/18-almost-sorted.cpp
new file mode 100644
index 0000000..fa00692
--- /dev/null
+++ b/Sorting/18-almost-sorted.cpp
@@ -0,0 +1,59 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+typedef long long LL;
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    LL n;
+    vector <LL> origin, sorted, diff;
+    cin >> n;
+    for (LL i = 0; i < n; ++i) {
+        LL x;
+        cin >> x;
+        origin.push_back(x);
+        sorted.push_back(x);
+    }
+    sort(sorted.begin(), sorted.end());
+
+    for (LL i = 0; i < n; ++i) {
+        if (origin[i] != sorted[i]) {
+            diff.push_back(i);
+        }
+    }
+
+    LL count = diff.size();
+
+    if (count == 0) {
+        cout << "yes" << endl;
+        return 0;
+    }
+
+    if (count == 2 &&
+        sorted[diff[0]] == origin[diff[1]] &&
+        sorted[diff[1]] == origin[diff[0]]) {
+        cout << "yes" << endl << "swap " << diff[0] + 1 << " " << diff.back() + 1;
+        return 0;
+    }
+
+    bool reverse = false;
+    for (LL i = 0; i < count; i ++) {
+        if (origin[diff[i]] == sorted[diff[count - i - 1]]) {
+            reverse = true;
+        } else {
+            reverse = false;
+            break;
+        }
+    }
+
+    if (reverse) {
+        cout << "yes" << endl << "reverse " << diff[0] + 1 << " " << diff.back() + 1;
+    } else {
+        cout << "no" << endl;
+    }
+
+    return 0;
+}
diff --git a/Sorting/18-almost-sorted.php b/Sorting/18-almost-sorted.php
new file mode 100644
index 0000000..6ca52cd
--- /dev/null
+++ b/Sorting/18-almost-sorted.php
@@ -0,0 +1,41 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $n);
+
+$origin = array_map('intval', explode(' ', trim(fgets($handle))));
+$sorted = $origin;
+sort($sorted);
+
+$diff = [];
+for ($i=0; $i < $n; $i++) {
+    if ($origin[$i] != $sorted[$i]) {
+        $diff[] = $i;
+    }
+}
+
+$count = count($diff);
+
+//sorted
+if ($count == 0) {
+    echo "yes\n";
+} else if ($count == 2 && // swap
+    $sorted[$diff[0]] == $origin[$diff[1]] &&
+    $sorted[$diff[1]] == $origin[$diff[0]]) {
+    printf("yes\nswap %d %d\n", $diff[0] + 1, $diff[1] + 1);
+} else if ($count > 2) {
+    $reverse = false;
+    for ($i=0; $i < $count; $i++) {
+        if ($sorted[$diff[$i]] == $origin[$diff[$count - 1 - $i]]) {
+            $reverse = true;
+        } else {
+            $reverse = false;
+            break;
+        }
+    }
+    if ($reverse) {
+        printf("yes\nreverse %d %d\n", $diff[0] + 1, $diff[$count - 1] + 1);
+    } else {
+        echo "no\n";
+    }
+}
diff --git a/Sorting/19-sherlock-and-pairs.php b/Sorting/19-sherlock-and-pairs.php
new file mode 100644
index 0000000..22e4c36
--- /dev/null
+++ b/Sorting/19-sherlock-and-pairs.php
@@ -0,0 +1,27 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $T);
+
+while ($T --) {
+    fscanf($handle, "%d", $n);
+    $arr = array_map('intval', explode(' ', trim(fgets($handle))));
+
+    $times = [];
+    foreach ($arr as $a) {
+        if (isset($times[$a])) {
+            $times[$a] ++;
+        } else {
+            $times[$a] = 1;
+        }
+    }
+
+    $count = 0;
+    foreach ($times as $a) {
+        if ($a == 1) continue;
+
+        $count += ($a - 1) * $a;
+    }
+
+    echo $count . PHP_EOL;
+}
diff --git a/Sorting/2-insertionsort1.php b/Sorting/2-insertionsort1.php
new file mode 100644
index 0000000..4029e98
--- /dev/null
+++ b/Sorting/2-insertionsort1.php
@@ -0,0 +1,29 @@
+<?php
+
+function insertSort($arr)
+{
+    $count = count($arr);
+    $last = $arr[$count - 1];
+
+    for ($i=$count - 2; $i >= 0; $i--) {
+        if ($arr[$i] > $last) {
+            $arr[$i + 1] = $arr[$i];
+            echo implode(' ', $arr) . PHP_EOL;
+        } else {
+            $arr[$i + 1] = $last;
+            echo implode(' ', $arr) . PHP_EOL;
+            break;
+        }
+
+        if ($i == 0) {
+            $arr[0] = $last;
+            echo implode(' ', $arr) . PHP_EOL;
+        }
+    }
+}
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $m);
+$ar = explode(' ', trim(fgets($handle)));
+
+insertSort($ar);
diff --git a/Sorting/20-insertion-sort.cpp b/Sorting/20-insertion-sort.cpp
new file mode 100644
index 0000000..5057a89
--- /dev/null
+++ b/Sorting/20-insertion-sort.cpp
@@ -0,0 +1,68 @@
+/* Enter your code here. Read input from STDIN. Print output to STDOUT */
+#include <iostream>
+#include <algorithm>
+#include <cmath>
+#include <stdio.h>
+
+using namespace std ;
+
+long long cnt=0 ;
+
+void merge(int a[],int p,int q,int r)
+{
+    int l1[q-p+1] ;
+    int r1[r-q] ;
+    int n1=q-p+1 ;
+    int n2=r-q ;
+    int pos1=0,pos2=0 ;
+    for(int i=p;i<=q;i++)
+        l1[pos1++]=a[i] ;
+    for(int i=q+1;i<=r;i++)
+        r1[pos2++]=a[i] ;
+    int size=pos1 ;
+    int pos3=p ;
+    pos1=pos2=0 ;
+    while(pos1<n1 && pos2<n2){
+        if(l1[pos1]>r1[pos2]){
+            cnt+=size-pos1 ;
+            a[pos3++]=r1[pos2++] ;
+        }else
+            a[pos3++]=l1[pos1++] ;
+    }
+    if(pos1>=n1){
+        while(pos2<n2)
+            a[pos3++]=r1[pos2++] ;
+    }else{
+        while(pos1<n1)
+            a[pos3++]=l1[pos1++] ;
+
+    }
+}
+
+void merge_sort(int a[],int p,int r)
+{
+    if(p<r){
+        int q=(p+r)/2 ;
+        merge_sort(a,p,q) ;
+        merge_sort(a,q+1,r) ;
+        merge(a,p,q,r) ;
+    }
+}
+
+int main()
+{
+    int t ;
+    scanf("%d",&t) ;
+    while(t) {
+        int n ;
+        scanf("%d",&n) ;
+        int A[n] ;
+        for(int i=0;i<n;i++)
+            scanf("%d",&A[i]) ;
+        merge_sort(A,0,n-1) ;
+        cout << cnt << endl ;
+        cnt = 0 ;
+        t-- ;
+    }
+    return 0 ;
+}
diff --git a/Sorting/20-insertion-sort.php b/Sorting/20-insertion-sort.php
new file mode 100644
index 0000000..19e9150
--- /dev/null
+++ b/Sorting/20-insertion-sort.php
@@ -0,0 +1,59 @@
+<?php
+
+// timeout.
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+while ($t --) {
+    fscanf($handle, "%d", $n);
+    $arr = array_map('intval', explode(' ', trim(fgets($handle))));
+
+    $count = countShifts($arr);
+
+    echo $count . PHP_EOL;
+}
+
+function countShifts(&$array) {
+    $count = count($array);
+    if ($count < 2) {
+        return 0;
+    }
+
+    $middle = (int) ($count / 2);
+    //make left
+    for ($i=0; $i < $middle; $i++) {
+        $left[] = $array[$i];
+    }
+    // make right
+    for ($i=$middle; $i < $count; $i++) {
+        $right[] = $array[$i];
+    }
+
+    return countShifts($left) + countShifts($right) + merge($array, $left, $right);
+}
+
+function merge(&$array, $left, $right) {
+    $inversions_count = 0;
+    $i = 0;
+    $j = 0;
+    $left_count = count($left);
+    $right_count = count($right);
+    while ($i < $left_count || $j < $right_count) {
+        if ($i == $left_count) {
+            $array[$i + $j] = $right[$j];
+            $j ++;
+        } else if ($j == $right_count) {
+            $array[$i + $j] = $left[$i];
+            $i ++;
+        } else if ($left[$i] <= $right[$j]) {
+            $array[$i + $j] = $left[$i];
+            $i ++;
+        } else {
+            $array[$i + $j] = $right[$j];
+            $inversions_count += $left_count - $i;
+            $j ++;
+        }
+    }
+
+    return $inversions_count;
+}
diff --git a/Sorting/3-insertionsort2.php b/Sorting/3-insertionsort2.php
new file mode 100644
index 0000000..d281ca9
--- /dev/null
+++ b/Sorting/3-insertionsort2.php
@@ -0,0 +1,26 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $m);
+$ar = explode(' ', trim(fgets($handle)));
+
+insertSort2($ar);
+
+function insertSort2(array $arr) {
+    $count = count($arr);
+
+    for ($i=1; $i < $count; $i++) {
+        $temp = $arr[$i];
+
+        for ($j=$i - 1; $j >= 0; $j--) {
+            if ($temp < $arr[$j]) {
+                $arr[$j + 1] = $arr[$j];
+                $arr[$j] = $temp;
+            } else {
+                break;
+            }
+        }
+
+        echo implode(" ", $arr) . PHP_EOL;
+    }
+}
diff --git a/Sorting/4-correctness-invariant.php b/Sorting/4-correctness-invariant.php
new file mode 100644
index 0000000..1291121
--- /dev/null
+++ b/Sorting/4-correctness-invariant.php
@@ -0,0 +1,25 @@
+<?php
+
+function insertionSort(&$arr){
+   for ($i=1; $i < count($arr); $i++) {
+      $val = $arr[$i];
+      for ($j=$i - 1; $j >= 0; $j--) {
+         if ($val < $arr[$j]) {
+            $arr[$j + 1] = $arr[$j];
+            $arr[$j] = $val;
+         } else {
+            break;
+         }
+      }
+   }
+}
+
+$handle = fopen ("php://stdin","r");
+$t = fgets($handle);
+$arr = split(' ', fgets($handle));
+
+insertionSort($arr);
+
+foreach($arr as $value) {
+  print $value." ";
+}
diff --git a/Sorting/5-runningtime.php b/Sorting/5-runningtime.php
new file mode 100644
index 0000000..b84311d
--- /dev/null
+++ b/Sorting/5-runningtime.php
@@ -0,0 +1,27 @@
+<?php
+
+function insertionSort($arr){
+    $times = 0;
+
+    for ($i=1; $i < count($arr); $i++) {
+      $val = $arr[$i];
+      for ($j=$i - 1; $j >= 0; $j--) {
+         if ($val < $arr[$j]) {
+            $arr[$j + 1] = $arr[$j];
+            $arr[$j] = $val;
+
+            $times ++;
+         } else {
+            break;
+         }
+      }
+   }
+
+   echo $times . PHP_EOL;
+}
+
+$handle = fopen ("php://stdin","r");
+$t = fgets($handle);
+$arr = split(' ', fgets($handle));
+
+insertionSort($arr);
diff --git a/Sorting/6-quicksort1.php b/Sorting/6-quicksort1.php
new file mode 100644
index 0000000..338b26f
--- /dev/null
+++ b/Sorting/6-quicksort1.php
@@ -0,0 +1,25 @@
+<?php
+
+function partition($ar) {
+    $count = count($ar);
+    $equal = $ar[0];
+    $left = [];
+    $right = [];
+
+    for ($i=0; $i < $count; $i++) {
+        if ($ar[$i] >= $equal) {
+            $right[] = $ar[$i];
+        } else {
+            $left[] = $ar[$i];
+        }
+    }
+
+    echo implode(' ', array_merge($left, $right)) . PHP_EOL;
+}
+
+$fp = fopen("php://stdin", "r");
+
+fscanf($fp, "%d", $m);
+$ar = explode(' ', trim(fgets($fp)));
+
+partition($ar);
diff --git a/Sorting/7-quicksort2.php b/Sorting/7-quicksort2.php
new file mode 100644
index 0000000..f14fa6c
--- /dev/null
+++ b/Sorting/7-quicksort2.php
@@ -0,0 +1,41 @@
+<?php
+
+function quickSort($arr) {
+
+    $count = count($arr);
+
+    if ($count <= 1) return $arr;
+
+    $temp = $arr[0];
+    $left = array();
+    $right = array();
+
+    for ($i = 1; $i < $count; $i ++) {
+        if ($temp > $arr[$i])
+            $left[] = $arr[$i];
+        else
+            $right[] = $arr[$i];
+    }
+
+    if (count($left) > 1) {
+        $left = quickSort($left);
+        echo implode(' ', $left) . PHP_EOL;
+    }
+
+    if (count($right) > 1) {
+        $right = quickSort($right);
+        echo implode(' ', $right) . PHP_EOL;
+    }
+
+    return array_merge($left, [$temp], $right);
+}
+
+$fp = fopen("php://stdin", "r");
+
+fscanf($fp, "%d", $m);
+
+$ar = explode(' ', trim(fgets($fp)));
+
+$results = quickSort($ar);
+
+echo implode(' ', $results) . PHP_EOL;
diff --git a/Sorting/8-quicksort3.cpp b/Sorting/8-quicksort3.cpp
new file mode 100644
index 0000000..beb1005
--- /dev/null
+++ b/Sorting/8-quicksort3.cpp
@@ -0,0 +1,50 @@
+#include <cmath>
+#include <cstdio>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+void quicksort(vector<int> &vec, int startIndex, int pivotIndex)
+{
+    int pivot, index, isgreater;
+    int arraySize = pivotIndex - startIndex;
+    pivot = vec[pivotIndex];
+
+    if (arraySize > 0) {
+        index = startIndex;
+        isgreater = 0;
+        for(int i=startIndex;i<pivotIndex;i++) {
+            if (vec[i]<=pivot) {
+                if(isgreater == 1) {
+                    swap(vec[i], vec[index]);
+                }
+                index++;
+            } else
+                isgreater = 1;
+        }
+        swap(vec[index], vec[pivotIndex]);
+
+        for(int i : vec) {
+            cout << i << " ";
+        }
+        cout << endl;
+
+        quicksort(vec, startIndex, index-1);
+        quicksort(vec, index+1, pivotIndex);
+    }
+}
+
+int main() {
+    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
+    int size;
+    vector<int> vec;
+    cin >> size;
+    for(int i = 0; i<size; i++) {
+        int dummy;
+        cin >> dummy;
+        vec.push_back(dummy);
+    }
+    quicksort(vec, 0, size-1);
+    return 0;
+}
diff --git a/Sorting/8-quicksort3.php b/Sorting/8-quicksort3.php
new file mode 100644
index 0000000..0a06715
--- /dev/null
+++ b/Sorting/8-quicksort3.php
@@ -0,0 +1,31 @@
+<?php
+
+$_fp = fopen("php://stdin", "r");
+
+$n = trim(fgets($_fp));
+$numbers = explode(' ', trim(fgets($_fp)));
+quicksort($numbers, 0, $n-1);
+
+function quicksort(array &$data, $start, $end) {
+    if ($start < $end) {
+        $p = partition($data, $start, $end);
+        quicksort($data, $start, $p - 1);
+        quicksort($data, $p + 1, $end);
+    }
+}
+
+function partition(array &$input, $start, $end) {
+    $firstHigh = $start;
+    $p = $input[$end];
+    for ($i=$start; $i < $end; $i++) {
+        if ($p > $input[$i]) {
+            $tmp = $input[$i];
+            $input[$i] = $input[$firstHigh];
+            $input[$firstHigh++] = $tmp;
+        }
+    }
+    $input[$end] = $input[$firstHigh];
+    $input[$firstHigh] = $p;
+    echo implode(' ', $input) . PHP_EOL;
+    return $firstHigh;
+}
diff --git a/Sorting/9-bigger-is-greater.cpp b/Sorting/9-bigger-is-greater.cpp
new file mode 100644
index 0000000..59e5ae4
--- /dev/null
+++ b/Sorting/9-bigger-is-greater.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    int T;
+    cin >> T;
+    while (T --) {
+        string s;
+        cin >> s;
+        string prev = s;
+        if (next_permutation(s.begin(), s.end()))
+        {
+            cout << s << endl;
+        }
+        else
+        {
+            cout << "no answer" << endl;
+        }
+    }
+
+    return 0;
+}
diff --git a/Sorting/9-bigger-is-greater.php b/Sorting/9-bigger-is-greater.php
new file mode 100644
index 0000000..76cc437
--- /dev/null
+++ b/Sorting/9-bigger-is-greater.php
@@ -0,0 +1,48 @@
+<?php
+
+$_fp = fopen("php://stdin", "r");
+fscanf($_fp, "%d", $t);
+
+while ($t --) {
+    $str = trim(fgets($_fp));
+
+    if (next_permutation($str)) {
+        echo "$str\n";
+    } else {
+        echo "no answer\n";
+    }
+}
+
+function next_permutation(&$str) {
+    $length = strlen($str);
+    $i = $length - 1;
+    while ($i > 0 && $str[$i - 1] >= $str[$i]) {
+        $i --;
+    }
+
+    // no nect permutation.
+    if ($i <= 0) return false;
+
+    // search right greater pivot.
+    $j = $length - 1;
+    while ($str[$j] <= $str[$i - 1]) {
+        $j --;
+    }
+
+    // change pivot and right.
+    $temp = $str[$i - 1];
+    $str[$i - 1] = $str[$j];
+    $str[$j] = $temp;
+
+    // reverse.
+    $j = $length - 1;
+    while ($i < $j) {
+        $temp = $str[$i];
+        $str[$i] = $str[$j];
+        $str[$j] = $temp;
+        $i ++;
+        $j --;
+    }
+
+    return true;
+}
diff --git a/Sorting/a.out b/Sorting/a.out
new file mode 100755
index 0000000000000000000000000000000000000000..73437492e9355191c5f87fcc3b034e4363136d2e
GIT binary patch
literal 9448
zcmcIpeQaCR6~DHVHlfr>OADbLU`7imEG9|QEQ}58q;6kO+Ga^wI-tBbw$m6AJF=g<
zw5Sl2mSJUuiValurAnJ7v_D2S4b=6IHl<U`HpIdtri#H7p@N(?OyR3!4C?*PefK!e
z&-R4&aiZsQ&+ndd?)TTpBY}<$PKQG<ImI1<q{#}Ogv?(d2Ck8!!dgV7@QG{1O0fV)
zIX<7vA#SFa&nef;E0mrKybNE9(*#<aKAB+tB@-6RxrW54ym|7eq{)A?*c6!y;gJB@
zQC;U${@mhTi8DW_>T$HTP2y}vFxl0(O}NJ0D-+D8RK=Kc`>1X7^(enRP9G$aeZ<6i
z`8&@^m#Fg{BTVU*%cThJlL_Xf?7j&*s^=G_YNgnv$}80`6{`NsRddCygVDa`rdtQY
zb%W7ZYNT$YrMa%T$(xLO8)du6Kk07Vyj7OO{pf*2?OTSA<^bit{&JIR)lBcU_?h=U
zEX!`W*L~+FGn7YN&f_LTHKyq@iB$n7|H)?-I<NoyqsrRA>mADvUCslCoI+X$M@tJ~
z>Bmz9zYbV2{4DTdep*ZTuPuSEE#d#`CG@wH(7&pL{!=CD=_;ZBXbJsU;7i2S;&62@
zQdkGDC;Bly>W2xnPY^~F#YcFr4gUu)@-wld7b%RN@*^;hl14am%Pll_nuV_K9E!*E
zq!COQx-Rs)cIjP_ozbKbNwf_HlgUU@=<Pk5^l&7h;GRuwgYj6TC)hU_G4qP&+_Smc
zXo<#?dS5UZX=;x}jr9$IT|x&QA4~>1H*|H!yY+wsqKRanD~e>d(G-b=2irs4Mngkr
zAehjNL@;V3+e3js7qGQ(77gj~q>+dOhuVAeo_amd-HeJC7T0DL*KMo~MPsJ#P&{Qw
zRjR=V^+kxg0X-0UP!A0}sP_k>gXovgNKg+Nk&&n&h9X1Bh#``pV5}cGWTtv-C<xaZ
zJK9^@^hR$}F4gE=XQsDr*Vh6!*PakgtU+37^p!!f{s96xfGx&Y(R!=Lw=5dP4q7I9
z6qZ^Mtt9*V)p$B!K}pglGS)nWEzv0+Q2BFJy%MLrN^LDt=J`c?yV`0c&hv%vB@!`z
zYSesO2vNC~86FF6^<Qhjd9NjddJAqnS6VE%bzk*aaBd^{(JVNh0fcv2@XH8LwB3R)
zVi3I7f~zAy<_=hJb%aTL*n-o($fS+URA}Sn%PTxW+dpBHXVxM|8~a_wDb_G~cAXO{
z+0|wEt-8*K6v+dWIX#sHt^RZ&Wa{GSNhyCoGIj0rgp|*dOcQAOh?L(ZnYwuTu$12*
znYwoRpp^ei@&b}arThnyX&9%6rTh}f)P>W%Qa(m<CCQyq{x!+emD4^c|AJ)d!s&X*
z4ezz5U%OvRzpag(o9*mrKQrOM396krd1Mi>Gp8$kBC`>SAN5yVhr{&fljy*$THWJd
z+Sr_1OTV*g<xzN(-L_=M3ChS$L3tm6V#g`!rG78V$0>iS_UPZGgOitBaG<4UwUe1U
zHOFb~wM)kGoVP{nt?D}XG0PwQMth}4h}4p;FwDeIu^p$&n*ljKlqH?0#)U&0yHljf
zFMJPnIcM*aL3VP-^d8ty8YAvY?|nr}rzXPMc-iV&)K*Ie<{Bon1A#ZS^yw3{#xg&=
zl+BI@-aOEmO>cd3|3uZ(6Z<Br_R;Zpd}?X0FqL*e=}ce>9>jS0Z!sZm3ry|3X*@8c
z9nwxtIkj?e1!@JCP3T-%rOXX584FA~F1$Kk{vB9op~>;`hmjb|IAB%v{7YK;CGF&S
zbjzgn+8k;&d#s}J8{#+>a^i4ZzsQV!PNkkROKp>-p4<D-c;K9NXuNDc6`2lX#`b2!
z!`F-lG7=;^cwZBk1%i^U4`eR9m2WZg=-wHBYn6DUc04eXGdj@ekYak-e)56zCueU6
z%s2uw7ydLBIOmYvs*ML`sg<+|WfG{}aXRj_^qEWw!t@JhvN;~(o94pW+RJ61W3AnU
z+~1#4gHoN|`&l|QH@5dPN9v|W_s(Ur818FNJlFhFk@@9k+3c}V49js6Ptc*6IR@;Y
zX?>h@Pte-SJWn&@RR2N$-TrO<bk@Js-_vnmb+glh$#<ac4)E^w^u_k{>kWVHSVME6
zLOc1nEA#O`vsrEbd&adqUpvz0JJJ`|!$Wr2o7&hZhj!bA)Op$%?%m<P&%eWezh6If
zaDIM&i2Xu(Q(Fg}2dl%_b62`<$MO-ha9>6t2f+`a=Dpxgp!w7<H=xdE!Gqv);3MF4
zf5?FMQma684<vHz=@O2SYRAgU7gii}EUYG+?*8@gc{3>}Dy}cYD&$Lj)Mb)%-PIf1
zHFs4l`gX;rxO2trH?LjwWr9hE>isJGK23G-yQ?2_wk=-ZI_N;rG9S$oZ5Z1-z;pS#
zDc7{$2OdQJa%+C4nNPldhHpFaBb49ju71+l>aKah6>xhFl(o8Rzgw=k>mOU7xm(5-
zZgKmD-7S81z29Bi>h?en`mOE?*)KCNAB7+5IYuu37jzi=AknjnOg^e)3F1c$PXVX9
z01=-}XBYaU%xBUnYzRbG%U^nL^~%&rC08rHLh%Z0Z$vaMMAXMbA79GGi63(Mh~?gV
zqh+SNK%#i3I!&1l1fpH4esmxZ)tF4ku~KPbbYMxs;v?cd_9%OvXEeWwt}>Z8y1*w>
zj1McB>#ZrhO2xT+45Mt1N9kh;NSVu>Rr1Ah)4wwRzcYTv+6%f8TM^NXiZ?61LGf*h
z_ba|j@y8T@M)993{-WZi6_?H}KO5WHzUHaj+LwwMDbG4@qqm{1u`wmZ#x*A3X{>Kp
z*HGV3FN8O_d&mg(fg1^v4{$0P!&6~ccw=!R;`O(-*BQZ`O4=DqdHYgPyji1R;U#Gx
zm>dw^@a`D=ncPU2IlCf>WHcVj6LjPyB7;FPP^sZTLwKWjO9(Hn=J@T0fV_A(Xat2f
zGNAV-f<qB~APifUObb1jNCbDA7My+{1T}aM4n;#KIu3{U@yb$6kA2Cc@P^_;Ly?$a
z>As>#7gleJ(^rt^!ffv;io1kS6feuIL#s0vRwb{$e0+i6b()Va6vgJZ3#*>jMZSKe
z;PsV{UzS^k`S>Ei`%ylQ-KxmEbBV>dI9I;DTkt-Xk5`F$wZG-#)wwuLKE6bZ7S&&x
z+ZXfouMoT+=Htr*T?6gp!md_q{kp`Jg5OzI8yD?jYQM|JYs5%VeE!{^ug|;pJWAVU
znRp-fm3*Re!hzGwUVl0t@Uj%bcJ6o;?z7>3h1<`myQTlD#U$>oL~8pM{W4wHp9g?b
zxrc53pOyNB<8l;uv39*G^{*CmZzJMz-$I)F->c45d4~W-=O*EN-tu`wcE$W(iwp-|
zyhj%MpfOKhk$7Q$l14E<EmFU5+&5FfVrjvA(-qF=Hfa$hq@Tk1_7HFnPFef>c?@{5
zxY3V*Q+&uyM<l*j&})r|&&3Iab3FQHnJdH@;2xE>vcHtT&r3gr>v~q=Ru5)+IVw=B
zo=qk2%?h{2y^_E^h3>_Zz?X>m{iICk{G^2cUzPClN8r^(`v0u-k5zU>uk`%*3iHPF
z2I0;cLC;kyy{q&mZ1K6zl|DUEtaKSJP)jkN=~+!A@4DbCfLG)8XZL@j)R(GxKdmM3
zdw|pYnNsVT`{%wA`bpqa?h&;fxsZ_(`p+nw9&}dvoAguIKkrEW#e(7oMDpzbeqQ2*
z=gur}IsfsvB%-ITq)@_08maz%ZwQgQyV|<+j`r>zL^|gKnz}KhhbW|(6dcL4K)N1|
z>pKVIeZfIJY{U~uJ(wC1xDgBwMvO?<`_*;LE%01KNvFGsdDGBwdr0gS=G`Qm8XDRS
z6N{wNl_pQMvA!-EOGXj~E=6_8c*5|8hKFSkv!g}Vqj7l$((h?%&?ypWASOykG&mUD
z0|^n`U@VNFEpBP4kd*7Ah_7z!*wX6nfJv%PZ`TnN)i-qcHwE;-=Jgc(mHngAN_ESI
z4c!5RS^cdY0n*5;XgD8`L1dw?|JG*zruH^L7br7KD(g*ASf5YEN>x<U467;(@l%SL
zs_1GcnUdWn*ufVFQ_HJhi8ye6!37~)dmZLuzqXvhC^H4MZQlQFynG8<6pqI9R5B7a
zBg(cS$eQP2eym-$^k@)0g<Kvv3Y=4L+g1}joQ&%Om<klCH{;gSv*zT{aktHNZ+`fD
zzDi9pTyDna^PN*j-3;ZA<Y!>AV`A9C{5F;UIM8qN6Op%c8HG1n6*5=-fBj4EXB<_z
zbCK`${QpyaKXXB(Yo!|?(3=(8xg@^-^ZzG33TMXqEz1o^Snc_pU?_*HSW$7i{d(XR
z@y6xy4>^5O^N<3Xq%{A|=l8UN#bzWH;bVJ#cT6gP?hizC%2AT-YX}5w!-p+7XV34G
zQB_fn8;~xMz5nh9MsId5pWiVTDY6aX_A4=04(mS%9f|?4>{;L=GrW5w6P+fL^(P&!
zzk<acB&e!v&+npPWzTU3E}!kW{ri-Ct8&P3jHAllqZ&;1bZ58QKLLzXlzQ%+byfvJ
z>@NbUtCi9atoFJ0m?~(}s*H5Cl9_+sX3zJ*NoC(fgKHtSW9SD+Sj*@4-6|Ex;&=_~
z+v|T=*>nH%JFs5at8QR(IaWCViRWzg{QrFZKmU5GGSc?)U$oityK+>O-=xNm-SGIa
zJb{E8A9oYq@A?1!_WrWlzXIDTi#@+nE66Fxu5XvmLWioz<@0;6`U~3AyNc!>+w;4(
zM%hoP_VfJY^0{5_+REqm@f<Y@#QLT*FEf4t8P@ve-qEUn5jIqu?U;XLv*-8Hh_dH;
zvKzKz`BNka<Mtm`_wmQs{>C;|mE4mjVef)W^{=<#Y+q-?Rd-4o%36Yt%eJb%pvtdc
r1C?nLr5|29R{IHZ3_79~&^1U?9l8Cyf6@9ZR{pRGG=E^rw3q)c9h!<-

literal 0
HcmV?d00001

diff --git a/string/1-pangrams.c b/String/1-pangrams.c
similarity index 100%
rename from string/1-pangrams.c
rename to String/1-pangrams.c
diff --git a/string/1-pangrams.php b/String/1-pangrams.php
similarity index 100%
rename from string/1-pangrams.php
rename to String/1-pangrams.php
diff --git a/string/10-palindrome-index.php b/String/10-palindrome-index.php
similarity index 100%
rename from string/10-palindrome-index.php
rename to String/10-palindrome-index.php
diff --git a/string/11-reverse-shuffle-merge.php b/String/11-reverse-shuffle-merge.php
similarity index 100%
rename from string/11-reverse-shuffle-merge.php
rename to String/11-reverse-shuffle-merge.php
diff --git a/string/12-the-love-letter-mystery.cpp b/String/12-the-love-letter-mystery.cpp
similarity index 100%
rename from string/12-the-love-letter-mystery.cpp
rename to String/12-the-love-letter-mystery.cpp
diff --git a/string/12-the-love-letter-mystery.php b/String/12-the-love-letter-mystery.php
similarity index 100%
rename from string/12-the-love-letter-mystery.php
rename to String/12-the-love-letter-mystery.php
diff --git a/string/13-common-child.cpp b/String/13-common-child.cpp
similarity index 100%
rename from string/13-common-child.cpp
rename to String/13-common-child.cpp
diff --git a/String/14-morgan-and-a-string.php b/String/14-morgan-and-a-string.php
new file mode 100644
index 0000000..6cbfa50
--- /dev/null
+++ b/String/14-morgan-and-a-string.php
@@ -0,0 +1,29 @@
+<?php
+
+// to do...
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $T);
+
+while ($T --) {
+    fscanf($handle, "%s", $str1);
+    fscanf($handle, "%s", $str2);
+
+    $length = strlen($str1);
+
+    $index_1 = 0;
+    $index_2 = 0;
+
+    $result = '';
+    while ($index_1 < $length - 1 && $index_2 < $length - 1) {
+        if (compare($str1, $str2, $index_1, $index_2) < 0) {
+
+        } else {
+
+        }
+    }
+}
+
+function compare($a, $b, $i, $j) {
+    // $length_1 = strlen($a) - $i
+}
+
diff --git a/String/15-sherlock-and-valid-string.php b/String/15-sherlock-and-valid-string.php
new file mode 100644
index 0000000..61a885a
--- /dev/null
+++ b/String/15-sherlock-and-valid-string.php
@@ -0,0 +1,22 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%s", $str);
+
+$letters = [];
+
+foreach (range('a', 'z') as $letter) {
+    if (substr_count($str, $letter)) {
+        $letters[] = substr_count($str, $letter);
+    }
+}
+
+$max = max($letters);
+$min = min($letters);
+if ($max == $min) {
+    echo "YES\n";
+} else if ((array_count_values($letters)[$min] == 1 && ($min == 1 || $min - $max == 1)) || (array_count_values($letters)[$max] == 1 && ($max == 1 || $max - $min == 1))) {
+    echo "YES\n";
+} else {
+    echo "NO\n";
+}
diff --git a/String/16-count-string.php b/String/16-count-string.php
new file mode 100644
index 0000000..98b4f82
--- /dev/null
+++ b/String/16-count-string.php
@@ -0,0 +1,3 @@
+<?php
+
+echo "So difficult";
diff --git a/String/17-string-function-calculation.cpp b/String/17-string-function-calculation.cpp
new file mode 100644
index 0000000..5715d7e
--- /dev/null
+++ b/String/17-string-function-calculation.cpp
@@ -0,0 +1,11 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    //
+
+    return 0;
+}
diff --git a/String/17-string-function-calculation.php b/String/17-string-function-calculation.php
new file mode 100644
index 0000000..f00623d
--- /dev/null
+++ b/String/17-string-function-calculation.php
@@ -0,0 +1,37 @@
+<?php
+
+// php time out.
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%s", $str);
+
+$length = strlen($str);
+
+$max = $length;
+$collection = [];
+
+for ($i=1; $i < $length + 1; $i++) {
+    for ($j=0; $j < $length + 1 - $i ; $j++) {
+        $current = substr($str, $j, $i);
+        if (! in_array($current, $collection)) {
+            $collection[] = $current;
+            $count = 0;
+            $start = $j;
+
+            if (strlen($current) > 1 && $current[0] == $current[1]) {
+                while (($pos = strpos($str, $current, $start)) !== false) {
+                    $count ++;
+                    $start = $pos + 1;
+                }
+            } else {
+                $count = substr_count($str, $current);
+            }
+
+            if (($count * $i) > $max) {
+                $max = $count * $i;
+            }
+        }
+    }
+}
+
+echo $max . PHP_EOL;
diff --git a/string/2-funny-string.cpp b/String/2-funny-string.cpp
similarity index 100%
rename from string/2-funny-string.cpp
rename to String/2-funny-string.cpp
diff --git a/string/2-funny-string.php b/String/2-funny-string.php
similarity index 100%
rename from string/2-funny-string.php
rename to String/2-funny-string.php
diff --git a/String/22-string-similarity.cpp b/String/22-string-similarity.cpp
new file mode 100644
index 0000000..6acefd1
--- /dev/null
+++ b/String/22-string-similarity.cpp
@@ -0,0 +1,124 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+typedef long int l;
+
+long int z_func(const string &s)
+{
+    l sum = 0;
+    l length = s.length();
+    l Z[length] = {0};
+    l left = 0;
+    l right = 0;
+    for (l k = 1; k < length; ++k)
+    {
+        if (k > right) {
+            left = right = k;
+            while (right < length && s[right] == s[right - left]) {
+                right ++;
+            }
+            Z[k] = right - left;
+            right --;
+        } else {
+            int k1 = k - left;
+            if (Z[k1] < right - k + 1) {
+                Z[k] = Z[k1];
+            } else {
+                left = k;
+                while (right < length && s[right] == s[right - left]) {
+                    right ++;
+                }
+                Z[k] = right - left;
+                right --;
+            }
+        }
+    }
+
+    for (l i = 0; i < length; ++i)
+    {
+        sum += Z[i];
+    }
+
+    return sum;
+}
+
+int main(int argc, char const *argv[])
+{
+    int T;
+    cin >> T;
+    while (T --) {
+        string s;
+        cin >> s;
+        l res = z_func(s);
+
+        cout << s.length() + res << endl;
+    }
+
+    return 0;
+}
+
+
+// timeout ...
+// #include <iostream>
+// #include <string>
+
+// using namespace std;
+
+// long int match(const string &str1, const string &str2)
+// {
+//     if (str1.empty() || str2.empty()) {
+//         return 0;
+//     }
+//     long int length = str2.length();
+
+//     int maxSubstr = 0;
+//     for (long int i = 0; i < length; ++i)
+//     {
+//         if (str2[i] == str1[i])
+//             maxSubstr ++;
+//         else
+//             break;
+//     }
+
+//     return maxSubstr;
+// }
+
+// long int stringSimilarity(string s)
+// {
+//     // soso.
+//     long int length = s.length();
+//     long int index[length];
+//     long int i = 0;
+//     long int c= 0;
+//     long int count= 0;
+//     while (s[i] != '\0') {
+//         if (s[i] == s[0]) {
+//             index[c] = i;
+//             c ++;
+//         }
+//         i ++;
+//     }
+
+//     for (i = 0; i < c; ++i)
+//     {
+//         string s1 = s.substr(index[i], length);
+//         count += match(s, s1);
+//     }
+
+//     return count;
+// }
+
+// int main(int argc, char const *argv[])
+// {
+//     int T;
+//     cin >> T;
+//     while (T --) {
+//         string s;
+//         cin >> s;
+//         cout << stringSimilarity(s) << endl;
+//     }
+
+//     return 0;
+// }
diff --git a/String/22-string-similarity.php b/String/22-string-similarity.php
new file mode 100644
index 0000000..6b4b921
--- /dev/null
+++ b/String/22-string-similarity.php
@@ -0,0 +1,28 @@
+<?php
+
+// timeout.. cpp
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $T);
+
+while ($T --) {
+    fscanf($handle, "%s", $str);
+
+    $res = stringSimilarity($str);
+    echo "$res\n";
+}
+
+function stringSimilarity($s) {
+    $letters = str_split($s);
+    $length = count($letters);
+    $count = $length;
+    for ($i=1; $i < $length; $i++) {
+        $j = 0;
+        while ($letters[$j] == $letters[$j + $i]) {
+            $j ++;
+        }
+        $count += $j;
+    }
+
+    return $count;
+}
diff --git a/string/3-alternating-characters.cpp b/String/3-alternating-characters.cpp
similarity index 100%
rename from string/3-alternating-characters.cpp
rename to String/3-alternating-characters.cpp
diff --git a/string/3-alternating-characters.php b/String/3-alternating-characters.php
similarity index 100%
rename from string/3-alternating-characters.php
rename to String/3-alternating-characters.php
diff --git a/string/4-game-of-thrones.cpp b/String/4-game-of-thrones.cpp
similarity index 100%
rename from string/4-game-of-thrones.cpp
rename to String/4-game-of-thrones.cpp
diff --git a/string/4-game-of-thrones.php b/String/4-game-of-thrones.php
similarity index 100%
rename from string/4-game-of-thrones.php
rename to String/4-game-of-thrones.php
diff --git a/string/5-gem-stones.cpp b/String/5-gem-stones.cpp
similarity index 100%
rename from string/5-gem-stones.cpp
rename to String/5-gem-stones.cpp
diff --git a/string/5-gem-stones.php b/String/5-gem-stones.php
similarity index 100%
rename from string/5-gem-stones.php
rename to String/5-gem-stones.php
diff --git a/string/6-make-it-anagram.cpp b/String/6-make-it-anagram.cpp
similarity index 100%
rename from string/6-make-it-anagram.cpp
rename to String/6-make-it-anagram.cpp
diff --git a/string/6-make-it-anagram.php b/String/6-make-it-anagram.php
similarity index 100%
rename from string/6-make-it-anagram.php
rename to String/6-make-it-anagram.php
diff --git a/string/7-anagram.cpp b/String/7-anagram.cpp
similarity index 100%
rename from string/7-anagram.cpp
rename to String/7-anagram.cpp
diff --git a/string/7-anagram.php b/String/7-anagram.php
similarity index 100%
rename from string/7-anagram.php
rename to String/7-anagram.php
diff --git a/string/8-two-string.cpp b/String/8-two-string.cpp
similarity index 100%
rename from string/8-two-string.cpp
rename to String/8-two-string.cpp
diff --git a/string/8-two-string.php b/String/8-two-string.php
similarity index 100%
rename from string/8-two-string.php
rename to String/8-two-string.php
diff --git a/string/9-sherlock-and-anagrams.cpp b/String/9-sherlock-and-anagrams.cpp
similarity index 100%
rename from string/9-sherlock-and-anagrams.cpp
rename to String/9-sherlock-and-anagrams.cpp
diff --git a/String/a.out b/String/a.out
new file mode 100755
index 0000000000000000000000000000000000000000..0ad0b52691c578fcf6b45376e0fc767a5bf70a13
GIT binary patch
literal 9112
zcmeHMeQaCR6~DHVHvMv(uCTP-sK*MFqL?I2v#e-f=cBc&^n)aYj1g`e+iBkB*pdC*
zCEd{4r9iDw7TA!&{;ITTnzTPwX=tj@)TAn+MPd?6V?ttR)fgy&vK8p6Ftzo5=e~RF
z=ND%}O#6=$J)e7i=i`39`|dsYL09)qx637%+~QtAQgC@tLDsJj^<Pq=#@fUR5frzG
zjba&)YCJ)uA#RnJFX+(BYqXsQyb4d7+XC9$K~-SR)iLK55~un~6x2nF|9+(<G8e+H
z0P>@@F04@^_@F8<AJgqPNexrvSHA?4U%gj};Df5b{Gx6cbM7DYjh;Rox6d7fL~@Xr
z=v2QYPPRn*-!bD<?p&cn@SrLbxdj*f+3$Y%Q9C~^`Ltn=u5YPvsnP9cuDdJlP8vh4
zEq5p54M`)F8*dnIYi($431riOX4P+sPqw@E9#A#$IQk(`o7dr?p(gz&a{lnN?~l)4
z-~Id(o8G<@5UyALN;;ZKo;M+U!sW7BP53H2U%7r|#g?wuyKkCa-2t&8{S)Zg3L1*!
zuYhk_0{;W>igD1uO1NhUeA^Q7_bq`RU83G+G~TG+Q;3QT{8D>-4*VTpbz;3Z;u}N>
zdbCdw<}qu=V|U#}bJr@QJUE(8$*dX8m{JP4`;hEO95k|KBGZwKX0wT`kdeMUGM>n2
zxNlEKGM!5FMTe3JOIKO*(B59N%}8hEP&AupiKGm(v#INlkigT)Y}fvsJ-z8(*#)52
zY)Pcz$w;i%Y-);)L^IONL=7_=iFI}L0NaKLMogx&W+o9Gjr7UBM%mTdiq<Z!qr<8L
zA!F&BS**<v=y!~}92<|ysF@fyU?54M`#%~rQeszkq`gBn2bu%ht#W_A+!koT;90MR
z8|&EGG~7VwkI03;Pr!Md<u(|2qdnqQJ?^BZqP3!hFz<W@TZdZ&w0@y>5L#>R(XXJA
zdH!e*T&)o6r(VzNa)>;&r19Hudz>vcoc9p2Z?xf52UD93x9>AS8&2;eQ`m;<txT!*
z+i<;AD?B`TsV4lR>ck4a2tPJ!R?lq%9G-l!<{U?~cwu`FObWO4;kR~E5G9gFNI8G8
z0J?2A$utD>uPV8nWa|3-tde(-OcOSLO3BS6(-6#`RPt7msq6DoO1_n3>hk;%C2t^^
zhIxJra?=Nq{A-Vd^M4CZ{{8a)zR3C6M(o((^Jiykh@Ec*n|lI=SB7ghbqaAhjR80i
zZWsXzPcC@F`F9R&JdJ3o+jRpoq$pg3@i79$z&YyWaDe4Aq(2Zo`VST0><teBg!7lf
zXXow<yIu;vcEh}>7;P0ttKEb+R{cl5@f_MOa&-sbIF~}h241Ru9FXf{Rnv?QAGq-3
zeIi%={!idn4E7;86kZ*eKMWr#W5#^>N3VtRxyxs0cxPy7&LwXY3TJ3j3g^$y%|K8A
zUOs2@$mbR&AHC+v-Es8Mg+c*sxn<_*I=J2s>lX$Q<P3>3w1dqJ0GqPB&yej5P3+un
zsM%;P#xwL_=z&na5IPX*>ppSY?bUt^&WVNqcyA<sHIje5>CNstsjW5Pv)4Uy&t5MS
z!jFAm-ooSAoqw-8f3*`43hVw7o;>FYfBpU3d$jPrH4u6@G!S|uB+pHi#{XliM-@#k
zO&8u-*GA7hL9~k&MG_S}34RUyVepU8f#<<Dqse~)9|FGu{(bOu=*%VXhr!nYBXS+?
z5w3BcYvbzWHB+wTKEmk?G>v#$$v{(Od(;Cx*}riO14p)A-%fA+?%Gw~tvMp@+i=g;
zZJTc;m~1e7q806HCLrYXJ?`#UvuqR<LnM71PZ;`p!HfEdlKvRrVd!tN>-SrFiv0^b
zgU}~P-|qGO*xl}}f6CM4^`EF}_ilNzI_zzHd|BArHo1JCH#p{P3wawu-YxB3KkQ)N
z?yXVdatZFo5y!rNQOM8f^AY%b1U}mc`0!mK`laTVvD?~-_E{n)r!x%^pFNH*3o2P(
zt3->wudG)n-M0o+X``0;yt6^eHTph9`wbE8Jw*SyQAiV?b_a=-?tE32%x91bZcAPX
z8=@V$!F(2}w_u_6C|xFIo!C&o_lAh~mRTj0_G8-9iN0ttaiKb>N{mlyncLl{?fA^Y
z^<(=|{pr{C*!Gpo^<LKU4z1T={_l+MvCfKK()0Rf&EM7hs^-h|dbwHi+cj@>tRs%Q
ztD|Fwf6IZPT*}P(x8pF~)X?0VQ)2U-7T|AgY}($`*n}YrWG6<==n%M>vG@p=j1;aS
zV<M1Bn~6ZEJ<?!C4{GUPDi;{a8Mu=gaS<SCB$^!&f%rrU@hom;EX|=rCTpZqWrBn*
zlSoF%L6^porU)3gtB3&Z2lyR^09`sBHKQVs7?H!7=x9QY#No@5<sqY)OmxEX;PSU)
zFhlg{s1ZZeX#~ViK-FSJ9Li=zAeJ5-O{7d7yQR1XZ)cl3xJd26YVNCudxTjLuPVN0
z_Fx{ob^Lyn<9Pe@dsvPy7nRnp2X8g6`*Qmgg5RHVd}Z-HE5}y}-fznB)#8+1m*x1H
zVjim;_ZIi5a=caq_5M|k`-*v(a=cC)uV}xvxbKzQe?jnmSB|d}bnJGL2fJ3K_tPV8
z7JNUn`*>)V()(FCUN8D9;-!2*xjpaBC6u<+D)AwX;N?W$0T)hb&i2#(?-pysm}5T(
zX#A7|4{6-_9ePm3UoWO`B_QJO(Xc8n9?uiNsb2oRkq^;xcwESg@b^f8_&JTIQomkP
z_Ui>*MTofGizrk45&hj%XJcTLPa&MYr~JJkze@2pL*YV3=Jd)SEK1a@@Wtav7M0@M
ztLzugdmmMd{yNuNLgUVH7*}x?ueYPX{bKR@c@p?qs=`4(SNIx1w_qavzWr9?K|SwV
zl~#xsfctgX&R$*ue@n$#{QkbJaC-!+OnJ*n?Yv_NJfv}-V|@+-_b(1Feh9oyl=h7(
zZS(XJ_P+-1t1zCYDUQ2d(6!!9FRJ*Z_muN?Z)$tGFWYGj_*$$(N<R=K)Gy9qz<tR7
zIpbI1AVm1IUgz3etN>nd+%(?k7@xF?v$*|-l>Hh(c@Uyz^((~p6kcIJk7dlPnHwGs
z#E^^I-O(evBfWjdM3xec(j1jBN;zf)XBusgl<~AYm`o2vlQM3mGg%qUjSGBH$C3#%
z5f6NAdutmaS1^+FZMVME5?|lUgs{Ht@!aU>1YB&Aq$5F@X>)S}PAEp|U_;gzHImVc
zVNL{MV`D0v+1)0kkyghD`A|!fr1YYR3??B)G-(`$grsXU6-QnbVRA7gHyVbJySn$a
zhq~dC8<G*JGLlm6><R7Zl3jZ{DMhPBNtd<tzMVUJyO0+RwRd-sMOky><$y}{3fcM1
zy`epk4nfBdEB#qYmIi|=391vHIz<}G=G2G@w*C~EV|993B1>Db5-Sf)z1C`-h?TOG
zvvp_|=YT2C?1=tfQ`q~^qqvchxoiSsMW(#Y%5&Y)K2{Pso)OAmQ@Ytvsf=gSas;zX
ziE=B?OoM2x3yG5-k0i3+#lh#ixFgnQPLey~B-F9fT2`td`u+T08Qu4=B^UR9KBw~k
z`}n@c^^mQdz6ycvSlG4{@p+d2pXS#%Gv0SuZbHHC&*xrK2i(ktnmheFfnUX)jO(9v
z2bJZt2Kb&=t<ciFRf}RT3Umi$e?CWF&_J8+Fx_LR$oI#3l!+d|gDtY?Up#N?hVng^
zY>AxX_Xse$V{-j`F5jUW%qKi<Kie_?4*coP$}*qd`?W(5dLn8+*>L*_BRY(Sn#%rs
z&Y#x)ON}4*|Csh~2Pfit_XX`gt57R1Kxa^{pZ%W#Mq@(lBjS6*aSd?)Ev?m7E)&n=
zvHSD=;*|EEvKyo9(=zj)I{f+E6Qo56`p7Y1>}P3(_!$cJ`Z=%Cq7w_8UtoK^ELapL
zwLgEu`Cb#$j!t`)ng2@r^ZXV6|E&Exi#1sV_G9>W4u8HU9oPOXj{fufvHvUzUOe;;
z5b=4H|4;24FQ@-2@TtYa{(KIup`akAy;FVzHq=D+=lhNCQ~JLJUs@{c&-b``?SE1C
zpVueX&;5GWQ9s}J7N}Dowzs5`%=r6I*xO&c7wQW7*->-$V}8Zq&-cfE?a%GxFzm<j
zzfmBJ`+r2AQ%AI8y<`6U?5H_iG|8mVfwO;u1Ltte>!9bl?WWJ_`fJ!wD;=V$o7cYG
h|0D$lUDgx#Wt6Fn+<)GGXqi{4e@Yu1bts+n{|8#mbv6J1

literal 0
HcmV?d00001

diff --git a/string/13-common-child b/string/13-common-child
deleted file mode 100755
index 1f2b901e141af180d281d4f83c73823adb731071..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 14104
zcmeHOdvH|Oc|W@=ka(>YjBO0WS}1nFuGU&1upFoHt{!lgE}$ZTsbhS#+Fj5FX;;<W
zC4z}toVBQL<+YW>xTG`bXgYn+>7?Y3)TQazNQOa#b{gUMK^-Tdu9MjXKSb?<!Wg!{
z@7!~)?yhz-wmaz`9gb%2cfQ~GUgvSoJ@?$BKWYtbu-j}*COi8QBW`4#k3+_lv7PsE
zR$z^64)d`Zww%odG7CQ+FCl8=B%KnbC9M*24$unx8tn$qX!r4qq{|H$9*iU-Buf6K
zlTTy~n!m+hC1uRb0n(#bv!CNEXeZA|Ix6CDna16`oM6(cx|6e@ojfDyqzFt>SwE^9
z{W^r*4!aK=@jfD~g<q#B$x>?jg%+WF!y?Xt`glgta(cf9J&N;_CYKQ0Cj6Camn9;8
zNkw(peLb<R^$qv+L~46t@zg-=K;!z_^$nh6!c))dP4-E4<Cg8*lWa#fII7=b{AdhN
zc|~m2e~hp4u1Rkk?T+4CTXS^9=Z{m_Li}XEG3K(bur0O`MomNAoP560zT)~vb5^&$
z7F>K}e)Imo-WLFuOsf!pXwrgmiql<y7)(tWJdS`$*?AlCrSR{T@jFrmUt7knr;Pm8
zGV<5T#Pe(!J5Q96|Hm@*-B-p=LmBzM2fmOkWuxv+cw%e`cuIeRAGKSjm~RN96vL0V
zXA!;>e#y>-6`dr;T*A&bktg}SB6)^!n$#lUd+(*Oxt^)&p58=UO=_WjO;wq?X`i|+
zx+j*@qW#T1p=2_eWNM&evl@x^3%Fx*b59~3?Fe=CM2)i2C68=r*BWDqq}mlqMjHb0
znAYNL-N#hmiJoL@+lFoJiFUP>A{ZD@`=b5HL_E|J)Ap<T>LAswHALf)o<O)=^LoSG
zp?+2C55=@(Al%xz4cJ<kjfK@jQtOX~dIKG5N1fW*z8+PW>9|=s*6vr;@W6oA>#aA`
zp&g6wDdnU+M4rr$Kec9TptYA``Q7$Ut-8J^8sDRJ^Tuk|)`nwo-X8s^`^?5L;<U5~
z`p()S_p95`5oPM#-k`RxQ#-tBEBb+&Je){ryalO?Vmwz)w`?rDwK2^0gu`l*MwyqX
z+v8u2#UmJ6$y9HY#$Z?uKa9NaUNzjkSKS?o^<XrF2SRE{iw?vPh)R-TaQ24K4jY@B
z)wP~FwlNrJYF6t#4Q8(1vyL_I-05!$s9w)n1Kzn4!VR8!ua%{{1UC(m1GIwAzBIc!
z@Eo<{TFG%c@^(DwZ20SjxSSW;?%qF-LFR;E0;P5~D9Y<#WpOOFfS$<X0!uB8&7m3o
zoGI^sj$sdk{rK2kJYi?Ep9=XunEF%X94sq%ZOu3F2(`1TLVv2JlhpV#SU{YY^9Vhz
z>6svtoEHeEXN*is#Jp1pKuj6D$Zf%`_E%eQ`D`YIIty+t6@WKdaO-o}XTiz0Oo{~;
zOBP<#X2H>rX4+}N(IIB)wBYkil(B9Ljt(+Yp9OcCC}RT_oX@+W?4Sj|)gu3t1+TW?
z!xo&zkW5PY-6~~h*5IvfrVNg1v$FJ{Q_`oZPD%-b=GXN@B!8ENYjuqeIpVviFn1x3
zbk|pir!LG*aK4Lp>bl%0=N}>7LHzePzm0h6!rTbwHxW-=mmB7M6Y<n#xr3bl0`b&U
zxjxR<6Hm*!Tqo!6A)dM>*T(sk#Lp$($N8niQy1mxIKPN^>YALJ^K*%(F3Gt#ZzrC*
zBF8v?Z83Oi(%j^YeBS$BKtK1GqQ9-A-<fRd2#k-q7x|bnKK8wZM8=<=?_=59q4?46
z>KZH#j~_z^Y*%WJf+*=Jr=tI2-?HPd#+!ZNt`k&{zX0JU31quYQY-KFNd6@%->y9I
zJ~uFS!vO<|KB<glA5v_mm2)?=TTN^8q_yfA*fIPc{GD&#=4LFla61&UaRj#O^sGaG
zY#(w@Cm0scO8Oy|nsw=0&@+u)CWZXOuG|6WP~QKre}{j&zoT7w;@$IzRDUsu5=H+9
zYUYSCRB_j8po-pl#yhI$7ZiPP36*DB4=Vb2wgGL2{0QY&8+qWTPmH2^*@p?xUpC55
zEBYJRR#Rj=`?uHgd3`VfV?+F!9<?b)l#BwEOg9hVj6#?`NFAn(4_1L76sG7#L1y_N
zu?5<F6gdqjDWnh5@PKxssXZyo(l|lEYEcjz;-bN!42cHyv%#UmBoZ9@4v7S+kG&Gq
z&x4FAnJ?Od`e@+l+luWCMZYF|1@zPY6GnjCML<90f06j0ehq4`2K6k+X+wK5aP^&O
z?Mxf$X~b21>}6%_f?dh9IgZnvt)#Oy#Wrz*@;@MJ%GImN-cgsb<`i{DdenhIW9KUR
z-~a+uhBz4~S+vzzCH=BZ8GGBV*w7Oj@))gotxnNjSM(n#>3m*ujq{0ANuRDz(jV9^
zT~zdc0|T93Lg&B8|E06zgO9>ASsdcI2YHuOXHH{=7$593%P1$y{v2h7v=W{$1`M2z
zXAgdy&$m>+;2z?7Mi~YWFN>h8`UU21JXQVN=#!&bSkZs3jD27??6hQjHbX1ZXA9{6
z9vI8nMRkV`lWQe>cIYrgs)S!bTc1;GXNM|=Gm1?}Dd8&t#8Q3i4b)7ZKb(7?w^2zK
zEu^OZOc{IM^p0LK8rSp|2)_brualp}!vX!xz}Q7dQz%xamxnS&P(MUaXBFG!p^B#-
zc=->}3!mJ4#qgzCQ=U68qp{XnMpH4Y3>~K75C~rmgwFu}5&Y^Ef0E|W*>Y{T71O*g
zZ8?7Dj$N`V`kS($GMj8ehw0`-OG5b^ni01(J@&H`zsl!dq8AD3%<#2*{-0@FC}I|<
z2Y~!RD!iNWLw~gdX7uyQ(5^EPW$ki4pJ?@$?p5@YQt3KOUcwwm0M~pMfC3#D@xw@#
z^O@-RFZ&<$@A5z9S9hJH$qSD=m;U(2dTJ{D_{X-?=bw0dibiSb&J&kcBGMhO@`Djf
zMK2M1f+6N?7qH<Ua_yH$_5?;L%N|3Bm|M;Hna_%Po+id%=B~TvyD?d3YCWLs0sTrq
zf6e=o;2LsYrHoy7WC!6^8GKK>Q_k-}{bEqR(gF+l#cwI;lQ!jnOR0<WApY_$S%s6s
z)BZj@i54Vl;!#cOKie|LgFXaD56MU2;AzkvME@vg7aHYN&>F;Dfg0=rT?P6z&=$~l
zL7xU)3>iwc1KXHwz-3!Dzp`rBR_P*~_I#>f?;a8mskA&}t58nzXRhY+{9VxL+TdKW
zse0a5s}8b<mOgmT+Epvb1j$gc9cT-3kChI3Rdg7B8T)ONk*!1U`(g!Fuy5VsV}7UW
zkiB`q?6zke&s1b)Jv}>J={Q<}NDX_>LH-tu)-QpYvio^4_xF9kUX=57lWEH+Z$a6s
z_|>623d)+Cu4nB{&Lz({TAl7pMU!*&)3X$3-J#ivvoT${)#>YVHu{})e&^~YryFvR
zZ*o@gc3h73+zC6@^(&do=WR89taLWddUg(bELVA>iv75X@;|Qv`j>NXxtVUZz|9u8
z*#b9P;ARWlY=N6CaI*#epSD0B_K7Hc1KUQF+62!TT(E@XshIMeHA^||{ZgV0ElS;U
zeVocY##PvzqI3tp;sr*0XI&<E+AW~8)F5n1l*{!wZM0GP?;H69(Ia*r5%Zhxg$je0
zd#n?7gQpERN)CrX<sRu0gJsseOD-pHhL<o(a_xLjG=O~HkbAbbb1BrP%ExmO9}&Ea
zTM=@!K}bpZ$MT%l$0g+P8pL@KE}InmJC#1J_kVSf-?5AR{k7=V7X&>m=<9<1QqU`c
z&c@3WrP~C(ThR4_ZV+^bpt}X#C+HzTpBI!Hvs~~Y<O}ZA+q+V6E#+S4srPtm>+4gT
ztzTmR?)p0KI&Yn~jxkSif3Ftm0@eBr+AVXjI6n3DF;6_9MLqa>Qmcjb2yRb2<>^Yr
z@J%}wVIJbTL&<LDiR_QVo<X&Kqhuex-^CK~0!Bqyf3zn=3L@9nqcKkm-vXHjpLlTH
z4F+Y2NJtAYPqbUz-5=_Ws@)OjN)ATxDJeP-j`nFP!pC<<ZbJ?A_lNcyHe~)QVJO01
zs5cgdUIH#~@o>L}kFI2rdBTa_-e_F2G-!z|eW_`*`(~8TccYGyxPxgW@e1?4wHl)@
zPV#;&#Ah>kUl-z)tknJBU{y@sM}_ipn7khg@ww)GTZqpy=dVJ1J{uO}x)5Jro{K5O
zolMSqg?KfqTjaAsJnz8QHF=)HTIj%+tbvm9ix_Q36ekBxLCE>lTIRs6fSgwgam<3)
zelJcAcAI&w#aiZIw=?<utq{koCg#mT{0?@cBtHG!zffL26{b;|ek<5zzN0&h8qXUW
z&EiGz({sko7O;t;dBY=cSJ89MFYw~$-^0Ldcq&b<>_l$*dAOVBXSQbsIQf;&RnnpK
zZTxH{`sFzAQuX>*F29t~J|HEkKc%1GNA}yr^P2B50h<Q_!sT;ZKG#UEl>HhM*f6fn
z7mc4<j?ZjQm?>%J0WLqY-?x%u)VFxNbqc(Ad?vY_nd9wiz};9i6px=j243pi$ajES
zzf)2al)lgL1&qFuQIgN~Qvx3m<K!M*%GkdEcZ<B0yjcc+pWB&vzkkGWs|6$9f&faz
z87qT7RR;eHi5HD?`tI(Y>6ZPclrJi)#e!oYo1T}j)ydNrfxAWCN_GHumFSl+@KW{q
zF4?!=!RYg$HT@IeCC=?k2zlBJx2B&0UxaZ^pE)T-`IWKvfV*I)*#57$yb!XGTTwxh
zpIX^zL9zY>UMl{^GWg#Ky!f2bhur?m`d$<A#pjWhVbisg-?e4%$2q=$(RW@-v^P!Z
z>l`of{0jGLNiDT|w<nC_B%7MIslh;d2TnRoA81mwUNuZdnvzVOWU@f28cC>odJ<is
z9yOvR`jcuXHNdcb=<A7U(TL~%b?X~pxrC5PYa3%-qGGMlzn>Xvn@Fm+cRy4toJvcg
z0#WbUT3Vwd;<e#!tiU|szCM0JC)lW}u>@a1sgE>xRXQA_;T#kpF&v*d01oH5LO5&_
ziDHeH3Uj_LhQmA?gIk;YL8zp<)PTy*)2Ql(ZT`)zYU`F3I{n2PNaTg|)(solTXDL|
z-xO>miGoNYg#bTA#?+SI-{RjKXlAtDG7j(X(CHwP&&N;h7zcBv4;mH0#<8DpGR2#a
zNgJQws2X2R{x45m6$C?vhsvBNE09A&6rEKP#W<uyN0Y4Qnu<zho>!w&XGPY3-5ESG
zQ09QwuRWwy;DT2)uoZ0`iN)1aGK#(>r}CC4Jocv+^zCQxKckA=zX~sMEXw0(1yQ0M
zBgur?jqy#V52pu;aYv|F+?%7N@MPI^qc<?zj;LMHLBt|IaQ~Y<a97~Z7-paK%wvHm
z)Q-RClsZ@G^I49_6&}ii4RN-P5BE<yp6Iw^K^RmcV~XKjW6aW@{YooiEGf+Oi+nGW
z=jG*oiS$6S*7RFoXpaKR0G{Ogn>>&17Puthu_9UKMb4@(-}5wKaFr=(WQz4$0AInL
zhV*~L?&E?-1klL2>3y9l!Ar6Q8QQ~<`trSTLI5s7X&;E{F7>fO<!J}5SQ41}^8NCH
z2vqJ98Pe11ZplA}4DHcK|METb9kKC4--{{XG0c;clXNdo+VhdTd|!2mK!=4M#ZPg{
z_yx=kAVZ-_efeHHA_Ns7DE&))S^p=6ev^=s`&L;Ycu))&(x<(=V*O`;k%-)9lly%9
zq#JO#e}^njqFE)&bmXl1@_l-Et|7v|)tl1O=R;ird#*@duG>e%#@^RuU_xH%Nt1t8
zq%YskSBb^f94RPhar`4fU#`{UdwiV$isdCQ=~1CC`%k{_%m3?W5q>3+dXlGqWT5tw
z`f^`jK=_Y{{*&^u|0F+(j8$LmAG~#oAwlzlH5Hj-ub|M0AB{~)@;y%epGa|g7yJJi
zbgJ=_`ttp7>T_gmdb}CjO#UJYC?=_IzW3j0XcYS^=0AX#ythb0?sHZN{Yg<_IgF&f
ztk)EDtp4Rb$W#qkn;Eavm-IShtor7DiJP>suWb<XD)l6t4P~pod@nxYHdJJs(ty;H
z{Cp@ACfje+-N}oNx;Zib@5<m96R>32LgBy8M2w8ouPwqUR!WjCL|*#l1>*9W+sG`H
xf&wpMxg9z7g$O5;D-7;}n1`u5=~*S~FXunHzf1X_SYzlvB_~dUHRBd6`ybc)wCVr=

diff --git a/string/a.out b/string/a.out
deleted file mode 100755
index baf813f93d2962b48bda656f7c204796a15aa792..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 14208
zcmeHOeQ;FQb-%l-FF>po1#FB7S`(9E7_GIEz`{)J)yIk_M|>1XHu=C$%kF}<NV}@`
zEf$PP&B%7x3Q|o<Q?;GWFq0YAoj7AUO<YehF$*}zcHEY@HugAfM|I+k)?i2eD5J*4
z>hIil&+6^dZfYl!|8!yBx#xG!IrsD3uXpsP!OnK4!y!00#a)89$t3{^nNJ}yw@X%G
zO=6J<h#Ik4lmRKlFCbHhnlYv`$~4moCFcSy!LP|_0!_|<j4)ko!pOl4TtcFh-&_c&
zs7e2=+GLpu;gtaCQCX)xFImuD8DaXIDu*X$+$+-wCcTO^k_GLR5vJ3sU`)AwR5$u{
zE4$s!065|UL`0i>&QX%3u<I=&Lh)aEBnujl5vH9cESR$1A3=}G`DuePFLtZ^inYs1
zReq+by5jc!*uKq;xA#YC`(yFcaP4r@=Gx7TzGT8zFY8VANp{<g9$6%AM=v-k^K$%X
z3{d*xH~s6?N8bNv%b#5z{Z+$@`qGcS@miYFs4KbOgzz|TaV&Qb_Bs4WKl$x)=PlPi
zT(my;O6T(N%GSdj2cH65Fl;~p)X>OFr*eAp5R<7Xg8x16LUs%kv=Ba3ME;+Ol;^P`
zcter$G!~KHSwx;1v`{(!vWT5yMauu<B6c1uV&~2x^4|x(Oso<aZ!dBZVkLMA-@}i}
zd0Ndwgi(m$M|i-7dyy~MnY^VJsTeKF&bJUJ`7<_of$^I(BH@i2Y0PdGx_)3F5!aJO
zXvolYq2F^z-yJ;=OB&Ik*8Wg38BGekqkFp^i4G~adwXktA|CAy?dy-4X@yh1vZKpr
ziY1czzECpS*b$EzZT{dPp#x9!Cxg4%cXuVa^dOaBcvv5d4kZ)uP=CxgtRJd_R6I0*
zXP40!jYs-B!d-^nAMOhc>BdkfW+Xep!QgIS4KN-H>xrZ>6b%h@bnD%9da!FVDl$L&
zR?gnIL)XK@!+yWN-c*NnEPkL+CS4)QDOd2%tQi{)QZ;sbsp~VVZtjo94;X#2$-0b&
za4as{V+eJh-xy{&EiHl`w6@3{`fhYbk$QJE>Rp@kZoeKxZ%~tm6DdQsAazts#)|0{
zEsJbz47LN|u%4u`<`;TT{DD|Jf&rFH4Mb@qhItTT{Dlwd;l6|V{!pwRV<J2p(nCgc
zIEI4gB&mkzKnU%yt+iEe@YRWJogFQ$dcChP7pwPe60LjoG`Do<eqVzL@7V+4Mqj<(
z%F?@nS4Tcwh?U6MnPy)X)>$W><@h<(zcNf84iSd}&zrlxczB6`%uh@sNOg))m0kxc
z%VV*nv||5@!cwbZi)aOSH7D<)DM{J`5&!<=L9D=K;ulK(PiFoKF_(B(@y2c6!V>Eg
z*OmTEO)sg*HCjQE=lO(|b9(<d@ccmd3I;(}s`;lJaW!?wRIdfM+Fx(Mc?~9oIt!lL
zN&s)N;MR3IV8JPG4w?n$Jq4xhvf#7^a@b?R7c&UjYr!imc%KDF2j#+`1$XCAA%-n@
zl?8vug44Rp;kX6AfkDtQ3r=H*!?*=s#vrIRa<xJmE#1DtE3`*4M(NZ>2|inK!4#U^
z)Pkhhb!~W7)dUbDzK;^Kld}lx?j)YNG<!+%^~6(GW;2rCK)j3iGm>9RJauXIwB%P2
zPhFWElYBMt)P>oHB)^z=>bmTp<ekJ*mt}h;|Lf)8G3G^fm*n3kp1LR-ko?=k;~f&&
zI?2CDJatvpEBV)nr!LBRB>xie)HPWl`4@<%F3C=R0$|;F;;Ct~li>aDbfkZFzm|Se
z8~Nq*uI`SB%q34iXcOmpC7HNf84y!9Lhr-<RW)rwJpIq;h#sx>42U)|<JQt|9lH5x
zSd-1aZ0}i0n4N_1!vu=G7pT?u`<Q=*(tEUH?@9ybK5@Z-mY&wmP2H_IE^0sf#8{ED
zwuG%!)xeIK|3iQH<r}<0q?YwSaVn02?Y&sq4#@F=%;~Ja23#AtTck>_`~~!K#@-`^
z*-Lw~N1#LTF74RW<0xVJ#}5M0(m$Z?iD;uG>(&F+(!nWzMmrfit)(ZX+R;*oXDEKB
z83%sxYzCE?iV=`LZ>C?=(yvb4mlK(o`qA~-*>v#KXz<iX#-WXCKZJ3F$trEjr3cEi
zbCa$s<=R9BdBe!W)PoR5-s2NNDw{CXwg!)X{hra_aj2hM{u9Er(IDchop!UC8aC_9
zGrLZjb&Uj%JFa|pB6z~IePV0yRMp9C82l5#F%ue-&_+O`!4q2elGy^6sc7e5qw1-Z
zqrou~M{7v@A0#fCE>xY$Je)E1lH#~VwY3)3aY-8$qdm}lNgFxu(9XT-)Et*adyvUX
z+R4gS%v$w~YmOJR(dyCd5PV)c_g@ftVYC_wX-}3){ppRLT<tN1|KC!aw-~LQYhK55
zRANg(o>LXBrq&T@wC0#2`#k!3BzVG+{T?Fd4qG3oYM-K7swxW%99m|k20xmeeTFu$
z)ViPhcy{(jvJuocdlRWV{w^b)eoY%qO+~bZMma!@`YRi?^aUQ3--pB%yi5dOXiiLh
zht#2i=nSGJf9zQrRbSnEfnESiou2g3kJG7{k)t0wQh#vl=*;XaUad7}-&>2)RYU8C
zk7Iy8L+n}FP*1G^Huk*KeuiYvq9w%ClNh_oWcuigmQGD$c+QM^@SGkMTh1RXqu7-a
zLh&Bw<^q}-n(u4Aw>drA+|%6Md2-#MrCv-9Cu_eB+SQT1){%b2|MSk<sHhd%x$CZ}
zrN2h49(l)D!}CdJ`t8p2wKiCoUH*nPa>1c(xsrNY8+o?kt9zTj*1Wg*{$~Bc*j%0;
zT)@ji)*ykX+>bbJc5T%VufXq(|DByZ1^O{Eih#b48ovSh0ebgV)Ygx>wt=>TmVnaS
z5dpml`UL25$Wm||*)1Hy9>>j<<rQO&au4BjS1|^=8%RKf!tz4gigc0>pgdmK6>d+v
zd*wY<OCG3rNZh?@>xPC~*OCd6q2M^Ot5fD!?xLfN%goobL$=(ghr@-P)f3fdbhqbG
zXY0~3ZN%mJ(1{Y7cIf@0*=;=;WSOu`miasZcmgl`UDou&bLlSve+%g=tm(VV^fq8u
z@$<lbl+s(=o<DcCxL1DD6?A(~mbAFnpD5Mbb&r;5?xvCQo$kP(yQ$e-*X&;3;`Txg
z@-6NP*}jcvk0#i$?zhM!YFKkSR^qLtua%0<pO#FNitm(C{K-<F@6cl*EVRHv3oNw2
zLJKUkz(NZww7^0OEVRHv3!nwg;GT!V3S9e87*o7t@Sr0I1v{m?UMo&_yA&!-B2F(3
z$Qa)tzO3xuq|*8O>dlJhJHJ(mpHbgo`J6*%Gz$Oo$!vn?xHCW`_sw^v#N_!7^^()%
z`Ob3@&Oj9CLXE;oljPm?5~Re0@b*dxK5LAt2H<lW-^t!6rErE^6p%5-GZiM!<<^uO
zUHDPp{BfL-^{G?xI8I8Q%Q3BZr%E@qfB#SZj&0BBvg+6WR`i;pWjK6NxIxh`D!N(G
zc17=1bibm96n#|DZ!7wkqE9J$QPIna%FHYeeDb){yS`^%DsH5_n|$>?e{FqzO0xC0
znSi&x&cDfD=dTmOmpnXRg!X|NLniIxSS*fDdxOFkPZ&`jzLV4%p#zFL5KsB`rDFKD
z9g7Gbaebj=pYTNv$6?Q;#*mqE2;b{siFh8PBW)<!A0h=68|*iPFNSY_!iSGJc<u*-
zv_vFigoH2Jr|%yM4Mg?62y~f)QG7It4u_+IhK}OnJEOFrhlYkihfNzC|Kl(ekzZ&a
z7KUB|S>WN5`I>p`OD2UcoER90#tln@7KqXpnI>moUJ88&>Mn@8gi#PL$-Tc;WAtT-
z-`jk=Oz``ikC%%=?}ZCDI{ZH6%P$iAUgqPAbMJ3Hz9ct~<>QqiqsDzczBK0_laIRv
z&wu%Nm6%lXVm|K4`FG^w%S7F>fEAK)7rtcC^^QHb;1R*|tToMr+Z3K(^KsnZ;2PZ?
zT;hhDe~UHEC2kb_oh={7?55_=eEcSHx*$IHoj+fmSBE*2rr{Ft9_}FX1Fbs_n$2zH
zr}f4umI{w;UGph?mkn=LxP2YGPugE4rq}i&Hn$$`m+|@Sc@j9~d&Xw}uciF_et8;r
zp?cBXngjj|bQep3>QCY4_>uirs{+KrJIf49AV4^;=kiVtNu*cEehm^F@Q`@iHhyX)
zKEFLFmqK>7Ncs8wzLPS>IJA$qUWMDoXHwdkKi(b$?iKUL&o_V<@)P+x;MJ71Es$SH
zHQI;1c2VH<{aJ-is`X`qOcmm%z`ZJNC9fC3-<5W(l4jh2jH<=_d7xb4^X2a=f*13n
z`P(A$KTx>cFXnaN-uc;zYenn?upwC{=H{ysrMnY&Av-bPo&x=K2za4>$&h{LO@clT
zTEmNk7x3Ttg_5Ta71l5focgy{^{>2hCIJ-K13Py6mB80ReuI)<uZ*n)UZ|XRDLXT3
zdzGX~T8qesir_CRoIV3t!)jbsQ@h#A`32xq9=pF%o5HO&DE_q~_+t`ZD(L$z1^PBX
z;kyzqu-=7-jHHp;zuy;zqscw3yY<eFu5Nfj%{e^j#(*9sm#3s)PbUkc>yd<hpg*xM
z)UQX3#86TXrG^Fe8-x8(BO3ADv1xM?EEf>cX)k2%V|46Ih7JpJFBC})3>=1vh0|#Z
zl_%<NsHHtkB3>Kr!;Z}t9vqauJDp9s9!tm_m;RMTzfNv520Ww)iNU?<2srqAh2Vx0
ziDFNf3QN8&1~;E=ojY5aJE4-=r+4Vm(?-|ZcQ<bj>cJgt<Q*m(NX3=(&i3}MApEYH
zTRMXzkyp}4J|Ml!gx>b$9nIT2S_SRTOt&6cbaHVD1f)-o>9RBDf@FhDhoEpWC7V#N
zjZfjqMs8&`V{%9OJGyA)nIuo6BJO8-a%dZyW0OjTM-%xmS)HJ4Df6A%$VJU&{WrPo
zk%1!KV879$D=!OK(T<&H{zxpYr;<^0H)YCiNxr9`p4Z*KMgH@uDD&5m3lC5BUCS#a
z+A)$$=zSRS<ghq5cFdPV$N7K<5cC@cLc<-g;O;MV>s|Hq9~$}2X>(oCDDd8*&Nh!m
zTkbIW`}Nt&%g-EqzpdM3o+;E$o}dajXa)inFS~rdKG;z1dGaOrtfP!PCi99xH8STS
z*<t2%{yRTu=Z&pQZhyq*KK9G!dl}A%WUb)~VCXIc+X)%?e8_(9UWGHka+nwV;H>(5
zjx?0PTl1vl@}7sZfxCvg6V89!8IbAY3TTqt-2G97;+gC~gzk!1pU<V26tG@Vx^JSo
zvp#mfGTe(NEv>B2=hqokQNE8drA-?gCwf1AbQi?>e9m>MjC@KM%eD+TImI6YrMo4@
z`8-^w^v9GOm7mJV<yWvcf(R9r_4(YKQG%Kh<osEm>;JIQZ&7l5KUT5G1o%FU^y%zo
z*Z(FkYFEC`JH0pnPT)K)33hV%K{aa*Oe1F1&nW$j()Zd1tVd}wJ!RA9bHSv#Kz!ep
zA?tAg{>G-y=l_?LplSvdmu;P65IKz>6_NL#lWKoDsq}5x=kytWT<LTF@!yH?-;Z=6
z-5OYrG5UiE%AfW5-l0x8VbXcb8o2)$%OGOa=lh8#RE21Mum+ns@e&f<_|e#;z~@B%
zdlY+n+w=cV=v3jy`h5PJ`8-*h8*e5zpMM((R3_HX-7BmyHSGD>`Cmbd-!0PM`_u}h
zKdmav<D2!lUNg|K=Fj&mGxP^22rO@Mb3EhMkzm!&-N$%MjngK{Jz0-w8I-O1d~b8w
zYpQTL*#PS?UkPQxxcxHTUYT^pD@pF}yG%|91v4v_K_CA`T@EoLtY2%xNtOar8m64L
zOi+*i@S2fTEU0iBEA8;uS0a+k++uPbRblE*KYm<)p8x3mE|h<Tx>)!}o;Xc&xpFI3
F{2zJ6*+2jQ