목록알고리즘 (18)

CodeLabs

[백준 / C#] 2805 : 나무 자르기

using System; namespace _2805 { class Program { static long[] N_M, arr; static long maxValue; static bool Chack(long mid, long[] arr) { long cnt = 0; for (long i = 0; i = N_M[1]; } static void Solution(long[] arr, long wood) { long left = 1; long result = 0; while(left result ? mid : result; left = mid + 1; } else maxValue = mid - 1; }..
백준/1000 ~ 2023. 8. 9. 22:59
[백준 / C#] 2667 : 단지번호붙이기

using System; using System.Collections.Generic; namespace _2667 { class Program { static int n, cnt; static int[] dx = { 0, 1, 0, -1 }, dy = { -1, 0, 1, 0 }; //상하좌우 표현 static string[] input = new string[25]; static bool[,] vi = new bool[25, 25]; static List result = new List(); static void DFS(int i, int j) { vi[i, j] = true; cnt++; for(int k=0; k
백준/1000 ~ 2023. 8. 7. 22:47
[백준 / C#] 2630 : 색종이 만들기

using System; class Program { static int n = int.Parse(Console.ReadLine()); static int[,] map = new int[n, n]; static int[] cnt = new int[2]; static void Divide(int n, int y, int x) { for (int i = y; i < y + n; i++) { for (int j = x; j < x + n; j++) if (map[i, j] != map[y, x]) { Divide(n / 2, y, x); Divide(n / 2, y + n / 2, x); Divide(n / 2, y, x + n / 2); Divide(n / 2, y + n / 2, x + n / 2); re..
백준/1000 ~ 2023. 8. 4. 22:35
[백준 / C#] 2579 : 계단 오르기

using System; class Stair { private int[] cost = new int[301]; internal int this[int index] { get { return cost[index]; } set { cost[index] = value; } } } class Program { static int t = int.Parse(Console.ReadLine()); static int[] dp = new int[301]; static Stair stair = new Stair(); static void Main(string[] args) { for (int i = 0; i < t; i++) stair[i] = int.Parse(Console.ReadLine()); dp[0] = sta..
백준/1000 ~ 2023. 7. 30. 22:27
[백준 / C#] 2178 : 미로탐색

using System; using System.Collections.Generic; using System.Linq; namespace _2178 { class Pair { public Pair(int first_, int second_) { first = first_; second = second_; } public int second { get; set; } public int first { get; set; } } class Program { static int n, m; static int[] dx = { 0, 1, 0, -1 }, dy = { -1, 0, 1, 0 }; static int[,] check = new int[100, 100]; static string[] input = new s..
백준/1000 ~ 2023. 7. 28. 22:23
[백준 / C#] 1931 : 회의실 배정

using System; using System.Linq; class Program { static int n; static int result = 1; static void Input() { n = int.Parse(Console.ReadLine()); } static void Solution() { int[][] meeting_time = new int[n][]; for (int i = 0; i < n; i++) { var input = Console.ReadLine().Split(); int[] copy = new int[2]; copy[0] = int.Parse(input[0]); copy[1] = int.Parse(input[1]); meeting_time[i] = copy; } // 가변배열 ..
백준/1000 ~ 2023. 7. 26. 21:27
이전 Prev 1 2 3 Next 다음