csp素材怎么导出？

#include <iostream>
#include <vector>
#include <set>

using namespace std;


int main() {
    int n, L, s;
    cin >> n >> L >> s;
    vector<pair<int, int>> v(n);
    set<pair<int, int>> set;
    for (int i = 0; i < n; i++) {
        cin >> v[i].first >> v[i].second;
        set.insert(v[i]);
    }
    vector<vector<int>> f(s + 1, vector<int>(s + 1));
    for (int i = s; i >= 0; i--) {
        for (int j = 0; j <= s; j++) {
            cin >> f[i][j];
        }
    }

    int ret = 0;
    for (int i = 0; i < n; i++) {
        int r = v[i].first;
        int c = v[i].second;
        bool check = true;
//        若当前点开始的矩阵不足以包含整个藏宝图
        if (r + s > L || c + s > L)
            check = false;
        for (int j = r, tr = 0; j <= r + s && check && tr <= s; j++, tr++) {
            for (int k = c, tc = 0; k <= c + s && check && tc <= s; k++, tc++) {
                if (f[tr][tc]) {
                    if (set.find({j, k}) == set.end()) {
                        check = false;

                    }

                } else {
                    if (set.find({j, k}) != set.end()) {
                        check = false;

                    }

                }
            }
        }
        if (check)
            ret++;
    }
    cout << ret;
    return 0;
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // 初始化数据
        int n, L, S;
        Scanner scanner = new Scanner(System.in);
        // 宝藏数量
        n = scanner.nextInt();
        // 绿化地图大小，L*L
        L = scanner.nextInt();
        // 藏宝图大小，S*S
        S = scanner.nextInt();
        // 绿化地图
        List<String> greenLocationMap = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            greenLocationMap.add(x + "," + y);
        }
        // 宝藏地图
        int[][] treasureMap = new int[S + 1][S + 1];
        for (int i = S; i >= 0; i--) {
            for (int j = 0; j <= S; j++) {
                treasureMap[i][j] = scanner.nextInt();
            }
        }

        // 初始化完成，开始统计
        int numOrgin = 0;
        for (int k = 0; k < greenLocationMap.size(); k++) {
            int orign_x, orign_y;
            String[] tmp_ss = greenLocationMap.get(k).split(",");
            orign_x = Integer.parseInt(tmp_ss[0]);
            orign_y = Integer.parseInt(tmp_ss[1]);
            if(orign_x+S>L||orign_y+S>L){
                continue;
            }
            boolean isOrgin = true;
            int i = 0, j = 0;
            for (i = 0; i <= S; i++) {
                for (j = 0; j <= S; j++) {
                    int actual_x = orign_x + i;
                    int actual_y = orign_y + j;
                    String s = (actual_x) + "," + (actual_y);
                    if (greenLocationMap.contains(s) && treasureMap[i][j] == 0 ||
                            !greenLocationMap.contains(s) && treasureMap[i][j] == 1) {
                        isOrgin = false;
                        break;
                    }

                }
                if (!isOrgin) break;
            }
            if (i == S + 1 && j == S + 1) {
                numOrgin++;
            }
        }
        System.out.println(numOrgin);
    }
}