Submission

Score: 0

User: Bermmmm

Problemset: Path Finding

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-14 23:51:48

#include <bits/stdc++.h>
using namespace std;

int main() {
    int N,n;
    cin >> N >> n;
    int x[1000],y[1000];

    for (int i = 0;i<N;i++) {
        for (int j = 0;j<N;j++) {
        }
    }

    for (int i = 0;i<n;i++) {
        cin >> x[i] >> y[i];
    }

    for (int i = 0;i<n;i++) {
        if (x[i] < 0 || x[i] > N || y[i] < 0 || y[i] > N) {
            cout << "Out of range";
            return 0;
        }
    }
}