单选题库

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int lengthOfLIS(vector<int>& nums) {
    int n = nums.size();
    if (n == 0) return 0;
    vector<int> dp(n, 1);
 
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < i; j++) {
            if (nums[i] > nums[j]) {
                ___________________
            }
        }
    }
    return *max_element(dp.begin(), dp.end());
}
 
int main() {
    int n;
    cin >> n;
    vector<int> nums(n);
    for (int i = 0; i < n; i++) {
        cin >> nums[i];
    }
 
    int result = lengthOfLIS(nums);
    cout << result << endl;
 
    return 0;
}

#include <iostream>
#include <vector>
#include <stack>
using namespace std;
 
void DFS(int start, vector<vector<int>>& graph, vector<bool>& visited) {
    stack<int> s;
    s.push(start);
    visited[start] = true;
 
    while (!s.empty()) {
        int node = s.top();
        s.pop();
 
        cout << node << " "; // 输出当前节点
 
        // 遍历邻接节点
        for (int neighbor : graph[node]) {
            if (!visited[neighbor]) {
                // 在此处填入代码
            }
        }
    }
}
 
int main() {
    int n, m;
    cin >> n >> m;
 
    vector<vector<int>> graph(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
 
    vector<bool> visited(n, false);
 
    // 从节点 0 开始DFS遍历
    DFS(0, graph, visited);
 
    return 0;
}

#include <string>
int count_miracle(int N) {
    int cnt = 0;
    for (int n = 1; n * n < N; n++) {
        int n2 = n * n;
        std::string s = std::to_string(n2);
 
        for (int i = 1; i < s.length(); i++) {
            if (s[i] != '0') {
                std::string s1 = s.substr(0, i);
                std::string sr = s.substr(i);
                int n1 = std::stoi(s1);
                int nr = std::stoi(sr);
                if (__________) // 在此处填入选项
                    cnt++;
            }
        }
    }
    return cnt;
}