전체 글351 [1991] 트리 순회 #include using namespace std;typedef struct node{char left;char right;}node;node arr[27];void preorder(char c){if (c == '.')return;else{cout > c3;arr[c1].left = c2;arr[c1].right = c3;}preorder('A'); cout 2018. 10. 20. [9252] LCS 2 #include #include #include using namespace std;string s1, s2;int dp[1001][1001] = { 0 };int main(){int i, j;cin >> s1 >> s2;for (i = 1; i 2018. 10. 20. [9251] LCS #include #include #include using namespace std;char a[1001], b[1001];int dp[1001][1001] = { 0 };int main(){cin >> a >> b;for (int i = 1; i 2018. 10. 20. [1912] 연속합 #include #include #include using namespace std;int fastestMaxSum(const vector & v){int sum = 0, psum = 0, i;for (i = 0; i > n;vector v(n);for (i = 0; i > num;v.push_back(num);}cout 2018. 10. 20. [1547] 공 #include #include using namespace std;int main(){bool v[4] = { false, true, false, false };int testcase, k = 0;cin >> testcase;for (int i = 1; i > a >> b;swap(v[a], v[b]);}for (int i = 1; i 2018. 10. 20. [1065] 한수 #include using namespace std;int main(){int n, i, count;int a, b, c;cin >> n;if (n 2018. 10. 20. [7568] 덩치 #include using namespace std;int main(){int n, i, j;int arr[3][51] = {0};cin >> n;for (i = 0; i > arr[0][i] >> arr[1][i];for (i = 0; i 2018. 10. 20. [2231] 분해합 #include using namespace std;int Solution(int num){int sum = num;while (num){sum += num % 10;num /= 10;}return sum;} int main(){int n, i;cin >> n;for (i = 1; i 2018. 10. 20. [2309] 일곱 난쟁이 #include #include using namespace std;int sum = 0;int Solution(int *arr){int i, j;for (i = 0; i 2018. 10. 20. [2493] 탑 #include #include using namespace std;int main(){int n, t, i;stack st;scanf("%d", &n);for (i = 1; i t){printf("%d ", st.top().first);break;}st.pop();}if (st.empty())printf("0 ");st.push(make_pair(i, t));}} 2018. 10. 20. [42588] 탑 #include #include using namespace std;vector solution(vector heights){vector answer;bool isReceive = false;for (int i = 0; i = 0; j--){if (heights[i] 2018. 10. 20. [42862] 체육복 #include #include using namespace std;int solution(int n, vector lost, vector reserve){int answer = 0, i;int arr[32];for (i = 0; i 2018. 10. 20. [2959] 거북이 #include #include using namespace std;int main(){int arr[4];cin >> arr[0] >> arr[1] >> arr[2] >> arr[3];sort(arr, arr + 4);cout 2018. 10. 19. [1813] 마지막 한마디 #include using namespace std;int arr[100001] = { 0, };int main(){int n, i;cin >> n;for (i = 0; i > num;arr[num]++;}for (i = n; i >= 0; i--){if (arr[i] == i){cout 2018. 10. 19. [1834] 나머지와 몫이 같은 수 #include using namespace std;int main(){int n;long long i, sum = 0;cin >> n;for (i = 1; i 2018. 10. 19. [11047] 동전 0 #include #include using namespace std;int main(){int n, i, k, count = 0;vector arr;cin >> n >> k;for (i = 0; i > num;arr.push_back(num);}for (i = n-1; i >= 0; i--){count += k / arr[i];k %= arr[i];}cout 2018. 10. 14. [11399] ATM #include #include #include using namespace std;int main(){int testcase, sum = 0, i;vector arr;cin >> testcase;arr.push_back(0);for (i = 1; i > num;arr.push_back(num);}sort(arr.begin(), arr.end());for (i = 1; i 2018. 10. 12. [9243] 파일 완전 삭제 #include #include using namespace std;int main(){string s1, s2;int i, n;cin >> n >> s1 >> s2;if (n % 2 != 0)for (i = 0; i 2018. 10. 9. [2864] 5와 6의 차이 #include #include using namespace std;int main(){int i, j, minsum, maxsum;string s1, s2;cin >> s1 >> s2;for (i = 0; i 2018. 10. 6. [11758]CCW #include using namespace std;int main(){int x1, y1, x2, y2, x3, y3; cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3; int temp = (x2 - x1)*(y3 - y1) - (y2 - y1)*(x3 - x1); if (temp > 0)cout 2018. 10. 6. 이전 1 ··· 5 6 7 8 9 10 11 ··· 18 다음
