@chwj0608

#include <iostream> using namespace std; int main() { int count[1001] = {0}; int sum = 0; for (int i = 0; i < 10; i++) { int num;

#include <iostream> using namespace std; int main() { int n; cin >> n; while (n--) { int cntA, cntB; int a[5] = {0};

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

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

#include <iostream> #include <vector> using namespace std; int main() { vector<int> v; vector<int> v2; int arr[7]; for (int i = 0;i < 7;i++) { cin >> arr[i];

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

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

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

#include <iostream> using namespace std; int main() { int s,e; cin >> s >> e; int i = 1; int a = 0; int m; int cnt;

#include <iostream> using namespace std; int main() { float cnt = 0; float time = 0; for (int i = 0;i < 5;i++) { float s,e; cin >> s >> e; float a = e-s;

#include <iostream> using namespace std; int main() { float cnt = 0; float time = 0; for (int i = 0;i < 5;i++) { float s,e; cin >> s >> e; float a = e-s;

#include <iostream> #include <string> using namespace std; int main() { string s; cin >> s; int cnt = 0; int a = 0; for (int i = s.length()-1;i >= 0;i--) {

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

#include <iostream> using namespace std; int dx[8] = {-1,0,1,-1,1,-1,0,1}; int dy[8] = {-1,-1,-1,0,0,1,1,1}; int main() { int arr[9][9]; int r,c; for (int i = 0;i < 9;i++) { for (int j = 0;j < 9;j++) {

#include <iostream> using namespace std; int n, m; char a[101][101]; bool visited[101][101]; int dx[8] = {-1,0,1,-1,1,-1,0,1}; int dy[8] = {-1,-1,-1,0,0,1,1,1};

#include <iostream> using namespace std; int n, m; char a[101][101]; bool visited[101][101]; int dx[8] = {-1,0,1,-1,1,-1,0,1}; int dy[8] = {-1,-1,-1,0,0,1,1,1};

#include <iostream> using namespace std; int main() { int n; cin >> n; int dp[n+1]; if (n == 1) { cout << 1; return 0;

#include <iostream> using namespace std; int main() { int n; cin >> n; int dp[n+1]; if (n == 1) { cout << 1; return 0;

#include <iostream> using namespace std; int main() { int n; cin >> n; int dp[n+1]; if (n == 1) { cout << 1; return 0;

#include <iostream> #include <stack> using namespace std; stack<int> num; stack<char> op; int priority(char c){ if(c=='+'||c=='-') return 1; if(c=='*'||c=='/') return 2;