From 4527ba6b440421484835f41277c85b008a3a552d Mon Sep 17 00:00:00 2001
From: RryLee <qq215672398@126.com>
Date: Thu, 25 Feb 2016 01:05:38 +0800
Subject: [PATCH] day two

---
 Implementation/1-angry-professor.php        |  20 ++++++++
 Implementation/10-the-grid-search.php       |  54 ++++++++++++++++++++
 Implementation/11-cavity-map.cpp            |  35 +++++++++++++
 Implementation/11-cavity-map.php            |  23 +++++++++
 Implementation/12-library-fine.cpp          |  33 ++++++++++++
 Implementation/12-library-fine.php          |  21 ++++++++
 Implementation/12-manasa-and-stones.cpp     |  31 +++++++++++
 Implementation/12-manasa-and-stones.php     |  27 ++++++++++
 Implementation/13-acm-icpc-team.php         |   0
 Implementation/2-sherlock-and-the-beast.cpp |  31 +++++++++++
 Implementation/2-sherlock-and-the-beast.php |  19 +++++++
 Implementation/3-utopian-tree.cpp           |  24 +++++++++
 Implementation/3-utopian-tree.php           |  15 ++++++
 Implementation/4-find-digits.cpp            |  25 +++++++++
 Implementation/4-find-digits.php            |  42 +++++++++++++++
 Implementation/5-sherlock-and-squares.cpp   |  20 ++++++++
 Implementation/5-sherlock-and-squares.php   |  10 ++++
 Implementation/6-service-lane.c             |  33 ++++++++++++
 Implementation/6-service-lane.cpp           |  32 ++++++++++++
 Implementation/6-service-lane.php           |  13 +++++
 Implementation/7-cut-the-sticks.cpp         |  41 +++++++++++++++
 Implementation/7-cut-the-sticks.php         |  22 ++++++++
 Implementation/8-chocolate-feast.c          |  26 ++++++++++
 Implementation/8-chocolate-feast.php        |  18 +++++++
 Implementation/9-caesar-cipher-1.c          |  30 +++++++++++
 Implementation/9-caesar-cipher-1.php        |   6 +++
 Implementation/a.out                        | Bin 0 -> 13200 bytes
 Warmup/6-staircase.php                      |   2 +
 28 files changed, 653 insertions(+)
 create mode 100644 Implementation/1-angry-professor.php
 create mode 100644 Implementation/10-the-grid-search.php
 create mode 100644 Implementation/11-cavity-map.cpp
 create mode 100644 Implementation/11-cavity-map.php
 create mode 100644 Implementation/12-library-fine.cpp
 create mode 100644 Implementation/12-library-fine.php
 create mode 100644 Implementation/12-manasa-and-stones.cpp
 create mode 100644 Implementation/12-manasa-and-stones.php
 create mode 100644 Implementation/13-acm-icpc-team.php
 create mode 100644 Implementation/2-sherlock-and-the-beast.cpp
 create mode 100644 Implementation/2-sherlock-and-the-beast.php
 create mode 100644 Implementation/3-utopian-tree.cpp
 create mode 100644 Implementation/3-utopian-tree.php
 create mode 100644 Implementation/4-find-digits.cpp
 create mode 100644 Implementation/4-find-digits.php
 create mode 100644 Implementation/5-sherlock-and-squares.cpp
 create mode 100644 Implementation/5-sherlock-and-squares.php
 create mode 100644 Implementation/6-service-lane.c
 create mode 100644 Implementation/6-service-lane.cpp
 create mode 100755 Implementation/6-service-lane.php
 create mode 100644 Implementation/7-cut-the-sticks.cpp
 create mode 100644 Implementation/7-cut-the-sticks.php
 create mode 100644 Implementation/8-chocolate-feast.c
 create mode 100755 Implementation/8-chocolate-feast.php
 create mode 100644 Implementation/9-caesar-cipher-1.c
 create mode 100644 Implementation/9-caesar-cipher-1.php
 create mode 100755 Implementation/a.out

diff --git a/Implementation/1-angry-professor.php b/Implementation/1-angry-professor.php
new file mode 100644
index 0000000..b9f88d1
--- /dev/null
+++ b/Implementation/1-angry-professor.php
@@ -0,0 +1,20 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+for ($a0 = 0; $a0 < $t; $a0 ++) {
+    fscanf($handle, "%d %d", $n, $k);
+    $a_temp = fgets($handle);
+    $a = explode(" ", $a_temp);
+    array_walk($a, 'intval');
+
+    if (count(array_filter($a, function($temp) {
+            return $temp <= 0;
+        })) < $k) {
+        echo "YES" . PHP_EOL;
+    } else {
+        echo "NO" . PHP_EOL;
+    }
+}
+
diff --git a/Implementation/10-the-grid-search.php b/Implementation/10-the-grid-search.php
new file mode 100644
index 0000000..7fa4e7e
--- /dev/null
+++ b/Implementation/10-the-grid-search.php
@@ -0,0 +1,54 @@
+<?php
+
+$handle = fopen ("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+for ($a0 = 0; $a0 < $t; $a0++) {
+    $big = array();
+    $small = array();
+
+    fscanf($handle, "%d %d", $R, $C);
+    for ($big_i = 0; $big_i < $R; $big_i++) {
+       fscanf($handle, "%s", $big[]);
+    }
+
+    fscanf($handle, "%d %d", $r, $c);
+    for ($small_i = 0; $small_i < $r; $small_i++) {
+       fscanf($handle, "%s", $small[]);
+    }
+
+    echo gridExists($big, $small) ? "YES\n" : "NO\n";
+}
+
+function gridExists(array $big, array $small) {
+    $exists = false;
+    $match = [];
+
+    foreach ($big as $key => $bigLine) {
+        if ($exists) break;
+
+        $start = 0;
+
+        while (($position = strpos($bigLine, $small[0], $start)) !== false) {
+            if ($exists) break;
+
+            $match = [$key, $position];
+            // $start += strlen($small[0]);
+
+            for ($i = 1, $j = $match[0] + 1; $i < count($small); $i ++, $j ++) {
+                $position = strpos($big[$j], $small[$i], $start);
+
+                if ($position === false || $position !== $match[1]) {
+                    $exists = false;
+                    break;
+                } else {
+                    $exists = true;
+                }
+            }
+
+            $start ++;
+        }
+    }
+
+    return $exists;
+}
diff --git a/Implementation/11-cavity-map.cpp b/Implementation/11-cavity-map.cpp
new file mode 100644
index 0000000..33c73a6
--- /dev/null
+++ b/Implementation/11-cavity-map.cpp
@@ -0,0 +1,35 @@
+#include <cmath>
+#include <cstdio>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int main(){
+    int n;
+    cin >> n;
+    vector<string> grid(n);
+    for(int grid_i = 0;grid_i < n;grid_i++){
+       cin >> grid[grid_i];
+    }
+
+    for (int i = 1; i < n - 1; ++i)
+    {
+        for (int j = 1; j < n - 1; ++j)
+        {
+            if (grid[i][j] > grid[i][j + 1] &&
+            grid[i][j] > grid[i][j - 1] &&
+            grid[i][j] > grid[i + 1][j] &&
+            grid[i][j] > grid[i - 1][j]) {
+                grid[i][j] = 'X';
+            }
+        }
+    }
+
+    for(int grid_i = 0;grid_i < n;grid_i++){
+       cout << grid[grid_i] << endl;
+    }
+
+    return 0;
+}
diff --git a/Implementation/11-cavity-map.php b/Implementation/11-cavity-map.php
new file mode 100644
index 0000000..e9059ad
--- /dev/null
+++ b/Implementation/11-cavity-map.php
@@ -0,0 +1,23 @@
+<?php
+
+$handle = fopen ("php://stdin","r");
+fscanf($handle,"%d",$n);
+$grid = array();
+for($grid_i = 0; $grid_i < $n; $grid_i++) {
+   fscanf($handle,"%s",$grid[]);
+}
+
+for ($i = 1; $i < $n - 1; $i++) {
+    for ($j = 1; $j < $n - 1; $j++) {
+        if ($grid[$i][$j] > $grid[$i][$j + 1] &&
+            $grid[$i][$j] > $grid[$i][$j - 1] &&
+            $grid[$i][$j] > $grid[$i + 1][$j] &&
+            $grid[$i][$j] > $grid[$i - 1][$j]) {
+            $grid[$i][$j] = 'X';
+        }
+    }
+}
+
+foreach ($grid as $g) {
+    print $g . PHP_EOL;
+}
diff --git a/Implementation/12-library-fine.cpp b/Implementation/12-library-fine.cpp
new file mode 100644
index 0000000..e38bf76
--- /dev/null
+++ b/Implementation/12-library-fine.cpp
@@ -0,0 +1,33 @@
+#include <cmath>
+#include <cstdio>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+int main(){
+    int d1;
+    int m1;
+    int y1;
+    cin >> d1 >> m1 >> y1;
+    int d2;
+    int m2;
+    int y2;
+    cin >> d2 >> m2 >> y2;
+
+    int fine = 0;
+
+    if (y1 == y2) {
+        if (m1 > m2) {
+            fine = (m1 - m2) * 500;
+        } else if (d1 > d2 && m1 == m2) {
+            fine = (d1 - d2) * 15;
+        }
+    } else if (y1 > y2) {
+        fine = 10000;
+    }
+
+    cout << fine << endl;
+
+    return 0;
+}
diff --git a/Implementation/12-library-fine.php b/Implementation/12-library-fine.php
new file mode 100644
index 0000000..a2de3a3
--- /dev/null
+++ b/Implementation/12-library-fine.php
@@ -0,0 +1,21 @@
+<?php
+
+$handle = fopen ("php://stdin","r");
+fscanf($handle,"%d %d %d",$d1,$m1,$y1);
+fscanf($handle,"%d %d %d",$d2,$m2,$y2);
+
+$fine = null;
+
+if ($y1 !== $y2) {
+    $fine = null ? $fine : 1000;
+}
+
+if ($m1 !== $m2) {
+    $fine = null ? $fine : 500 * abs($m1 - $m2);
+}
+
+if ($d1 !== $d2) {
+    $fine = null ? $fine : 15 * abs($d1 - $d2);
+}
+
+echo $fine . PHP_EOL;
diff --git a/Implementation/12-manasa-and-stones.cpp b/Implementation/12-manasa-and-stones.cpp
new file mode 100644
index 0000000..a007d0f
--- /dev/null
+++ b/Implementation/12-manasa-and-stones.cpp
@@ -0,0 +1,31 @@
+#include <iostream>
+#include <algorithm>
+#include <set>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    int t;
+    cin >> t;
+    while (t --) {
+        long long a, b, n, i;
+        long long int c, d;
+        set <int> x;
+        cin >> n >> c >> d;
+        a = max(c, d);
+        b = min(c, d);
+
+        for (int i = 0; i < n; ++i)
+        {
+            x.insert(i * b + (n - 1 - i) * a);
+        }
+
+        for (auto it = x.begin(); it != x.end(); it ++) {
+            cout << *it << " ";
+        }
+
+        cout << endl;
+    }
+    return 0;
+}
diff --git a/Implementation/12-manasa-and-stones.php b/Implementation/12-manasa-and-stones.php
new file mode 100644
index 0000000..8a4f744
--- /dev/null
+++ b/Implementation/12-manasa-and-stones.php
@@ -0,0 +1,27 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+
+fscanf($handle, "%d", $t);
+
+for ($a0=0; $a0 < $t; $a0++) {
+    fscanf($handle, "%d", $n);
+    fscanf($handle, "%d", $a);
+    fscanf($handle, "%d", $b);
+
+    if ($a > $b) {
+        $temp = $a;
+        $a = $b;
+        $b = $temp;
+    }
+
+    $result = [];
+    for ($i=0; $i <= $n - 1; $i++) {
+        $temp = ($n - 1 - $i) * $a + $i * $b;
+        if (! in_array($temp, $result)) {
+            $result[] = $temp;
+        }
+    }
+
+    echo implode(" ", $result) . PHP_EOL;
+}
diff --git a/Implementation/13-acm-icpc-team.php b/Implementation/13-acm-icpc-team.php
new file mode 100644
index 0000000..e69de29
diff --git a/Implementation/2-sherlock-and-the-beast.cpp b/Implementation/2-sherlock-and-the-beast.cpp
new file mode 100644
index 0000000..9234592
--- /dev/null
+++ b/Implementation/2-sherlock-and-the-beast.cpp
@@ -0,0 +1,31 @@
+// c++ faster than php
+#include <iostream>
+
+using namespace std;
+
+int main(){
+    int t;
+    cin >> t;
+    while (t --) {
+        int n;
+        cin >> n;
+
+        int i, k;
+        string s;
+        for (i = n; i >= 0; i -= 5) {
+            if (i % 3 == 0 && (n - i) % 5 == 0) {
+                s = "";
+                for (k = 0; k < i; k ++)
+                    s += '5';
+                for (k = 0; k < n - i; k ++)
+                    s += '3';
+                break;
+            }
+        }
+        if(s == "")
+            cout << "-1" << endl;
+        else
+            cout << s << endl;
+    }
+    return 0;
+}
diff --git a/Implementation/2-sherlock-and-the-beast.php b/Implementation/2-sherlock-and-the-beast.php
new file mode 100644
index 0000000..6241351
--- /dev/null
+++ b/Implementation/2-sherlock-and-the-beast.php
@@ -0,0 +1,19 @@
+<?php
+
+$handle = fopen ("php://stdin","r");
+fscanf($handle,"%d",$t);
+for($a0 = 0; $a0 < $t; $a0++){
+    fscanf($handle,"%d",$n);
+
+    $found = false;
+
+    for ($i = $n ; $i >= 0; $i -= 5) {
+        if (($n - $i) % 5 == 0 && ($i % 3 == 0)) {
+            echo str_repeat('5', $i) . str_repeat('3', $n - $i) . PHP_EOL;
+            $found = true;
+            break;
+        }
+    }
+
+    if (! $found) echo '-1' . PHP_EOL;
+}
diff --git a/Implementation/3-utopian-tree.cpp b/Implementation/3-utopian-tree.cpp
new file mode 100644
index 0000000..12914b3
--- /dev/null
+++ b/Implementation/3-utopian-tree.cpp
@@ -0,0 +1,24 @@
+#include <iostream>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    int T, N, i;
+    cin >> T;
+    while(T --) {
+        cin >> N;
+        long long int s = 1;
+        for (i = 1; i <= N; i ++) {
+            if (i % 2 == 0) {
+                s ++;
+            } else {
+                s *= 2;
+            }
+        }
+
+        cout << s << endl;
+    }
+
+    return 0;
+}
diff --git a/Implementation/3-utopian-tree.php b/Implementation/3-utopian-tree.php
new file mode 100644
index 0000000..1de0977
--- /dev/null
+++ b/Implementation/3-utopian-tree.php
@@ -0,0 +1,15 @@
+<?php
+
+$handle = fopen ("php://stdin","r");
+fscanf($handle,"%d",$t);
+for($a0 = 0; $a0 < $t; $a0++){
+    fscanf($handle,"%d",$n);
+
+    if ($n % 2 == 0)
+        $height = (pow(2, (int) ($n / 2)) - 1) * 2 + 1;
+    else
+        $height = (pow(2, (int) ($n / 2) + 1) - 1) * 2;
+
+    echo $height . PHP_EOL;
+}
+
diff --git a/Implementation/4-find-digits.cpp b/Implementation/4-find-digits.cpp
new file mode 100644
index 0000000..519d095
--- /dev/null
+++ b/Implementation/4-find-digits.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+
+using namespace std;
+
+int main(){
+    int t;
+    cin >> t;
+    for(int a0 = 0; a0 < t; a0++){
+        int n, m;
+        int digit_count = 0;
+        cin >> n;
+        m = n;
+
+        while(m > 0) {
+            int curr_digit = m % 10;
+            m /= 10;
+            if (curr_digit != 0 && n % curr_digit == 0) {
+                digit_count ++;
+            }
+        }
+
+        cout << digit_count << endl;
+    }
+    return 0;
+}
diff --git a/Implementation/4-find-digits.php b/Implementation/4-find-digits.php
new file mode 100644
index 0000000..d2f1cf4
--- /dev/null
+++ b/Implementation/4-find-digits.php
@@ -0,0 +1,42 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+// one
+// for ($i=0; $i < $t; $i++) {
+//     fscanf($handle, "%d", $n);
+
+//     $n_str = (string)$n;
+
+//     $array = str_split($n_str);
+
+//     $result = 0;
+
+//     foreach ($array as $a) {
+//         if ($a != 0 && $n % $a == 0) {
+//             $result ++;
+//         }
+//     }
+
+//     echo $result . PHP_EOL;
+// }
+
+// two
+for ($i=0; $i < $t; $i++) {
+    fscanf($handle, "%d", $n);
+
+    $m = $n;
+
+    $result = 0;
+
+    while ($m > 0) {
+        $current_digit = $m % 10;
+        $m = (int) $m / 10;
+        if ($current_digit != 0 && $n % $current_digit == 0) {
+            $result ++;
+        }
+    }
+
+    echo $result . PHP_EOL;
+}
diff --git a/Implementation/5-sherlock-and-squares.cpp b/Implementation/5-sherlock-and-squares.cpp
new file mode 100644
index 0000000..a3c0839
--- /dev/null
+++ b/Implementation/5-sherlock-and-squares.cpp
@@ -0,0 +1,20 @@
+// ⌊b‾√⌋−⌈a‾√⌉+1
+#include <iostream>
+#include <cmath>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    int t;
+    cin >> t;
+    while(t --) {
+        int a, b, result;
+        cin >> a >> b;
+
+        result = floor(sqrt(b)) - ceil(sqrt(a)) + 1;
+        cout << result << endl;
+    }
+
+    return 0;
+}
diff --git a/Implementation/5-sherlock-and-squares.php b/Implementation/5-sherlock-and-squares.php
new file mode 100644
index 0000000..21c85f3
--- /dev/null
+++ b/Implementation/5-sherlock-and-squares.php
@@ -0,0 +1,10 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $t);
+
+for ($i=0; $i < $t; $i++) {
+    fscanf($handle, "%d %d", $m, $n);
+
+    echo floor(sqrt($n)) - ceil(sqrt($m)) + 1 . PHP_EOL;
+}
diff --git a/Implementation/6-service-lane.c b/Implementation/6-service-lane.c
new file mode 100644
index 0000000..5cfad8d
--- /dev/null
+++ b/Implementation/6-service-lane.c
@@ -0,0 +1,33 @@
+// test#11 0.00s
+#include <stdio.h>
+
+int min(int a, int b)
+{
+    return a > b ? b : a;
+}
+
+int main(int argc, char const *argv[])
+{
+    int N, T;
+    scanf("%d %d", &N, &T);
+    int width[N];
+
+    for (int i = 0; i < N; i ++) {
+        scanf("%d", &width[i]);
+    }
+
+    for (int i = 0; i < T; i ++) {
+        int l, r;
+        scanf("%d %d", &l, &r);
+
+        int result = width[l];
+        while(l <= r) {
+            result = min(result, width[l]);
+            l ++;
+        }
+
+        printf("%d\n", result);
+    }
+
+    return 0;
+}
diff --git a/Implementation/6-service-lane.cpp b/Implementation/6-service-lane.cpp
new file mode 100644
index 0000000..b9aa902
--- /dev/null
+++ b/Implementation/6-service-lane.cpp
@@ -0,0 +1,32 @@
+// test#11 0.02s
+#include <iostream>
+#include <algorithm>
+#include <vector>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    int N, T;
+    cin >> N >> T;
+
+    vector <int> width(N);
+    for (int i = 0; i < N; i ++) {
+        cin >> width[i];
+    }
+
+    for (int i = 0; i < T; i ++) {
+        int l, r;
+        cin >> l >> r;
+
+        int ans = width[l];
+        while(l <= r) {
+            ans = min(ans, width[l]);
+            l ++;
+        }
+
+        cout << ans << endl;
+    }
+
+    return 0;
+}
diff --git a/Implementation/6-service-lane.php b/Implementation/6-service-lane.php
new file mode 100755
index 0000000..f4d918b
--- /dev/null
+++ b/Implementation/6-service-lane.php
@@ -0,0 +1,13 @@
+<?php
+
+$handle = fopen ("php://stdin","r");
+fscanf($handle,"%d %d",$n,$t);
+$width_temp = fgets($handle);
+$width = explode(" ",$width_temp);
+array_walk($width,'intval');
+for($a0 = 0; $a0 < $t; $a0++){
+    fscanf($handle,"%d %d",$i,$j);
+
+    $through = array_slice($width, $i, $j - $i + 1);
+    printf("%d\n", min($through));
+}
diff --git a/Implementation/7-cut-the-sticks.cpp b/Implementation/7-cut-the-sticks.cpp
new file mode 100644
index 0000000..cf4a73b
--- /dev/null
+++ b/Implementation/7-cut-the-sticks.cpp
@@ -0,0 +1,41 @@
+// test#6 0.00
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int main(){
+    int n;
+    cin >> n;
+    vector<int> arr(n);
+    for(int arr_i = 0;arr_i < n;arr_i++){
+       cin >> arr[arr_i];
+    }
+
+    int mx = *max_element(arr.begin(), arr.end());
+    while (mx > 0) {
+        int mn = mx;
+        int cuts = 0;
+
+        for (int i = 0; i < n; ++i)
+        {
+            if (arr[i] > 0) {
+                mn = min(mn, arr[i]);
+            }
+        }
+
+        for (int i = 0; i < n; ++i)
+        {
+            if (arr[i] > 0) {
+                cuts ++;
+                arr[i] -= mn;
+            }
+        }
+
+        cout << cuts << endl;
+        mx = *max_element(arr.begin(), arr.end());
+    }
+
+    return 0;
+}
diff --git a/Implementation/7-cut-the-sticks.php b/Implementation/7-cut-the-sticks.php
new file mode 100644
index 0000000..ee25a5f
--- /dev/null
+++ b/Implementation/7-cut-the-sticks.php
@@ -0,0 +1,22 @@
+<?php
+
+// test#6 0.11
+
+$handle = fopen ("php://stdin","r");
+fscanf($handle,"%d",$n);
+$arr_temp = fgets($handle);
+$arr = explode(" ",$arr_temp);
+array_walk($arr,'intval');
+
+while (count($arr) !== 0) {
+    echo count($arr) . PHP_EOL;
+
+    $min = min($arr);
+    array_walk($arr, function(&$item) use ($min) {
+        $item = $item - $min;
+    });
+
+    $arr = array_filter($arr, function($a) {
+        return $a !== 0;
+    });
+}
diff --git a/Implementation/8-chocolate-feast.c b/Implementation/8-chocolate-feast.c
new file mode 100644
index 0000000..9f5777c
--- /dev/null
+++ b/Implementation/8-chocolate-feast.c
@@ -0,0 +1,26 @@
+#include <stdio.h>
+
+int main(){
+    int t;
+    scanf("%d",&t);
+    for(int a0 = 0; a0 < t; a0++){
+        int n;
+        int c;
+        int m;
+        scanf("%d %d %d",&n,&c,&m);
+
+        int wrapper;
+        wrapper = n / c;
+        int count;
+        count = wrapper;
+        while (wrapper >= m) {
+            wrapper -= m;
+            count ++;
+            wrapper ++;
+        }
+
+        printf("%d\n", count);
+    }
+    return 0;
+}
+
diff --git a/Implementation/8-chocolate-feast.php b/Implementation/8-chocolate-feast.php
new file mode 100755
index 0000000..95b8aac
--- /dev/null
+++ b/Implementation/8-chocolate-feast.php
@@ -0,0 +1,18 @@
+<?php
+
+$handle = fopen ("php://stdin","r");
+fscanf($handle,"%d",$t);
+for($a0 = 0; $a0 < $t; $a0++){
+    fscanf($handle,"%d %d %d",$n,$c,$m);
+
+    $wrappers = (int) ($n / $c);
+    $count = $wrappers;
+    while ($wrappers >= $m) {
+        $wrappers -= $m;
+        $count ++;
+        $wrappers ++;
+    }
+
+    echo $count . PHP_EOL;
+}
+
diff --git a/Implementation/9-caesar-cipher-1.c b/Implementation/9-caesar-cipher-1.c
new file mode 100644
index 0000000..346bd6e
--- /dev/null
+++ b/Implementation/9-caesar-cipher-1.c
@@ -0,0 +1,30 @@
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+
+int main(){
+    int n;
+    scanf("%d",&n);
+    char* s = (char *)malloc(10240 * sizeof(char));
+    scanf("%s",s);
+    int k;
+    scanf("%d",&k);
+
+    int i = 0;
+    char ch;
+    while (s[i] != '\0') {
+        if (s[i] >= 'a' && s[i] <= 'z') {
+            ch = 'a';
+            s[i] = ch + (s[i] - ch + k) % 26;
+        } else if (s[i] >= 'A' && s[i] <= 'Z') {
+            ch = 'A';
+            s[i] = ch + (s[i] - ch + k) % 26;
+        }
+
+        i ++;
+    }
+
+    printf("%s\n", s);
+
+    return 0;
+}
diff --git a/Implementation/9-caesar-cipher-1.php b/Implementation/9-caesar-cipher-1.php
new file mode 100644
index 0000000..ca3a076
--- /dev/null
+++ b/Implementation/9-caesar-cipher-1.php
@@ -0,0 +1,6 @@
+<?php
+
+$handle = fopen("php://stdin", "r");
+fscanf($handle, "%d", $n);
+fscanf($handle, "%s", $s);
+fscanf($handle, "%d", $k);
diff --git a/Implementation/a.out b/Implementation/a.out
new file mode 100755
index 0000000000000000000000000000000000000000..110ba5366eaf992d6a976867101238066d70bb14
GIT binary patch
literal 13200
zcmeHNeQaCR6~DIgML!&u!Isjkb)m4fBPK~dmhPk2NnD<hX|p7SjIF#lw$pgcm+a>*
zMRWwELG{u=x4{-BP3okfb$@Iy?W>zK>aMIQ(>}_ykBV(5LVyy=5C{et>&SlR-h1q4
z$3X~b|K(cG=bqm^=iGbGz3;yJ?mPDe!@Haghv4KCI|XsAm3|4Se<3_KN>*cy;tJsx
zYsDH-0i+z4UzQM6Ii_>kG}9_A=K?Lm)#y|}qth=lOh2q(!IWD_l<LbTzs@T9Teo7F
z3gMLi=}}wfJ|bDrE}3CEq}y?l8YYuh{u4}kHESgc+9fkgr**@aa{s7rbaiOE9Zo+u
z;{8NKi~P@1lBLx8f)%5D%Sy?D`ei0Z6`a#&z0W|8+WB6SM+>&;`WEv`m2N*%-Cc20
zU!r^a)|>ibwS9?!^l<HP<M!I^TYafPUxVy7*(cdscJGxnu^+wQsLfa5B3Dy+-|xQv
zjp;j<?SJF7SI$*lzW>|b`|cNhK=R9R@wj0II)$T5Vt_^R>y^$;!9Ry7Un)`k-Vz1t
z7QxR0zp{k<Dm0)JUbYCnWfA*(7QtU%q~2dHf+rTir-82$tHp@73pvbJavaj5xTyUe
zeLoW>6UHxP#iAek7>(I>VVe8<2M5fQ6-ipADa>0Bnr-p@iIf#jHuptRsd!45p^n?k
zSUjoWj@z311_$CDk?y{@Dl1)bXS<b5g`(|NeSNeyk~FPkBw+yv2HSvb>5illQ4<v<
z<B|SQhuKkQ2HUrrZS7moiaU3=TaAgqlnJT$*3dx0YN-z%lz1YU3brLmi8L#bc56#C
zF(A;-D0dOPiykney$8&mNTLsYjt)o6h!r1BSYSv}JD@)T&0E5ure?Fjw>6h*@NHB1
z&Q5a+aGji($!ggs6HfhefX<?v=3yPKs}c#^(PiQ~j0<7uYZ6z`9Z;*s$$^<pSt_Gs
zZTc#f5~tXq%jed0Nu2I+4N0EIo7P0SUpUq1c~A+!F7LJBs?ADcqYdXZg-YsdxP9Gi
zwBak13Hk50;k*`7fnmeZ@my-P;mdL;<VRnwGRDjIuJ#IJENhj|T!%tq^vSBTHX&r^
zw>3dz{`waDSFiIUM|>{{%}&oFUH=K<$py0)B;P<hEibcK$!{j!Mf~HEzm|A%!R!gi
zUqd`~efGHIuOyy^VRl6F%ZMj8&kljF|7R%k^j${gIb-zsS6e$mQ`tJK;KtOM><S`N
zyQ=(R=8F(~qo;aZix8&<;efqHZ7+y1I_EYrFC1KR3f5$|SM57Z1@qGoK0=__cb0nD
z<755_D&K3|_lh)d<{cLd7@1d%Gcz|Ej&sJ-?^svotSx72)$3qK)j#s-ub}-Ry=pHM
zX9m!)edo%*1jzBatm(7|4?JV^W|1zx^fl<^jJ-w*^B4Bb-VGhf2kr>m9@rb`XgBVA
zxeES{8RKQwZ$y)gOz?bt)|eRUg`|-=cbewx%#YrgpPw4L2M~2@To&$-eD%bmF4CGd
zGGlWj6+BKNQ^ALbz)qjt&H+dmnO^}W_rtuA`RmN>0LK+DX-o_OPEV3oMzanWohFs3
zu^A9)5d{;Sj&Wrd^23lnd?GL3N`|M#I(1u(%$zplR|SSH2#-HZqT%sxk!U#cOn7{Z
zM8e|}BoeBA>_Rwm9t5pj;S6Ukgx;Dq98VjW-{kA6gCOc^1W|31b%iod2Iz?(V38zX
zktD*I-@w|R!kH|{ua(hk=&k4TMkiX)VbxsJeu`EXV|2!0I4=C0^1mRP##^r$2eKYx
z)05=$(JT$v$*JH7l_{s}2#y?XnF`7osNA|Ec;xVn<G~|F^ul;>#F#XyA3JL}er1dY
zPr`O?ke|IgKR+5g;<)tGXmG@F>4z94i#o`Y;0GvIgEy>T8oWmUj*m%z2k-H`gD$AS
zyI4GU(k>6)sl2?G3{Q=11fdSGH!@=$RZyb~;8_xdXGs*E#b}ZUMw3L~;6H{l7eO$S
zY4G6Z=kk756H7o4byb1b>I!Af1x^zWizESyB!T$>Yk#3>Q2p3cZbrPAH@f)Xowg0$
zTMGs+I~6=i_3_{xrNKL<kRjB(BY2Dk@0c9CqxQke+6Qm_e`xTI$-z5HgE#&t-HxO3
zCUwk)FidJS7~gk3W^DPeyxFl*KlL`eFcH7_xxnWG`vP|b%zbBReZY$D$sE3%NzaWQ
zzU)YU^uEJ$<fio6(~qpjde9E7Uvyz*c!Jo|v|pJqfgOKJYCl1;r)e3Vc??~kWpIRg
zBv+lxJS{xoiR*7z<;7w+QR@S34`tpAW&T|Mx9}#ayUIB8U)Ri||3=%!{%Nh{^)sA#
zDV%w;1s3M7`nxfD)?w_plzxdGG@skY?LT`wzuvxnmhK=}(~ly0&O6q)KIunW=pk?q
zDj-*{K+``D>Vy-240<gZ{XA$FDD55Z0o?%lGH4$t?T0Bj?rsx~VUJ_Yipr|vj!F;V
z^bT|qb~lrNPNn6A*no19pMi6aldRjb%UyG8_3|%Pjfk7C`Q+v;8?GhzMqDkpcA=f#
zGGqd7&;8Ekl@+ZIx*jN-C_h#)TIpI|hE|{qiELW9wqpkDB!J})DG@4v2v-NnueO)B
zs&cC9$GBQi9;fmqx934;le^{tSJ3U9C~I<WJXUVF>+Y{G+>N7^d))pZcVoa^7jSQE
za(f{M`6hRj^wVXi55o>U#Fx^N2bMgr<bfp*EO}tb14|xQ^1zY@mOQZJfh7+td0@!{
zi+jL}b7)H6!LhVVnpaHzn*p7;P-05oG$^f5L`+urWln#t6kGN8%GJ7@zpt**JRMw7
zx<(OEh2v#PbbdfdA2*19y)!>Z{G`)QB=^mC&ZT(%)|quGewk1ys2j@PLTWTF&m?r7
z2u_$)!if_lK1;|-E`J_FXF8NVq=>j!?w2{nPimgqU8m*v8wb~q;|kfIPA!jPAIWpQ
zuWEj$F4t!M?}Wc&7gzKbJ+3cm`lhB8IG3aJK}~Pabi1azG?hZOzgwD{KjGcDw>v#x
zrM=sH4Zix?hK96c8#XDx+fY}(t-h`vF7%}i^;?l{P%EiuFXs{i_#`<bd;^14+!tsH
z)moALn%h5+_I0Nd_$Hl*2_JF2kyNkn#SRU?o}yM#l^l#GQ;ETW0>(sHGTs*<1)Uq}
zvxF~!?~cNU&xH8z0fVx^Sj375U%c1sNk;nPW^W9-%qa~sl1xSpDGknlAqp{AkMt*^
zsCp0v@#mAZD2v^xl<-9d`}^Yqblmo?$%VVJ(dl0x<HBt2D2cm-RT3}D-Dh@VF5Gq5
zlJXUT@54g*N>OV5x^P$Xyf2i$Lh$`lh%d|CXNCCk+<H@puMk;1KMV1dxj2?W+?`ve
z3h`>;*Xvgy?#abr6ymGI(US64=Hg2V<v);H?+Wp&1bt>JPA+kEF5bjm<`N$i{5`l3
z$10`QvqHQ^be6>P@dAbNygKJmT2{-%Yx28B9#zi)2To;++fVDiQ>+vtMeBi2<JlrS
zpm9<39J&Lz191(L>${N4KZkl`exW}nfK$Evd?Ou7kKl435`v#c62#vrT&4Q;2PwZ=
z(8mZ$`mrLOMV{>U=;x+93kT+g0O9;R<>$>}e!CV04n%C6cl)88PjwPs=ueU;)y_{z
z`Gw=&MiryK{Cp*jQdHx`emE%YESzum0{4oA^XJRJOU0X<0DdL>KwrHn@$>C*jdNVt
zW?3r4&wzV%-cHUff<GheEWCfGC2qH%^5tkisra1@i{LvoUK}qI1@2vFUfc_OmB_Cf
zWm@KeMdVKc_muGGPson5M$l(`dpe_W`Z8uuzXwi!rmzA^arrOAv(o<R1$JJN@><A7
zDqN-gvlh4q_uYy0T{dYUu9Nt}c5aq-Rtk!5pybt#xJlv**X?Z*m!gG#(WI5K(mg%C
zC_-{>ZEiEeq4o|$B;^B-Osn6FQs_}iaKw=fGR@eaxxa6)JJM&ytifc;jHHJJo~T28
zaVsA4eSF*YMp!N(WYV);J*iDReUpcTdbY>X{r!iaV&hEO5)_Em*VS6R@!I{#M65Oy
zk0hhLzUa^p!jsyqaHDA^2IVHgymM>4Nijwi#XP}ABGQ+*8yrHfA_Fl*S7Dozj!M2R
zf#{}N!h4zmVW_0L&5$X>l1y_~Ti~{!8Qk4Mfm+f>I<KYo?Ap~HL?l(9DI6q;g2u)Q
z0U7Wm%$CpY4%`-M7PJXbF;KGU6hY<p%Rnd{@}$G0qN%iWmtf)d5I!ciP9;LRC|;{%
zB`O$=I<1Qlj71?>_PDL0lF|WVMb_Unj%^Qm6iW=4=~Nu9B2k`Xg#mA--Bl*aasv`e
z4Vt|eO$v)sL1pAEHU1{{cR808hNI<sveg#gR@C(P02&pSTSYY)^t5V!zcF@&_6u*t
z_ruY99+u+Vy3hMlj`QXBJhn};_H-Q>dbh%IB@^#sIgZw=aVEUpGGC93U7z>6mNvM7
z1vM?!Zvp-$-o?27NvB^*PHJGI<nr&M{NATwu^SnB_hkL7(+^HyA1#S!)E(wHKGv^M
z#o~5QER8vR-e=Ddh{W%=ip%dyn7<1ddbi~Ic|X3hTuJcGPP4gsSpERS=v|e0-nVyZ
zg;re=wV!0T{Tdc`BSSuAecs=n)cX8>%=NQA_y362Z_)<&efy$T$ZDKeI)f<Ie*hS{
zn9m3Jd}2}q+<%D3R6PC}pmzOig<r~Lwf=F*<^Mc7%k&}ec75LOw9=$RdX77;*j&7)
zX2my=vFr1B%2s{A!siMsU)=r^TA%kk{66E?`o;3hGd-#GdHiy5=UTsoE7p|t82)LI
zKEEFwWqs<LE%Ep<ltspkOHcRQex2jf+0QIrtp8gSRNM4<|68?IX%x#B^A{mTP2~Fd
zy~gt%_5T4~nkuZ%=PNZ@e_HpS=O@?C{d%#eetyrJTZaN9mRDS!XZ#Wh?CsCJ4|<hG
zCo5{odQ9H{ZrA7c#!jzN;C5>D1?_no1!Rl+KjQ6@qP<>8gje@paYAUASwSzDBvO|{
zREG6yi*Po_bQQ|EZoBBiUd2&lsy!94vTmOHcDWPl75AzhxQ~FPHnQJ%{i6G`RQ<;{
MD*Z1N6&Bb3Ka~4+-T(jq

literal 0
HcmV?d00001

diff --git a/Warmup/6-staircase.php b/Warmup/6-staircase.php
index 6470a74..3f4f991 100755
--- a/Warmup/6-staircase.php
+++ b/Warmup/6-staircase.php
@@ -1,5 +1,7 @@
 <?php
 
+// test#11 1.02s
+
 $handle = fopen ("php://stdin","r");
 fscanf($handle,"%d",$n);