@chwj0608

#include <vector> #include <iostream> #include <algorithm> using namespace std; int dist (pair<int,int> a,pair<int,int> b) { return abs(a.first - b.first) + abs(a.second - b.second); } int main() { int n,k;

#include <iostream> #include <algorithm> #include <vector> #include <queue> using namespace std; #define fastio cin.tie(0)->sync_with_stdio(0) using ll = long long; using matrix = vector<vector<ll>>;

#include <algorithm> #include <iostream> #include <vector> using namespace std; bool compare(pair<int,int> a,pair<int,int> b){ if (a.second != b.second) return a.second < b.second; return a.first < b.first; }

#include <iostream> #include <algorithm> using namespace std; int main() { int n,k; cin >> n >> k; int arr[100000][100000] = {0,}; for (int i = 0;i < n ;i++ ) { int x,y;

#include <iostream> #include <algorithm> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i=0;i<n;i++) { arr[i] = i+1;

#include <iostream> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0;i < n;i++) { cin >> arr[i]; }

#include <iostream> using namespace std; int main() { int n; int cnt = 1; cin >> n; int arr[n]; for (int i = 0;i < n;i++) { cin >> arr[i];

#include <iostream> #include <algorithm> using namespace std; int main() { while(true) { int n,m,p; cin >> n >> m >> p; if (n == 0) { break;

#include <iostream> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0;i < n;i++) { cin >> arr[i]; }

#include <iostream> using namespace std; int main() { int n; cin >> n; int arr[n*2]; for (int i = 0;i < n*2;i++) { cin >> arr[i]; }

#include <iostream> #include <algorithm> using namespace std; int main() { int n; cin >> n; int x[n]; int t[n];

#include <iostream> using namespace std; int main() { int n; cin >> n; int x[n]; int t[n]; int b; int cnt = 0;

#include <iostream> #include <algorithm> using namespace std; int main() { int n; cin >> n; int arr[n+1]; arr[1] = 0;

#include <iostream> using namespace std; int main() { int t; cin >> t; for (int i = 0;i < t;i++) { int n; cin >> n; int dp[n+1];

#include <iostream> using namespace std; int main() { int n,k,p; cin >> n >> k >> p; int arr[n*k]; int cnt = 0; for (int i = 0;i < n*k;i++) {

#include <iostream> using namespace std; int main() { int n,k,p; int cnt = 0; int cnt2 = 0; cin >> n >> k >> p; int arr[n*k];

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], b[n]; int arr = 2100000000; bool t = false;

#include <iostream> #include <queue> using namespace std; int main() { int n,k; cin >> n >> k; queue<int> q; int visited[100001] = {0,}; q.push(n);

#include <iostream> using namespace std; int cnt = 0; int arr[101][101]; int visited[101][101] = {0,}; int main() { int n; cin >> n;

#include <iostream> using namespace std; int main() { int n; cin >> n; int cnt = 99; if (n < 100) { cout << n; return 0; }