@chwj0608

#include <iostream> using namespace std; int main() { int s; int n = 1; cin >> s; while(s > 0){ n++;

#include <iostream> using namespace std; int main() { int n; cin >> n; for (int i = 0;i < n;i++) { int m1,m2; cin >> m1 >> m2;

#include <iostream> #include <queue> 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 main() { int n,m; cin >> n >> m;

#include <iostream> #include <cstring> #include <string> #include <set>

#include <iostream> using namespace std; int main() { int a, b; cin >> a >> b; int cnt = 0; while (b >= a) {

#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> #include <vector> #include <queue> #include <algorithm> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0);

#include<bits/stdc++.h> using namespace std; int N; int arr[16][2]; int benefit = 0; void ddddawang(int x, int b) { if(x > N){

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

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); string s; cin >> s;

#include <iostream> #include <algorithm> using namespace std; int cnt = 0; int dx[4] = {0, -1, 1, 0}; int dy[4] = {-1, 0, 0, 1}; int arr[101][101]; int visited[101][101] = {0,}; void rain (int max_val,int i,int j,int k,int n) { visited[i][j] = 1

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

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; int arr_sum[n]; for (int i = 1; i <= n; i++) { cin >> arr[i];

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

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

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

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n;

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n;

#include <iostream> using namespace std; int main() { int t; cin >> t; for (int i = 0;i < t;i++) { int r,l,s; cin >> r >> l >> s;

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int x[3];