├── 2023-2 ├── Basic │ ├── 202219404 │ │ └── array │ │ │ └── test.cpp │ ├── yeon │ │ ├── test │ │ └── array │ │ │ └── 2577.cpp │ ├── AFpine │ │ └── test.md │ ├── sjin1121 │ │ ├── Queue │ │ │ └── text.txt │ │ ├── Array │ │ │ └── Test.txt │ │ ├── Graph │ │ │ └── test.txt │ │ └── Stack │ │ │ └── text.txt │ ├── Bkjung9 │ │ └── Array │ │ │ ├── Text.txt │ │ │ └── 2577.cpp │ ├── dlgusdn4408 │ │ ├── Array │ │ │ ├── test │ │ │ └── 10808.cpp │ │ └── array │ │ │ └── test │ ├── eunhyoha2 │ │ └── Array │ │ │ ├── test.txt │ │ │ ├── 1475.cpp │ │ │ └── 2577.cpp │ ├── gimyeongsu6737 │ │ ├── Array │ │ │ ├── test.txt │ │ │ ├── boj_10808.cpp │ │ │ └── boj_2577.cpp │ │ └── Queue │ │ │ └── boj_2164.cpp │ ├── igaeun8 │ │ └── Array │ │ │ ├── 2577 │ │ │ ├── 10808 │ │ │ └── test.txt │ ├── ffe4el │ │ ├── Array │ │ │ ├── 두수의합 │ │ │ ├── 두수의합2 │ │ │ ├── 방_번호 │ │ │ ├── array_test │ │ │ ├── 알파벳_개수.cpp │ │ │ └── 두수의합2.cpp │ │ └── Linked_list │ │ │ ├── 에디터2 │ │ │ ├── 키로거 │ │ │ ├── 요세푸스2 │ │ │ ├── linked_list │ │ │ └── tempCodeRunnerFile │ ├── gyeongtae │ │ ├── Array │ │ │ └── 10807.cpp │ │ └── Queue │ │ │ └── 2164.cpp │ ├── saer6114 │ │ └── Array │ │ │ └── 10808.cpp │ ├── minkyunson │ │ └── array │ │ │ └── 2577.cpp │ ├── youth5427 │ │ ├── Recursion │ │ │ └── beak_1629.cpp │ │ ├── array │ │ │ └── Beak_2577.cpp │ │ └── Queue │ │ │ └── Beak_2164.cpp │ ├── user20230912 │ │ ├── Array │ │ │ ├── 2577-2.cpp │ │ │ └── 1475.cpp │ │ └── queue │ │ │ └── 2164.cpp │ └── JoonHyuk0331 │ │ ├── Recursion │ │ └── 1629.cpp │ │ └── 1158.cpp ├── Intermediate │ ├── enjuS2 │ │ └── test │ ├── LuckyPlace │ │ ├── test.txt │ │ ├── MST │ │ │ └── 9372.cpp │ │ └── Dynamic_programming │ │ │ └── 11727.cpp │ ├── dameun2224 │ │ └── BinarySearch │ │ │ └── test.txt │ ├── highcastle01 │ │ └── DP │ │ │ ├── BOJ_11727.cpp │ │ │ └── BOJ_2193.cpp │ └── ksu206631 │ │ └── DP │ │ └── boj2133.cpp └── Exercise │ ├── alphasobs │ ├── week_1 │ │ └── .vscode │ │ │ └── settings.json │ └── week_2 │ │ └── exercise │ │ ├── 14675 │ │ ├── 2118.cpp │ │ └── 14675.cpp │ └── README.md ├── 2023-1 ├── Basic │ ├── dlgustj206 │ │ ├── test │ │ ├── Array │ │ │ ├── 1475.exe │ │ │ ├── 1919.exe │ │ │ ├── 2577.exe │ │ │ ├── 3273.exe │ │ │ ├── 10807.exe │ │ │ ├── 11328.exe │ │ │ ├── 13300.exe │ │ │ ├── 10808.cpp │ │ │ ├── 10807.cpp │ │ │ ├── 2577.cpp │ │ │ └── 3273.cpp │ │ ├── Linked list │ │ │ ├── 1158.exe │ │ │ ├── 1406.exe │ │ │ └── 5397.exe │ │ ├── 기초코드작성요령 │ │ │ ├── 2753.c │ │ │ ├── 10869.c │ │ │ ├── 2440.c │ │ │ ├── 2438.c │ │ │ ├── 2441.c │ │ │ ├── 2442.c │ │ │ ├── 2443.c │ │ │ ├── 2562.c │ │ │ ├── 2576.c │ │ │ ├── 9498.c │ │ │ ├── 2439.c │ │ │ └── 2752.c │ │ └── Queue │ │ │ └── 2164.cpp │ ├── eunhyoha2 │ │ ├── Queue │ │ │ ├── test │ │ │ └── 2164 카드2.cpp │ │ ├── Stack │ │ │ └── test │ │ ├── 기초_코드_작성_요령II │ │ ├── Linked List │ │ │ ├── test2 │ │ │ ├── 1158 요세푸스.cpp │ │ │ ├── 5397 키로거.cpp │ │ │ └── 1406 에디터.cpp │ │ ├── Array │ │ │ ├── 10808_알파벳_개수 │ │ │ ├── 10808_알파벳_개수.c │ │ │ ├── 2577_숫자의_개수.c │ │ │ ├── 1919_에너그램_만들기.c │ │ │ ├── 10807_개수_세기.c │ │ │ └── 1475_방_번호.c │ │ └── Deque │ │ │ └── 1021 회전하는 큐.cpp │ ├── iwtl0303 │ │ ├── Graph │ │ │ └── test │ │ ├── Recursion │ │ │ ├── test │ │ │ └── 1629.cpp │ │ ├── Backtracking │ │ │ └── test │ │ ├── 기초_코드_작성_요령_II │ │ │ ├── 2557_Hello_World.cpp │ │ │ ├── 1000_A+B.cpp │ │ │ ├── 10869_사칙연산.cpp │ │ │ ├── 10171_고양이.cpp │ │ │ ├── 2753_윤년.cpp │ │ │ ├── 10871_X보다_작은_수.cpp │ │ │ ├── 9498_시험_성적.cpp │ │ │ ├── 2572_세수정렬.cpp │ │ │ └── 2576_홀수.cpp │ │ ├── Array │ │ │ ├── 10808_알파벳_개수.cpp │ │ │ ├── 2577_숫자의_개수.cpp │ │ │ └── 10807_개수_세기.cpp │ │ └── Stack │ │ │ └── 10773.cpp │ ├── AFpine │ │ ├── Array │ │ │ ├── test.cpp │ │ │ └── update.txt │ │ └── basic2 │ │ │ └── 1000.cpp │ ├── Joonhyuk0331 │ │ ├── array │ │ │ ├── ss │ │ │ ├── test │ │ │ ├── test.md │ │ │ └── 10807.cpp │ │ ├── BFS │ │ │ └── fire.cpp │ │ ├── linked_array │ │ │ └── ss │ │ ├── 기초코드작성요령2 │ │ │ ├── array │ │ │ │ ├── test │ │ │ │ └── test.md │ │ │ ├── 2557.cpp │ │ │ ├── 10171.cpp │ │ │ ├── 1000.cpp │ │ │ ├── 2438.cpp │ │ │ ├── 10871.cpp │ │ │ ├── 2439.cpp │ │ │ └── 2562.cpp │ │ ├── recursive │ │ │ └── 11729.cpp │ │ └── stack │ │ │ └── 10773제로.cpp │ ├── LuckyPlace │ │ ├── test.cpp │ │ ├── BOJ_1267.cpp │ │ ├── BFS │ │ │ ├── BOJ_10026.cpp │ │ │ ├── BOJ_1012.cpp │ │ │ ├── BOJ_1697.cpp │ │ │ ├── BOJ_1926.cpp │ │ │ ├── BOJ_2178.cpp │ │ │ ├── BOJ_5427.cpp │ │ │ ├── BOJ_7562.cpp │ │ │ └── BOJ_7576.cpp │ │ ├── tree │ │ │ ├── BOJ_1991.cpp │ │ │ ├── BOJ_4803.cpp │ │ │ ├── BOJ_15681.cpp │ │ │ └── BOJ_22856.cpp │ │ ├── Array │ │ │ ├── BOJ_13300.cpp │ │ │ ├── BOJ_2577.cpp │ │ │ └── BOJ_3273.cpp │ │ ├── Graph │ │ │ ├── BOJ_1260.cpp │ │ │ └── BOJ_1707.cpp │ │ ├── deque │ │ │ └── BOJ_5430.cpp │ │ ├── queue │ │ │ ├── BOJ_18258.cpp │ │ │ └── BOJ_2164.cpp │ │ ├── stack │ │ │ ├── BOJ_10828.cpp │ │ │ └── BOJ_1874.cpp │ │ ├── recursion │ │ │ ├── BOJ_1780.cpp │ │ │ ├── BOJ_2448.cpp │ │ │ ├── BOJ_2630.cpp │ │ │ ├── BOJ_11729.cpp │ │ │ ├── BOJ_17478.cpp │ │ │ └── BOJ_1629.cpp │ │ ├── BackTracking │ │ │ └── BOJ_15650.cpp │ │ ├── BOJ_2557.cpp │ │ ├── BOJ_1000.cpp │ │ ├── BOJ_10869.cpp │ │ ├── BOJ_10171.cpp │ │ ├── BOJ_2438.cpp │ │ ├── BOJ_2752.cpp │ │ └── BOJ_2753.cpp │ ├── tjsdnrdua1 │ │ ├── test.cpp │ │ ├── Basic_code │ │ │ ├── BOJ_2557.cpp │ │ │ ├── BOJ_2438.cpp │ │ │ ├── BOJ_1000.cpp │ │ │ ├── BOJ_2440.cpp │ │ │ ├── BOJ_2753.cpp │ │ │ ├── BOJ_10171.cpp │ │ │ ├── BOJ_15552.cpp │ │ │ ├── BOJ_2562.cpp │ │ │ ├── BOJ_10804.cpp │ │ │ ├── BOJ_2441.cpp │ │ │ ├── BOJ_10869.cpp │ │ │ ├── BOJ_10871.cpp │ │ │ ├── BOJ_2439.cpp │ │ │ └── BOJ_2442.cpp │ │ ├── Array │ │ │ ├── BOJ_10808.cpp │ │ │ ├── BOJ_2577.cpp │ │ │ └── BOJ_10807.cpp │ │ └── Backtracking │ │ │ ├── BOJ_15651.cpp │ │ │ └── BOJ_15654_2.cpp │ ├── IvyJung │ │ └── Array │ │ │ ├── test.cpp │ │ │ └── 2577.c │ ├── hanseungwoo0614 │ │ └── Array │ │ │ ├── test.cpp │ │ │ ├── 10808.cpp │ │ │ └── 2577.cpp │ ├── eddiego │ │ ├── 6.Deque │ │ │ └── 11003.cpp │ │ ├── 1.기초 코드 작성 요령 2 │ │ │ ├── 2557.cpp │ │ │ ├── 1000.cpp │ │ │ ├── 2438.cpp │ │ │ ├── 10869.cpp │ │ │ ├── 2562.cpp │ │ │ ├── 2440.cpp │ │ │ ├── 10171.cpp │ │ │ ├── 15552.cpp │ │ │ ├── 10871.cpp │ │ │ ├── 2752.cpp │ │ │ ├── 2441.cpp │ │ │ ├── 2439.cpp │ │ │ ├── 2442.cpp │ │ │ ├── 2443.cpp │ │ │ ├── 2753.cpp │ │ │ ├── 2587.cpp │ │ │ ├── 2480.cpp │ │ │ ├── 10804.cpp │ │ │ ├── 10093.cpp │ │ │ └── 9498.cpp │ │ ├── 2.Array │ │ │ ├── 10808.cpp │ │ │ ├── 10807.cpp │ │ │ └── 2577.cpp │ │ ├── 5.Queue │ │ │ └── 2164.cpp │ │ └── 9.Recursion │ │ │ └── 1629.cpp │ ├── JinHaeun │ │ ├── Deque │ │ │ └── 1021.cpp │ │ ├── Stack │ │ │ └── 6198.cpp │ │ ├── Array │ │ │ ├── 2577 │ │ │ ├── 3273 │ │ │ ├── 10807 │ │ │ └── 10808 │ │ ├── 기초_코드_작성_요령_II │ │ │ ├── 2439 │ │ │ ├── 2562 │ │ │ ├── 2587 │ │ │ ├── 2752 │ │ │ ├── 10871 │ │ │ └── 15552 │ │ ├── Queue │ │ │ └── 2164.cpp │ │ └── Recursion │ │ │ ├── 11729.cpp │ │ │ ├── 1629.cpp │ │ │ └── 2447.cpp │ ├── youth5427 │ │ ├── basic_code │ │ │ ├── beak_2557 │ │ │ ├── beak_1267.cpp │ │ │ ├── beak_2309.cpp │ │ │ ├── beak_2562.cpp │ │ │ ├── beak_1000 │ │ │ ├── beak_10869 │ │ │ ├── beak_2753 │ │ │ ├── beak_10171.cpp │ │ │ └── beak_9498 │ │ ├── Array │ │ │ ├── Beak_3273.cpp │ │ │ ├── beak_1475.cpp │ │ │ └── beak_2577.cpp │ │ ├── Stack │ │ │ ├── beak_10773.cpp │ │ │ └── beak_10828.cpp │ │ ├── Linked_List │ │ │ └── beak_1158.cpp │ │ ├── Queue │ │ │ └── beak_2164.cpp │ │ └── Recursion │ │ │ └── beak_1629.cpp │ ├── highcastle01 │ │ ├── basic2 │ │ │ ├── BOJ_1000.cpp │ │ │ ├── BOJ_2557.cpp │ │ │ ├── BOJ_10171.cpp │ │ │ ├── BOJ_10869.cpp │ │ │ ├── BOJ_15552.cpp │ │ │ ├── BOJ_2438.cpp │ │ │ ├── BOJ_2440.cpp │ │ │ ├── BOJ_2562.cpp │ │ │ ├── BOJ_2752.cpp │ │ │ ├── BOJ_2441.cpp │ │ │ ├── BOJ_2439.cpp │ │ │ ├── BOJ_2442.cpp │ │ │ ├── BOJ_2753.cpp │ │ │ └── BOJ_10871.cpp │ │ └── Heap │ │ │ └── BOJ_2075.cpp │ ├── hodu26 │ │ ├── basic_code2 │ │ │ ├── 2557.cpp │ │ │ ├── 1000.cpp │ │ │ ├── 15552.cpp │ │ │ ├── 10171.cpp │ │ │ ├── 10871.cpp │ │ │ ├── 2438.cpp │ │ │ ├── 2440.cpp │ │ │ ├── 2753.cpp │ │ │ ├── 10869.cpp │ │ │ ├── 2439.cpp │ │ │ ├── 2441.cpp │ │ │ ├── 2442.cpp │ │ │ └── 2443.cpp │ │ ├── basic_code1 │ │ │ ├── problem_num4.cpp │ │ │ └── problem_num1.cpp │ │ ├── Array │ │ │ ├── 10807.cpp │ │ │ └── 10808.cpp │ │ ├── Recursion │ │ │ └── 1074.cpp │ │ └── Queue │ │ │ └── 2164.cpp │ ├── bjgood01 │ │ ├── Stack │ │ │ └── 10773.py │ │ └── Queue │ │ │ └── 2164.py │ ├── rlathdns │ │ └── Array │ │ │ └── 10808.cpp │ └── ksu206631 │ │ └── Queue │ │ └── Boj2164.cpp ├── Exercise │ ├── cuzl15 │ │ ├── test.txt │ │ └── 9week │ │ │ └── 18234.cpp │ ├── eun2572 │ │ └── readme.md │ ├── rkdbq │ │ ├── .gitignore │ │ └── Week5 │ │ │ └── PRAC4 │ │ │ └── 20365.cpp │ ├── zszszszs │ │ ├── .vscode │ │ │ ├── launch.json │ │ │ └── settings.json │ │ ├── 4week │ │ │ ├── HW3 │ │ │ │ ├── 19951 │ │ │ │ ├── 19951.dSYM │ │ │ │ │ └── Contents │ │ │ │ │ │ └── Resources │ │ │ │ │ │ └── DWARF │ │ │ │ │ │ └── 19951 │ │ │ │ └── .cph │ │ │ │ │ ├── .15559.cpp_268ba4430c4378297c89c4d002578428.prob │ │ │ │ │ ├── .15685.cpp_f0128324d043f4e27faf550af28d4a4c.prob │ │ │ │ │ ├── .19951.cpp_a6be7100ae800b3eace2492ea2ddb6f3.prob │ │ │ │ │ └── .14890.cpp_de1b213805862abf1cf12f3db9bddc80.prob │ │ │ └── ExerciseA │ │ │ │ ├── 1189.bin │ │ │ │ └── .cph │ │ │ │ ├── .1189.cpp_ff8895df3298ae6778385fe563f809a5.prob │ │ │ │ ├── .1189.cpp_7ee704dfa78411dd239f631d6e5a1805.prob │ │ │ │ ├── .5464.cpp_068c0b782dd5d4b7ec2467838bc40569.prob │ │ │ │ └── .17204.cpp_ed9af23a4a3153673615d82f07b42028.prob │ │ ├── 7week │ │ │ ├── ExA │ │ │ │ ├── 8911.bin │ │ │ │ ├── 14176.bin │ │ │ │ ├── 24481.bin │ │ │ │ └── .cph │ │ │ │ │ ├── .8911.cpp_9d73ac1c6fd6c7303919ee2c726e3eb9.prob │ │ │ │ │ └── .24481.cpp_febc7009271d0dad80e34671de2bd253.prob │ │ │ ├── HW │ │ │ │ ├── 16168.bin │ │ │ │ ├── 17025.bin │ │ │ │ ├── 1943.bin │ │ │ │ └── .cph │ │ │ │ │ ├── .16168.cpp_c4a57f482155f4673992d89348f7042d.prob │ │ │ │ │ ├── .17025.cpp_c0820be5aab7cc613f71f6bfdd36e6f3.prob │ │ │ │ │ └── .1943.cpp_31afa81ba5b066590f7b54e52bc7a4d7.prob │ │ │ └── .vscode │ │ │ │ └── settings.json │ │ ├── 8week │ │ │ ├── HW │ │ │ │ └── 13023.bin │ │ │ └── ExA │ │ │ │ ├── 14562.bin │ │ │ │ ├── 21921.bin │ │ │ │ ├── 14466.cpp │ │ │ │ └── .cph │ │ │ │ └── .14562.cpp_f385f01742a0928999f0ae3f791f4135.prob │ │ ├── 6week │ │ │ ├── ExA │ │ │ │ ├── 15464.bin │ │ │ │ └── 16139.bin │ │ │ └── .cph │ │ │ │ ├── .15464.cpp_112b8d987c2df7f8faa77793e9e502db.prob │ │ │ │ └── .16139.cpp_c77fcbeb8ee3678f7bffe2a0b3028752.prob │ │ ├── 5week │ │ │ ├── ExerciseA │ │ │ │ ├── 1713.bin │ │ │ │ ├── 17503.bin │ │ │ │ └── .cph │ │ │ │ │ ├── .deb.cpp_925e6ab91aa3f6b0a4dc14e3ec182f02.prob │ │ │ │ │ ├── .1713.cpp_00983f7a63d935b849a046f2aad03abc.prob │ │ │ │ │ └── .17503.cpp_913d3bc549d51af4e229b45ac7a35630.prob │ │ │ └── .vscode │ │ │ │ └── settings.json │ │ ├── 1week │ │ │ └── .cph │ │ │ │ ├── .21314.cpp_f6923d1d904fd805e709f17b3c64b1a6.prob │ │ │ │ ├── .note.cpp_e1b6a04e887a7d817223d2c5d0c34741.prob │ │ │ │ ├── .18115.cpp_c3954be6f9e70740894b5de05282033e.prob │ │ │ │ └── .16767(Convention2).cpp_b128b2265d11942684eb7b6f48d01bbb.prob │ │ ├── 2week │ │ │ └── .cph │ │ │ │ ├── .16120.cpp_1be85149c5a45b67b81c1b6e99c77d36.prob │ │ │ │ ├── .3687.cpp_d20cf2d118a76f0c2be9ff213f42e77f.prob │ │ │ │ ├── .16678.cpp_8118d48b8aecc437b7b096a35096e721.prob │ │ │ │ ├── .d(21314).cpp_6df51c55d8ffd164e18331859fc53719.prob │ │ │ │ ├── .c(2551).cpp_393520b1cda46686d4667df7305c5542.prob │ │ │ │ ├── .copy.cpp_505c3afb860f939a0a6bdf01e3503962.prob │ │ │ │ ├── .18405.cpp_f03472198d2b8673bda6b5d1232b205b.prob │ │ │ │ ├── .1415.cpp_497745fe74cd2b5cea6685baf7597710.prob │ │ │ │ ├── .tmp.cpp_78dbcc5801c8d3e50f5e6111bb05158a.prob │ │ │ │ └── .20924.cpp_b89ad0550310af012ed1555df8f64528.prob │ │ └── 3week │ │ │ ├── .cph │ │ │ └── .d.cpp_db22a3fe352223bb6d0205e11868057c.prob │ │ │ └── HW2 │ │ │ └── .cph │ │ │ ├── .2616.cpp_0c2def57269a2ef377a42737fb0f2cd6.prob │ │ │ └── .23559(밥).cpp_02872bc61a219e7a479d45c71db60b72.prob │ ├── shinsh │ │ └── test │ ├── vuswltmd │ │ ├── 2023_1_5 │ │ │ ├── 13164.cpp │ │ │ └── 9489.cpp │ │ ├── 2023_1_6 │ │ │ └── week6_HW │ │ │ │ ├── 1414.cpp │ │ │ │ └── 1863.cpp │ │ ├── 2023_1_9 │ │ │ └── week9_HW │ │ │ │ └── 2116.cpp │ │ ├── 2023_1_4 │ │ │ ├── week4_HW │ │ │ │ ├── 14890.cpp │ │ │ │ └── 19951.cpp │ │ │ └── week4_Practice │ │ │ │ ├── 1189.cpp │ │ │ │ ├── 17204.cpp │ │ │ │ ├── 3425.cpp │ │ │ │ └── 5464.cpp │ │ ├── 2023-1학기-3주차 │ │ │ ├── 3주차_HW │ │ │ │ ├── 23559_밥.cpp │ │ │ │ └── 8983_사냥꾼.cpp │ │ │ └── 3주차_연습문제 │ │ │ │ ├── 2785_체인.cpp │ │ │ │ ├── 7573_고기잡이.cpp │ │ │ │ └── 19949_영재의_시험.cpp │ │ ├── 2023-1학기_2주차 │ │ │ ├── 2주차_HW │ │ │ │ ├── 16678_모독.cpp │ │ │ │ ├── 3687_성냥개비.cpp │ │ │ │ ├── 18405_경쟁적_경험.cpp │ │ │ │ └── 8972_미친_아두이노.cpp │ │ │ └── 2주차_연습문제 │ │ │ │ ├── 2824_최대공약수.cpp │ │ │ │ └── 2551_두_대표_자연수.cpp │ │ └── 2023-1학기-1주차 │ │ │ └── 1주차_HW │ │ │ ├── 16767_Convention_II.cpp │ │ │ ├── 16770_The_Bucket_List.cpp │ │ │ └── 16771_Back_and_Forth.cpp │ ├── alphasobs │ │ ├── README.md │ │ └── week_10 │ │ │ └── homework │ │ │ └── 2406 │ └── ohanthony │ │ └── 2_week │ │ └── Exercise_HW1 │ │ └── 16678_모독_G(5).cpp └── Intermediate │ ├── jikim08 │ ├── test.txt │ ├── 수학적귀납법 │ │ └── test.txt │ ├── DP │ │ ├── 2193.cpp │ │ ├── 11727.cpp │ │ └── 1912.cpp │ └── Divide-and-conquer │ │ └── 1629.cpp │ ├── wss0702 │ ├── readme.md │ ├── floyd │ │ ├── README.md │ │ ├── 11562.cpp │ │ ├── 14938.cpp │ │ └── 21940.cpp │ ├── Dijkstra │ │ ├── README.md │ │ ├── 1238.cpp │ │ ├── 1504.cpp │ │ └── 17835.cpp │ ├── greedy │ │ ├── readme.md │ │ ├── 1541.cpp │ │ ├── 1700.cpp │ │ ├── 1744.cpp │ │ ├── 2170.cpp │ │ ├── 2457.cpp │ │ └── 11501.cpp │ ├── binary_serach │ │ ├── readme.md │ │ ├── 16401.cpp │ │ ├── 18869.cpp │ │ ├── 2110.cpp │ │ ├── 2467.cpp │ │ ├── 2473.cpp │ │ ├── 2805.cpp │ │ ├── 3151.cpp │ │ └── 7453.cpp │ ├── two_pointer │ │ ├── readme.md │ │ ├── 1644.cpp │ │ ├── 2531.cpp │ │ ├── 13144.cpp │ │ └── 20922.cpp │ ├── dive_and_conquer │ │ ├── readme.md │ │ ├── 1725.cpp │ │ ├── 2104.cpp │ │ ├── 2339.cpp │ │ ├── 2447.cpp │ │ └── 1629.cpp │ ├── dynamic_programming │ │ ├── readme.md │ │ ├── 1003.cpp │ │ ├── 2193.cpp │ │ ├── 9461.cpp │ │ ├── 11053.cpp │ │ ├── 14501.cpp │ │ └── 11727.cpp │ ├── topological_sort │ │ ├── readme.md │ │ ├── 1766.cpp │ │ ├── 2637.cpp │ │ └── 21276.cpp │ └── minimum_spanning_tree │ │ ├── README.md │ │ ├── 1647.cpp │ │ ├── 1774.cpp │ │ ├── 9372.cpp │ │ ├── 10423.cpp │ │ ├── 13418.cpp │ │ └── 16398.cpp │ ├── kimmi7574 │ ├── DP │ │ ├── README.md │ │ ├── 1149.cpp │ │ ├── 1463.cpp │ │ ├── 1912.cpp │ │ ├── 1932.cpp │ │ ├── 2193.cpp │ │ ├── 2579.cpp │ │ ├── 9095.cpp │ │ ├── 9251.cpp │ │ ├── 11055.cpp │ │ ├── 11659.cpp │ │ ├── 11726.cpp │ │ └── 11727.cpp │ ├── MST │ │ ├── README.md │ │ ├── 13418.cpp │ │ ├── 16398.cpp │ │ ├── 1647.cpp │ │ ├── 1774.cpp │ │ └── 9372.cpp │ ├── readme.md │ ├── Dijkstra │ │ ├── README.md │ │ ├── 1238.cpp │ │ ├── 1504.cpp │ │ ├── 17835.cpp │ │ └── 20183.cpp │ ├── Floyd │ │ ├── README.md │ │ ├── 11562.cpp │ │ ├── 14938.cpp │ │ ├── 1719.cpp │ │ └── 21940.cpp │ ├── Greedy │ │ ├── README.md │ │ ├── 1026.cpp │ │ ├── 11047.cpp │ │ ├── 11399.cpp │ │ ├── 11501.cpp │ │ ├── 1541.cpp │ │ ├── 1700.cpp │ │ ├── 1744.cpp │ │ ├── 1931.cpp │ │ ├── 2170.cpp │ │ ├── 2217.cpp │ │ └── 2457.cpp │ ├── binary_search │ │ ├── README.md │ │ ├── 10815.cpp │ │ ├── 16401.cpp │ │ ├── 1822.cpp │ │ ├── 18869.cpp │ │ ├── 2110.cpp │ │ ├── 2467.cpp │ │ ├── 2473.cpp │ │ └── 2805.cpp │ ├── two_pointer │ │ ├── README.md │ │ ├── 20922.cpp │ │ ├── 22862.cpp │ │ └── 2531.cpp │ ├── Divide_and_Conquer │ │ ├── README.md │ │ ├── 1074.cpp │ │ ├── 1725.cpp │ │ ├── 1780.cpp │ │ └── 2339.cpp │ └── Topological_sort │ │ ├── README.md │ │ ├── 1766.cpp │ │ └── 21276.cpp │ ├── qowlgur121 │ ├── 수학적귀납법 │ │ ├── test1.txt │ │ └── test.cpp │ ├── greedy │ │ └── 11047.cpp │ ├── Divide_and_Conquer │ │ └── 1629.cpp │ └── MST │ │ └── 9372.cpp │ ├── Dameun2224 │ ├── 수학적귀납법 │ │ └── test.cpp │ └── DP │ │ ├── 11726.cpp │ │ └── 11727.cpp │ ├── chaehyeon107 │ ├── 수학적귀납법 │ │ └── src1.txt │ ├── dynamicProgramming │ │ ├── 11727.cpp │ │ ├── 1912.cpp │ │ ├── 11055.cpp │ │ ├── 11053.cpp │ │ └── 1003.cpp │ ├── Greedy │ │ ├── 11399_ATM.cpp │ │ └── 1541.cpp │ └── Divide_and_Conquer │ │ └── 1629.cpp │ ├── suin0413 │ ├── 이분탐색 │ │ ├── README.md │ │ └── BOJ_10815.cpp │ ├── DP │ │ ├── BOJ_11727.cpp │ │ ├── BOJ_2193.cpp │ │ ├── BOJ_1912.cpp │ │ └── BOJ_11055.cpp │ ├── MST │ │ └── BOJ_9372.cpp │ └── greedy │ │ └── BOJ_11399.cpp │ ├── Zoe305 │ ├── Dynamic_Programming │ │ ├── 11726.cpp │ │ ├── 11727.cpp │ │ ├── 2193.cpp │ │ ├── 11053.cpp │ │ └── 1912.cpp │ ├── MST │ │ └── 9372.cpp │ └── .vscode │ │ └── settings.json │ ├── kimso1279 │ ├── Greedy │ │ ├── BOJ_2217.cpp │ │ ├── BOJ_11047.cpp │ │ ├── BOJ_11399.cpp │ │ └── BOJ_1026.cpp │ └── DP │ │ ├── BOJ_11726.cpp │ │ └── BOJ_11727.cpp │ ├── chlwndks33 │ ├── Greedy │ │ └── 2217.cpp │ ├── DP │ │ ├── 11726.cpp │ │ ├── 1699.cpp │ │ └── 1463.cpp │ └── MST │ │ └── 9372.cpp │ └── Daeuning │ ├── Dynamicprogramming │ ├── BOJ_2193 │ └── BOJ_11727 │ └── Greedy │ └── 11399 ├── .gitignore └── README.md /2023-2/Basic/yeon/test: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/test: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Queue/test: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Stack/test: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/Graph/test: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Exercise/cuzl15/test.txt: -------------------------------------------------------------------------------- 1 | test -------------------------------------------------------------------------------- /2023-1/Exercise/eun2572/readme.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-2/Basic/AFpine/test.md: -------------------------------------------------------------------------------- 1 | # TEST 2 | -------------------------------------------------------------------------------- /2023-2/Intermediate/enjuS2/test: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/AFpine/Array/test.cpp: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/array/ss: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/test.cpp: -------------------------------------------------------------------------------- 1 | hello 2 | -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/기초_코드_작성_요령II: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/Recursion/test: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/test.cpp: -------------------------------------------------------------------------------- 1 | hello 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/jikim08/test.txt: -------------------------------------------------------------------------------- 1 | .. 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/readme.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-2/Basic/sjin1121/Queue/text.txt: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/AFpine/Array/update.txt: -------------------------------------------------------------------------------- 1 | update 2 | -------------------------------------------------------------------------------- /2023-1/Basic/IvyJung/Array/test.cpp: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/BFS/fire.cpp: -------------------------------------------------------------------------------- 1 | . 2 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/array/test: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/array/test.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/linked_array/ss: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Linked List/test2: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/Backtracking/test: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Exercise/rkdbq/.gitignore: -------------------------------------------------------------------------------- 1 | .DS_Store 2 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/.vscode/launch.json: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/MST/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/readme.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/floyd/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-2/Basic/Bkjung9/Array/Text.txt: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-2/Basic/dlgusdn4408/Array/test: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-2/Basic/dlgusdn4408/array/test: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-2/Basic/eunhyoha2/Array/test.txt: -------------------------------------------------------------------------------- 1 | text 2 | -------------------------------------------------------------------------------- /2023-2/Basic/sjin1121/Array/Test.txt: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-2/Basic/sjin1121/Graph/test.txt: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-2/Basic/sjin1121/Stack/text.txt: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-2/Intermediate/LuckyPlace/test.txt: -------------------------------------------------------------------------------- 1 | ttt 2 | -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Array/10808_알파벳_개수: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-1/Basic/hanseungwoo0614/Array/test.cpp: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-1/Exercise/shinsh/test: -------------------------------------------------------------------------------- 1 | create new folder 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/jikim08/수학적귀납법/test.txt: -------------------------------------------------------------------------------- 1 | .. 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Dijkstra/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Floyd/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/qowlgur121/수학적귀납법/test1.txt: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/Dijkstra/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/greedy/readme.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/기초코드작성요령2/array/test: -------------------------------------------------------------------------------- 1 | 1111 2 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/기초코드작성요령2/array/test.md: -------------------------------------------------------------------------------- 1 | 1111 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/Dameun2224/수학적귀납법/test.cpp: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/binary_search/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/two_pointer/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/qowlgur121/수학적귀납법/test.cpp: -------------------------------------------------------------------------------- 1 | test 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/binary_serach/readme.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/two_pointer/readme.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Divide_and_Conquer/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Topological_sort/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dive_and_conquer/readme.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dynamic_programming/readme.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/topological_sort/readme.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-2/Basic/gimyeongsu6737/Array/test.txt: -------------------------------------------------------------------------------- 1 | hello world! 2 | -------------------------------------------------------------------------------- /2023-2/Basic/igaeun8/Array/test.txt: -------------------------------------------------------------------------------- 1 | djfskldfjslfjsljseilfjd 2 | -------------------------------------------------------------------------------- /2023-2/Intermediate/dameun2224/BinarySearch/test.txt: -------------------------------------------------------------------------------- 1 | hi 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/chaehyeon107/수학적귀납법/src1.txt: -------------------------------------------------------------------------------- 1 | //1주차 수학적 귀납법 2 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/minimum_spanning_tree/README.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/6.Deque/11003.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/27. 3 | // 4 | -------------------------------------------------------------------------------- /2023-2/Basic/202219404/array/test.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | std::cout<<"hello workd 5 | -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Array/두수의합: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Basic/ffe4el/Array/두수의합 -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Array/두수의합2: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Basic/ffe4el/Array/두수의합2 -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Array/방_번호: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Basic/ffe4el/Array/방_번호 -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Deque/1021.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/JinHaeun/Deque/1021.cpp -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Stack/6198.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/JinHaeun/Stack/6198.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BOJ_1267.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BOJ_1267.cpp -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Array/array_test: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Basic/ffe4el/Array/array_test -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Linked_list/에디터2: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Basic/ffe4el/Linked_list/에디터2 -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Linked_list/키로거: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Basic/ffe4el/Linked_list/키로거 -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/1475.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Array/1475.exe -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/1919.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Array/1919.exe -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/2577.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Array/2577.exe -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/3273.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Array/3273.exe -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/basic_code/beak_2557: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | printf("Hello World!"); 4 | return 0; 5 | } 6 | -------------------------------------------------------------------------------- /2023-1/Intermediate/suin0413/이분탐색/README.md: -------------------------------------------------------------------------------- 1 | # [지수인](solved.ac/suin0413) 2 | 3 | ``` 4 | 2주차 스터디 5 | ``` 6 | 7 | ## 어려웠다 8 | 9 | --- -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Linked_list/요세푸스2: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Basic/ffe4el/Linked_list/요세푸스2 -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BFS/BOJ_10026.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BFS/BOJ_10026.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BFS/BOJ_1012.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BFS/BOJ_1012.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BFS/BOJ_1697.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BFS/BOJ_1697.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BFS/BOJ_1926.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BFS/BOJ_1926.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BFS/BOJ_2178.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BFS/BOJ_2178.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BFS/BOJ_5427.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BFS/BOJ_5427.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BFS/BOJ_7562.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BFS/BOJ_7562.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BFS/BOJ_7576.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BFS/BOJ_7576.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/tree/BOJ_1991.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/tree/BOJ_1991.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/tree/BOJ_4803.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/tree/BOJ_4803.cpp -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/10807.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Array/10807.exe -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/11328.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Array/11328.exe -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/13300.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Array/13300.exe -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Queue/2164 카드2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/eunhyoha2/Queue/2164 카드2.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/4week/HW3/19951: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/4week/HW3/19951 -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/1149.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/1149.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/1463.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/1463.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/1912.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/1912.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/1932.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/1932.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/2193.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/2193.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/2579.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/2579.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/9095.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/9095.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/9251.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/9251.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/Array/BOJ_13300.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/Array/BOJ_13300.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/Array/BOJ_2577.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/Array/BOJ_2577.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/Array/BOJ_3273.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/Array/BOJ_3273.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/Graph/BOJ_1260.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/Graph/BOJ_1260.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/Graph/BOJ_1707.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/Graph/BOJ_1707.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/deque/BOJ_5430.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/deque/BOJ_5430.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/queue/BOJ_18258.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/queue/BOJ_18258.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/stack/BOJ_10828.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/stack/BOJ_10828.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/stack/BOJ_1874.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/stack/BOJ_1874.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/tree/BOJ_15681.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/tree/BOJ_15681.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/tree/BOJ_22856.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/tree/BOJ_22856.cpp -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Array/10808_알파벳_개수.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/eunhyoha2/Array/10808_알파벳_개수.c -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Array/2577_숫자의_개수.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/eunhyoha2/Array/2577_숫자의_개수.c -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/Array/Beak_3273.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/youth5427/Array/Beak_3273.cpp -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/Array/beak_1475.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/youth5427/Array/beak_1475.cpp -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/Stack/beak_10773.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/youth5427/Stack/beak_10773.cpp -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/Stack/beak_10828.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/youth5427/Stack/beak_10828.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_5/13164.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_5/13164.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_5/9489.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_5/9489.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/ExA/8911.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/7week/ExA/8911.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/HW/16168.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/7week/HW/16168.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/HW/17025.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/7week/HW/17025.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/HW/1943.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/7week/HW/1943.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/8week/HW/13023.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/8week/HW/13023.bin -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/11055.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/11055.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/11659.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/11659.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/11726.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/11726.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/DP/11727.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/DP/11727.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/MST/13418.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/MST/13418.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/MST/16398.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/MST/16398.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/MST/1647.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/MST/1647.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/MST/1774.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/MST/1774.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/MST/9372.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/MST/9372.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/floyd/11562.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/floyd/11562.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/floyd/14938.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/floyd/14938.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/floyd/21940.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/floyd/21940.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/greedy/1541.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/greedy/1541.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/greedy/1700.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/greedy/1700.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/greedy/1744.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/greedy/1744.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/greedy/2170.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/greedy/2170.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/greedy/2457.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/greedy/2457.cpp -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Linked_list/linked_list: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Basic/ffe4el/Linked_list/linked_list -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/recursion/BOJ_1780.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/recursion/BOJ_1780.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/recursion/BOJ_2448.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/recursion/BOJ_2448.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/recursion/BOJ_2630.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/recursion/BOJ_2630.cpp -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Linked list/1158.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Linked list/1158.exe -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Linked list/1406.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Linked list/1406.exe -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Linked list/5397.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/dlgustj206/Linked list/5397.exe -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Array/1919_에너그램_만들기.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/eunhyoha2/Array/1919_에너그램_만들기.c -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Deque/1021 회전하는 큐.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/eunhyoha2/Deque/1021 회전하는 큐.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/alphasobs/README.md: -------------------------------------------------------------------------------- 1 | # [alphasobs](solved.ac/alphasobs) 2 | 3 | ```c++ 4 | #include 5 | 6 | ``` 7 | 8 | --- 9 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/6week/ExA/15464.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/6week/ExA/15464.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/6week/ExA/16139.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/6week/ExA/16139.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/ExA/14176.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/7week/ExA/14176.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/ExA/24481.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/7week/ExA/24481.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/8week/ExA/14562.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/8week/ExA/14562.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/8week/ExA/21921.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/8week/ExA/21921.bin -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Floyd/11562.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Floyd/11562.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Floyd/14938.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Floyd/14938.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Floyd/1719.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Floyd/1719.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Floyd/21940.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Floyd/21940.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/1026.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/1026.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/11047.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/11047.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/11399.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/11399.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/11501.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/11501.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/1541.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/1541.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/1700.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/1700.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/1744.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/1744.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/1931.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/1931.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/2170.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/2170.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/2217.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/2217.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Greedy/2457.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Greedy/2457.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/Dijkstra/1238.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/Dijkstra/1238.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/Dijkstra/1504.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/Dijkstra/1504.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/Dijkstra/17835.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/Dijkstra/17835.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/greedy/11501.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/greedy/11501.cpp -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/기초코드작성요령2/2557.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main(void){ 3 | 4 | printf("Hello World!"); 5 | return 0; 6 | } 7 | -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/recursion/BOJ_11729.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/recursion/BOJ_11729.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/recursion/BOJ_17478.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/recursion/BOJ_17478.cpp -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Linked List/1158 요세푸스.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/eunhyoha2/Linked List/1158 요세푸스.cpp -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Linked List/5397 키로거.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/eunhyoha2/Linked List/5397 키로거.cpp -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/Linked_List/beak_1158.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/youth5427/Linked_List/beak_1158.cpp -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/basic_code/beak_1267.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/youth5427/basic_code/beak_1267.cpp -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/basic_code/beak_2309.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/youth5427/basic_code/beak_2309.cpp -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/basic_code/beak_2562.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/youth5427/basic_code/beak_2562.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/alphasobs/week_10/homework/2406: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/alphasobs/week_10/homework/2406 -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Dijkstra/1238.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Dijkstra/1238.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Dijkstra/1504.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Dijkstra/1504.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Dijkstra/17835.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Dijkstra/17835.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Dijkstra/20183.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Dijkstra/20183.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/two_pointer/1644.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/two_pointer/1644.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/two_pointer/2531.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/two_pointer/2531.cpp -------------------------------------------------------------------------------- /2023-2/Exercise/alphasobs/week_1/.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "files.associations": { 3 | "iosfwd": "cpp", 4 | "ios": "cpp" 5 | } 6 | } 7 | -------------------------------------------------------------------------------- /2023-2/Exercise/alphasobs/week_2/exercise/14675: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Exercise/alphasobs/week_2/exercise/14675 -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | 2 | .DS_Store 3 | <<<<<<< HEAD 4 | Exercise/.DS_Store 5 | Exercise/.DS_Store 6 | ======= 7 | >>>>>>> parent of bbb2018 (Update .gitignore) 8 | -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BackTracking/BOJ_15650.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Basic/LuckyPlace/BackTracking/BOJ_15650.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_6/week6_HW/1414.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_6/week6_HW/1414.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_6/week6_HW/1863.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_6/week6_HW/1863.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_9/week9_HW/2116.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_9/week9_HW/2116.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/4week/ExerciseA/1189.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/4week/ExerciseA/1189.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/5week/ExerciseA/1713.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/5week/ExerciseA/1713.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/5week/ExerciseA/17503.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/zszszszs/5week/ExerciseA/17503.bin -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "files.associations": { 3 | "iostream": "cpp", 4 | "ios": "cpp" 5 | } 6 | } -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/two_pointer/20922.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/two_pointer/20922.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/two_pointer/22862.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/two_pointer/22862.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/two_pointer/2531.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/two_pointer/2531.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/binary_serach/16401.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/binary_serach/16401.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/binary_serach/18869.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/binary_serach/18869.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/binary_serach/2110.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/binary_serach/2110.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/binary_serach/2467.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/binary_serach/2467.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/binary_serach/2473.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/binary_serach/2473.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/binary_serach/2805.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/binary_serach/2805.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/binary_serach/3151.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/binary_serach/3151.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/binary_serach/7453.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/binary_serach/7453.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/two_pointer/13144.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/two_pointer/13144.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/two_pointer/20922.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/two_pointer/20922.cpp -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Linked_list/tempCodeRunnerFile: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-2/Basic/ffe4el/Linked_list/tempCodeRunnerFile -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_4/week4_HW/14890.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_4/week4_HW/14890.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_4/week4_HW/19951.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_4/week4_HW/19951.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/binary_search/10815.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/binary_search/10815.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/binary_search/16401.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/binary_search/16401.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/binary_search/1822.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/binary_search/1822.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/binary_search/18869.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/binary_search/18869.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/binary_search/2110.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/binary_search/2110.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/binary_search/2467.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/binary_search/2467.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/binary_search/2473.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/binary_search/2473.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/binary_search/2805.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/binary_search/2805.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dive_and_conquer/1725.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/dive_and_conquer/1725.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dive_and_conquer/2104.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/dive_and_conquer/2104.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dive_and_conquer/2339.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/dive_and_conquer/2339.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dive_and_conquer/2447.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/dive_and_conquer/2447.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/topological_sort/1766.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/topological_sort/1766.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/topological_sort/2637.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/topological_sort/2637.cpp -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BOJ_2557.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) 5 | { 6 | cout << "Hello World!" << endl; 7 | return 0; 8 | } -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_HW/23559_밥.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_HW/23559_밥.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Topological_sort/1766.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Topological_sort/1766.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Topological_sort/21276.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Topological_sort/21276.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dynamic_programming/1003.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/dynamic_programming/1003.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dynamic_programming/2193.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/dynamic_programming/2193.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dynamic_programming/9461.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/dynamic_programming/9461.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/topological_sort/21276.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/topological_sort/21276.cpp -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/basic_code/beak_1000: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int x,y; 4 | scanf("%d %d", &x, &y); 5 | printf("%d", x+y); 6 | return 0; 7 | } 8 | -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_HW/8983_사냥꾼.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_HW/8983_사냥꾼.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_연습문제/2785_체인.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_연습문제/2785_체인.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_HW/16678_모독.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_HW/16678_모독.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_HW/3687_성냥개비.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_HW/3687_성냥개비.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_4/week4_Practice/1189.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_4/week4_Practice/1189.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_4/week4_Practice/17204.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_4/week4_Practice/17204.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_4/week4_Practice/3425.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_4/week4_Practice/3425.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023_1_4/week4_Practice/5464.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023_1_4/week4_Practice/5464.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Divide_and_Conquer/1074.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Divide_and_Conquer/1074.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Divide_and_Conquer/1725.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Divide_and_Conquer/1725.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Divide_and_Conquer/1780.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Divide_and_Conquer/1780.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/kimmi7574/Divide_and_Conquer/2339.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/kimmi7574/Divide_and_Conquer/2339.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dynamic_programming/11053.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/dynamic_programming/11053.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dynamic_programming/14501.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/dynamic_programming/14501.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/minimum_spanning_tree/1647.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/minimum_spanning_tree/1647.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/minimum_spanning_tree/1774.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/minimum_spanning_tree/1774.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/minimum_spanning_tree/9372.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/minimum_spanning_tree/9372.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_연습문제/7573_고기잡이.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_연습문제/7573_고기잡이.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_HW/18405_경쟁적_경험.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_HW/18405_경쟁적_경험.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_HW/8972_미친_아두이노.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_HW/8972_미친_아두이노.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_연습문제/2824_최대공약수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_연습문제/2824_최대공약수.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/minimum_spanning_tree/10423.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/minimum_spanning_tree/10423.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/minimum_spanning_tree/13418.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/minimum_spanning_tree/13418.cpp -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/minimum_spanning_tree/16398.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Intermediate/wss0702/minimum_spanning_tree/16398.cpp -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/기초_코드_작성_요령_II/2557_Hello_World.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int main() 5 | { 6 | cout << "Hello World!" ; 7 | return 0; 8 | } 9 | -------------------------------------------------------------------------------- /2023-1/Exercise/ohanthony/2_week/Exercise_HW1/16678_모독_G(5).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/ohanthony/2_week/Exercise_HW1/16678_모독_G(5).cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_연습문제/19949_영재의_시험.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기-3주차/3주차_연습문제/19949_영재의_시험.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_연습문제/2551_두_대표_자연수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기_2주차/2주차_연습문제/2551_두_대표_자연수.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기-1주차/1주차_HW/16767_Convention_II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기-1주차/1주차_HW/16767_Convention_II.cpp -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/기초_코드_작성_요령_II/1000_A+B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b; 6 | std::cin >> a >> b; 7 | std::cout << a + b; 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기-1주차/1주차_HW/16770_The_Bucket_List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기-1주차/1주차_HW/16770_The_Bucket_List.cpp -------------------------------------------------------------------------------- /2023-1/Exercise/vuswltmd/2023-1학기-1주차/1주차_HW/16771_Back_and_Forth.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/alps-jbnu/23ALPStudy/HEAD/2023-1/Exercise/vuswltmd/2023-1학기-1주차/1주차_HW/16771_Back_and_Forth.cpp -------------------------------------------------------------------------------- /2023-1/Basic/AFpine/basic2/1000.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() { 6 | int A, B; 7 | cin>>A>>B; 8 | cout< 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | int A, B; 8 | cin >> A >> B; 9 | cout << A+B; 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/5week/.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "files.associations": { 3 | "random": "cpp", 4 | "vector": "cpp", 5 | "iostream": "cpp", 6 | "ios": "cpp" 7 | } 8 | } -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BOJ_1000.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) 5 | { 6 | int A, B; 7 | cin >> A >> B; 8 | cout << A + B << endl; 9 | 10 | return 0; 11 | } -------------------------------------------------------------------------------- /2023-1/Basic/highcastle01/basic2/BOJ_2557.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | cout << "Hello World!"; 10 | } 11 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/기초코드작성요령2/10171.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | printf("\\ /\\\n"); 5 | printf(" ) ( ')\n"); 6 | printf("( / ) \n"); 7 | printf(" \\(__)|\n"); 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code2/2557.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | cout << "Hello World!"; 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/기초코드작성요령2/1000.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int A, B; 4 | scanf("%d %d", &A, &B); 5 | 6 | if (0 < A && 10 >B ) { 7 | printf("%d\n",A + B); 8 | } 9 | 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/8week/ExA/14466.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n, k, r; 5 | int board[101][101]; 6 | 7 | int main(void) 8 | { 9 | ios::sync_with_stdio(0); 10 | cin.tie(0); 11 | } -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code2/1000.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int A,B; 9 | cin >> A >> B; 10 | cout << A+B; 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BOJ_10869.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) 5 | { 6 | int A, B; 7 | cin >> A >> B; 8 | cout << A + B << endl << A - B << endl << A * B << endl << A / B << endl << A % B << endl; 9 | return 0; 10 | } -------------------------------------------------------------------------------- /2023-1/Basic/bjgood01/Stack/10773.py: -------------------------------------------------------------------------------- 1 | import sys 2 | n = int(input()) 3 | stack = [] 4 | for i in range(n): 5 | num = int(input()) 6 | if num == 0: 7 | stack.pop() 8 | else: 9 | stack.append(num) 10 | 11 | print(sum(stack)) 12 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2557.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/12. 3 | // 4 | #include "bits/stdc++.h" 5 | using namespace std; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | cout << "Hello World!"; 11 | } -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/기초_코드_작성_요령_II/10869_사칙연산.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int main() 5 | { 6 | int x, y; 7 | cin >> x >> y; 8 | cout << x+y << "\n" << x - y << "\n" << x*y << "\n" << x/y << "\n" < 2 | using namespace std; 3 | 4 | int main(void) 5 | { 6 | cout << "\\ /\\" << endl; 7 | cout << " ) ( ')" << endl; 8 | cout << "( / )" << endl; 9 | cout << " \\(__)|" << endl; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_2557.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | ios::sync_with_stdio(0); //false 6 | cin.tie(0); //nullptr 7 | 8 | cout << "Hello World!"; 9 | } 10 | -------------------------------------------------------------------------------- /2023-2/Exercise/alphasobs/week_2/exercise/2118.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long int 3 | #define MAX 100 + 1 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | return 0; 12 | } -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/기초_코드_작성_요령_II/10171_고양이.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int main() 5 | { 6 | cout << "\\ /\\" << '\n'; 7 | cout << " ) ( \')" << '\n'; 8 | cout << "( / )" <<'\n'; 9 | cout << " \\(__)|"; 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/기초_코드_작성_요령_II/2753_윤년.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int main() 5 | { 6 | int year; 7 | cin >> year; 8 | if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0) cout << 1; 9 | else cout << 0; 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/기초코드작성요령2/2438.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int n=0; 4 | scanf("%d",&n); 5 | for(int i=1;i<=n;i++){ 6 | for(int j=1;j<=i;j++){ 7 | printf("*"); 8 | } 9 | printf("\n"); 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_2438.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int n; 5 | std::cin >> n; 6 | for (int i = 0; i < n; i++) { 7 | for (int j = 0; j < i + 1; j++) { 8 | std::cout << "*"; 9 | } 10 | std::cout << "\n"; 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/기초코드작성요령/2753.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int y; 6 | scanf("%d", &y); 7 | 8 | if(y%4==0 && y%100!=0 || y%400==0) 9 | printf("1\n"); 10 | else 11 | printf("0\n"); 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/기초코드작성요령2/10871.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n=0,x=0,i=0; 6 | scanf("%d %d",&n,&x); 7 | while(n>0){ 8 | scanf("%d",&i); 9 | if(i 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | cout<<"\\ /\\\n"; 10 | cout<<" ) ( ')\n"; 11 | cout<<"( / )\n"; 12 | cout<<" \\(__)|\n"; 13 | } 14 | -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/basic_code/beak_10869: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int x,y; 4 | scanf("%d %d", &x, &y); 5 | printf("%d \n", x+y); 6 | printf("%d \n", x-y); 7 | printf("%d \n", x*y); 8 | printf("%d \n", x/y); 9 | printf("%d \n", x%y); 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "files.associations": { 3 | "iostream": "cpp", 4 | "ratio": "cpp", 5 | "iosfwd": "cpp", 6 | "vector": "cpp", 7 | "ios": "cpp", 8 | "string": "cpp", 9 | "deque": "cpp", 10 | "queue": "cpp" 11 | } 12 | } -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/1000.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/12. 3 | // 4 | #include "bits/stdc++.h" 5 | using namespace std; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | int a,b; 11 | cin>> a >> b; 12 | cout << a+b; 13 | } -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_1000.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | ios::sync_with_stdio(0); //false 6 | cin.tie(0); //nullptr 7 | 8 | int A, B; 9 | cin >> A >> B; 10 | cout << A + B; 11 | } 12 | -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/basic_code/beak_2753: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int year, result; 4 | 5 | scanf("%d", &year); 6 | result = (year%4 == 0) && (year%100 != 0) || (year % 400 == 0); 7 | printf("%s", (result==1)?"1":"0"); 8 | 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Array/BOJ_10808.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int alp[26]; 4 | int main() { 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | string s; 9 | cin >> s; 10 | for (int e : s) 11 | alp[e - 'a']++; 12 | for (int p : alp) 13 | cout << p << " "; 14 | } 15 | -------------------------------------------------------------------------------- /2023-2/Exercise/alphasobs/week_2/exercise/14675.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long int 3 | #define MAX 100000 + 1 4 | using namespace std; 5 | 6 | int N; 7 | 8 | int main() 9 | { 10 | ios::sync_with_stdio(0); 11 | cin.tie(0); 12 | 13 | cin >> N; 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/기초코드작성요령/10869.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int a, b; 6 | scanf("%d %d", &a, &b); 7 | printf("%d\n",a+b); 8 | printf("%d\n",a-b); 9 | printf("%d\n",a*b); 10 | printf("%d\n",a/b); 11 | printf("%d\n",a%b); 12 | 13 | return 0; 14 | } -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/기초코드작성요령/2440.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int n; 6 | scanf("%d", &n); 7 | 8 | for(int i=0; ii; j--){ 10 | printf("*"); 11 | } 12 | printf("\n"); 13 | } 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/basic_code/beak_10171.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Day: 2023.03.10 3 | 참고 : 역슬래쉬(\) 출력 4 | */ 5 | #include 6 | using namespace std; 7 | 8 | int main() { 9 | 10 | cout << "\\ /\\" << endl; 11 | cout << " ) ( \')" << endl; 12 | cout << "( / )" << endl; 13 | cout << " \\(__)|"; 14 | } 15 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2438.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int N; 6 | cin >> N; 7 | 8 | for(int i=1; i<=N; i++){ 9 | for(int j=1; j<=i; j++){ 10 | cout << "*";} 11 | cout << endl; 12 | } 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /2023-1/Basic/bjgood01/Queue/2164.py: -------------------------------------------------------------------------------- 1 | from collections import deque 2 | import sys 3 | queue = deque() 4 | n = int(sys.stdin.readline().rstrip()) 5 | 6 | for i in range(1, n+1): 7 | queue.append(i) 8 | 9 | while len(queue) > 1: 10 | queue.popleft() 11 | queue.append(queue.popleft()) 12 | 13 | print(queue[0]) 14 | -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code2/15552.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int T,A,B; 9 | cin >> T; 10 | 11 | while (T--){ 12 | cin >> A >> B; 13 | cout << A+B << '\n'; 14 | } 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /2023-2/Basic/gimyeongsu6737/Array/boj_10808.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() { 4 | string str; 5 | cin >> str; 6 | int buf[26] = { 0 }; 7 | for (int i = 0; i < str.length(); i++) { 8 | buf[str[i] - 97]++; 9 | } 10 | for (int i = 0; i < 26; i++) { 11 | cout << buf[i] << ' '; 12 | } 13 | } -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BOJ_2438.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) 5 | { 6 | int N; 7 | cin >> N; 8 | if (N < 1 || N >100) 9 | return 0; 10 | for (int i = 1; i <= N; i++) 11 | { 12 | for (int j = 0; j < i; j++) 13 | cout << "*"; 14 | cout << endl; 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Array/10808: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int freq[26]; 5 | int main(void) { 6 | ios::sync_with_stdio(0); 7 | cin.tie(0); 8 | string s; 9 | cin >> s; 10 | for(auto c : s) 11 | freq[c-'a']++; 12 | for(int i = 0; i < 26; i++) 13 | cout << freq[i] << ' '; 14 | } 15 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/10869.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/12. 3 | // 4 | #include "bits/stdc++.h" 5 | using namespace std; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | int a, b; 11 | cin >> a >>b; 12 | cout < 2 | using namespace std; 3 | int main() { 4 | ios::sync_with_stdio(false); 5 | cin.tie(NULL); 6 | 7 | int n; 8 | cin >> n; 9 | for (int i = 0; i < n; i++) { 10 | for (int j = n; j > i; j--) { 11 | cout << "*"; 12 | } 13 | cout << '\n'; 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/10808.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int arr[26]; 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | string s; 10 | cin>>s; 11 | for(auto c:s) 12 | arr[c-'a']++; 13 | for(int i=0; i<26; i++) 14 | cout< 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | 10 | int a,b; 11 | 12 | cin >> a>>b; 13 | 14 | cout << a+b << "\n" << a-b << "\n" << a*b << "\n" << a/b << "\n" << a%b; 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/기초코드작성요령/2438.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int n, i, j; 6 | scanf("%d", &n); 7 | 8 | for(i=0; i> arr[i]; 8 | if(n<=arr[i]){ 9 | n=arr[i]; 10 | k=i; 11 | } 12 | } 13 | cout << n << "\n" << k+1; 14 | } -------------------------------------------------------------------------------- /2023-1/Basic/highcastle01/basic2/BOJ_15552.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int T, A, B, i; 10 | 11 | cin >> T; 12 | 13 | for(i = 0; i < T; i++) 14 | { 15 | cin >> A >> B; 16 | cout << A + B << "\n"; 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code2/10171.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | 9 | cout << "\\ /\\" << '\n'; 10 | cout << " ) ( ')" << '\n'; 11 | cout << "( / )" << '\n'; 12 | cout << " \\(__)|" << '\n'; 13 | 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/기초_코드_작성_요령_II/10871_X보다_작은_수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | int n, x; 7 | cin >> n >> x; 8 | int arr[10005]; 9 | for(int i=0; i> arr[i]; 11 | if (arr[i] < x) cout << arr[i] << " "; 12 | } 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/1week/.cph/.21314.cpp_f6923d1d904fd805e709f17b3c64b1a6.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 21314","url":"/23ALPStudy/Exercise/zszszszs/1week/21314.cpp","tests":[{"id":1678706886256,"input":"","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/1week/21314.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/1week/.cph/.note.cpp_e1b6a04e887a7d817223d2c5d0c34741.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: note","url":"/23ALPStudy/Exercise/zszszszs/1week/note.cpp","tests":[{"id":1678519023096,"input":"","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/1week/note.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/2week/.cph/.16120.cpp_1be85149c5a45b67b81c1b6e99c77d36.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 16120","url":"/23ALPStudy/Exercise/zszszszs/2week/16120.cpp","tests":[{"id":1679209399742,"input":"ppap","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/2week/16120.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/2week/.cph/.3687.cpp_d20cf2d118a76f0c2be9ff213f42e77f.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 3687","url":"/23ALPStudy/Exercise/zszszszs/2week/3687.cpp","tests":[{"id":1679057310859,"input":"1\n99","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/2week/3687.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2440.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void){ 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i = 0; i < N; i++) { 12 | for(int j = 0; j < N - i; j++) cout << '*'; 13 | cout << "\n"; 14 | } 15 | } -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code1/problem_num4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int func4(int N){ 6 | int flag = 1; 7 | 8 | while (flag <= N){ 9 | flag *= 2; 10 | } 11 | 12 | return flag/2; 13 | } 14 | 15 | int main(){ 16 | int N; 17 | cin >> N; 18 | cout << func4(N); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/기초코드작성요령2/2439.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int n=0; 4 | scanf("%d",&n); 5 | for(int i=1;i<=n;i++){ 6 | for(int j=1;j<=n-i;j++){ 7 | printf(" "); 8 | } 9 | for(int j=1;j<=i;j++){ 10 | printf("*"); 11 | } 12 | printf("\n"); 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/1week/.cph/.18115.cpp_c3954be6f9e70740894b5de05282033e.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 18115","url":"/23ALPStudy/Exercise/zszszszs/1week/18115.cpp","tests":[{"id":1678702880328,"input":"5\n2 3 3 2 1","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/1week/18115.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/2week/.cph/.16678.cpp_8118d48b8aecc437b7b096a35096e721.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 16678","url":"/23ALPStudy/Exercise/zszszszs/2week/16678.cpp","tests":[{"id":1679100929016,"input":"4\n1\n1\n1\n4","output":"7"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/2week/16678.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/10171.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/12. 3 | // 4 | #include "bits/stdc++.h" 5 | using namespace std; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | cout << "\\ /\\" << "\n"; 11 | cout << " ) ( ')" << "\n"; 12 | cout << "( / )" << "\n"; 13 | cout << " \\(__)|"; 14 | } -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/15552.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void){ 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | int T; 9 | cin >> T; 10 | 11 | for(int t = 0; t < T; t++){ 12 | int A, B; 13 | cin >> A >> B; 14 | 15 | cout << A + B << "\n"; 16 | } 17 | } -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code2/10871.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int N,X,A; 9 | cin >> N >> X; 10 | 11 | while (N--){ 12 | cin >> A; 13 | 14 | if (A < X){ 15 | cout << A << ' '; 16 | } 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/기초_코드_작성_요령_II/9498_시험_성적.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int main() 5 | { 6 | int score; 7 | cin >> score; 8 | if (score >= 90) cout << "A"; 9 | else if (score >= 80) cout << "B"; 10 | else if (score >= 70) cout << "C"; 11 | else if (score >= 60) cout << "D"; 12 | else cout << "F"; 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/2week/.cph/.d(21314).cpp_6df51c55d8ffd164e18331859fc53719.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: d(21314)","url":"/23ALPStudy/Exercise/zszszszs/2week/d(21314).cpp","tests":[{"id":1678971415855,"input":"MMMKKMMK","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/2week/d(21314).cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Intermediate/chaehyeon107/dynamicProgramming/11727.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int d[1002]; 5 | int mod = 10007; 6 | 7 | int main(void) { 8 | int n; 9 | cin >> n; 10 | d[0] = 0; 11 | d[1] = 1; 12 | d[2] = 3; 13 | for(int i = 3; i <= n; i++) 14 | d[i] = (d[i-1] + d[i-2] * 2) % mod; 15 | cout << d[n]; 16 | } 17 | -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code2/2438.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i=1;i<=N;i++){ 12 | for (int j=0;j 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i=N;i>0;i--){ 12 | for (int j=0;j 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int year; 9 | cin >> year; 10 | 11 | if ((year%4==0 && year%100!=0) || year%400==0){ 12 | cout << 1; 13 | } 14 | else { 15 | cout << 0; 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/기초_코드_작성_요령_II/2572_세수정렬.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int arr[3]; 7 | for (int i = 0; i < 3; i++){ 8 | cin>>arr[i]; 9 | } 10 | sort(arr, arr+3); 11 | for(int i = 0; i < 3; i++){ 12 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int N, X; 7 | cin >> N >> X; 8 | 9 | int A[N]; 10 | 11 | for(int i=0; i> A[i]; 14 | } 15 | 16 | for(int i=0; i>n>>x; 12 | while (n--){ 13 | cin>>t; 14 | if(t 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int i, j, n; 10 | cin >> n; 11 | for(i = 1; i <= n; i++) 12 | { 13 | for(j = 1; j <= i; j++) 14 | { 15 | cout << "*"; 16 | } 17 | cout << "\n"; 18 | } 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Array/BOJ_2577.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int result[10]; //핵심: 0~9 사이 등장한 숫자 횟수 4 | int main() { 5 | int A, B, C; 6 | cin >> A >> B >> C; 7 | int mult = A * B * C; 8 | while (mult > 0) { 9 | result[mult % 10]++; 10 | mult /= 10; 11 | } 12 | for (int i = 0; i < 10; i++) 13 | cout << result[i] << '\n'; 14 | } 15 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_2753.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | ios::sync_with_stdio(0); //false 6 | cin.tie(0); //nullptr 7 | 8 | int y; 9 | cin >> y; 10 | if ((y % 4 == 0 && y % 100 != 0) || y % 400 == 0) 11 | cout << 1; 12 | else cout << 0; 13 | } 14 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/2week/.cph/.c(2551).cpp_393520b1cda46686d4667df7305c5542.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: c(2551)","url":"/23ALPStudy/Exercise/zszszszs/2week/c(2551).cpp","tests":[{"id":1679011853681,"input":"6\n4 3 2 2 10 10","output":"3 5"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/2week/c(2551).cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/2week/.cph/.copy.cpp_505c3afb860f939a0a6bdf01e3503962.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: copy","url":"/23ALPStudy/Exercise/zszszszs/2week/copy.cpp","tests":[{"id":1679107459126,"input":"3 3\n1 0 2\n0 0 0\n3 0 0\n2 3 2","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/2week/copy.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Intermediate/Zoe305/Dynamic_Programming/11726.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int d[10005]; 5 | int mod = 10007; 6 | 7 | int main(void){ 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | int n; 11 | cin >> n; 12 | d[1] = 1; 13 | d[2] = 2; 14 | for(int i = 3; i <= n; i++) d[i] = (d[i-1]+d[i-2])%mod; 15 | cout << d[n]; 16 | } -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/Array/10808_알파벳_개수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | string s; 7 | int cnt[30]={0, }; 8 | cin >> s; 9 | for (int i = 0; i 2 | 3 | using namespace std; 4 | 5 | int main() { 6 | int a,c,d; 7 | int count = 0; 8 | cin >> a; 9 | int b[100]; 10 | for (int i = 0;i < a;i++) { 11 | cin >> b[i]; 12 | } 13 | cin >> c; 14 | for (int i = 0;i < a;i++) { 15 | if (b[i] == c) { 16 | count++; 17 | } 18 | } 19 | cout << count; 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/10807.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int arr[101]; 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int n, v, count=0; 10 | cin>>n; 11 | for(int i=0; i>arr[i]; 12 | cin>>v; 13 | for(int i=0; i>a[i]; 14 | sort(a,a+3); 15 | for(int i=0;i<3;i++) 16 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | string s; 7 | int n[1000] = {}; 8 | cin >> s; 9 | 10 | for (int i = 0; i < s.length(); i++) 11 | { 12 | 13 | n[s[i]]++; 14 | 15 | } 16 | 17 | for (int i = 0; i < 26; i++) 18 | { 19 | cout << n[97 + i] << " "; 20 | 21 | } 22 | 23 | 24 | } 25 | -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code2/10869.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int A,B; 9 | cin >> A >> B; 10 | 11 | cout << A+B << '\n'; 12 | cout << A-B << '\n'; 13 | cout << A*B << '\n'; 14 | cout << A/B << '\n'; 15 | cout << A%B << '\n'; 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_10171.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | ios::sync_with_stdio(0); //false 6 | cin.tie(0); //nullptr 7 | 8 | cout << "\\ /\\" << '\n'; 9 | cout << " ) ( ')" << '\n'; 10 | cout << "( / )" << '\n'; 11 | cout << " \\(__)|" << '\n'; 12 | } 13 | -------------------------------------------------------------------------------- /2023-1/Intermediate/Zoe305/MST/9372.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int t; 5 | int main(void){ 6 | ios::sync_with_stdio(0); 7 | cin.tie(0); 8 | 9 | cin >> t; 10 | while(t--) { 11 | int n, m; 12 | cin >> n >> m; 13 | int a, b; 14 | while(m--) { 15 | cin >> a >> b; 16 | } 17 | cout << (n-1) << '\n'; 18 | } 19 | } -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/2577.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int s[10]; 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int a, b, c; 10 | cin>>a>>b>>c; 11 | int mul=a*b*c; 12 | while(mul>0){ 13 | s[mul%10]++; 14 | mul/=10; 15 | } 16 | for(int i=0; i<10; i++) cout< 2 | 3 | using namespace std; 4 | int main() 5 | { 6 | int a, sum = 0, min = 100; 7 | for (int i = 0; i < 7; i++) { 8 | cin >> a; 9 | if (a % 2 != 0) { 10 | sum += a; 11 | if (min > a) min = a; 12 | } 13 | } 14 | if (sum == 0) cout << -1; 15 | else cout << sum << "\n" << min; 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_15552.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() { 4 | ios::sync_with_stdio(false); //false 5 | cin.tie(NULL); //nullptr 6 | 7 | int N, a, b; 8 | cin >> N; 9 | for (int i = 0; i < N; i++) { 10 | cin >> a >> b; 11 | cout << a + b << '\n'; 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_2562.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n, max_elem, max_idx; 5 | int main(void) { 6 | ios::sync_with_stdio(0); 7 | cin.tie(0); 8 | 9 | for (int i = 1; i < 10; i++) { 10 | cin >> n; 11 | if (n > max_elem) { 12 | max_elem = n; 13 | max_idx = i; 14 | } 15 | } 16 | cout << max_elem << '\n' << max_idx; 17 | } 18 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/4week/ExerciseA/.cph/.1189.cpp_ff8895df3298ae6778385fe563f809a5.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 1189","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/4week/ExerciseA/1189.cpp","tests":[{"id":1681021614794,"input":"1","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/4week/ExerciseA/1189.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/5week/ExerciseA/.cph/.deb.cpp_925e6ab91aa3f6b0a4dc14e3ec182f02.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: deb","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/5week/ExerciseA/deb.cpp","tests":[{"id":1681028049609,"input":"13","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/5week/ExerciseA/deb.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Intermediate/Zoe305/Dynamic_Programming/11727.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n; 5 | int d[1010]; 6 | int mod = 10007; 7 | 8 | int main(void){ 9 | ios::sync_with_stdio(0); 10 | cin.tie(0); 11 | 12 | cin >> n; 13 | d[1] = 1; 14 | d[2] = 3; 15 | for(int i = 3; i <= n; ++i) d[i] = (d[i-1] + d[i-2] * 2) % mod; 16 | cout << d[n]; 17 | } -------------------------------------------------------------------------------- /2023-2/Basic/saer6114/Array/10808.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | string name; 6 | cin >> name; 7 | vector a(26); 8 | 9 | for (int i = 0; i < 26; i++) { 10 | for (int j = 0; j < name.size(); j++) { 11 | if (name[j] == (char)(i + 97)) 12 | a[i]++; 13 | } 14 | cout << a[i] << " "; 15 | } 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Queue/2164.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int N; 8 | cin >> N; 9 | queue q; 10 | 11 | for(int i=1; i<=N; i++) 12 | { 13 | q.push(i); 14 | } 15 | 16 | while(q.size() > 1) 17 | { 18 | q.pop(); 19 | q.push(q.front()); 20 | q.pop(); 21 | } 22 | 23 | cout << q.back(); 24 | } 25 | -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/기초_코드_작성_요령_II/2587: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int a[5]; 8 | int sum = 0; 9 | 10 | for(int i=0; i<5; i++) 11 | { 12 | cin >> a[i]; 13 | sum += a[i]; 14 | } 15 | 16 | cout << sum/5<< endl; 17 | 18 | sort(a, a+5); 19 | cout << a[2]; 20 | 21 | 22 | 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BOJ_2752.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(void) 7 | { 8 | array arr = { 0 }; 9 | for (int i = 0; i < 3; i++) 10 | cin >> arr[i]; 11 | sort(arr.begin(), arr.end()); 12 | for (int i = 0; i < 3; i++) 13 | cout << arr[i] << ' '; 14 | 15 | return 0; 16 | } -------------------------------------------------------------------------------- /2023-1/Basic/highcastle01/basic2/BOJ_2440.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int n, i, j, k; 10 | cin >> n; 11 | 12 | for(i = 1; i <= n; i++) 13 | { 14 | for(j = 1; j <= n - i + 1; j++) 15 | { 16 | cout << "*"; 17 | } 18 | cout << "\n"; 19 | } 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code1/problem_num1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int func1(int N){ 6 | int ans=0; 7 | while (N){ 8 | if (N%3==0 || N%5==0){ 9 | ans += N; 10 | } 11 | N--; 12 | } 13 | return ans; 14 | } 15 | 16 | int main(){ 17 | int N; 18 | cin >> N; 19 | cout << func1(N); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/3week/HW2/.cph/.2616.cpp_0c2def57269a2ef377a42737fb0f2cd6.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 2616","url":"c:\\23ALPStudy\\Exercise\\zszszszs\\3week\\HW2\\2616.cpp","tests":[{"id":1679836878608,"input":"7\n35 40 50 10 30 45 60\n2","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\23ALPStudy\\Exercise\\zszszszs\\3week\\HW2\\2616.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/4week/HW3/.cph/.15559.cpp_268ba4430c4378297c89c4d002578428.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 15559","url":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\HW3\\15559.cpp","tests":[{"id":1680363808947,"input":"3 4\nSWWW\nSEWN\nEEEN","output":"2"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\HW3\\15559.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-2/Intermediate/LuckyPlace/MST/9372.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int t, v, e; 5 | 6 | int main(void) 7 | { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | cin >> t; 11 | while (t--) 12 | { 13 | cin >> v >> e; 14 | while (e--) 15 | { 16 | int a, b; 17 | cin >> a >> b; 18 | } 19 | cout << v - 1 << "\n"; 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/기초코드작성요령/2441.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int n; 6 | scanf("%d", &n); 7 | 8 | for(int i=0; ii; k--){ 13 | printf("*"); 14 | } 15 | printf("\n"); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Array/BOJ_10807.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int n; 5 | std::cin >> n; 6 | int arr[100]; 7 | for (int i = 0; i < n; i++) { 8 | std::cin >> arr[i]; 9 | } 10 | 11 | int v; 12 | std::cin >> v; 13 | int m=0; //how many v's are in arr[n]? 14 | for (int j = 0; j < n; j++) { 15 | if (v == arr[j]) m++; 16 | } 17 | std::cout << m; 18 | 19 | } 20 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/3week/HW2/.cph/.23559(밥).cpp_02872bc61a219e7a479d45c71db60b72.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 23559(밥)","url":"c:\\23ALPStudy\\Exercise\\zszszszs\\3week\\HW2\\23559(밥).cpp","tests":[{"id":1679822597803,"input":"1 5000\n10 30","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\23ALPStudy\\Exercise\\zszszszs\\3week\\HW2\\23559(밥).cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/5week/ExerciseA/.cph/.1713.cpp_00983f7a63d935b849a046f2aad03abc.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 1713","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/5week/ExerciseA/1713.cpp","tests":[{"id":1681022592492,"input":"3\n3\n1 1 1","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/5week/ExerciseA/1713.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-2/Basic/igaeun8/Array/2577: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() { 6 | int a, b, c; 7 | int arr[10] = { 0 }; 8 | cin >> a >> b >> c; 9 | int result = a * b * c; 10 | 11 | while (result !=0) { 12 | arr[result % 10] += 1; 13 | result /= 10; 14 | } 15 | 16 | for (int i = 0; i < 10; i++) { 17 | cout << arr[i] << endl; 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Array/10807: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int a[100]; 5 | 6 | int main() 7 | { 8 | int n, v; 9 | cin >> n; 10 | 11 | for(int i=0; i> a[i]; 14 | } 15 | 16 | cin >> v; 17 | 18 | int count = 0; 19 | for(int i=0; i 2 | 3 | int main(void) 4 | { 5 | int n; 6 | scanf("%d", &n); 7 | 8 | for(int i=0; i0; j--){ 10 | printf(" "); 11 | } 12 | for(int k=2*i+1;k>0; k--){ 13 | printf("*"); 14 | } 15 | printf("\n"); 16 | } 17 | 18 | return 0; 19 | } -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/기초코드작성요령/2443.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int n; 6 | scanf("%d", &n); 7 | 8 | for(int i=0; i> s; 10 | 11 | for(char a = 'a'; a<='z'; a++){ 12 | int cnt = 0; 13 | for(auto c : s) 14 | if(a==c) 15 | cnt++; 16 | cout << cnt << ' '; 17 | } 18 | } -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/2week/.cph/.1415.cpp_497745fe74cd2b5cea6685baf7597710.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 1415","url":"/23ALPStudy/Exercise/zszszszs/2week/1415.cpp","tests":[{"id":1679097478136,"input":"10\n1234\n5678\n9012\n3456\n7890\n2345\n6789\n123\n4567\n8901","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/2week/1415.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/4week/HW3/.cph/.15685.cpp_f0128324d043f4e27faf550af28d4a4c.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 15685","url":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\HW3\\15685.cpp","tests":[{"id":1680401857140,"input":"3\n3 3 0 1\n4 2 1 3\n4 2 2 1","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\HW3\\15685.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/ExA/.cph/.8911.cpp_9d73ac1c6fd6c7303919ee2c726e3eb9.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 8911","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/ExA/8911.cpp","tests":[{"id":1683544074394,"input":"3\nFFLF\nFFRRFF\nFFFBBBRFFFBBB","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/ExA/8911.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/HW/.cph/.16168.cpp_c4a57f482155f4673992d89348f7042d.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 16168","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/HW/16168.cpp","tests":[{"id":1684034396224,"input":"4 5\n1 2\n1 3\n1 4\n2 3\n2 4","output":"YES"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/HW/16168.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/기초_코드_작성_요령_II/2439: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int N; // 줄 개수 7 | int i, j; 8 | 9 | cin >> N; 10 | 11 | for(i=N; i>0; i--) 12 | { 13 | for(j=1; j0; j--) 18 | { 19 | cout << "*"; 20 | } 21 | cout << endl; 22 | } 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/4week/ExerciseA/.cph/.1189.cpp_7ee704dfa78411dd239f631d6e5a1805.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 1189","url":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\ExerciseA\\1189.cpp","tests":[{"id":1679911457667,"input":"3 4 6\n....\n.T..\n....","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\ExerciseA\\1189.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Intermediate/chaehyeon107/Greedy/11399_ATM.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n, tmp = 0, ans = 0; 5 | int a[1002]; 6 | 7 | int main(void) { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | cin >> n; 11 | for(int i = 0; i < n; i++) 12 | cin >> a[i]; 13 | sort(a, a+n); 14 | for(int i = 0; i < n; i++) 15 | ans += a[i] * (n-i); 16 | cout << ans; 17 | } 18 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/array/10807.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int n=0,f=0, aaa[100],sss; 4 | int main() 5 | { 6 | cin >> n; 7 | for (int i = 0; i < n; i++) 8 | { 9 | cin >> aaa[i]; 10 | } 11 | cin >> f; 12 | for (int i = 0; i < n; i++) 13 | { 14 | if (f == aaa[i]) 15 | sss++; 16 | } 17 | cout << sss << '\n'; 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2441.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void){ 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i = 0; i < N; i++) { 12 | int j = 0; 13 | for( ; j < i; j++) cout << ' '; 14 | for( ; j < N; j++) cout << '*'; 15 | cout << "\n"; 16 | } 17 | } -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/Array/10807.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int nums[203]; 6 | 7 | int main(){ 8 | ios::sync_with_stdio(0);cin.tie(); 9 | 10 | int N, v, inpt; 11 | 12 | cin >> N; 13 | 14 | while (N--){ 15 | cin >> inpt; 16 | nums[inpt+100] += 1; 17 | } 18 | 19 | cin >> v; 20 | 21 | cout << nums[v+100]; 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/Array/2577_숫자의_개수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int a,b,c,ans,freq[10]={0, }; 6 | cin>>a>>b>>c; 7 | ans = a*b*c; 8 | while(ans/10!=0){ 9 | freq[ans%10]++; 10 | ans/=10; 11 | } 12 | freq[ans%10]++; 13 | for (int i=0;i<10;i++){ 14 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(void) { 6 | int n; 7 | cin >> n; 8 | 9 | int w[n]; 10 | for(int i=0; i> w[i]; 11 | sort(w, w+n); 12 | 13 | int ans=0; 14 | for(int i=1; i<=n; i++){ 15 | ans = max(ans, w[n-i]*i); 16 | } 17 | cout << ans; 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2439.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void){ 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i = 0; i < N; i++) { 12 | int j = 0; 13 | for( ; j < N - i - 1; j++) cout << ' '; 14 | for( ; j < N; j++) cout << '*'; 15 | cout << "\n"; 16 | } 17 | } -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2442.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) { 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i = 1; i <= N; i++){ 12 | for(int j = 1; j <= N - i; j++) cout << ' '; 13 | for(int j = 1; j <= 2 * i - 1; j++) cout << '*'; 14 | cout << "\n"; 15 | } 16 | } -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2443.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) { 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i = N; i >= 1; i--){ 12 | for(int j = 1; j <= N - i; j++) cout << ' '; 13 | for(int j = 1; j <= 2 * i - 1; j++) cout << '*'; 14 | cout << "\n"; 15 | } 16 | } -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/2week/.cph/.tmp.cpp_78dbcc5801c8d3e50f5e6111bb05158a.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: tmp","url":"/23ALPStudy/Exercise/zszszszs/2week/tmp.cpp","tests":[{"id":1679058322161,"input":"printf(\\'left quotes_count\\\\n\\'); \nprintf(\\'right quotes_count\\'); \nEOF ","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/2week/tmp.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/6week/.cph/.15464.cpp_112b8d987c2df7f8faa77793e9e502db.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 15464","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/15464.cpp","tests":[{"id":1682936878470,"input":"4\n7 Mildred +3\n4 Elsie -1\n9 Mildred -1\n1 Bessie +2","output":"3"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/15464.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/6week/.cph/.16139.cpp_c77fcbeb8ee3678f7bffe2a0b3028752.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 16139","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/16139.cpp","tests":[{"id":1682937721119,"input":"seungjaehwang\n4\na 0 5\na 0 6\na 6 10\na 7 10","output":"0\n1\n2\n1"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/16139.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/ExA/.cph/.24481.cpp_febc7009271d0dad80e34671de2bd253.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 24481","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/ExA/24481.cpp","tests":[{"id":1683542096882,"input":"5 4 1\n1 2\n1 4\n2 3\n2 4\n3 4","output":"0\n1\n2\n3\n-1"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/ExA/24481.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Intermediate/chaehyeon107/dynamicProgramming/1912.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int d[100005], s[100005]; 5 | int n; 6 | 7 | int main(void) { 8 | int n; 9 | cin >> n; 10 | for(int i = 1; i <= n; i++) { 11 | cin >> s[i]; 12 | d[i] = s[i]; 13 | } 14 | for(int i = 1; i <= n; i++) 15 | d[i] = max(d[i], d[i-1] + s[i]); 16 | cout << *max_element(d+1, d+n+1); 17 | } 18 | -------------------------------------------------------------------------------- /2023-2/Basic/ffe4el/Array/알파벳_개수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | string w; 6 | cin>>w; 7 | 8 | int alpha[26]={}; 9 | 10 | for(int i=0; i 2 | 3 | int main(void) 4 | { 5 | int arr[9]; 6 | int i, max, idx; 7 | max=idx=0; 8 | 9 | for(i=0; i<9; i++) 10 | { 11 | scanf("%d", &arr[i]); 12 | 13 | if(max 2 | 3 | int main(void) 4 | { 5 | int n, sum=0, min=99; 6 | 7 | for(int i=0; i<7; i++){ 8 | scanf("%d", &n); 9 | if(n%2==1){ 10 | sum+=n; 11 | if(min>n) 12 | min=n; 13 | } 14 | } 15 | 16 | if(sum==0) printf("-1"); 17 | else printf("%d\n%d", sum, min); 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/5week/ExerciseA/.cph/.17503.cpp_913d3bc549d51af4e229b45ac7a35630.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 17503","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/5week/ExerciseA/17503.cpp","tests":[{"id":1681032784086,"input":"3 9 5\n2 5\n4 6\n3 3\n4 3\n1 4","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/5week/ExerciseA/17503.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/HW/.cph/.17025.cpp_c0820be5aab7cc613f71f6bfdd36e6f3.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 17025","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/HW/17025.cpp","tests":[{"id":1684032270467,"input":"6\n##....\n....#.\n.#..#.\n.#####\n...###\n....##","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/HW/17025.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/7week/HW/.cph/.1943.cpp_31afa81ba5b066590f7b54e52bc7a4d7.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 1943","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/HW/1943.cpp","tests":[{"id":1684056259416,"input":"2\n500 1\n50 1\n3\n100 2\n50 1\n10 5\n3\n1 1\n2 1\n3 1","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/7week/HW/1943.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-2/Intermediate/LuckyPlace/Dynamic_programming/11727.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int dp[1005]; 5 | 6 | int main(void) 7 | { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | int n; 11 | cin >> n; 12 | dp[1] = 1; 13 | dp[2] = 3; 14 | for (int i = 3; i <= n; i++) 15 | { 16 | dp[i] = (dp[i - 1] + (2 * dp[i - 2])) % 10007; 17 | } 18 | cout << dp[n]; 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Basic/IvyJung/Array/2577.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int A, B, C; 5 | int arr[10] = {0, }; 6 | int num; 7 | scanf("%d %d %d", &A, &B, &C); 8 | 9 | int n = A * B * C; 10 | while(n > 0){ 11 | num = n % 10; 12 | arr[num]++; 13 | n /= 10; 14 | } 15 | for(int i = 0; i < 10; i++){ 16 | printf("%d\n", arr[i]); 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/기초코드작성요령/9498.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int s; 6 | scanf("%d", &s); 7 | 8 | if(s>=90) 9 | printf("A\n"); 10 | else if(s>=80&&s<90) 11 | printf("B\n"); 12 | else if(s>=70&&s<80) 13 | printf("C\n"); 14 | else if(s>=60&&s<70) 15 | printf("D\n"); 16 | else 17 | printf("F\n"); 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /2023-1/Basic/highcastle01/basic2/BOJ_2562.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | 10 | int i = 1, n, max = 0, maxi = 1; 11 | while(i < 10) 12 | { 13 | cin >> n; 14 | if(max < n) 15 | { 16 | max = n; 17 | maxi = i; 18 | } 19 | i++; 20 | } 21 | 22 | cout << max << "\n" << maxi; 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/4week/HW3/.cph/.19951.cpp_a6be7100ae800b3eace2492ea2ddb6f3.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 19951","url":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\HW3\\19951.cpp","tests":[{"id":1680405637471,"input":"10 3\n1 2 3 4 5 -1 -2 -3 -4 -5\n1 5 -3\n6 10 5\n2 7 2","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\HW3\\19951.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Intermediate/chlwndks33/Greedy/2217.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int n; 6 | int w[100001]; 7 | 8 | int main() { 9 | ios::sync_with_stdio(0); 10 | cin.tie(0); 11 | cin >> n; 12 | for(int i=0; i> w[i]; 13 | sort(w,w+n); 14 | int ans =0; 15 | for(int i=1; i<=n; i++) 16 | ans = max(ans,w[n-i]*i); 17 | cout << ans; 18 | } -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dynamic_programming/11727.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | using namespace std; 7 | int dp[10005]; 8 | int n; 9 | int main() { 10 | ios::sync_with_stdio(0); 11 | cin.tie(0); 12 | cin >> n; 13 | dp[1] = 1; 14 | dp[2] = 3; 15 | for (int i = 3; i <= n; i++)dp[i] = (dp[i - 1] + dp[i - 2] * 2)%10007; 16 | cout << dp[n]; 17 | } 18 | -------------------------------------------------------------------------------- /2023-2/Basic/igaeun8/Array/10808: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() { 7 | 8 | string s; 9 | int apb[26] = { 0 }; 10 | cin >> s; 11 | 12 | //알파벳 문자 횟수 계산 13 | for (int i = 0; i < s.size(); i++) { 14 | apb[s[i] - 'a']++; 15 | } 16 | 17 | //각 알파벳 문자 횟수 출력 18 | for (int i = 0; i < 26; i++) { 19 | cout << apb[i] << " "; 20 | } 21 | 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2753.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/12. 3 | // 4 | #include "bits/stdc++.h" 5 | using namespace std; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | int a; 12 | cin >> a; 13 | if(a%4==0) 14 | if(a%100!=0 || a%400==0) 15 | cout << 1; 16 | else 17 | cout <<0; 18 | else 19 | cout<<0; 20 | } -------------------------------------------------------------------------------- /2023-1/Basic/rlathdns/Array/10808.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main(void){ 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | string s; 10 | cin >> s; 11 | for(char a = 'a'; a<='z'; a++){ 12 | int cnt = 0; 13 | for(auto c: s) 14 | if(a == c) cnt++; 15 | cout << cnt << " "; 16 | } 17 | 18 | 19 | 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_10804.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int a[21]; 5 | int main(void) { 6 | ios::sync_with_stdio(0); 7 | cin.tie(0); 8 | 9 | for (int i = 1; i < 21; i++) a[i] = i; 10 | int tc = 10; 11 | while (tc--) { 12 | int i; int f; 13 | cin >> i >> f; 14 | reverse(a + i, a + f + 1); 15 | } 16 | for (int i = 1; i < 21; i++) cout << a[i]<<" "; 17 | } 18 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/8week/ExA/.cph/.14562.cpp_f385f01742a0928999f0ae3f791f4135.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 14562","url":"/Users/zs/23ALPStudy/Exercise/zszszszs/8week/ExA/14562.cpp","tests":[{"id":1684146469785,"input":"6\n10 20\n2 7\n15 62\n10 37\n11 50\n34 59","output":"3\n3\n4\n4\n5\n25"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/Users/zs/23ALPStudy/Exercise/zszszszs/8week/ExA/14562.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Intermediate/Zoe305/Dynamic_Programming/2193.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n; 5 | long long num[91]; //int형으로 선언해서 틀렸습니다가 떴었음 6 | 7 | int main(void){ 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | cin >> n; 12 | num[1] = 1; 13 | num[2] = 1; 14 | 15 | for(int i = 3; i <= n; i++) 16 | num[i] = num[i-1] + num[i-2]; 17 | 18 | cout << num[n]; 19 | } -------------------------------------------------------------------------------- /2023-1/Intermediate/chaehyeon107/Divide_and_Conquer/1629.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | using ll = long long; 4 | 5 | ll func(ll a, ll b, ll c) { 6 | if (b == 1) return a % c; 7 | ll val = func(a, b / 2, c); 8 | val = val * val % c; 9 | if (b % 2) return val * a % c; 10 | return val; 11 | } 12 | 13 | int main(void) 14 | { 15 | ll a, b, c; 16 | cin >> a >> b >> c; 17 | cout << func(a, b, c); 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Intermediate/chlwndks33/DP/11726.cpp: -------------------------------------------------------------------------------- 1 | // Baekjoon - 11762번 2*n 타일링 2 | 3 | #include 4 | using namespace std; 5 | 6 | int arr[10001]; 7 | int n; 8 | 9 | int main() { 10 | ios::sync_with_stdio(0); 11 | cin.tie(0); 12 | arr[1] = 1; 13 | arr[2] = 2; 14 | cin >> n; 15 | for(int i=3; i<=n; i++) { 16 | arr[i] = (arr[i-1] + arr[i-2]) % 10007; 17 | } 18 | cout << arr[n]; 19 | 20 | } -------------------------------------------------------------------------------- /2023-1/Intermediate/kimso1279/Greedy/BOJ_11047.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(void) { 6 | int n, k, cnt=0; 7 | cin >> n >> k; 8 | 9 | int A[1000001]; 10 | for(int i=0; i> A[i]; 11 | 12 | for(int i=n-1; i>=0; i--){ 13 | cnt += k / A[i]; // 나눈 몫 저장 14 | k %= A[i]; // 나머지 저장 15 | } 16 | 17 | cout << cnt; 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Intermediate/suin0413/DP/BOJ_11727.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n; 5 | long long arr[1002]; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | cin >> n; 11 | // arr[k] = arr[k-1] + arr[k-2] * 2 12 | arr[1] = 1; 13 | arr[2] = 3; 14 | for(int i = 3; i<=n;i++){ 15 | arr[i] = (arr[i-1] + arr[i-2] * 2) % 10007; 16 | } 17 | cout << arr[n]; 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/기초코드작성요령2/2562.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int i=0,j=0,max=0,x=0; 6 | int arr[9]; 7 | while(i<9){ 8 | scanf("%d",&arr[i]); 9 | i++; 10 | } 11 | max=arr[0]; 12 | while(j<8){ 13 | x++; 14 | if(max 2 | #include 3 | 4 | using namespace std; 5 | 6 | int abc[3]; 7 | 8 | int main(void) 9 | { 10 | ios::sync_with_stdio(0); 11 | cin.tie(0); 12 | 13 | int a, b, c, i; 14 | 15 | cin >> abc[0] >> abc[1] >> abc[2]; 16 | 17 | sort(abc, abc+3); 18 | 19 | for(i = 0; i < 3; i++) 20 | { 21 | cout << abc[i] << " "; 22 | } 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/Array/10807_개수_세기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void){ 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | int n,v,num,cnt=0; 9 | int a[101]={0, }; 10 | cin>>n; 11 | for (int i=0; i> num; 13 | a[i] = num; 14 | } 15 | cin >> v; 16 | for(int i=0; i 2 | using namespace std; 3 | int main() { 4 | ios::sync_with_stdio(false); 5 | cin.tie(NULL); 6 | 7 | int n; 8 | cin >> n; 9 | int flag = 0; 10 | for (int i = 0; i < n; i++) { 11 | for (int k = 0; k < flag; k++) { 12 | cout << " "; 13 | } 14 | for (int j = n; j > i; j--) { 15 | cout << "*"; 16 | } 17 | flag++; 18 | cout << '\n'; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/Array/beak_2577.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Day: 2023.03.15 3 | 참고 : 4 | */ 5 | #include 6 | 7 | using namespace std; 8 | 9 | int main() { 10 | int a, b, c; 11 | cin >> a >> b >> c; 12 | int result = a * b * c; 13 | int num[10] = { 0 }; 14 | while (result > 0) { 15 | num[result % 10]++; 16 | result = result / 10; 17 | } 18 | for (int i = 0; i < 10; i++) { 19 | cout << num[i] << "\n"; 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/1week/.cph/.16767(Convention2).cpp_b128b2265d11942684eb7b6f48d01bbb.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 16767(Convention2)","url":"/23ALPStudy/Exercise/zszszszs/1week/16767(Convention2).cpp","tests":[{"id":1678517096614,"input":"5\n25 3\n105 30\n20 50\n10 17\n100 10","output":"10"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/23ALPStudy/Exercise/zszszszs/1week/16767(Convention2).cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Intermediate/Daeuning/Dynamicprogramming/BOJ_2193: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | long long D[92][3]; 5 | 6 | int main(void) 7 | { 8 | int N; 9 | 10 | cin >> N; 11 | 12 | D[1][1] = 1; 13 | D[1][0] = 0; 14 | 15 | for (int i = 2; i <= N; i++) 16 | { 17 | D[i][0] = D[i - 1][0] + D[i - 1][1]; 18 | D[i][1] = D[i - 1][0]; 19 | } 20 | 21 | cout << D[N][0] + D[N][1]; 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimso1279/DP/BOJ_11726.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | ios::sync_with_stdio(0); 7 | cin.tie(0); 8 | 9 | int d[10005]; 10 | int mod = 10007, n; 11 | 12 | cin >> n; 13 | 14 | // 초기값 정하기 15 | d[1] = 1; 16 | d[2] = 2; 17 | for(int i=3; i <= n; i++) d[i] = (d[i-1] + d[i-2]) % mod; 18 | 19 | cout << d[n]; 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Intermediate/qowlgur121/greedy/11047.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int n, k; 3 | int a[15]; 4 | 5 | 6 | int main() { 7 | std::ios::sync_with_stdio(0); 8 | std::cin.tie(0); 9 | std::cin >> n >> k; 10 | 11 | int ans = 0; 12 | for (int i = 0; i < n; i++)std::cin >> a[i]; 13 | for (int i = n - 1; i >= 0; i--) { 14 | ans += k / a[i]; //ans는 거슬러줘야하는 동전의 개수 15 | k %= a[i]; //거스름돈 16 | } 17 | std::cout << ans; 18 | 19 | } 20 | -------------------------------------------------------------------------------- /2023-2/Basic/Bkjung9/Array/2577.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(int argc, const char *argv[]){ 5 | int a, b, c; 6 | cin >> a >> b >> c; 7 | 8 | int num = a * b * c; 9 | int count[10] = {}; 10 | 11 | while(num != 0){ 12 | count[num % 10]++; 13 | num /= 10; 14 | } 15 | 16 | for(int i : count) 17 | cout << i << "\n"; 18 | 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /2023-2/Basic/minkyunson/array/2577.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int a, b, c, t; 7 | cin >> a >> b >> c; 8 | 9 | t = a * b * c; 10 | int arr[10] = {}; 11 | 12 | while(t) 13 | { 14 | arr[t % 10] += 1; 15 | t = t / 10; 16 | } 17 | 18 | for(int i = 0; i < 10; i++) 19 | { 20 | cout << arr[i] << endl; 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /2023-2/Basic/youth5427/Recursion/beak_1629.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | long long pow(long long a, long long b, long long c) { 5 | if (b == 1)return a % c; 6 | long long val = pow(a, b / 2, c); 7 | val = val * val % c; 8 | if (b % 2 == 0) return val; 9 | else return val * a % c; //...? 10 | } 11 | int main() { 12 | long long a, b, c; 13 | cin >> a >> b >> c; 14 | cout << pow(a, b, c); 15 | 16 | } 17 | -------------------------------------------------------------------------------- /2023-2/Basic/youth5427/array/Beak_2577.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Day: 2023.03.15 3 | 참고 : 4 | */ 5 | #include 6 | 7 | using namespace std; 8 | 9 | int main() { 10 | int a, b, c; 11 | cin >> a >> b >> c; 12 | int result = a * b * c; 13 | int num[10] = { 0 }; 14 | while (result > 0) { 15 | num[result % 10]++; 16 | result = result / 10; 17 | } 18 | for (int i = 0; i < 10; i++) { 19 | cout << num[i] << "\n"; 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/기초_코드_작성_요령_II/15552: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | cin.tie(NULL); //입력과 출력의 연결을 끊어줌 - endl사용하면 안됨 7 | ios_base::sync_with_stdio(false); //C의 stdio와 C++의 iostream의 동기화를 비활성화 한다 (즉, 평소엔 서로 동기화 상태) 8 | int T; 9 | cin >> T; 10 | 11 | int a, b; 12 | for(int i=0; i> a >> b; 15 | cout << a+b <<"\n"; 16 | } 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Linked List/1406 에디터.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | const int MX = 1000005; 5 | char dat[MX]; 6 | int pre[MX]; 7 | int nxt[MX]; 8 | int unused = 1; 9 | 10 | void intsert(int addr, int num) { 11 | 12 | } 13 | 14 | void erase(int addr) { 15 | 16 | } 17 | 18 | void traversa1() { 19 | 20 | } 21 | 22 | int main(void) { 23 | ios::sync_with_stdio(0); 24 | cin.tie(0); 25 | fill(pre) 26 | } -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code2/2439.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i=1;i<=N;i++){ 12 | for (int j=0;j 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i=N;i>0;i--){ 12 | for (int j=0;j 2 | using namespace std; 3 | 4 | int main() { 5 | ios::sync_with_stdio(0); //false 6 | cin.tie(0); //nullptr 7 | 8 | int A, B; 9 | cin >> A >> B; 10 | 11 | cout << A + B << '\n'; 12 | cout << A - B << '\n'; 13 | cout << A * B << '\n'; 14 | cout << A / B << '\n'; 15 | cout << A % B << '\n'; 16 | } 17 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_10871.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | ios::sync_with_stdio(0); //false 6 | cin.tie(0); //nullptr 7 | 8 | int N, X; 9 | cin >> N >> X; 10 | 11 | int input; 12 | for (int i = 0; i < N; i++) { 13 | cin >> input; 14 | if (input < X) 15 | cout << input << ' '; 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Basic_code/BOJ_2439.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() { 4 | ios::sync_with_stdio(false); 5 | cin.tie(NULL); 6 | 7 | int n; 8 | cin >> n; 9 | int flag = 0; 10 | for (int i = 0; i < n; i++) { 11 | for (int j = n; j > i + 1; j--) { 12 | cout << " "; 13 | } 14 | for (int k = 0; k <= flag; k++) { 15 | cout << "*"; 16 | } 17 | flag++; 18 | cout << '\n'; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/basic_code/beak_9498: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int x; 5 | scanf("%d",&x); 6 | if(x>=90) //90점 이상 7 | printf("A",x); 8 | else if(x >=80) //80점 이상 90점 미만 9 | printf("B",x); 10 | else if(x >=70) //70점 이상 80점 미만 11 | printf("C",x); 12 | else if(x >=60) //60점 이상 70점 미만 13 | printf("D",x); 14 | else //60점 미만 15 | printf("F",x); 16 | 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /2023-1/Intermediate/Dameun2224/DP/11726.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int d[1005]; 7 | 8 | int main(void) { 9 | ios_base::sync_with_stdio(0); 10 | cin.tie(0); 11 | 12 | int n; 13 | cin >> n; 14 | 15 | d[1] = 1; 16 | d[2] = 2; 17 | 18 | for (int i = 3; i <= n; i++) d[i] = (d[i - 1] + d[i - 2]) % 10007; 19 | cout << d[n] << '\n'; 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /2023-1/Intermediate/chlwndks33/MST/9372.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | int t; 9 | cin >> t; 10 | while(t--) { 11 | int v, e; 12 | cin >> v >> e; 13 | while(e--) { 14 | int a, b; 15 | cin >> a >> b; 16 | } 17 | cout << v-1 << '\n'; //최소신장트리의 간선의 수는 정점의수-1 18 | } 19 | } -------------------------------------------------------------------------------- /2023-1/Intermediate/kimso1279/DP/BOJ_11727.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | ios::sync_with_stdio(0); 7 | cin.tie(0); 8 | 9 | int d[10005]; 10 | int mod = 10007, n; 11 | 12 | cin >> n; 13 | 14 | // 초기값 정하기 15 | d[1] = 1; 16 | d[2] = 3; 17 | for(int i=3; i <= n; i++) d[i] = (d[i-1] + d[i-2] * 2) % mod; 18 | 19 | cout << d[n]; 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Intermediate/suin0413/DP/BOJ_2193.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n; 5 | long long arr[100][2]; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | cin >> n; 11 | arr[1][1] = 1; 12 | arr[2][0] = 1; 13 | for(int i = 3;i<=n;i++){ 14 | arr[i][0] = arr[i-1][0] + arr[i-1][1]; 15 | arr[i][1] = arr[i-1][0]; 16 | } 17 | cout << arr[n][0] + arr[n][1]; 18 | } 19 | -------------------------------------------------------------------------------- /2023-2/Basic/user20230912/Array/2577-2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int solution[10]; 4 | 5 | int main() 6 | { 7 | long long i_a, i_b, i_c; 8 | std::cin >> i_a >> i_b >> i_c; 9 | 10 | long long d = i_a * i_b * i_c; 11 | 12 | while (d != 0) { 13 | solution[d % 10]++; 14 | d /= 10; 15 | } 16 | 17 | for (int i = 0; i < 10; i++) { 18 | std::cout << solution[i] << '\n'; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Array/2577: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int A, B, C; 6 | int sum; 7 | int arr[10] = {0, }; 8 | int num; 9 | int i; 10 | 11 | cin >> A; 12 | cin >> B; 13 | cin >> C; 14 | 15 | sum = A * B * C; 16 | 17 | while(sum > 0) 18 | { 19 | num = sum % 10; 20 | arr[num]++; 21 | sum = sum/10; 22 | } 23 | 24 | for(i = 0; i <= 9; i++) 25 | { 26 | cout << arr[i] <<"\n"; 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2587.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/13. 3 | // 4 | #include "bits/stdc++.h" 5 | using namespace std; 6 | 7 | int a[5],sum; 8 | 9 | int main(){ 10 | ios::sync_with_stdio(0); 11 | cin.tie(0); 12 | 13 | for(int i=0;i<5;i++) 14 | cin >> a[i]; 15 | for(int i=0;i<5;i++) 16 | sum += a[i]; 17 | cout << sum/5 << "\n"; 18 | 19 | sort(a,a+5); 20 | cout << a[2]; 21 | } -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/2.Array/10807.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int a[105]={}; 6 | 7 | int main(){ 8 | cin.tie(0); 9 | ios::sync_with_stdio(0); 10 | 11 | int n,x; 12 | int cnt = 0; 13 | 14 | cin >> n; 15 | for(int i = 0; i> a[i]; 17 | cin >> x; 18 | for(int i = 0; i < n;i++) 19 | if(a[i]==x) 20 | cnt++; 21 | cout << cnt; 22 | } -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/5.Queue/2164.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int N; 5 | queue q; 6 | 7 | int main(void){ 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | cin >> N; 12 | for(int i = 1; i <= N; ++i) q.push(i); 13 | while(q.size() != 1){ 14 | q.pop(); 15 | int tmp = q.front(); 16 | q.push(tmp); 17 | q.pop(); 18 | } 19 | cout << q.front(); 20 | } -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/Recursion/1074.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int z_recursion(int N, int r, int c){ 6 | if (N == 1) return r*2 + c; 7 | 8 | return z_recursion(N-1,r/2,c/2)*4 + r%2*2 + c%2; 9 | } 10 | 11 | int main(){ 12 | ios::sync_with_stdio(0); cin.tie(0); 13 | 14 | int N,r,c; 15 | 16 | cin >> N >> r >> c; 17 | 18 | cout << z_recursion(N,r,c); 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/basic_code2/2442.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i=1;i<=N;i++){ 12 | for (int j=0;j 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | ios::sync_with_stdio(0); cin.tie(0); 7 | 8 | int N; 9 | cin >> N; 10 | 11 | for(int i=N;i>0;i--){ 12 | for (int j=0;j 6 | #include 7 | using namespace std; 8 | 9 | int main() { 10 | queue q; 11 | int N = 0; 12 | cin >> N; 13 | 14 | for (int i = 1; i < N+1; i++) q.push(i); 15 | 16 | for (int i = N; i > 1; i--) { 17 | q.pop(); 18 | q.push(q.front()); 19 | q.pop(); 20 | } 21 | cout << q.front(); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/4week/ExerciseA/.cph/.5464.cpp_068c0b782dd5d4b7ec2467838bc40569.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 5464","url":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\ExerciseA\\5464.cpp","tests":[{"id":1680239840356,"input":"3 4\n2\n3\n5\n200\n100\n300\n800\n3\n2\n-3\n1\n4\n-4\n-2\n-1","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\ExerciseA\\5464.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-1/Intermediate/Daeuning/Dynamicprogramming/BOJ_11727: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int D[1002]; 6 | int mod = 10007; 7 | 8 | int main(void) 9 | { 10 | int N; 11 | cin >> N; 12 | 13 | D[0] = 0; 14 | D[1] = 1; 15 | D[2] = 3; 16 | 17 | for (int i = 3; i <= N; i++) 18 | { 19 | D[i] = (D[i - 1] + D[i - 2] + D[i - 2]) % mod; 20 | } 21 | 22 | cout << D[N]; 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /2023-1/Intermediate/suin0413/MST/BOJ_9372.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) { 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | int t; cin >> t; 8 | while(t--){ 9 | int n, m; 10 | cin >> n >> m; 11 | while(m--){ 12 | int a,b; 13 | cin >> a >> b; 14 | } 15 | cout << n-1 << "\n"; 16 | } 17 | } 18 | 19 | // 전제에 모든 노드를 방문할 수 있는 경로 존재 20 | // MST는 항상 간선의 개수가 N-1개 21 | -------------------------------------------------------------------------------- /2023-1/Intermediate/suin0413/이분탐색/BOJ_10815.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n, m, arr[500005]; 5 | 6 | int main(void) { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | cin >> n; 10 | for(int i = 0;i> arr[i]; 12 | } 13 | sort(arr,arr+n); 14 | cin >> m; 15 | while(m--){ 16 | int t; 17 | cin >> t; 18 | cout << binary_search(arr,arr+n,t) << " "; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/queue/BOJ_2164.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | queue Q; 6 | int N; 7 | 8 | int main(void) 9 | { 10 | cin >> N; 11 | for (int i = 1; i <= N; i++) 12 | Q.push(i); 13 | while (Q.size() > 1) 14 | { 15 | Q.pop(); 16 | 17 | if (Q.size() == 1) 18 | break; 19 | 20 | Q.push(Q.front()); 21 | Q.pop(); 22 | } 23 | cout << Q.front() << endl; 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Array/10807_개수_세기.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | 4 | int arr[100]; 5 | int main() { 6 | int N; 7 | scanf("%d", &N); 8 | 9 | for (int i = 0; i < N; i++) { 10 | scanf("%d", &arr[i]); 11 | } 12 | 13 | int v; 14 | scanf("%d", &v); 15 | 16 | int count = 0; 17 | for (int j = 0; j < N; j++) { 18 | if (arr[j] == v) 19 | count++; 20 | } 21 | printf("%d", count); 22 | 23 | return 0; 24 | } -------------------------------------------------------------------------------- /2023-1/Basic/highcastle01/basic2/BOJ_2441.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int n, i, j, k; 10 | cin >> n; 11 | 12 | for(i = 0; i < n; i++) 13 | { 14 | for(j = 0; j < i; j++) 15 | { 16 | cout << " "; 17 | } 18 | for(k = 0; k < n - i; k++) 19 | { 20 | cout << "*"; 21 | } 22 | cout << "\n"; 23 | } 24 | 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/Array/10808.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int alphabets[33]; 6 | 7 | int main(){ 8 | ios::sync_with_stdio(0);cin.tie(); 9 | 10 | string S; 11 | cin >> S; 12 | 13 | for (int i=0;i a == 97 15 | } 16 | 17 | for (int i=0;i<26;i++){ 18 | cout << alphabets[i] << ' '; 19 | } 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/Stack/10773.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) 5 | { 6 | ios::sync_with_stdio(0); 7 | cin.tie(0); 8 | 9 | stack s; 10 | int k,num,ans=0; 11 | cin >> k; 12 | for (int i = 0; i < k; i++){ 13 | cin >> num; 14 | if (num == 0) s.pop(); 15 | else s.push(num); 16 | } 17 | while(!(s.empty())){ 18 | ans+=s.top(); 19 | s.pop(); 20 | } 21 | cout< 2 | #include 3 | using namespace std; 4 | int main() { 5 | ios_base::sync_with_stdio(false); 6 | cin.tie(0); 7 | int a, b, c; 8 | cin >> a >> b >> c; 9 | string str = to_string(a * b * c); 10 | int buf[10] = {}; 11 | for (int i = 0; i < str.length(); i++) { 12 | buf[str[i] - 48]++; 13 | } 14 | for (int i = 0; i < 10; i++) { 15 | cout << buf[i] << '\n'; 16 | } 17 | } -------------------------------------------------------------------------------- /2023-2/Basic/gimyeongsu6737/Queue/boj_2164.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | ios_base::sync_with_stdio(false); 7 | cin.tie(0); 8 | int n; 9 | 10 | queue q; 11 | cin >> n; 12 | for (int i = 1; i <= n; i++) { 13 | q.push(i); 14 | } 15 | 16 | while (q.size() != 1) { 17 | q.pop(); 18 | q.push(q.front()); 19 | q.pop(); 20 | 21 | 22 | } 23 | 24 | cout << q.front(); 25 | } -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Queue/2164.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | queue Q; 6 | int main(void) 7 | { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | int n; 12 | int i=1; 13 | cin>>n; 14 | 15 | while(n--){ 16 | Q.push(i++); 17 | } 18 | 19 | while(Q.size()>2){ 20 | Q.pop(); 21 | Q.push(Q.front()); 22 | } 23 | cout< 2 | 3 | int main(void) 4 | { 5 | int n, i, j, k; 6 | scanf("%d", &n); 7 | 8 | for (i = 0; i < n; i++) 9 | { 10 | for (j = 0; j < n-i-1; j++) 11 | { 12 | printf(" "); 13 | 14 | } 15 | for (k = 0; k < i + 1; k++) 16 | { 17 | printf("*"); 18 | } 19 | printf("\n"); 20 | } 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/2480.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/12. 3 | // 4 | #include "bits/stdc++.h" 5 | using namespace std; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | int a,b,c; 12 | cin>>a>>b>>c; 13 | if(a==b&&b==c) cout << 10000 + a*1000; 14 | else if(a==b||a==c) cout << 1000 + a*100; 15 | else if(b==c) cout << 1000 + b*100; 16 | else cout << max({a,b,c}) * 100; 17 | } -------------------------------------------------------------------------------- /2023-1/Basic/highcastle01/basic2/BOJ_2439.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int n, i, j, k; 10 | cin >> n; 11 | 12 | for(i = 1; i <= n; i++) 13 | { 14 | for(j = 1; j <= n - i; j++) 15 | { 16 | cout << " "; 17 | } 18 | for(k = 1; k <= i; k++) 19 | { 20 | cout << "*"; 21 | } 22 | cout << "\n"; 23 | } 24 | 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /2023-1/Basic/highcastle01/basic2/BOJ_2442.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int n, i, j, k; 10 | cin >> n; 11 | 12 | for(i = 1; i <= n; i++) 13 | { 14 | for(j = 1; j <= n - i; j++) 15 | { 16 | cout << " "; 17 | } 18 | for(k = 1; k < 2 * i; k++) 19 | { 20 | cout << "*"; 21 | } 22 | cout << "\n"; 23 | } 24 | 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /2023-1/Basic/highcastle01/basic2/BOJ_2753.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int year; 10 | 11 | cin >> year; 12 | 13 | if(year % 4 == 0) 14 | { 15 | if(year % 100 != 0 || year % 400 == 0) 16 | { 17 | cout << 1; 18 | } 19 | else 20 | { 21 | cout << 0; 22 | } 23 | } 24 | else 25 | { 26 | cout << 0; 27 | } 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /2023-1/Intermediate/chlwndks33/DP/1699.cpp: -------------------------------------------------------------------------------- 1 | // Baekjoon - 1699번 제곱수의 합 2 | 3 | #include 4 | using namespace std; 5 | 6 | int n; 7 | int d[100010]; 8 | 9 | int main() { 10 | ios::sync_with_stdio(0); 11 | cin.tie(0); 12 | 13 | cin >> n; 14 | for(int i=1; i<=n; i++) { 15 | d[i] = i; 16 | for(int j=1; j*j<=i; j++) { 17 | d[i] = min(d[i],d[i-j*j]+1); 18 | } 19 | } 20 | cout << d[n]; 21 | } -------------------------------------------------------------------------------- /2023-1/Intermediate/qowlgur121/Divide_and_Conquer/1629.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | long long a, b, c, k; 6 | 7 | long long power(long long b) { 8 | if (b == 0) return 1; 9 | if (b == 1) return a % c; 10 | 11 | k = power(b / 2) % c; 12 | if (b % 2 == 0) return k * k % c; 13 | return k * k % c * a % c; 14 | } 15 | 16 | int main(void) { 17 | cin >> a >> b >> c; 18 | cout << power(b); 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Intermediate/suin0413/DP/BOJ_1912.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n; 5 | int a[100002], d[100002]; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | cin >> n; 11 | for(int i = 1; i <= n; i++){ 12 | cin >> a[i]; 13 | } 14 | for(int i = 1; i <= n; i++) 15 | d[i] = max(a[i], d[i-1] + a[i]); 16 | // d[i]는 i까지의 연속합의 최대값 17 | cout << *max_element(d + 1, d + n + 1); 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Intermediate/wss0702/dive_and_conquer/1629.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | long long fun1(long long a, long long b, long long c) { 4 | if (b == 1) { 5 | return a % c; 6 | } 7 | long long val = fun1(a, b / 2, c); 8 | val = val * val % c; 9 | if (b % 2 == 0) { 10 | return val; 11 | } 12 | return val * a % c; 13 | } 14 | int main() { 15 | long long A, B, C; 16 | cin >> A >> B >> C; 17 | cout << fun1(A, B, C); 18 | } 19 | -------------------------------------------------------------------------------- /2023-2/Basic/yeon/array/2577.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | int a, b, c; 7 | int arr[10] = {}; 8 | cin >> a >> b >> c; 9 | 10 | int sum = a*b*c; 11 | 12 | //계산 결과를 자릿수별로 확인 13 | while(sum>0){ 14 | arr[sum%10]++; 15 | sum/=10; 16 | } 17 | 18 | for(int i=0; i<10; i++){ 19 | cout << arr[i] << '\n'; 20 | } 21 | 22 | return 0; 23 | 24 | } 25 | -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Array/3273: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int arr[2000001] = {}; 5 | 6 | int main() 7 | { 8 | int n, a; 9 | cin >> n; 10 | 11 | for(int i=0; i> a; 14 | arr[a]++; 15 | } 16 | 17 | int x; 18 | cin >> x; 19 | 20 | int ans = 0; 21 | for(int i = 1; i < (x+1)/2; ++i) 22 | { 23 | if (arr[i]==1 && arr[x-i]==1) 24 | ans++; 25 | } 26 | 27 | cout << ans; 28 | } 29 | -------------------------------------------------------------------------------- /2023-1/Intermediate/chaehyeon107/dynamicProgramming/11055.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int d[1002], s[1002]; 5 | 6 | int main(void) { 7 | int n; 8 | cin >> n; 9 | for(int i = 0; i < n; i++) { 10 | cin >> s[i]; 11 | d[i] = s[i]; 12 | } 13 | for(int i = 0; i < n; i++) { 14 | for(int j = 0; j < i; j++) { 15 | if(s[i] > s[j]) d[i] = max(d[j] + s[i], d[i]); 16 | } 17 | } 18 | cout << *max_element(d, d+n); 19 | } 20 | -------------------------------------------------------------------------------- /2023-1/Intermediate/jikim08/DP/2193.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() { 7 | int N; 8 | cin >> N; 9 | 10 | vector DP(N+1); //long long....빡치네 11 | 12 | DP[1] = 1; 13 | DP[2] = 1; 14 | 15 | for (int i = 3; i <= N; i++) { 16 | DP[i] = DP[i - 1] + DP[i - 2]; //마지막 수가 0인경우, 마지막 수가 1인 경우(01이 고정이므로 i-2) 17 | } 18 | 19 | cout << DP[N]; 20 | 21 | } 22 | -------------------------------------------------------------------------------- /2023-2/Basic/user20230912/queue/2164.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | queue q; 9 | 10 | int input = 0; 11 | cin >> input; 12 | 13 | for (int i = 1; i <= input; i++) { 14 | q.push(i); 15 | } 16 | 17 | while (q.size() != 1) { 18 | q.pop(); 19 | q.push(q.front()); 20 | q.pop(); 21 | 22 | } 23 | cout << q.front(); 24 | } 25 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/recursive/11729.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void Matb(int a,int b,int n) 5 | { 6 | if(n==1){ 7 | printf("%d %d\n",a,b); 8 | return ; 9 | } 10 | Matb(a,6-a-b,n-1); 11 | printf("%d %d\n",a,b); 12 | Matb(6-a-b,b,n-1); 13 | } 14 | 15 | int main() 16 | { 17 | int n=0; 18 | scanf("%d",&n); 19 | int n2=pow(2,n)-1; 20 | printf("%d\n",n2); 21 | Matb(1,3,n); 22 | } 23 | -------------------------------------------------------------------------------- /2023-1/Basic/LuckyPlace/BOJ_2753.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) 5 | { 6 | int year; 7 | cin >> year; 8 | if (year % 4 == 0) 9 | { 10 | if (year % 100 == 0) 11 | { 12 | if (year % 400 == 0) 13 | { 14 | cout << 1 << endl; 15 | return 0; 16 | } 17 | cout << 0 << endl; 18 | return 0; 19 | } 20 | cout << 1 << endl; 21 | return 0; 22 | } 23 | else 24 | cout << 0 << endl; 25 | return 0; 26 | } -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/Array/3273.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int occur[2000001]; 5 | int arr[100001]; 6 | int main(void) 7 | { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | int n, x, count=0; 11 | cin>>n; 12 | for(int i=0; i>arr[i]; 13 | cin>>x; 14 | for(int i=0; i 2 | using namespace std; 3 | 4 | int num[21]; 5 | 6 | int main(void){ 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | 10 | for(int i = 1; i <= 20; i++) num[i] = i; 11 | 12 | for(int i = 1; i <= 10; i++) { 13 | int a, b; 14 | cin >> a >> b; 15 | reverse(num+a, num+b+1); 16 | } 17 | 18 | for(int i = 1; i <= 20; i++) cout << num[i] << ' '; 19 | } -------------------------------------------------------------------------------- /2023-1/Basic/iwtl0303/Recursion/1629.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | using ll = long long; 4 | 5 | ll func(ll a,ll b,ll c){ 6 | if (b==1) return a % c; 7 | ll val = func(a,b/2,c); 8 | val = val * val % c; 9 | if (b%2 == 0) return val; 10 | return val * a % c; 11 | } 12 | 13 | int main(void) { 14 | ios::sync_with_stdio(0); 15 | cin.tie(0); 16 | ll a,b,c; 17 | cin >> a >> b >> c; 18 | cout< 2 | using namespace std; 3 | int main() { 4 | ios::sync_with_stdio(false); 5 | cin.tie(NULL); 6 | 7 | int n; 8 | cin >> n; 9 | int flag = 1; 10 | for (int i = 0; i < n; i++) { 11 | for (int j = n; j > i + 1; j--) { 12 | cout << " "; 13 | } 14 | for (int k = 0; k < flag; k++) { 15 | cout << "*"; 16 | } 17 | 18 | flag = 2 * (i + 2) - 1; 19 | cout << '\n'; 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Intermediate/Dameun2224/DP/11727.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int d[1005]; 7 | 8 | 9 | int main(void) { 10 | ios_base::sync_with_stdio(0); 11 | cin.tie(0); 12 | 13 | int n; 14 | cin >> n; 15 | 16 | d[1] = 1; 17 | d[2] = 3; 18 | 19 | for (int i = 3; i <= n; i++) d[i] = (2 * d[i - 2] + d[i - 1]) % 10007; 20 | 21 | cout << d[n] << '\n'; 22 | 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /2023-1/Intermediate/chaehyeon107/Greedy/1541.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | string s; 5 | int tmp, ans; 6 | int sign = 1; 7 | 8 | int main(void) { 9 | cin >> s; 10 | for (char c : s) { 11 | if (c == '-' || c == '+') { 12 | ans += tmp * sign; 13 | if (c == '-') sign = -1; 14 | tmp = 0; 15 | } 16 | else { 17 | tmp *= 10; 18 | tmp += c - '0'; 19 | } 20 | } 21 | ans += tmp * sign; 22 | cout << ans; 23 | } 24 | -------------------------------------------------------------------------------- /2023-1/Intermediate/suin0413/greedy/BOJ_11399.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n, p[1002]; 5 | 6 | int main() { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | cin >> n; 10 | for(int i = 0;i> p[i]; 11 | sort(p,p+n); 12 | int sum = 0; 13 | for(int i = 0;i 2 | 3 | using namespace std; 4 | 5 | int DP[1001] = {0, 1, 3}; 6 | 7 | void dp(int n) 8 | { 9 | for(int i = 3; i <= n; i++) 10 | { 11 | DP[i] = (DP[i-1] + 2 * DP[i-2]) % 10007; 12 | } 13 | 14 | cout << DP[n]; 15 | } 16 | 17 | int main(void) 18 | { 19 | ios::sync_with_stdio(0); 20 | cin.tie(0); 21 | 22 | int n; 23 | 24 | cin >> n; 25 | 26 | dp(n); 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Recursion/11729.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | void func(int a, int b, int n) { 5 | if(n == 1) { 6 | cout << a << ' ' << b << '\n'; 7 | return; 8 | } 9 | func(a, 6-a-b, n-1); 10 | cout << a << ' ' << b << '\n'; 11 | func(6-a-b, b, n-1); 12 | } 13 | 14 | int main() { 15 | ios::sync_with_stdio(0); 16 | cin.tie(0); 17 | int k; 18 | cin >> k; 19 | cout << (1< 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector nlist; 7 | 8 | int main(void) 9 | { 10 | int n, x, i, a; 11 | 12 | cin >> n >> x; 13 | 14 | for(i = 0; i < n; i++) 15 | { 16 | cin >> a; 17 | nlist.push_back(a); 18 | } 19 | 20 | for(i = 0; i < n; i++) 21 | { 22 | if(nlist[i] < x) 23 | { 24 | cout << nlist[i] << " "; 25 | } 26 | } 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /2023-1/Exercise/zszszszs/4week/ExerciseA/.cph/.17204.cpp_ed9af23a4a3153673615d82f07b42028.prob: -------------------------------------------------------------------------------- 1 | {"name":"Local: 17204","url":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\ExerciseA\\17204.cpp","tests":[{"id":1679913309831,"input":"5 3\n1\n3\n2\n1\n4","output":""},{"id":1679913370244,"input":"6 2\n1\n3\n5\n4\n0\n2","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\23ALPStudy\\Exercise\\zszszszs\\4week\\ExerciseA\\17204.cpp","group":"local","local":true} -------------------------------------------------------------------------------- /2023-2/Basic/eunhyoha2/Array/1475.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() { 6 | int N; 7 | int count[10] = { 0, }; 8 | cin >> N; 9 | 10 | while (N > 0) { 11 | count[N % 10]++; 12 | N /= 10; 13 | } 14 | count[6] = (count[6] + count[9] + 1) / 2; 15 | 16 | int max = 0; 17 | for (int i = 0; i < 9; i++) { 18 | if (max < count[i]) { 19 | max = count[i]; 20 | } 21 | } 22 | 23 | cout << max; 24 | 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /2023-1/Intermediate/Daeuning/Greedy/11399: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int N; 6 | int P[1002]; 7 | 8 | int main(void) 9 | { 10 | cin >> N; 11 | 12 | for (int i = 0; i < N; i++){ 13 | cin >> P[i]; 14 | } 15 | 16 | sort(P, P + N); 17 | 18 | int sum = 0; 19 | int total = 0; 20 | 21 | for (int i = 0; i < N; i++){ 22 | sum += P[i]; 23 | total += sum; 24 | } 25 | 26 | cout << total; 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /2023-1/Intermediate/chaehyeon107/dynamicProgramming/11053.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int s[1002], d[1002]; 5 | int cnt = 0; 6 | 7 | int main(void) { 8 | int n; 9 | cin >> n; 10 | for(int i = 0; i < n; i++) { 11 | cin >> s[i]; 12 | d[i] = 1; 13 | } 14 | for(int i = 0; i < n; i++) { 15 | for(int j = 0; j < i; j++) { 16 | if(s[i] > s[j]) d[i] = max(d[i], d[j] + 1); 17 | } 18 | } 19 | cout << *max_element(d, d+n); 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Intermediate/chlwndks33/DP/1463.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int arr[1000001]; 5 | int n; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | cin >> n; 12 | arr[1] = 0; 13 | for(int i = 2; i<=n; i++) { 14 | arr[i] = arr[i-1] + 1; 15 | if(i % 2 == 0) arr[i] = min(arr[i],arr[i/2]+1); 16 | if(i % 3 == 0) arr[i] = min(arr[i],arr[i/3]+1); 17 | } 18 | cout << arr[n]; 19 | } -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Recursion/1629.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | long long func(long long a, long long b, long long k) { 5 | if(b == 1) return a % k; 6 | long long val = func(a, b/2, k); 7 | val = val * val % k; 8 | if(b%2 == 0) return val; //b가 짝수 9 | return val * a % k; 10 | } 11 | 12 | int main() { 13 | ios::sync_with_stdio(0); 14 | cin.tie(0); 15 | long long a, b, c; 16 | cin >> a >> b >> c; 17 | cout << func(a, b, c); 18 | } 19 | -------------------------------------------------------------------------------- /2023-1/Basic/hanseungwoo0614/Array/2577.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c; 6 | int n; 7 | 8 | std::cin >> a >> b >> c; 9 | 10 | n = a * b * c; 11 | int d[10] {}; 12 | 13 | while(1) 14 | { 15 | d[n % 10] = d[n % 10] + 1; //n=2032323 3 16 | 17 | if (n / 10 == 0) 18 | break; 19 | 20 | n=n / 10; 21 | 22 | } 23 | for (int i = 0; i < 10; i++) 24 | { 25 | std::cout << d[i] << "\n"; 26 | } 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /2023-1/Intermediate/kimso1279/Greedy/BOJ_11399.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(void) { 6 | int n; 7 | cin >> n; 8 | 9 | int p[n]; 10 | for(int i=0; i> p[i]; 11 | sort(p,p+n); 12 | 13 | int sum = 0, before = 0; 14 | for(int i=0; i 2 | 3 | using namespace std; 4 | 5 | int main() { 6 | int A, B, C; 7 | int sum; 8 | cin >> A >> B >> C; 9 | sum = A * B * C; 10 | int arr[10] = { 0, }; 11 | int num; 12 | 13 | while (sum > 0) { 14 | num = sum % 10; //나눈 나머지, 현재 1의 자리 15 | arr[num]++; 16 | sum /= 10; //나머지를 없앤 몫이 다음 숫자가 됨 17 | } 18 | 19 | for (int i = 0; i < 10; i++) { 20 | cout << arr[i] << endl; 21 | } 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /2023-2/Basic/user20230912/Array/1475.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int input, arr[10] = {}, max; 6 | bool d; 7 | 8 | std::cin >> input; 9 | 10 | while (input != 0) { 11 | arr[input % 10]++; 12 | input /= 10; 13 | } 14 | max = (arr[6] + arr[9]) / 2 + (arr[6] + arr[9]) % 2; 15 | 16 | for (int i = 0; i < 10; i++) { 17 | if (i == 6 || i == 9) 18 | continue; 19 | if (max < arr[i]) 20 | max = arr[i]; 21 | } 22 | std::cout << max; 23 | } 24 | -------------------------------------------------------------------------------- /2023-1/Basic/dlgustj206/기초코드작성요령/2752.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int a, b, c, temp; 6 | scanf("%d %d %d", &a, &b, &c); 7 | 8 | if(a>b){ 9 | temp=a; 10 | a=b; 11 | b=temp; 12 | } 13 | if(b>c){ 14 | temp=b; 15 | b=c; c=temp; 16 | } 17 | if(a>b){ 18 | temp=a; 19 | a=b; 20 | b=temp; 21 | } 22 | 23 | printf("%d %d %d", a, b, c); 24 | 25 | return 0; 26 | } -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/10093.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/13. 3 | // 4 | #include "bits/stdc++.h" 5 | using namespace std; 6 | 7 | int main(){ 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | long long a, b; 12 | cin >> a >> b; 13 | 14 | if(a>b) swap(a,b); 15 | if(a==b||b-a==1) cout << 0; 16 | else{ 17 | cout << b-a-1 << "\n"; 18 | for(long long i=a+1;i 2 | using namespace std; 3 | 4 | int main() { 5 | ios::sync_with_stdio(0); 6 | cin.tie(0); 7 | 8 | int a, b, c; 9 | int result = 0; 10 | cin >> a >> b >> c; 11 | 12 | result = a*b*c; 13 | 14 | int arr[10]={0,}; 15 | 16 | while (result>0){ 17 | arr[result%10]++; 18 | result/=10; 19 | } 20 | 21 | for(int i = 0; i<10; i++) 22 | cout << arr[i] << '\n'; 23 | } 24 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/9.Recursion/1629.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | long long func(long long a, long long b, long long c){ 5 | if(b==1) return a%c; 6 | long long val = func(a, b/2, c); 7 | val = val* val % c; 8 | if(b%2==0) return val; 9 | return val * a % c; 10 | } 11 | 12 | int main(){ 13 | ios::sync_with_stdio(0); 14 | cin.tie(0); 15 | long long a, b, c; 16 | cin >> a >> b >> c; 17 | cout << func(a,b,c); 18 | } -------------------------------------------------------------------------------- /2023-1/Basic/eunhyoha2/Array/1475_방_번호.c: -------------------------------------------------------------------------------- 1 | #define _CRT_SECURE_NO_WARNINGS 2 | #include 3 | 4 | int main() { 5 | int N; 6 | int count[10] = { 0, }; 7 | 8 | scanf("%d", &N); 9 | 10 | while (N > 0) { 11 | count[N % 10]++; 12 | N /= 10; 13 | } 14 | 15 | count[6] = (count[6] + count[9] + 1) / 2; 16 | 17 | int max = 0; 18 | for (int i = 0; i < 9; i++) { 19 | if (max < count[i]) 20 | max = count[i]; 21 | } 22 | 23 | printf("%d", max); 24 | 25 | return 0; 26 | } -------------------------------------------------------------------------------- /2023-1/Intermediate/jikim08/DP/11727.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() { 7 | int N; 8 | cin >> N; 9 | 10 | vector DP(N+1); 11 | 12 | DP[1] = 1; 13 | DP[2] = 3; 14 | for (int i = 3; i <= N; i++) { 15 | DP[i] = DP[i - 1] + DP[i - 2] * 2; //2*1타일이 세로로 하나 고정인 경우 + 1*2타일 두개가 같이 고정인 경우 + 2*2타일 하나가 고정인 경우 16 | if (DP[i] > 10007) DP[i] %= 10007; 17 | } 18 | 19 | cout << DP[N]; 20 | 21 | } 22 | -------------------------------------------------------------------------------- /2023-2/Basic/JoonHyuk0331/Recursion/1629.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | using ll = long long; 4 | ll A, B, C; 5 | 6 | ll fun(ll a, ll b) { 7 | if (b == 1)//base case: a의1승이 되면 나눈 값을 반환 8 | return a % C; 9 | ll val = fun(a, b / 2); 10 | if (b % 2 == 0) { 11 | return val * val % C;//짝수면 12 | } 13 | else{ 14 | return ((val * val) % C * a) % C;//홀수면 15 | } 16 | } 17 | 18 | int main(void) { 19 | cin >> A >> B >> C; 20 | cout << fun(A, B); 21 | } 22 | -------------------------------------------------------------------------------- /2023-2/Basic/dlgusdn4408/Array/10808.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | 7 | string s; 8 | cin >> s; 9 | int len = s.size(); 10 | 11 | int count[26] = {0}; 12 | 13 | for (int i = 0; i < len; i++) { 14 | for (int j = 'a'; j <= 'z'; j++) { 15 | if (s[i] == j) { 16 | count[j - 'a']++; 17 | } 18 | } 19 | } 20 | 21 | for (int i = 0; i < 26; i++) { 22 | cout << count[i] << " "; 23 | } 24 | 25 | } 26 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # 23ALPStudy 2 | 2023 ALPS study repository 3 | [23ALPStudy Overview](https://url.kr/avcs5q) 4 | 5 | ## Previous Study 6 | [22ALPStudy](https://github.com/alps-jbnu/22ALPStudy) 7 | 8 | ## How to Contribute 9 | 1. fork 10 | 2. 해당 스터디 내에 자신의 이름으로 폴더 만들기 11 | ex) `23ALPStudy/Basic/AFpine` 12 | 3. 자신의 폴더에 스터디 주제에 대한 폴더 만들기 13 | ex) `23ALPStudy/Basic/AFpine/Queue` 14 | 4. 주제 폴더에 자신의 풀이 코드 작성 15 | ex) `23ALPStudy/Basic/AFpine/Queue/BOJ_10845.cpp` 16 | 5. Pull Request 17 | -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/기초_코드_작성_요령_II/2562: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int s[9]; 7 | int i; 8 | int max = 0; 9 | int n; 10 | 11 | for(i=0; i<9; i++) 12 | { 13 | cin >> s[i]; 14 | } 15 | 16 | for(i=0; i<9; i++) 17 | { 18 | if(s[i] > max) 19 | max = s[i]; 20 | } 21 | 22 | for(i=0; i<9; i++) 23 | { 24 | if(s[i] == max) 25 | n = i; 26 | } 27 | 28 | cout << max< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int a, b, c; 7 | cin >> a >> b >> c; 8 | 9 | int t = 0; 10 | 11 | if(a > b) 12 | { 13 | t = a; 14 | a = b; 15 | b = t; 16 | } 17 | 18 | if(a > c) 19 | { 20 | t = a; 21 | a = c; 22 | c = t; 23 | } 24 | 25 | if(b > c) 26 | { 27 | t = b; 28 | b = c; 29 | c = t; 30 | } 31 | 32 | cout << a <<' '<< b <<' '<< c; 33 | 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /2023-1/Basic/hodu26/Queue/2164.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | queue q; 6 | 7 | int main(void) { 8 | ios::sync_with_stdio(0);cin.tie(0); 9 | 10 | int N; 11 | 12 | cin >> N; 13 | 14 | for (int i=1;i<=N;i++){ 15 | q.push(i); 16 | } 17 | 18 | while (q.size() > 1){ 19 | q.pop(); 20 | q.push(q.front()); 21 | q.pop(); 22 | } 23 | 24 | cout << q.front(); 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /2023-1/Basic/ksu206631/Queue/Boj2164.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | int main(void){ 6 | cin.tie(0); 7 | cin.sync_with_stdio(0); 8 | queue q; 9 | int n; 10 | string s; 11 | cin >> n; 12 | for(int i = 1; i<=n; i++){ 13 | q.push(i); 14 | } 15 | while(q.size()>1){ 16 | q.pop(); 17 | q.push(q.front()); 18 | q.pop(); 19 | } 20 | cout< 2 | using namespace std; 3 | int n,m,seq[10]; 4 | void func(int cur){ 5 | if(cur==m){ 6 | for(int i=0;i>n>>m; 20 | func(0); 21 | } -------------------------------------------------------------------------------- /2023-1/Exercise/rkdbq/Week5/PRAC4/20365.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int N; 7 | int cnt; 8 | 9 | int main() { 10 | ios::sync_with_stdio(false); 11 | cin.tie(nullptr); 12 | 13 | cin>>N; 14 | char bef; 15 | for(int i{}; i>cur; 18 | if(bef != cur) cnt++; 19 | bef = cur; 20 | } 21 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(void) { 6 | int n; 7 | cin >> n; 8 | 9 | int a[n], b[n]; 10 | for(int i=0; i> a[i]; 11 | for(int i=0; i> b[i]; 12 | sort(a,a+n); 13 | sort(b,b+n); 14 | 15 | int sum=0; 16 | for(int i=0; i 2 | using namespace std; 3 | /* 4 | 노드 개수 -1이 간선개수이면 가장 적은 종류의 비행기를 타고 가는 것과 동일 5 | */ 6 | int main() { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | int t; 10 | int n, m; 11 | std::cin >> t; 12 | for (int i = 0; i < t; i++) { 13 | std::cin >> n >> m; 14 | 15 | for (int j = 0; j < m; j++) { 16 | int a, b; 17 | std::cin >> a >> b; 18 | } 19 | std::cout << n - 1 << "\n"; 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /2023-2/Basic/JoonHyuk0331/1158.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) { 5 | vector v; 6 | int n, k; 7 | cin >> n >> k; 8 | for (int i = 1; i <= n; i++) 9 | v.push_back(i); 10 | cout << "<"; 11 | int it = k - 1; 12 | while (!v.empty()) { 13 | cout<"; 20 | } 21 | -------------------------------------------------------------------------------- /2023-2/Basic/youth5427/Queue/Beak_2164.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() { 7 | ios::sync_with_stdio(false); // 지연시간 줄이기 8 | cin.tie(NULL); 9 | cout.tie(NULL); 10 | 11 | queue q; 12 | int N = 0; 13 | cin >> N; 14 | 15 | for (int i = 1; i < N+1; i++) q.push(i); 16 | 17 | for (int i = N; i > 1; i--) { 18 | q.pop(); 19 | q.push(q.front()); 20 | q.pop(); 21 | } 22 | cout << q.front(); 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /2023-2/Exercise/README.md: -------------------------------------------------------------------------------- 1 | # Exercise 2 | 3 | ## 목표 4 | - 문제풀이 능력을 키우기 5 | - 기업 코딩 테스트를 대비, 다양한 프로그래밍 대회에서 입상할 수 있는 기초 쌓기 6 | 7 | ## 형식 8 | - 주 1회, 대면으로 진행 9 | - 멘토링이 아닌 전체 참여 방식 10 | 11 | ## 커리큘럼 12 | - 랜덤한 문제를 주어진 시간안에 해결 13 | - [solved.ac](http://solved.ac) 기준 Silver ~ Gold 난이도의 문제 [3문제 : 2시간] 14 | - 변경될 수 있음 15 | - 스터디 리뷰 16 | - 문제 해결 접근 방식, 시간 분배 등 17 | - 다음 스터디까지 숙제용 랜덤 문제 풀어오기 18 | - 많은 시간을 소비하고 해결하지 못 한 경우엔 정답 코드 확인 19 | - 30분 ~ 1시간 동안 진전이 없는 문제는 정답을 보는 것이 효율적 20 | -------------------------------------------------------------------------------- /2023-2/Intermediate/highcastle01/DP/BOJ_2193.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | long long DP[91]; 5 | 6 | void dp(int n) 7 | { 8 | DP[1] = 1; 9 | DP[2] = 1; 10 | 11 | for(int i = 3; i <= n; i++) 12 | { 13 | DP[i] = DP[i-1] + DP[i-2]; 14 | } 15 | 16 | cout << DP[n] << "\n"; 17 | } 18 | 19 | int main(void) 20 | { 21 | ios::sync_with_stdio(0); 22 | cin.tie(0); 23 | 24 | int n; 25 | cin >> n; 26 | 27 | dp(n); 28 | 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /2023-2/Intermediate/ksu206631/DP/boj2133.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void){ 6 | int n; 7 | cin >> n; 8 | 9 | int dp[32] = {0}; 10 | 11 | dp[0] = 1; 12 | dp[2] = 3; 13 | 14 | for(int i = 4; i<=n; i++){ 15 | dp[i] = dp[i-2] *3; 16 | for(int j = 4; j<=i; j+=2){ 17 | dp[i] += dp[i-j]*2; 18 | } 19 | } 20 | cout << dp[n]; 21 | return 0; 22 | 23 | 24 | } 25 | -------------------------------------------------------------------------------- /2023-1/Basic/JinHaeun/Recursion/2447.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n; 5 | 6 | void star(int n, int x, int y) { 7 | if((x/n)%3==1 && (y/n)%3==1) cout << " "; 8 | else if(n/3 == 0) cout << "*"; 9 | else star(n/3, x, y); 10 | 11 | } 12 | 13 | int main() { 14 | ios::sync_with_stdio(0); 15 | cin.tie(0); 16 | cin >> n; 17 | 18 | for(int i=0; i 2 | using namespace std; 3 | using ll = long long; 4 | 5 | ll POW(ll a, ll b, ll m) 6 | { 7 | if (b == 1) 8 | return a % m; 9 | ll val = POW(a, b / 2, m); 10 | val = val * val % m; 11 | if (b % 2 == 0) 12 | return val; 13 | return val * a % m; 14 | } 15 | 16 | int main(void) 17 | { 18 | ios::sync_with_stdio(0); 19 | cin.tie(0); 20 | ll A, B, C; 21 | cin >> A >> B >> C; 22 | cout << POW(A, B, C); 23 | return 0; 24 | } -------------------------------------------------------------------------------- /2023-1/Basic/highcastle01/Heap/BOJ_2075.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | 10 | int n, tmp, i; 11 | priority_queue, greater> pq; 12 | 13 | cin >> n; 14 | 15 | for(i = 0; i < n * n; i++) 16 | { 17 | cin >> tmp; 18 | pq.push(tmp); 19 | if(pq.size() > n) 20 | { 21 | pq.pop(); 22 | } 23 | } 24 | 25 | cout << pq.top(); 26 | 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /2023-1/Basic/youth5427/Recursion/beak_1629.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Day: 2023.05.09 3 | 참고 : 재귀 (연습문제1) 4 | */ 5 | #include 6 | using namespace std; 7 | 8 | long long pow(long long a, long long b, long long c) { 9 | if (b == 1)return a % c; 10 | long long val = pow(a, b / 2, c); 11 | val = val * val % c; 12 | if (b % 2 == 0) return val; 13 | else return val * a % c; //...? 14 | } 15 | int main() { 16 | long long a, b, c; 17 | cin >> a >> b >> c; 18 | cout << pow(a, b, c); 19 | 20 | } 21 | -------------------------------------------------------------------------------- /2023-1/Exercise/cuzl15/9week/18234.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n, t; 5 | long long ans = 0; 6 | pair arr[2000005]; 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | cin >> n >> t; 11 | for (int i = 0; i < n; i++) { 12 | cin >> arr[i].second >> arr[i].first; 13 | } 14 | sort(arr, arr + n); 15 | for (int i = 0; i < n; i++) { 16 | ans += arr[i].second + arr[i].first * (t - n + i); 17 | } 18 | cout << ans; 19 | } -------------------------------------------------------------------------------- /2023-1/Intermediate/Zoe305/Dynamic_Programming/11053.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n; 5 | int a[1004], d[1004]; 6 | 7 | int main(void) { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | cin >> n; 12 | for (int i = 0; i < n; i++) cin >> a[i]; 13 | fill(d, d + n, 1); 14 | for (int i = 0; i < n; i++) 15 | for (int j = 0; j < i; j++) 16 | if (a[j] < a[i]) d[i] = max(d[i], d[j] + 1); 17 | 18 | cout << *max_element(d, d + n); 19 | } -------------------------------------------------------------------------------- /2023-1/Intermediate/Zoe305/Dynamic_Programming/1912.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n; 5 | int a[100003], d[100003]; 6 | 7 | int main(void){ 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | 11 | cin >> n; 12 | for(int i = 1; i <= n; ++i){ 13 | cin >> a[i]; 14 | d[i] = a[i]; 15 | } 16 | 17 | for(int i = 1; i <= n; ++i) 18 | d[i] = max(d[i], d[i-1] + a[i]); 19 | cout << *max_element(d + 1, d + n + 1); 20 | }//구간합 구하기라는 문제랑 비슷했던 것 같음 -------------------------------------------------------------------------------- /2023-1/Intermediate/chaehyeon107/dynamicProgramming/1003.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int d0[100]; 5 | int d1[100]; 6 | 7 | int main(void) { 8 | d0[0] = 1; 9 | d0[1] = 0; 10 | d1[0] = 0; 11 | d1[1] = 1; 12 | for(int i = 2; i <= 40; i++) { 13 | d1[i] = d1[i-1] + d1[i-2]; 14 | d0[i] = d0[i-1] + d0[i-2]; 15 | } 16 | int t; 17 | cin >> t; 18 | while(t--) { 19 | int n; 20 | cin >> n; 21 | cout << d0[n] << " " << d1[n] << '\n'; 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /2023-1/Intermediate/jikim08/Divide-and-conquer/1629.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | long long mod(int n1, int n2, int n3) { 5 | if (n2 == 1) { 6 | return n1 % n3; 7 | } 8 | if (n2 == 0) { 9 | return 1; 10 | } 11 | long long k = mod(n1, n2 / 2, n3) % n3; 12 | if (n2 % 2 == 0) return k * k % n3; 13 | else return k * k % n3 * n1 % n3; 14 | } 15 | 16 | int main() { 17 | int n1, n2, n3; 18 | cin >> n1 >> n2 >> n3; 19 | 20 | cout << mod(n1, n2, n3); 21 | } 22 | -------------------------------------------------------------------------------- /2023-1/Basic/Joonhyuk0331/stack/10773제로.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(void) 5 | { 6 | int result = 0; 7 | int k = 0; 8 | cin >> k; 9 | //stack s; 굳이 스택 안써도 될듯? 10 | vector v; 11 | 12 | for (int i = 0; i < k; i++) { 13 | int a = 0; 14 | cin >> a; 15 | if (a != 0) 16 | v.push_back(a); 17 | else 18 | v.pop_back(); 19 | } 20 | for (int i = 0; i < v.size(); i++) { 21 | result += v[i]; 22 | } 23 | cout << result << '\n'; 24 | } 25 | -------------------------------------------------------------------------------- /2023-1/Basic/eddiego/1.기초 코드 작성 요령 2/9498.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by 김우식 on 2023/03/12. 3 | // 4 | #include "bits/stdc++.h" 5 | using namespace std; 6 | 7 | int main() { 8 | ios::sync_with_stdio(0); 9 | cin.tie(0); 10 | int a; 11 | cin>>a; 12 | if(a>=90 && a<=100) 13 | cout << 'A'; 14 | else if(a>=80) 15 | cout << 'B'; 16 | else if(a>=70) 17 | cout << 'C'; 18 | else if(a>=60) 19 | cout << 'D'; 20 | else 21 | cout << 'F'; 22 | } -------------------------------------------------------------------------------- /2023-1/Basic/tjsdnrdua1/Backtracking/BOJ_15654_2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int n,m,seq[9]; 5 | int main(){ 6 | ios::sync_with_stdio(0); 7 | cin.tie(0); 8 | cin>>n>>m; 9 | for(int i=0;i>seq[i]; 11 | sort(seq,seq+n); 12 | do{ 13 | for(int i=0;i 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() { 7 | int N; 8 | cin >> N; 9 | vector num(N); 10 | 11 | for (int i = 0; i < N; i++) { 12 | cin >> num[i]; 13 | } 14 | 15 | vector DP(N); 16 | 17 | DP[0] = num[0]; 18 | 19 | for (int i = 1; i < N; i++) { 20 | DP[i] = max(DP[i - 1] + num[i], num[i]); 21 | } 22 | 23 | cout << *max_element(DP.begin(), DP.end()); 24 | 25 | } 26 | -------------------------------------------------------------------------------- /2023-1/Intermediate/suin0413/DP/BOJ_11055.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int n, arr[1002], d[1002]; 5 | 6 | int main() { 7 | ios::sync_with_stdio(0); 8 | cin.tie(0); 9 | cin >> n; 10 | for(int i = 0;i> arr[i]; 12 | d[i] = arr[i]; 13 | } 14 | for(int i = 0;i 2 | using namespace std; 3 | 4 | int main(){ 5 | int n, m; 6 | cin >>n; 7 | 8 | int a[1000001] = {}; //빈배열 생성 9 | for(int i=0;i> a[i]; 11 | } 12 | cin>>m; 13 | 14 | bool num[2000001]; 15 | int cnt=0; 16 | for(int i=0;i0 && num[m-a[i]]){cnt++;} 18 | num[a[i]] = true; 19 | } 20 | 21 | cout< 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() { 7 | int a,b,c; 8 | string n, m; 9 | queue q; 10 | cin >> a; 11 | for (int i = 1;i <= a;i++) { 12 | q.push(i); 13 | //cout << q.back() << endl; 14 | } 15 | while (q.size() > 1) { 16 | q.pop(); 17 | b = q.front(); 18 | q.pop(); 19 | q.push(b); 20 | } 21 | cout << q.front(); 22 | } 23 | --------------------------------------------------------------------------------