update encoding

Author: tiny656

.editorconfig

@@ -4,4 +4,5 @@ root = true
 # all files
 [*]
 indent_style = tab
-indent_size = 4
+indent_size = 4
+charset = utf-8

.vscode/tasks.json

@@ -0,0 +1,65 @@
+{
+    // See https://go.microsoft.com/fwlink/?LinkId=733558
+    // for the documentation about the tasks.json format
+    "version": "2.0.0",
+    "tasks": [
+        {
+            "label": "clean",
+            "type": "shell",
+            "command": "Remove-Item * -Include *.obj,*.exe -Recurse",
+            "group": "build",
+            "presentation": {
+                "echo": true,
+                "reveal": "always",
+                "focus": false,
+                "panel": "shared"
+            },
+            "problemMatcher": []
+        },
+        {
+            "label": "compile",
+            "type": "shell",
+            "command": "build.bat '${relativeFileDirname}/${fileBasenameNoExtension}'",
+            "group": "build",
+            "dependsOn": "clean",
+            "presentation": {
+                "echo": true,
+                "reveal": "always",
+                "focus": false,
+                "panel": "shared"
+            },
+            "problemMatcher": {
+                "owner": "cpp",
+                "fileLocation": [
+                    "relative",
+                    "${workspaceFolder}"
+                ],
+                "pattern": {
+                    "regexp": "^(.*):(\\d+):(\\d+):\\s+(warning|error):\\s+(.*)$",
+                    "file": 1,
+                    "line": 2,
+                    "column": 3,
+                    "severity": 4,
+                    "message": 5
+                }
+            }
+        },
+        {
+            "label": "run",
+            "type": "shell",
+            "command": ".\\'${relativeFileDirname}/${fileBasenameNoExtension}.exe'",
+            "group": {
+                "kind": "build",
+                "isDefault": true
+            },
+            "dependsOn": "compile",
+            "presentation": {
+                "echo": true,
+                "reveal": "always",
+                "focus": false,
+                "panel": "shared"
+            },
+            "problemMatcher": []
+        }
+    ]
+}

PAT (Advanced Level) Practise/1003_Emergency (25).cpp

@@ -12,10 +12,10 @@ int matrix[N][N];
 
 vector<int> path;
 
-void DFS(int next)//深搜 + 回溯
+void DFS(int next)//深搜 + 回溯
 {
     int i;
-    if(next == e)//如果当前点是目标点
+    if(next == e)//如果当前点是目标点
     {
         int curTeam = 0, curDis = 0;
         for(i = 0; i < path.size(); i++)
@@ -85,14 +85,14 @@ int main()
         minDis = 0x7fffffff;
         maxTeam = -1;
 
-        //搜索+回溯开始
+        //搜索+回溯开始
         vis[s] = 1;
         path.push_back(s);
         DFS(s);
         path.pop_back();
         vis[s] = 0;
 
-        //打印答案
+        //打印答案
         cout << numDis << " " << maxTeam << endl;
     }
     return 0;

PAT (Advanced Level) Practise/1004_Counting Leaves (30).cpp

@@ -28,7 +28,7 @@ int main()
     int n,m,i,j,k;
     string ID,tmpID;
 
-    map<string, node*> hash;//hash¸÷¸ö½áµã
+    map<string, node*> hash;//hash各个结点
 
 
     while(cin >> n >> m)

PAT (Advanced Level) Practise/1010_Radix (25).cpp

@@ -1,6 +1,6 @@
-//第七组样例超时
-//1、需要二分答案....
-//2、结果用long long
+//第七组样例超时
+//1、需要二分答案....
+//2、结果用long long
 
 
 #include <iostream>

PAT (Advanced Level) Practise/1014_Waiting in Line (30).cpp

@@ -13,7 +13,7 @@ pair<int,int> Windows[25];
 map<int,int> ans;
 int n,m,k,query,i,j,val;
 
-//判断是否有窗口为空
+//判断是否有窗口为空
 bool has_Windows(int &win_num)
 {
     for(int i = 1; i <= n; i++)
@@ -27,7 +27,7 @@ bool has_Windows(int &win_num)
     return false;
 }
 
-//补充排队人数
+//补充排队人数
 bool has_Queue()
 {
     for(int i = 1; i <= n; i++)
@@ -58,7 +58,7 @@ int main()
         Peo.push( make_pair(i,val) );
     }
 
-    //初始化各个窗口前的排队队列
+    //初始化各个窗口前的排队队列
     while(q[n].size() != m && !Peo.empty())
     {
         for(i = 1; i <= n; i++)
@@ -71,10 +71,10 @@ int main()
         }
     }
 
-    int time = 8*60;//起始时间
+    int time = 8*60;//起始时间
     while(time < 17*60)
     {
-        //窗口工作
+        //窗口工作
         for(i = 1; i <= n; i++)
         {
             if(Windows[i].second != 0)
@@ -87,18 +87,18 @@ int main()
             }
         }
 
-        //窗口空闲，调入排队的人
+        //窗口空闲，调入排队的人
         int win_num = -1;
         while(has_Windows(win_num))
         {
             Windows[win_num] = q[win_num].front();
-            //cout << "人员" <<q[win_num].front().first << "进入窗口" <<win_num<<endl;
-            //cout << "人员" << q[win_num].front().first << "将在"
-            //     <<(q[win_num].front().second+time )/60<< ":"<<(q[win_num].front().second+time )%60<<"完成"<<endl;
+            //cout << "人员" <<q[win_num].front().first << "进入窗口" <<win_num<<endl;
+            //cout << "人员" << q[win_num].front().first << "将在"
+            //     <<(q[win_num].front().second+time )/60<< ":"<<(q[win_num].front().second+time )%60<<"完成"<<endl;
             //cout << endl;
             ans[q[win_num].front().first] = q[win_num].front().second+time;
         }
-        //补充窗口前排队人数
+        //补充窗口前排队人数
         while(has_Queue())
         {
             int minSize = 100000;
@@ -117,7 +117,7 @@ int main()
             if(!Peo.empty() && index != -1)
             {
                 q[index].push(Peo.front());
-                //cout << "人员" <<Peo.front().first << "进入队列" <<index<<endl;
+                //cout << "人员" <<Peo.front().first << "进入队列" <<index<<endl;
                 Peo.pop();
             }
             else

PAT (Advanced Level) Practise/1017_Queueing at Bank (25).cpp

@@ -1,5 +1,5 @@
-//原始版
-//fuck   只要除以合法人数   而不是总人数   第一个Sample 老是跑不对， 原因在这。
+//原始版
+//fuck   只要除以合法人数   而不是总人数   第一个Sample 老是跑不对， 原因在这。
 #include <iostream>
 #include <cstdio>
 #include <cstring>
@@ -79,7 +79,7 @@ int main()
 
 
 /*
-//在自己基础上，照着网上的其他人改了下。  窗口其实像上面定义成Int就好了，这个我觉得写的还麻烦了。
+//在自己基础上，照着网上的其他人改了下。  窗口其实像上面定义成Int就好了，这个我觉得写的还麻烦了。
 
 #include <iostream>
 #include <cstdio>

PAT (Advanced Level) Practise/1018_Public Bike Management (30).cpp

@@ -1,7 +1,7 @@
-//理解题目有误啊。
-//Back 那个前面计算有问题   5和7测试用例一直过不了，
-//后面参考了http://linest.iteye.com/blog/1423959
-//然后拿下了。
+//理解题目有误啊。
+//Back 那个前面计算有问题   5和7测试用例一直过不了，
+//后面参考了http://linest.iteye.com/blog/1423959
+//然后拿下了。
 #include <iostream>
 #include <cstdio>
 #include <vector>
@@ -59,7 +59,7 @@ void dfs(int ID, int curDis, int curNum,int cnt)
             }
         }
 
-        //路径更小
+        //路径更小
         if(curDis < minDis)
         {
             minDis = curDis;
@@ -89,13 +89,13 @@ void dfs(int ID, int curDis, int curNum,int cnt)
     {
         if(!vis[adj[ID][i].first] && curDis + adj[ID][i].second <= minDis)
         {
-            //cout << "访问" << adj[ID][i].first << endl;
+            //cout << "访问" << adj[ID][i].first << endl;
             vis[adj[ID][i].first] = 1;
             path.push_back(adj[ID][i].first);
             dfs(adj[ID][i].first, curDis + adj[ID][i].second, curNum+numOfBike[adj[ID][i].first], cnt+1);
             path.pop_back();
             vis[adj[ID][i].first] = 0;
-            //cout << "回溯" << adj[ID][i].first << endl;
+            //cout << "回溯" << adj[ID][i].first << endl;
         }
     }
 }

PAT (Advanced Level) Practise/1020_Tree Traversals (25).cpp

@@ -26,22 +26,22 @@ node::node(const int &v)
 }
 
 void build(node * &r, int post[],int in[],int postLeft,int postRight, int inLeft, int inRight)
-{//构造以r为根的二叉树
+{//构造以r为根的二叉树
     if(inLeft > inRight)
-    {//二叉树无结点，空二叉树
+    {//二叉树无结点，空二叉树
         r = NULL;
     }
     else
     {
         r = new node(post[postRight]);
         int mid = inLeft;
         while(in[mid] != post[postRight])
-        {//找出中序遍历中根的位置
+        {//找出中序遍历中根的位置
             mid++;
         }
-        //cout << "根：" << post[postRight] << endl;
-        //cout << "左：" << postLeft << " " <<  postLeft+(mid-1) << " " <<  inLeft << " " <<  mid-1 << endl;
-        //cout << "右：" << postLeft+mid << " " <<   postLeft+mid-inLeft << " " <<  mid+1 << " " <<  inRight << endl;
+        //cout << "根：" << post[postRight] << endl;
+        //cout << "左：" << postLeft << " " <<  postLeft+(mid-1) << " " <<  inLeft << " " <<  mid-1 << endl;
+        //cout << "右：" << postLeft+mid << " " <<   postLeft+mid-inLeft << " " <<  mid+1 << " " <<  inRight << endl;
         //system("pause");
         build(r->left, post, in, postLeft, postLeft+(mid-1-inLeft), inLeft, mid-1);
         build(r->right, post, in, postLeft+mid-inLeft, postRight-1, mid+1, inRight);

PAT (Advanced Level) Practise/1021_Deepest Root (25).cpp

@@ -1,7 +1,7 @@
 /*
-    并查集判断 树的个数
-    第1次BFS找到最远叶子结点
-    第2次BFS找到距离最远的所有结点集合
+    并查集判断 树的个数
+    第1次BFS找到最远叶子结点
+    第2次BFS找到距离最远的所有结点集合
 */
 #include <iostream>
 #include <cstring>
@@ -99,7 +99,7 @@ int main()
     else
     {
         set<int> ans;
-        int farMax = bfs(1);//离1最远距离
+        int farMax = bfs(1);//离1最远距离
         int tmp;
         for(i = 1; i <= n; i++)
         {
@@ -109,8 +109,8 @@ int main()
                 break;
             }
         }
-        farMax = bfs(tmp);//寻找距离最远的两点
-        ans.insert(tmp);//自身也要加入
+        farMax = bfs(tmp);//寻找距离最远的两点
+        ans.insert(tmp);//自身也要加入
         for(i = 1; i <= n; i++)
         {
             if(dist[i] == farMax)

PAT (Advanced Level) Practise/1022_Digital Library (30).cpp

@@ -10,13 +10,13 @@ map<string,set<string> > note;
 vector<string> vec;
 void StringSplit(string s,char splitchar,vector<string>& vec)
 {
-    if(vec.size()>0)//保证vec是空的
+    if(vec.size()>0)//保证vec是空的
        vec.clear();
     int length = s.length();
     int start=0;
     for(int i=0;i<length;i++)
     {
-       if(s[i] == splitchar && i == 0)//第一个就遇到分割符
+       if(s[i] == splitchar && i == 0)//第一个就遇到分割符
        {
            start += 1;
        }
@@ -25,7 +25,7 @@ void StringSplit(string s,char splitchar,vector<string>& vec)
            vec.push_back(s.substr(start,i - start));
            start = i+1;
        }
-       else if(i == length-1)//到达尾部
+       else if(i == length-1)//到达尾部
        {
            vec.push_back(s.substr(start,i+1 - start));
        }