111

A.cpp

@@ -0,0 +1,14 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int a, n, sum = 0;
+    cin >> a >> n;
+    int c = a;
+    for (int i = 1; i <= n; i++) {
+        sum += a;
+        a = a * 10 + c;
+    }
+    cout << sum << endl;
+    return 0;
+}
+ 

B.cpp

@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+int f(int n) {
+    if (n == 1 || n == 2) {
+        return n;
+    }
+    else {
+        return f(n - 1) + f(n - 2);
+    }
+}
+int main() {
+    int i, n, c;
+    cin >> n;
+    for (i = 1; i <= n; i++) {
+        cin >> c;
+        cout << f(c) << endl;
+    }
+    return 0;
+}

C.cpp

@@ -0,0 +1,14 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    string s, t;
+    while (getline(cin, s) && getline(cin, t)) {
+        for (size_t i = 0; i < s.size(); i++) {
+            if (s[i] != t[0]) {
+                cout << s[i];
+            }
+        }
+        cout << endl;
+    }
+    return 0;
+}

CMakeLists.txt

@@ -0,0 +1,7 @@
+cmake_minimum_required(VERSION 3.8)
+project(main)
+
+set(CMAKE_CXX_STANDARD 11)
+
+set(SOURCE_FILES main.cpp)
+add_executable(HighPrecision ${SOURCE_FILES})

D.cpp

@@ -0,0 +1,20 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main() {
+    int T;cin>>T;
+    cin.get();
+    string s;
+    while(T--){
+        getline(cin,s);
+        int n=s.size();
+        for(int i=0,left=0,right=0;i<n;i++){
+            for(left=i;left<n;++left)if(s[left]!=' ')break;
+            for(right=left;right<n;++right)if(s[right]==' ')break;
+            reverse(s.begin()+left,s.begin()+right);
+            i=right;
+            left=right=i;
+        }
+        cout<<s<<endl;
+    }
+    return 0;
+}

E.cpp

@@ -0,0 +1,14 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main() {
+    vector<vector<int> > v(3,vector<int>(4,0));
+    for(int i=0; i<3; i++)for(int j=0; j<4; j++)cin>>v[i][j];
+    int Max=v[0][0],r=0,c=0;
+    for(int i=0; i<3; i++)for(int j=0; j<4; j++) {
+            if(v[i][j]>Max) {
+                Max=v[i][j],r=i,c=j;
+            }
+        }
+    cout<<Max<<" "<<r<<" "<<c<<endl;
+    return 0;
+}

F.cpp

@@ -0,0 +1,24 @@
+#include<bits/stdc++.h>
+using namespace std;
+bool cmp(const string & a, const string & b) {
+    if (a.size() != b.size()) {
+        return a.size() < b.size();
+    }
+    return a < b;
+}
+int main()
+{
+    int n;
+    while (cin >> n)
+    {
+        vector < string > v(n);
+        for (int i = 0; i < n; i++) {
+            cin >> v[i];
+        }
+        sort(v.begin(), v.end(), cmp);
+        for (int i = 0; i < n; i++) {
+            cout << v[i] << endl;
+        }
+    }
+    return 0;
+}

G.cpp

@@ -0,0 +1,50 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+int a, b, n;
+int flag[67] = {
+        0
+};
+//mod7 很有意思，最多有 7 * 7种情况吧，找循环结构
+// 十位数是本位，个位数是上一位，方便操作
+int f[100] = {
+        0
+};
+
+int main() {
+    while (scanf("%d%d%d", &a, &b, &n)) {
+        int Begin = 100;
+        int length = 0;
+        memset(flag, 0, sizeof(flag));
+        memset(f, 0, sizeof(f));
+        if (a == 0 && b == 0 && n == 0) {
+            break;
+        }
+        f[1] = 1;
+        f[2] = 1;
+        for (int i = 3; i <= 100; i++) {
+            if (i < Begin) {
+                int ans = ((a * f[i - 1] + b * f[i - 2]) % 7) * 10 + f[i - 1];
+                if (flag[ans] == 0) {
+                    flag[ans] = i;
+                } else {
+                    Begin = flag[ans];
+                    length = i - flag[ans];
+                }
+                f[i] = ans / 10;
+            } else {
+                break;
+            }
+        }
+        if (n < Begin) {
+            printf("%d\n", f[n]);
+        } else {
+            printf("%d\n", f[(n - Begin) % length + Begin]);
+        }
+    }
+    return 0;
+}
+//
+// Created by Administrator on 2018-11-05.
+//
+