Submission #60329330

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <vector>
using namespace std;
void dfs(int N, int M, int pos, int last, vector<int>& current, vector<vector<int>>& result) {
    // ベースケース: 長さがNになったら結果に追加
    if (pos == N) {
        result.push_back(current);
        return;
    }
    // 次に選べる値の範囲を計算
    int start = (pos == 0) ? 1 : last + 10;
    // 範囲を満たす値を探索
    for (int i = start; i <= M; ++i) {
        current.push_back(i);
        dfs(N, M, pos + 1, i, current, result);
        current.pop_back(); // バックトラック
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <vector>
using namespace std;

void dfs(int N, int M, int pos, int last, vector<int>& current, vector<vector<int>>& result) {
    // ベースケース: 長さがNになったら結果に追加
    if (pos == N) {
        result.push_back(current);
        return;
    }

    // 次に選べる値の範囲を計算
    int start = (pos == 0) ? 1 : last + 10;

    // 範囲を満たす値を探索
    for (int i = start; i <= M; ++i) {
        current.push_back(i);
        dfs(N, M, pos + 1, i, current, result);
        current.pop_back(); // バックトラック
    }
}

int main() {
    int N, M;
    cin >> N >> M;

    vector<vector<int>> result;
    vector<int> current;

    // DFSで条件を満たす数列を生成
    dfs(N, M, 0, 0, current, result);

    // 結果を出力
    cout << result.size() << endl;
    for (const auto& seq : result) {
        for (size_t i = 0; i < seq.size(); ++i) {
            if (i > 0) cout << " ";
            cout << seq[i];
        }
        cout << endl;
    }

    return 0;
}

Submission Info

Judge Result