목록2023/07 (22)

CodeLabs

[백준 / 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
[백준 / C#] 1927 : 최소 힙

using System; using System.Collections.Generic; using System.Text; using System.IO; namespace _11279 { class MaxHeap { private List A = new List(); public void Add(int value) { // Add the end A.Add(value); // bubble up(부모노드 찾기) int i = A.Count - 1; while (i > 0) { int parent = (i - 1) / 2; if (A[parent] > A[i]) // Max Heap일때는 부등호를 반대 { Swap(parent, i); i = parent; } else break; } } public int Re..
백준/1000 ~ 2023. 7. 24. 18:44
[백준 / C++] 1764 : 듣보잡

#include #include #include #include #define pp pair using namespace std; int n, m, idx = 0; string str; map mm; map answer; bool compare(const pp& a, const pp& b) { if (a.second == b.second) return a.first > n >> m; for (int i = 0; i > str; mm[str] = true; } for (int i = 0; i > str; if (mm[str]) { answer..
백준/1000 ~ 2023. 7. 21. 18:43
[백준 / C#] 1697 : 숨바꼭질

using System; using System.Collections.Generic; using System.Linq; struct Locate { public int location, time; public Locate(int location,int time) { this.location = location; this.time = time; } } class Program { static int[] N_K = Console.ReadLine().Split().Select(int.Parse).ToArray(); static int n = N_K[0], k = N_K[1]; static bool[] visited = new bool[100001]; static Queue lot = new Queue(); s..
백준/1000 ~ 2023. 7. 18. 18:42
이전 Prev 1 2 3 4 Next 다음