최근 글
[정올] 1114 / 목걸이(The necklace of beads)

입력을 받으며 전에 있는 진주와 종류가 같으면 합쳐서 최적화. #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define interface struct #define zx3f 1061109567 #define itn int #define _DEBUG_ 0 #define dout \ if (_DEBUG_) \ cout typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32..

[정올] 2573 / [백준] 2532 / 먹이사슬

#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define interface struct #define zx3f 1061109567 #define itn int typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32; typedef long long i64; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; template cl..

[정올] 1257 / 전깃줄 (중) / [백준] 2568 / 전깃줄 - 2

#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define interface struct #define zx3f 1061109567 #define itn int typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32; typedef long long i64; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; template cl..

[정올] 1000 / 두 정수 더하기(A+B) / [백준] 1000 / A+B

문제 두 정수 A, B를 입력받아 A + B를 출력하는 문제 정답 코드 C++ #include using namespace std; int main() { int A; int B; cin>>A; cin>>B; cout

[정올] 2913 / [백준] 10835 / 카드게임

#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define interface struct #define zx3f 1061109567 #define itn int typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32; typedef long long i64; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int N; int ..

[정올] 1677 / 경로찾기

#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define interface struct #define zx3f 1061109567 #define itn int #define dout(X) \ if (X) \ cout typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32; typedef long long i64; int dx[] = {0, 1, -1}; int dy[]..

[정올] 2138 / 네 줄로 타일 깔기

#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define interface struct #define zx3f 1061109567 #define itn int typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32; typedef long long i64; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int n, m; i..

[백준] 2718 / 타일 채우기

#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define interface struct #define zx3f 1061109567 #define itn int typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32; typedef long long i64; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int n, m; i..

[정올] 2112 / [백준] 2133 / 세 줄로 타일 깔기(3열로 타일깔기)

#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define interface struct #define zx3f 1061109567 #define itn int typedef long long ll; typedef unsigned long ull; typedef pair pii; typedef signed char i8; typedef short i16; typedef int i32; typedef long long i64; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int n; int ..