diff --git a/GESP/SheXingJuZhen.cpp b/GESP/SheXingJuZhen.cpp
index 4564fb7..142cc76 100644
--- a/GESP/SheXingJuZhen.cpp
+++ b/GESP/SheXingJuZhen.cpp
@@ -9,8 +9,8 @@ int n, m;
 
 int main() {
     cin >> n >> m;
-    for (int k = 1; k <= n * m; k++) { // 没有填充完毕
-        a[x][y] = k;                   // 在当前位置填充数字, 值在长大
+    for (int i = 1; i <= n * m; i++) { // 没有填充完毕
+        a[x][y] = i;                   // 在当前位置填充数字, 值在长大
         //  p是说方向数组中的游标，它是需要变化的，什么情况下变化呢？
         //  1、出界了就变化 2、遇到了障碍就变化
         int tx = x + dx[p], ty = y + dy[p]; // 蛇准备去的位置
diff --git a/GESP/TangDou.cpp b/GESP/TangDou.cpp
new file mode 100644
index 0000000..55864ab
--- /dev/null
+++ b/GESP/TangDou.cpp
@@ -0,0 +1,45 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int chenghebi(int u) {
+    int t = u * 7;
+    int sum = 0;
+    while (t > 9) {
+        sum = t / 10 + t % 10;
+        t = sum;
+    }
+    return t;
+}
+
+int main() {
+   int T;
+    cin >> T;
+   while (T--) {
+        int n;
+        int dj = 0;
+        int k = 0;
+        int c[10000] = {0};
+        cin >> n;
+        while (n != 0) {
+            dj++;
+            int a = n % 10;
+            if ( dj% 2 == 0)
+                c[dj] = a;
+            else
+                c[dj] = chenghebi(a);
+            n /= 10;
+        }
+        for (int i = dj; i >= 1; i--) {
+            k *= 10;
+            k += c[i];
+        
+        }
+
+        if (k % 8 == 0)
+            cout << "T" << endl;
+        else
+            cout << "F" << endl;
+    }
+
+    return 0;
+}
\ No newline at end of file