@SungWooLee

[PS] BaekJoon 7569

Jul 12, 2023 · 2 min read · #include <iostream> #include <queue> #define MAX 101 using namespace std; struct Coordinate { Coordinate(int x, int y, int z) { X = x; Y = y; Z = z; } int X; int Y; int Z; }; int locoX[6] = { -1,1,0,0...

[PS] BaekJoon 6064

Jul 11, 2023 · 2 min read · Attempt1: Timeout #include <iostream> #include <map> #include <algorithm> using namespace std; int GCD(int x, int y) { if (y == 0) return x; return GCD(y, x % y); } int LCM(int x, int y) { return (x * y) / GCD(x, y); } int mai...

[PS] BaekJoon 5525

Jul 10, 2023 · 2 min read · Partial Success: Brute Force #include <iostream> #include <algorithm> #include <string> using namespace std; int N, M; string SearchString = ""; string S; int Count = 0; void Solve() { int i = 0; int j = 0; int SearchLength = 2 * N + 1;...

[PS] BaekJoon 2630

Jul 10, 2023 · 1 min read · #include <iostream> using namespace std; int N; int Map[129][129]; int White = 0; int Blue = 0; void Solve(int X, int Y, int Length) { if (Length == 1) { if (Map[X][Y] == 1) Blue++; else White++; ...

[PS] BaekJoon 2805

Jul 9, 2023 · 1 min read · #include <iostream> #include <vector> using namespace std; long N, M; vector<long> Trees; long Solve() { long start = 0; long end = 1000000000; long height = (start + end) / 2; long sum = 0; while (true) { for (int i ...