목록알고리즘 (18)

CodeLabs

[백준 / C#] 1260 : DFS와 BFS

using System; using System.Collections.Generic; using System.Linq; namespace _1260 { class Program { static int n, m, v; static int[] visited = new int[1001]; static int[,] arr = new int[1001, 1001]; static void DPS(int v) { Console.Write(v + " "); visited[v] = 1; for(int i=1; i
백준/1000 ~ 2023. 7. 9. 18:33
[백준 / C#] 1003 : 피보나치 함수

using System; class Program { static int t = int.Parse(Console.ReadLine()); static long[] dp = new long[100]; static long Fibo(int n) { dp[0] = 0; dp[1] = 1; for (int i = 2; i 0) { int n = int.Parse(Console.ReadLine()); Fibo(n); if (n == 0) Console.WriteLine("1 0"); else Console.Write($"{dp[n-1]} {dp[n]}\n"); } } }
백준/1000 ~ 2023. 7. 3. 18:30
[백준 / C#] 7576 : 토마토

using System; using System.Collections.Generic; using System.Linq; namespace _7576 { struct Tomato { public int y, x; public Tomato(int i, int j) { y = i; x = j; } } class Program { static int n, m, result = 0; static int[] dx = { 1, 0, -1, 0 }, dy = { 0, 1, 0, -1 }; // 우 하 좌 상 static int[,] box = new int[1001, 1001]; static Queue q = new Queue(); static void BFS() { while (!q.Count.Equals(0)) {..
백준/5000~ 2023. 6. 30. 18:29
[백준 / C#] 7569 : 토마토

using System; using System.Collections.Generic; using System.Linq; struct Tomato { public int x, y, z; public Tomato(int h, int i, int j) { y = i; x = j; z = h; } } class Program { static int[] M_N_Z = Console.ReadLine().Split().Select(int.Parse).ToArray(); static int m = M_N_Z[0], n = M_N_Z[1], h = M_N_Z[2], result = 0; static int[] dx = { 1, 0, 0, -1, 0, 0 }, dy = { 0, 1, 0, 0, -1, 0 }, dz = {..
백준/5000~ 2023. 6. 28. 18:27
[백준 / C#] 9019 : DLSR

public class Pair { public int num; public string str; public Pair(int num, string str) { this.num = num; this.str = str; } } internal class Program { static int t; static int[] a, b; static string[] result; static void BFS(int flag) { var queue = new Queue(); queue.Enqueue(new Pair(a[flag], "")); bool[] visited = new bool[10000]; visited[a[flag]] = true; while(queue.Count != 0) { int curNum = q..
백준/5000~ 2023. 6. 24. 18:26
[백준 / C#] 1389 : 케빈 베이컨의 6단계 법칙

internal class Program { static int[,] arr; static int n, m, start, end, min = int.MaxValue, result = 0; static List list = new List(); static bool[] visit = new bool[101]; static void BFS(int pivot, int cnt) { if(pivot == end) { arr[start, end] = Math.Min(cnt, arr[start, end]); return; } visit[pivot] = true; for (int i = 0; i < list[pivot].Count; i++) { if (!visit[list[pivot][i]]) { BFS(list[pi..
백준/1000 ~ 2023. 6. 22. 17:23
이전 Prev 1 2 3 Next 다음