[정수론] 9월 13일

1213.cpp

@@ -0,0 +1,66 @@
+#include <iostream>;
+#include <string>;
+
+using namespace std;
+
+
+
+int main() {
+
+	int arr[26] = { 0 };
+
+	string str;
+	cin >> str;
+
+	for (int i = 0; i < str.length(); i++) {
+		int index = str[i] - 65;
+		arr[index]++;
+	}
+
+
+	int odd = 0;
+	int odd_index;
+	string sol = "";
+	bool flag = false;
+
+	// Ȧ�� ���� ����
+	for (int i = 0; i < 26; i++) {
+		if (arr[i] % 2 != 0)
+			odd++;
+	}
+
+	// Ȧ���� 1�� �̻��̸� ����
+	if (odd > 1) {
+		cout << "I'm Sorry Hansoo";
+	}
+
+	else {
+		for (int i = 0; i < 26; i++) {
+			if (arr[i] % 2 != 0) {
+				odd_index == i;
+				flag = true;
+			}
+
+		}
+
+		for (int i = 0; i < 26; i++) {
+			for (int j = 0; j < arr[i] / 2; j++) {
+				sol += i + 'A';
+			}
+		}
+
+		for (int i = 0; i < 26; i++)
+			if (arr[i] % 2)
+				sol += i + 'A';
+
+
+		for (int i = 25; i >= 0; i--) {
+			for (int j = 0; j < arr[i] / 2; j++) {
+				sol += i + 'A';
+			}
+		}
+	}
+
+	cout << sol;
+	return 0;
+}

14490.cpp

@@ -0,0 +1,30 @@
+#include <iostream>
+#include <string>
+#include <sstream>
+
+using namespace std;
+
+// ��Ŭ���� ȣ����
+int gcdRecursion(int a, int b) {
+	// a > b �� ��, a�� b�� �ִ������� ����
+	if (b == 0) {
+		return a;
+	}
+	return gcdRecursion(b, a % b);
+}
+
+
+int main() {
+	string str;
+	cin >> str;
+
+	string str1 = str.substr(0, str.find(':'));
+	string str2 = str.substr(str.find(':') + 1);
+
+	int n = stoi(str1);
+	int m = stoi(str2);
+
+	int gcd = gcdRecursion(n, m);
+	cout << n / gcd << ":" << m / gcd;
+	return 0;
+}

2108.cpp

@@ -0,0 +1,63 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <math.h>
+
+using namespace std;
+
+int main() {
+	int count;
+	cin >> count;
+
+	int sum = 0;
+
+	vector<int> v;
+	int arr[8001] = { 0 };
+
+	for (int i = 0; i < count; i++) {
+		int n;
+		cin >> n;
+		sum += n;
+		v.push_back(n);
+		arr[n+4000]++;
+
+	}
+
+	// ��� - �Ҽ��� ���� ù���ڸ� �ݿø�
+	double avg = ((double)sum) / count;
+	avg = round(avg);
+	if (avg == -0) {
+		avg = 0;
+	}
+	cout << avg << "\n";
+
+	// �߾Ӱ�
+	sort(v.begin(), v.end());
+	int med = v.at(v.size() / 2);
+	cout << med << "\n";
+
+	// �ֺ�
+	int stop = 0;
+	int com;
+	int common_value = 0;
+	for (int i = 0; i < 8001; i++) {
+		if (arr[i] > common_value) {
+			common_value = arr[i];
+		}
+	}
+	for (int i = 0; i <  8001; i++) {
+		if (arr[i] == common_value) {
+			com = i-4000;
+			stop++;
+		}
+		if (stop == 2) {
+			break;
+		}
+	}
+	cout << com << "\n";
+
+	// ����
+	int rng = v.back() - v.front();
+	cout << rng;
+	return 0;
+}

2168.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+
+using namespace std;
+
+
+// ��Ŭ���� ȣ����
+int gcdRecursion(int x, int y) {
+    // a > b �� ��, a�� b�� �ִ������� ����
+    if (y == 0) {
+        return x;
+    }
+    return gcdRecursion(y, x % y);
+}
+
+int main() {
+    // �Է�
+    int x, y;
+    cin >> x >> y;
+
+    // x�� y�� �ִ����� ���ϱ�
+    int gcd = gcdRecursion(x, y);
+
+    cout << x + y - gcd;
+
+    return 0;
+}