Merge branch 'main' into 3-pu2rile

honggukang0623/README.md

@@ -2,5 +2,7 @@
 
 | 차시 |    날짜    | 문제유형 | 링크 | 풀이 |
 |:----:|:---------:|:----:|:-----:|:----:|
-| 1차시 | 2023.10.27 |  BFS  | -  | - |
----
+| 1차시 | 2024.03.26 | 사칙연산 |[분수의덧셈]https://school.programmers.co.kr/learn/courses/30/lessons/120808  | [#5]https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/5 |
+| 2차시 | 2024.03.29 | 배열 |[배열두배만들기]https://school.programmers.co.kr/learn/courses/30/lessons/120809  | [#7]https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/7 |
+| 3차시 | 2024.04.05 | 배열 |[중앙값구하기]https://school.programmers.co.kr/learn/courses/30/lessons/120811#  | [#13]https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/13 |
+| 4차시 | 2024.04.09 | 출력 |[직각삼각형출력하기]https://school.programmers.co.kr/learn/courses/30/lessons/120823  | [#17]https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/17/commits|

honggukang0623/다항식 더하기/다항식 더하기.js

@@ -0,0 +1,36 @@
+function solution(polynomial) {
+    const values = polynomial.split(' + ');
+    console.log("values : ", values);
+    let x = 0;
+    let c = 0;
+    for(let i=0;i<values.length;i++) {
+        const item = values[i];
+        if(item[item.length-1] !== 'x') {
+            c += Number(item);
+        }
+        else {
+            // x일때
+            const num = item.split('x')[0];
+            if(num === '') {
+                x += 1;
+            } else {
+                x += Number(num)
+            }
+        }
+    }
+    let answer = '';
+    if(x === 1) {
+        answer += 'x';
+    }
+    if(x > 1) {
+        answer += `${x}x`;
+    }
+
+    if(x === 0 && c > 0) {
+        answer += c;
+    }
+    else if(c > 0) {
+        answer += ` + ${c}`;
+    }
+    return answer;
+}

honggukang0623/배열/배열 두배 만들기.js

@@ -0,0 +1,11 @@
+function solution(numbers) {
+    var answer = [];
+
+
+    let cnt = 0;
+    while(cnt < numbers.length){
+        answer.push(numbers[cnt]*2);
+        cnt = cnt +1;
+    }
+    return answer;
+} 

honggukang0623/사칙연산/분수의 덧셈.js

@@ -0,0 +1,22 @@
+function solution(numer1, denom1, numer2, denom2) {
+    var answer = [];
+    const numer = numer1 * denom2 + numer2 * denom1;
+    const denom = denom1 * denom2;
+
+    let minNumber;
+    if(numer < denom){
+        minNumber = numer;
+    } else {
+        minNumber = denom;
+    }
+
+
+   while(true){ 
+    if(numer % minNumber === 0){
+        if(denom % minNumber === 0){
+            return [numer / minNumber, denom / minNumber];
+        }
+    }
+    minNumber = minNumber -1;
+   }
+}

honggukang0623/중앙값 구하기/중앙값구하기.js

@@ -0,0 +1,30 @@
+function solution(array) {
+
+    let arrayCnt = 0;
+    let newArray = [];
+    while(arrayCnt < array.length){
+    let minNumber = 1000;
+
+    let cnt = 0;
+    while(cnt < array.length){
+        if(minNumber > array[cnt]){
+            minNumber = array[cnt];
+        }
+        cnt = cnt + 1;
+    }
+
+    newArray.push(minNumber);
+
+    let cnt2 = 0;
+    while(cnt2 < array.length){
+        if(minNumber === array[cnt2]){
+           array[cnt] = 1000;
+            break;
+        }
+        cnt2 = cnt2 + 1
+    } 
+
+        arrayCnt = arrayCnt + 1;
+    }
+    return newArray[Math.floor(array.length / 2)];
+}

honggukang0623/직각삼각형 출력하기/직각삼각형 출력하기.js

@@ -0,0 +1,27 @@
+const readline = require('readline');
+const rl = readline.createInterface({
+    input: process.stdin,
+    output: process.stdout
+});
+
+let input = [];
+
+rl.on('line', function (line) {
+    input = line.split(' ');
+}).on('close', function () {
+    const n = Number(input[0]);
+
+    let line = 1;
+    while(line <= n){
+
+        let starStr = "";
+        let cnt = 0;
+        while(cnt < line){
+            starStr = starStr+"*"
+            cnt = cnt + 1;
+        }
+
+        console.log(starStr)
+        line = line + 1;  
+    }
+});

oesnuj/README.md

@@ -2,5 +2,14 @@
 
 | 차시 |    날짜    | 문제유형 | 링크 | 풀이 |
 |:----:|:---------:|:----:|:-----:|:----:|
-| 1차시 | 2023.10.27 |  BFS  | -  | - |
+| 1차시 | 2024.03.26 |  스택  | [후위표기식2](https://www.acmicpc.net/problem/1935)  | [#4](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/4) |
+| 2차시 | 2024.03.29 |  연결리스트  | [에디터](https://www.acmicpc.net/problem/1406)  | [#8](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/8) |
+| 3차시 | 2024.04.02 |  덱  | [카드 놓기](https://www.acmicpc.net/problem/18115)  | [#11](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/11) |
+| 4차시 | 2024.04.06 |  스택  | [옥상 정원 꾸미기](https://www.acmicpc.net/problem/6198)  | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/14) |
+| 5차시 | 2024.04.13 | 이분탐색  | [듣보잡](https://www.acmicpc.net/problem/1764)  | [#20](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/20) |
+| 6차시 | 2024.05.06 | 기하학  | [정사각형](https://www.acmicpc.net/problem/1485)  | [#22](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/22) |
+| 7차시 | 2024.05.08 | 스택, 큐, 덱 | [queuestack](https://www.acmicpc.net/problem/24511)  | [#24](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/24) |
+| 8차시 | 2024.05.13 | 우선순위 큐 | [카드 정렬하기](https://www.acmicpc.net/problem/1715)  | [#27](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/27) |
+| 9차시 | 2024.05.30 | 구현 | [빙고](https://www.acmicpc.net/problem/2578)  | [#30](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/30) |
+| 10차시 | 2024.07.04 | 구현 | [상어초등학교](https://www.acmicpc.net/problem/21608)  | [#34](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/34) |
 ---

oesnuj/구현/21608.js

@@ -0,0 +1,78 @@
+const fs = require('fs');
+const filepath = process.platform === 'linux' ? '/dev/stdin' : './input.txt';
+const input = fs.readFileSync(filepath).toString().trim().split('\n');
+//입력 데이터 정리
+const N = +input.shift();
+const students = input.map(x => {
+	const [num, ...likes] = x.trim().split(' ').map(Number);
+	return { num, likes };
+});
+
+let board = Array.from({ length: N }, () => Array(N).fill(0));
+
+const dr = [-1, 1, 0, 0];
+const dc = [0, 0, -1, 1];
+
+main();
+
+function main(){
+	for(let i=0; i< N**2; i++){
+		if(i == 0){
+			board[1][1] = students[i].num; //첫학생은 1,1에 무조건 앉는다.
+			continue;
+		}
+		choiceSeat(students[i].num); //학생을 조건에 맞게 앉히기
+	}
+	console.log(calcSatisfy()); //모두 앉은 후 만족도 계산하기
+}
+
+// 최적의 자리 선택 및 학생 배치 함수
+function choiceSeat(studentNum){
+	const neighborInfos = []; //인접 자리 정보를 모으는 배열
+	for(let i = 0; i<N; i++){
+		for(let j =0; j<N; j++){
+			if(board[i][j] !== 0) continue; //이미 차있는 자리 패스
+			neighborInfos.push(getSeatInfo(i, j, studentNum));
+		}
+	}
+	neighborInfos.sort((a, b) => {
+		if (a.match !== b.match) {
+			return b.match - a.match; // match 기준 내림차순 정렬
+		} else if (a.empty !== b.empty) {
+			return b.empty - a.empty; // empty 기준 내림차순 정렬
+		} else if (a.r !== b.r) {
+			return a.r - b.r; // r 기준 오름차순 정렬
+		} else {
+			return a.c - b.c; // c 기준 오름차순 정렬
+		}
+	});
+	board[neighborInfos[0].r][neighborInfos[0].c] = studentNum; //최적의 위치에 앉히기
+}
+
+// 특정 자리의 인접 정보 계산 함수
+function getSeatInfo(r, c, studentNum){
+	let empty = 0;
+	let match = 0;
+	// 학생 번호에 맞는 좋아하는 학생들 찾기
+	let studentLikes = students.find(student => student.num === studentNum)?.likes || [];
+	for(let i = 0; i< 4; i++){
+		nr = r + dr[i];
+		nc= c + dc[i];
+		if(nr < 0 || nc < 0 || nr >= N || nc >= N) continue;
+		if (board[nr][nc] == 0) empty++;
+		else if(studentLikes.includes(board[nr][nc])) match++
+	}
+	return { r: r, c: c, empty: empty, match: match };
+}
+
+//만족도 처리
+function calcSatisfy(){
+	let result = 0;
+	for(let i = 0; i<N; i++){ //남아있는 모든 자리의 정보를 수집
+		for(let j =0; j<N; j++){
+			result += Math.floor(10 ** (getSeatInfo(i, j ,board[i][j]).match-1));
+		}
+	}
+	return result;
+}
+출처: https://oesnuj.tistory.com/entry/Nodejs-백준-Javascript-21608-상어-초등학교 [비트로 그리는 성장일기:티스토리]

oesnuj/구현/2578.cpp

@@ -0,0 +1,79 @@
+#include <iostream>
+using namespace std;
+
+const int BINGO_SIZE = 5;
+int board[BINGO_SIZE][BINGO_SIZE];
+
+void changeBingo(int target);
+int checkBingo();
+
+
+
+int main()
+{
+    ios::sync_with_stdio(0);    cin.tie(0);
+	for (int i = 0; i < BINGO_SIZE; i++)
+	{
+		for (int j = 0; j < BINGO_SIZE; j++)
+		{
+			cin >> board[i][j];
+		}
+	}
+
+	int sayCnt = 0;
+	for (int i = 0; i < BINGO_SIZE * BINGO_SIZE; i++)
+	{
+			int num;
+			cin >> num;
+			sayCnt++;
+			changeBingo(num);
+			if (checkBingo() >= 3) {
+				cout << sayCnt;
+				return 0;
+			}
+	}
+	return 0;
+}
+
+
+void changeBingo(int target)  //사회자가 부른 수 체크하기
+{
+	for (int i = 0; i < BINGO_SIZE; i++){
+		for (int j = 0; j < BINGO_SIZE; j++){
+			if (board[i][j] == target){
+				board[i][j] = 0;
+				return;
+			}
+		}
+	}
+	return;
+}
+
+int checkBingo() //현재 보드판에 빙고가 몇줄인지
+{
+	int bingoCnt = 0;
+
+	for (int i = 0; i < BINGO_SIZE; i++)  //가로, 세로 빙고 확인
+	{
+		int horizontal = 0, vertical = 0;
+		for (int j = 0; j < BINGO_SIZE; j++){
+			if (!board[i][j])
+				horizontal++;
+			if (!board[j][i])
+				vertical++;
+		}
+		if (horizontal == BINGO_SIZE) bingoCnt++;
+		if (vertical == BINGO_SIZE) bingoCnt++;
+	}													
+
+	int right_diagonal = 0, left_diagonal = 0;
+	for (int i = 0; i < BINGO_SIZE; i++) //대각선 2개 빙고 확인
+	{
+		if (!board[i][i]) right_diagonal++;
+		if (!board[i][BINGO_SIZE - i - 1]) left_diagonal++;
+	}
+	if (right_diagonal == BINGO_SIZE) bingoCnt++;
+	if (left_diagonal == BINGO_SIZE) bingoCnt++;
+
+	return bingoCnt;
+}

oesnuj/기하/1485.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <cmath>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+struct Point
+{
+    int x, y;
+};
+
+int calcDistance(Point a, Point b)
+{
+    return pow(a.x - b.x, 2) + pow(a.y - b.y, 2);
+}
+
+bool compareInfo(Point &a, Point &b)
+{
+    if(a.x == b.x)
+        return a.y < b.y;
+    return a.x < b.x;
+}
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int n;
+    cin >> n;
+
+    while (n--)
+    {
+        vector <Point> v(4);
+        for (int i = 0; i < 4; i++) {
+            cin >> v[i].x >> v[i].y;
+        }
+        sort(v.begin(), v.end(),compareInfo);
+        //2 3
+        //0 1
+        int s1 = calcDistance(v[0], v[1]); //선분
+        int s2 = calcDistance(v[0], v[2]);
+        int s3 = calcDistance(v[1], v[3]);
+        int s4 = calcDistance(v[2], v[3]);
+
+        int dia1 = calcDistance(v[0], v[3]); //대각선
+        int dia2 = calcDistance(v[1], v[2]);
+        if (s1 == s2 && s2 == s3 && s3 == s4 && dia1 == dia2) //네변의 길이가 같고 대각선의 길이가 같다.
+            cout << 1 << '\n';
+        else
+            cout << 0 << '\n';
+    }
+    return 0;
+}