ohmyfun ohmyfun

#include #include using namespace std; int main() { int wincheck = 0; int arrsum = 0; int arr2sum = 0; vector arr(10); vector arr2(10); for (int i = 0; i > arr[j]; } else if (i == 1) { cin >> arr2[j]; } } } for (int i = 0; i arr2[i]) { arrsum = arrsum + 3; wincheck = i; } else if (arr[i] < arr2[i]) { arr2sum ..

#include #include using namespace std; int result(int a,int b) { char A = 'A'; char B = 'B'; char D = 'D'; if (a == 1 && b == 2) { return B; } else if (a == 1 && b == 3) { return A; } else if (a == 1 && b == 1) { return D; } if (a == 2 && b == 1) { return A; } else if (a == 2 && b == 3) { return B; } else if (a == 2 && b == 2) { return D; } if (a == 3 && b == 1) { return B; } else if (a == 3 && ..

#include #include using namespace std; int main() { int sum = 0; int N; cin >> N; vector arr(N); for (int i = 0; i > arr[i]; } for (int i = 0; i arr[j]) { if (j == N - 1) { sum++; } continue; } else break; } } cout

#include #include using namespace std; int main() { int arr[2]; int N; int sum=0; int max = 0; for (int i = 0; i > arr[i]; } vector temp(arr[0]); for (int i = 0; i > temp[i]; if (temp[i] > arr[1]) { sum++; if (max < sum) { max = sum; } } else { sum = 0; } } cout

#include #include #include using namespace std; int main() { int N; int sum=0; cin >> N; vector arr(N,vector(2)); for (int i = 0; i > arr[i][j]; } } for (int i = 0; i < N; i++) { sum = 0; for (int k = 1; k

#include #include #include using namespace std; int main() { int check=0; char first[100]; char second[100]; cin >> first; cin >> second; for (int i = 0; i < strlen(first); i++) { check = 0; for (int j = 0; j < strlen(second); j++) { if (first[i] == second[j]) { second[j] = '*';//맞는게 있으면 *로 변경해버림 check = 0; break; } else { check = 1; } } if (check == 1)//하나라도 없다면 바로 break하고 끝냄 { break; } } if (c..

1번째 방법 #include #include using namespace std; int main() { int resultcnt = 0; int cnt = 0; int N; cin >> N; vector arr(N); for (int i = 1; i

#include #include using namespace std; int reverse(int x) { int arr[100000]; int temp = 0; int remain = 0; int sum = 0; int i = 0; temp = x; while (temp > 0) { remain = temp % 10; temp = temp / 10; arr[i] = remain; i++; } //cout