add 去哪网

Author: pandasLab

去哪网/1.1.png

@@ -0,0 +1,96 @@
+// C
+#ifndef _GLIBCXX_NO_ASSERT
+#include <cassert>
+#endif
+#include <cctype>
+#include <cerrno>
+#include <cfloat>
+#include <ciso646>
+#include <climits>
+#include <clocale>
+#include <cmath>
+#include <csetjmp>
+#include <csignal>
+#include <cstdarg>
+#include <cstddef>
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+#include <ctime>
+
+#if __cplusplus >= 201103L
+#include <ccomplex>
+#include <cfenv>
+#include <cinttypes>
+//#include <cstdalign>
+#include <cstdbool>
+#include <cstdint>
+#include <ctgmath>
+#include <cwchar>
+#include <cwctype>
+#endif
+
+// C++
+#include <algorithm>
+#include <bitset>
+#include <complex>
+#include <deque>
+#include <exception>
+#include <fstream>
+#include <functional>
+#include <iomanip>
+#include <ios>
+#include <iosfwd>
+#include <iostream>
+#include <istream>
+#include <iterator>
+#include <limits>
+#include <list>
+#include <locale>
+#include <map>
+#include <memory>
+#include <new>
+#include <numeric>
+#include <ostream>
+#include <queue>
+#include <set>
+#include <sstream>
+#include <stack>
+#include <stdexcept>
+#include <streambuf>
+#include <string>
+#include <typeinfo>
+#include <utility>
+#include <valarray>
+#include <vector>
+
+#if __cplusplus >= 201103L
+#include <array>
+#include <atomic>
+#include <chrono>
+#include <condition_variable>
+#include <forward_list>
+#include <future>
+#include <initializer_list>
+#include <mutex>
+#include <random>
+#include <ratio>
+#include <regex>
+#include <scoped_allocator>
+#include <system_error>
+#include <thread>
+#include <tuple>
+#include <typeindex>
+#include <type_traits>
+#include <unordered_map>
+#include <unordered_set>
+#endif
+
+
+//#include <bits/stdc++.h>
+
+// #define LL long long
+// #define INT_MAX 2147483647
+// #define INT_MIN (-INT_MAX - 1)
+
+

去哪网/1.2.png

@@ -0,0 +1,3 @@
+第一题：67%
+第二题：100%
+第三题：76%

去哪网/2.1.png

@@ -0,0 +1,12 @@
+int result = 1;
+    int k = n-m;
+    for(int i = n; i > 1; i--){
+        result *= i;
+    }
+    for(int i = k; i >= 1; i--){
+        result /= i;
+    }
+    for(int i = m; i >1; i--){
+        result /= i;
+    }
+    return result;

去哪网/2.2.png

@@ -0,0 +1,79 @@
+#include "include.h"
+
+using namespace std;
+
+//获取一个数字
+template <typename T>
+T getNum(){
+    T result = 0;
+    string str;
+    bool isFushu = false;
+    getline(cin, str);
+    for(int i = 0; i < str.size(); ++i){
+        if(str[i] == '-'){
+            isFushu = true;
+            continue;
+        }
+        if(str[i]>='0' && str[i] <= '9'){
+            result = isFushu? result*10 - str[i] + '0' : result*10 + str[i] - '0';
+        }
+    }
+    return result;
+}
+
+//获取一维数组
+template <typename T>
+vector<T> getNums(char c = ' '){
+    vector<T> result;
+    string str;
+    T tmp = 0;
+    bool minus = false;
+    getline(cin, str);
+    if(str.size() == 0) return result;
+    for(int i = 0; i < str.size(); i++){
+        if(str[i] == c){
+            result.push_back(tmp);
+            tmp = 0;
+            minus = false;
+            continue;
+        }
+        if(str[i] == '-'){
+            minus = true;
+            continue;
+        }
+        tmp = minus? tmp*10 - str[i] + '0' : tmp*10 + str[i] - '0';
+    }
+    result.push_back(tmp);
+    return result;
+}
+
+int maxlength(vector<int> nums1, vector<int> nums2){
+    vector<vector<int> > dp(nums1.size()+1, vector<int>(nums2.size()+1, 0));
+    for (int i = 0; i < nums1.size(); i++)
+    {
+        for (int j = 0; j < nums2.size(); j++)
+        {
+            if(nums1[i] == nums2[j]){
+                dp[i+1][j+1] = dp[i][j] +1;
+            }else{
+                dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j]);
+            }
+        }
+    }
+    return dp[nums1.size()][nums2.size()];
+}
+
+int main(int argc, char const *argv[])
+{
+    int n = getNum<int>();
+    vector<int> list1 = getNums<int>();
+    vector<int> list2 = getNums<int>();
+    cout << maxlength(list1,list2);
+    return 0;
+}
+
+/*
+7
+a b c d e f g
+b d a c f g e
+*/

去哪网/3.1.png

@@ -0,0 +1,45 @@
+#include "include.h"
+
+using namespace std;
+
+//获取一个数字
+template <typename T>
+T getNum(){
+    T result = 0;
+    string str;
+    bool isFushu = false;
+    getline(cin, str);
+    for(int i = 0; i < str.size(); ++i){
+        if(str[i] == '-'){
+            isFushu = true;
+            continue;
+        }
+        if(str[i]>='0' && str[i] <= '9'){
+            result = isFushu? result*10 - str[i] + '0' : result*10 + str[i] - '0';
+        }
+    }
+    return result;
+}
+
+int c(int n, int m){
+    int result = 1;
+    int k = n-m;
+    for(int i = n; i > 1; i--){
+        result *= i;
+    }
+    for(int i = k; i >= 1; i--){
+        result /= i;
+    }
+    for(int i = m; i >1; i--){
+        result /= i;
+    }
+    return result;
+}
+
+int main(int argc, char const *argv[])
+{
+    int n = getNum<int>();
+    int m = getNum<int>();
+    cout << c(n, m);
+    return 0;
+}