@chwj0608

#include <bits/stdc++.h> using namespace std; int main() { int n,m,v; queue <int> q; cin >> n >> m >> v; q.push(v) for (int i = 0;i < m;i++) {

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

#include <iostream> using namespace std; int main() { int n; cin >> n; for (int i = n / 5; i >= 0; i--) { int cnt = n - i * 5;

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

#include <iostream> #include <string> using namespace std; int dx[4] = {0, -1, 1, 0}; int dy[4] = {-1, 0, 0, 1}; int arr[1001][1001]; void change(int i, int j, int n, int m){

#include <iostream> #include <vector> #include <string> using namespace std; int main() { int n, m; cin >> n >> m; vector<string> board(n);

#include <iostream> using namespace std; int main() { int t; cin >> t; while (t--) { int N, M;

#include <iostream> #include <vector> #include <queue> using namespace std; int visited[1000]; vector<int> c[1000]; void counting_is_good(int i) {

#include <iostream> using namespace std; int dx[4] = {0, -1, 1, 0}; int dy[4] = {-1, 0, 0, 1}; int arr[101][101]; int n, m; int change(int y, int x) {

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

#include <iostream> using namespace std; int main() { int a,b,v; cin >> a >> b >> v; if (a-b + a-b >= v) { cout << 2;

#include <iostream> #include <string> using namespace std; int main() { int arr; int aar; cin >> arr;

#include<bits/stdc++.h> using namespace std; int N; long long result; vector<long long> rooms; int main() { ios::sync_with_stdio(false);

#include <iostream> using namespace std; int main() { long long n; cin >> n; long long tmp; long long arr[n];

#include <iostream> using namespace std; int platform[3][3]; bool visited[3][3]; int n; int success = 0; void check(int i, int j) {

#include <iostream> using namespace std; int main() { int dol; cin >> dol; if (dol % 2 == 1) { cout << "SK";

#include <iostream> #include <string> #include <algorithm> using namespace std; int dx[4] = {0, -1, 1, 0}; int dy[4] = {-1, 0, 0, 1}; int arr[30][30];

#include <iostream> using namespace std; int dy[8] = {-1,-1,-1,0,0,1,1,1}; int dx[8] = {-1,0,1,-1,1,-1,0,1}; int arr[50][50]; int a,b;

#include <iostream> #include <string> #include <queue> using namespace std; int main() { int n, m; cin >> n >> m;

#include <iostream> #include <vector> #include <queue> using namespace std; int main() { int com, link; cin >> com >> link;