├── .gitattributes ├── .gitignore ├── C.sln ├── C.vcxproj ├── C.vcxproj.filters ├── 그래프 ├── 1043_거짓말.cpp ├── 11403_경로찾기.cpp ├── 11404_플로이드.cpp ├── 11657_타임머신.cpp ├── 1197_최소신장트리.cpp ├── 1219_세일즈맨의고민.cpp ├── 1325_효율적인해킹.cpp ├── 1389_케빈베이컨의6단계법칙.cpp ├── 1414_불우이웃돕기.cpp ├── 1516_게임개발.cpp ├── 1707_이분그래프.cpp ├── 1717_집합표현하기.cpp ├── 17472_다리만들기.cpp ├── 1753_최단경로.cpp ├── 18352_특정거리도시찾기.cpp ├── 1854_K번째최단경로.cpp ├── 1916_최소비용구하기.cpp ├── 1948_임계경로.cpp ├── 1976_여행계획짜기.cpp ├── 2251_물통.cpp └── 2252_줄세우기.cpp ├── 그리디 ├── 11047_동전개수최솟값.cpp ├── 1541_잃어버린괄호.cpp ├── 1715_ 카드정렬하기.cpp ├── 1744_수묶기.cpp └── 1931_회의실배정.cpp ├── 기하 ├── 11758_CCW.cpp ├── 17387_선분교차.cpp ├── 2162_선분그룹.cpp └── 2166_다각형의면적.cpp ├── 동적계획법 ├── 10844_계단수.cpp ├── 11049_행렬곱연산횟수의최솟값.cpp ├── 11726_타일채우기.cpp ├── 1328_빌딩.cpp ├── 13398_연속합2.cpp ├── 14403_가장길게증가하는부분수열.cpp ├── 14501_퇴사.cpp ├── 1463_1로만들기.cpp ├── 1915_가장큰정사각형.cpp ├── 2098_외판원순회.cpp ├── 2193_이친수.cpp ├── 2342_DDR.cpp ├── 2747_피보나치수_BottomUp.cpp ├── 2747_피보나치수_TopDown.cpp └── 9252_LCS.cpp ├── 자료구조 ├── 10986_나머지합.cpp ├── 11003_최솟값찾기.cpp ├── 11286_절댓값힙.cpp ├── 11659_구간합구하기.cpp ├── 11660_구간합구하기2.cpp ├── 11720_숫자의합.cpp ├── 1253_좋은수.cpp ├── 12891_DNA비밀번호.cpp ├── 1546_평균.cpp ├── 17298_오큰수.cpp ├── 1874_스택수열.cpp ├── 1940_주몽.cpp ├── 2018_연속된자연수의합.cpp └── 2164_카드.cpp ├── 정렬 ├── 10989_수정렬하기3.cpp ├── 11004_K번째수.cpp ├── 11399_ATM.cpp ├── 1377_버블소트1.cpp ├── 1427_내림차순정렬.cpp ├── 1517_버블소트2.cpp ├── 2750_수정렬하기.cpp └── 2751_수정렬하기2.cpp ├── 정수론 ├── 1016_제곱이아닌수.cpp ├── 1033_칵테일.cpp ├── 11689_GDCNK1.cpp ├── 1456_거의소수.cpp ├── 1747_소수팰린드롬.cpp ├── 1850_최대공약수.cpp ├── 1929_소수구하기.cpp ├── 1934_최소공배수.cpp └── 21568_AxByC.cpp ├── 조합 ├── 1010_다리놓기.cpp ├── 11050_이항계수.cpp ├── 11051_이항계수2.cpp ├── 1256_사전.cpp ├── 13251_조약돌꺼내기.cpp ├── 1722_순열의순서.cpp ├── 1947_선물전달.cpp └── 2775_부녀회장이될테야.cpp ├── 탐색 ├── 1167_트리의지름.cpp ├── 11724_연결요소의개수.cpp ├── 1260_DFS와BFS.cpp ├── 1300_K번째수.cpp ├── 13023_친구관계파악하기.cpp ├── 15649_N과M.cpp ├── 17136_색종이붙이기.cpp ├── 1920_원하는정수찾기.cpp ├── 2023_신기한소수.cpp ├── 2178_미로탐색.cpp ├── 2343_블루레이.cpp └── 9663_NQueen.cpp └── 트리 ├── 1068_리프노드.cpp ├── 10868_최솟값.cpp ├── 11437_LCA.cpp ├── 11438_LCA2.cpp ├── 11505_구간곱구하기.cpp ├── 11725_트리의부모찾기.cpp ├── 14425_문자열찾기.cpp ├── 1991_트리순회.cpp └── 2042_구간합구하기.cpp /.gitattributes: -------------------------------------------------------------------------------- 1 | ############################################################################### 2 | # Set default behavior to automatically normalize line endings. 3 | ############################################################################### 4 | * text=auto 5 | 6 | ############################################################################### 7 | # Set default behavior for command prompt diff. 8 | # 9 | # This is need for earlier builds of msysgit that does not have it on by 10 | # default for csharp files. 11 | # Note: This is only used by command line 12 | ############################################################################### 13 | #*.cs diff=csharp 14 | 15 | ############################################################################### 16 | # Set the merge driver for project and solution files 17 | # 18 | # Merging from the command prompt will add diff markers to the files if there 19 | # are conflicts (Merging from VS is not affected by the settings below, in VS 20 | # the diff markers are never inserted). Diff markers may cause the following 21 | # file extensions to fail to load in VS. An alternative would be to treat 22 | # these files as binary and thus will always conflict and require user 23 | # intervention with every merge. To do so, just uncomment the entries below 24 | ############################################################################### 25 | #*.sln merge=binary 26 | #*.csproj merge=binary 27 | #*.vbproj merge=binary 28 | #*.vcxproj merge=binary 29 | #*.vcproj merge=binary 30 | #*.dbproj merge=binary 31 | #*.fsproj merge=binary 32 | #*.lsproj merge=binary 33 | #*.wixproj merge=binary 34 | #*.modelproj merge=binary 35 | #*.sqlproj merge=binary 36 | #*.wwaproj merge=binary 37 | 38 | ############################################################################### 39 | # behavior for image files 40 | # 41 | # image files are treated as binary by default. 42 | ############################################################################### 43 | #*.jpg binary 44 | #*.png binary 45 | #*.gif binary 46 | 47 | ############################################################################### 48 | # diff behavior for common document formats 49 | # 50 | # Convert binary document formats to text before diffing them. This feature 51 | # is only available from the command line. Turn it on by uncommenting the 52 | # entries below. 53 | ############################################################################### 54 | #*.doc diff=astextplain 55 | #*.DOC diff=astextplain 56 | #*.docx diff=astextplain 57 | #*.DOCX diff=astextplain 58 | #*.dot diff=astextplain 59 | #*.DOT diff=astextplain 60 | #*.pdf diff=astextplain 61 | #*.PDF diff=astextplain 62 | #*.rtf diff=astextplain 63 | #*.RTF diff=astextplain 64 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | ## Ignore Visual Studio temporary files, build results, and 2 | ## files generated by popular Visual Studio add-ons. 3 | ## 4 | ## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore 5 | 6 | # User-specific files 7 | *.rsuser 8 | *.suo 9 | *.user 10 | *.userosscache 11 | *.sln.docstates 12 | 13 | # User-specific files (MonoDevelop/Xamarin Studio) 14 | *.userprefs 15 | 16 | # Mono auto generated files 17 | mono_crash.* 18 | 19 | # Build results 20 | [Dd]ebug/ 21 | [Dd]ebugPublic/ 22 | [Rr]elease/ 23 | [Rr]eleases/ 24 | x64/ 25 | x86/ 26 | [Ww][Ii][Nn]32/ 27 | [Aa][Rr][Mm]/ 28 | [Aa][Rr][Mm]64/ 29 | bld/ 30 | [Bb]in/ 31 | [Oo]bj/ 32 | [Oo]ut/ 33 | [Ll]og/ 34 | [Ll]ogs/ 35 | 36 | # Visual Studio 2015/2017 cache/options directory 37 | .vs/ 38 | # Uncomment if you have tasks that create the project's static files in wwwroot 39 | #wwwroot/ 40 | 41 | # Visual Studio 2017 auto generated files 42 | Generated\ Files/ 43 | 44 | # MSTest test Results 45 | [Tt]est[Rr]esult*/ 46 | [Bb]uild[Ll]og.* 47 | 48 | # NUnit 49 | *.VisualState.xml 50 | TestResult.xml 51 | nunit-*.xml 52 | 53 | # Build Results of an ATL Project 54 | [Dd]ebugPS/ 55 | [Rr]eleasePS/ 56 | dlldata.c 57 | 58 | # Benchmark Results 59 | BenchmarkDotNet.Artifacts/ 60 | 61 | # .NET Core 62 | project.lock.json 63 | project.fragment.lock.json 64 | artifacts/ 65 | 66 | # ASP.NET Scaffolding 67 | ScaffoldingReadMe.txt 68 | 69 | # StyleCop 70 | StyleCopReport.xml 71 | 72 | # Files built by Visual Studio 73 | *_i.c 74 | *_p.c 75 | *_h.h 76 | *.ilk 77 | *.meta 78 | *.obj 79 | *.iobj 80 | *.pch 81 | *.pdb 82 | *.ipdb 83 | *.pgc 84 | *.pgd 85 | *.rsp 86 | *.sbr 87 | *.tlb 88 | *.tli 89 | *.tlh 90 | *.tmp 91 | *.tmp_proj 92 | *_wpftmp.csproj 93 | *.log 94 | *.vspscc 95 | *.vssscc 96 | .builds 97 | *.pidb 98 | *.svclog 99 | *.scc 100 | 101 | # Chutzpah Test files 102 | _Chutzpah* 103 | 104 | # Visual C++ cache files 105 | ipch/ 106 | *.aps 107 | *.ncb 108 | *.opendb 109 | *.opensdf 110 | *.sdf 111 | *.cachefile 112 | *.VC.db 113 | *.VC.VC.opendb 114 | 115 | # Visual Studio profiler 116 | *.psess 117 | *.vsp 118 | *.vspx 119 | *.sap 120 | 121 | # Visual Studio Trace Files 122 | *.e2e 123 | 124 | # TFS 2012 Local Workspace 125 | $tf/ 126 | 127 | # Guidance Automation Toolkit 128 | *.gpState 129 | 130 | # ReSharper is a .NET coding add-in 131 | _ReSharper*/ 132 | *.[Rr]e[Ss]harper 133 | *.DotSettings.user 134 | 135 | # TeamCity is a build add-in 136 | _TeamCity* 137 | 138 | # DotCover is a Code Coverage Tool 139 | *.dotCover 140 | 141 | # AxoCover is a Code Coverage Tool 142 | .axoCover/* 143 | !.axoCover/settings.json 144 | 145 | # Coverlet is a free, cross platform Code Coverage Tool 146 | coverage*.json 147 | coverage*.xml 148 | coverage*.info 149 | 150 | # Visual Studio code coverage results 151 | *.coverage 152 | *.coveragexml 153 | 154 | # NCrunch 155 | _NCrunch_* 156 | .*crunch*.local.xml 157 | nCrunchTemp_* 158 | 159 | # MightyMoose 160 | *.mm.* 161 | AutoTest.Net/ 162 | 163 | # Web workbench (sass) 164 | .sass-cache/ 165 | 166 | # Installshield output folder 167 | [Ee]xpress/ 168 | 169 | # DocProject is a documentation generator add-in 170 | DocProject/buildhelp/ 171 | DocProject/Help/*.HxT 172 | DocProject/Help/*.HxC 173 | DocProject/Help/*.hhc 174 | DocProject/Help/*.hhk 175 | DocProject/Help/*.hhp 176 | DocProject/Help/Html2 177 | DocProject/Help/html 178 | 179 | # Click-Once directory 180 | publish/ 181 | 182 | # Publish Web Output 183 | *.[Pp]ublish.xml 184 | *.azurePubxml 185 | # Note: Comment the next line if you want to checkin your web deploy settings, 186 | # but database connection strings (with potential passwords) will be unencrypted 187 | *.pubxml 188 | *.publishproj 189 | 190 | # Microsoft Azure Web App publish settings. Comment the next line if you want to 191 | # checkin your Azure Web App publish settings, but sensitive information contained 192 | # in these scripts will be unencrypted 193 | PublishScripts/ 194 | 195 | # NuGet Packages 196 | *.nupkg 197 | # NuGet Symbol Packages 198 | *.snupkg 199 | # The packages folder can be ignored because of Package Restore 200 | **/[Pp]ackages/* 201 | # except build/, which is used as an MSBuild target. 202 | !**/[Pp]ackages/build/ 203 | # Uncomment if necessary however generally it will be regenerated when needed 204 | #!**/[Pp]ackages/repositories.config 205 | # NuGet v3's project.json files produces more ignorable files 206 | *.nuget.props 207 | *.nuget.targets 208 | 209 | # Microsoft Azure Build Output 210 | csx/ 211 | *.build.csdef 212 | 213 | # Microsoft Azure Emulator 214 | ecf/ 215 | rcf/ 216 | 217 | # Windows Store app package directories and files 218 | AppPackages/ 219 | BundleArtifacts/ 220 | Package.StoreAssociation.xml 221 | _pkginfo.txt 222 | *.appx 223 | *.appxbundle 224 | *.appxupload 225 | 226 | # Visual Studio cache files 227 | # files ending in .cache can be ignored 228 | *.[Cc]ache 229 | # but keep track of directories ending in .cache 230 | !?*.[Cc]ache/ 231 | 232 | # Others 233 | ClientBin/ 234 | ~$* 235 | *~ 236 | *.dbmdl 237 | *.dbproj.schemaview 238 | *.jfm 239 | *.pfx 240 | *.publishsettings 241 | orleans.codegen.cs 242 | 243 | # Including strong name files can present a security risk 244 | # (https://github.com/github/gitignore/pull/2483#issue-259490424) 245 | #*.snk 246 | 247 | # Since there are multiple workflows, uncomment next line to ignore bower_components 248 | # (https://github.com/github/gitignore/pull/1529#issuecomment-104372622) 249 | #bower_components/ 250 | 251 | # RIA/Silverlight projects 252 | Generated_Code/ 253 | 254 | # Backup & report files from converting an old project file 255 | # to a newer Visual Studio version. Backup files are not needed, 256 | # because we have git ;-) 257 | _UpgradeReport_Files/ 258 | Backup*/ 259 | UpgradeLog*.XML 260 | UpgradeLog*.htm 261 | ServiceFabricBackup/ 262 | *.rptproj.bak 263 | 264 | # SQL Server files 265 | *.mdf 266 | *.ldf 267 | *.ndf 268 | 269 | # Business Intelligence projects 270 | *.rdl.data 271 | *.bim.layout 272 | *.bim_*.settings 273 | *.rptproj.rsuser 274 | *- [Bb]ackup.rdl 275 | *- [Bb]ackup ([0-9]).rdl 276 | *- [Bb]ackup ([0-9][0-9]).rdl 277 | 278 | # Microsoft Fakes 279 | FakesAssemblies/ 280 | 281 | # GhostDoc plugin setting file 282 | *.GhostDoc.xml 283 | 284 | # Node.js Tools for Visual Studio 285 | .ntvs_analysis.dat 286 | node_modules/ 287 | 288 | # Visual Studio 6 build log 289 | *.plg 290 | 291 | # Visual Studio 6 workspace options file 292 | *.opt 293 | 294 | # Visual Studio 6 auto-generated workspace file (contains which files were open etc.) 295 | *.vbw 296 | 297 | # Visual Studio LightSwitch build output 298 | **/*.HTMLClient/GeneratedArtifacts 299 | **/*.DesktopClient/GeneratedArtifacts 300 | **/*.DesktopClient/ModelManifest.xml 301 | **/*.Server/GeneratedArtifacts 302 | **/*.Server/ModelManifest.xml 303 | _Pvt_Extensions 304 | 305 | # Paket dependency manager 306 | .paket/paket.exe 307 | paket-files/ 308 | 309 | # FAKE - F# Make 310 | .fake/ 311 | 312 | # CodeRush personal settings 313 | .cr/personal 314 | 315 | # Python Tools for Visual Studio (PTVS) 316 | __pycache__/ 317 | *.pyc 318 | 319 | # Cake - Uncomment if you are using it 320 | # tools/** 321 | # !tools/packages.config 322 | 323 | # Tabs Studio 324 | *.tss 325 | 326 | # Telerik's JustMock configuration file 327 | *.jmconfig 328 | 329 | # BizTalk build output 330 | *.btp.cs 331 | *.btm.cs 332 | *.odx.cs 333 | *.xsd.cs 334 | 335 | # OpenCover UI analysis results 336 | OpenCover/ 337 | 338 | # Azure Stream Analytics local run output 339 | ASALocalRun/ 340 | 341 | # MSBuild Binary and Structured Log 342 | *.binlog 343 | 344 | # NVidia Nsight GPU debugger configuration file 345 | *.nvuser 346 | 347 | # MFractors (Xamarin productivity tool) working folder 348 | .mfractor/ 349 | 350 | # Local History for Visual Studio 351 | .localhistory/ 352 | 353 | # BeatPulse healthcheck temp database 354 | healthchecksdb 355 | 356 | # Backup folder for Package Reference Convert tool in Visual Studio 2017 357 | MigrationBackup/ 358 | 359 | # Ionide (cross platform F# VS Code tools) working folder 360 | .ionide/ 361 | 362 | # Fody - auto-generated XML schema 363 | FodyWeavers.xsd -------------------------------------------------------------------------------- /C.sln: -------------------------------------------------------------------------------- 1 |  2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio Version 17 4 | VisualStudioVersion = 17.1.32421.90 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "C", "C.vcxproj", "{0D3342BF-27CB-4262-B246-53490E0E569F}" 7 | EndProject 8 | Global 9 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 10 | Debug|x64 = Debug|x64 11 | Debug|x86 = Debug|x86 12 | Release|x64 = Release|x64 13 | Release|x86 = Release|x86 14 | EndGlobalSection 15 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 16 | {0D3342BF-27CB-4262-B246-53490E0E569F}.Debug|x64.ActiveCfg = Debug|x64 17 | {0D3342BF-27CB-4262-B246-53490E0E569F}.Debug|x64.Build.0 = Debug|x64 18 | {0D3342BF-27CB-4262-B246-53490E0E569F}.Debug|x86.ActiveCfg = Debug|Win32 19 | {0D3342BF-27CB-4262-B246-53490E0E569F}.Debug|x86.Build.0 = Debug|Win32 20 | {0D3342BF-27CB-4262-B246-53490E0E569F}.Release|x64.ActiveCfg = Release|x64 21 | {0D3342BF-27CB-4262-B246-53490E0E569F}.Release|x64.Build.0 = Release|x64 22 | {0D3342BF-27CB-4262-B246-53490E0E569F}.Release|x86.ActiveCfg = Release|Win32 23 | {0D3342BF-27CB-4262-B246-53490E0E569F}.Release|x86.Build.0 = Release|Win32 24 | EndGlobalSection 25 | GlobalSection(SolutionProperties) = preSolution 26 | HideSolutionNode = FALSE 27 | EndGlobalSection 28 | GlobalSection(ExtensibilityGlobals) = postSolution 29 | SolutionGuid = {C9C7AC6A-02D3-4397-BAFA-82DE111E254E} 30 | EndGlobalSection 31 | EndGlobal 32 | -------------------------------------------------------------------------------- /C.vcxproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | Debug 6 | Win32 7 | 8 | 9 | Release 10 | Win32 11 | 12 | 13 | Debug 14 | x64 15 | 16 | 17 | Release 18 | x64 19 | 20 | 21 | 22 | 17.0 23 | {0D3342BF-27CB-4262-B246-53490E0E569F} 24 | Win32Proj 25 | 26 | 27 | 28 | Application 29 | true 30 | v143 31 | 32 | 33 | Application 34 | false 35 | v143 36 | 37 | 38 | Application 39 | true 40 | v143 41 | 42 | 43 | Application 44 | false 45 | v143 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | true 67 | 68 | 69 | true 70 | 71 | 72 | 73 | WIN32;_DEBUG;_WINDOWS;%(PreprocessorDefinitions) 74 | MultiThreadedDebugDLL 75 | Level3 76 | ProgramDatabase 77 | Disabled 78 | 79 | 80 | MachineX86 81 | true 82 | Windows 83 | 84 | 85 | 86 | 87 | WIN32;NDEBUG;_WINDOWS;%(PreprocessorDefinitions) 88 | MultiThreadedDLL 89 | Level3 90 | ProgramDatabase 91 | 92 | 93 | MachineX86 94 | true 95 | Windows 96 | true 97 | true 98 | 99 | 100 | 101 | 102 | true 103 | 104 | 105 | true 106 | 107 | 108 | true 109 | 110 | 111 | true 112 | 113 | 114 | true 115 | 116 | 117 | true 118 | 119 | 120 | true 121 | 122 | 123 | true 124 | 125 | 126 | true 127 | 128 | 129 | true 130 | 131 | 132 | true 133 | 134 | 135 | true 136 | 137 | 138 | true 139 | 140 | 141 | true 142 | 143 | 144 | true 145 | 146 | 147 | true 148 | 149 | 150 | true 151 | 152 | 153 | true 154 | 155 | 156 | true 157 | 158 | 159 | true 160 | 161 | 162 | true 163 | 164 | 165 | true 166 | 167 | 168 | true 169 | 170 | 171 | true 172 | 173 | 174 | true 175 | 176 | 177 | true 178 | 179 | 180 | true 181 | 182 | 183 | true 184 | 185 | 186 | true 187 | 188 | 189 | true 190 | 191 | 192 | true 193 | 194 | 195 | true 196 | 197 | 198 | true 199 | 200 | 201 | true 202 | 203 | 204 | true 205 | 206 | 207 | true 208 | 209 | 210 | true 211 | 212 | 213 | true 214 | 215 | 216 | true 217 | 218 | 219 | true 220 | 221 | 222 | true 223 | 224 | 225 | true 226 | 227 | 228 | true 229 | 230 | 231 | true 232 | 233 | 234 | true 235 | 236 | 237 | true 238 | 239 | 240 | true 241 | 242 | 243 | true 244 | 245 | 246 | true 247 | 248 | 249 | true 250 | 251 | 252 | false 253 | 254 | 255 | true 256 | 257 | 258 | true 259 | 260 | 261 | true 262 | 263 | 264 | true 265 | 266 | 267 | true 268 | 269 | 270 | true 271 | 272 | 273 | true 274 | 275 | 276 | true 277 | 278 | 279 | true 280 | 281 | 282 | true 283 | 284 | 285 | true 286 | 287 | 288 | true 289 | 290 | 291 | true 292 | 293 | 294 | true 295 | 296 | 297 | true 298 | 299 | 300 | true 301 | 302 | 303 | true 304 | 305 | 306 | true 307 | 308 | 309 | true 310 | 311 | 312 | true 313 | 314 | 315 | true 316 | 317 | 318 | true 319 | 320 | 321 | true 322 | 323 | 324 | true 325 | 326 | 327 | true 328 | 329 | 330 | true 331 | 332 | 333 | true 334 | 335 | 336 | true 337 | 338 | 339 | true 340 | 341 | 342 | true 343 | 344 | 345 | true 346 | 347 | 348 | true 349 | 350 | 351 | true 352 | 353 | 354 | true 355 | 356 | 357 | true 358 | 359 | 360 | true 361 | 362 | 363 | true 364 | 365 | 366 | true 367 | 368 | 369 | true 370 | 371 | 372 | true 373 | 374 | 375 | true 376 | 377 | 378 | true 379 | 380 | 381 | true 382 | 383 | 384 | true 385 | 386 | 387 | true 388 | 389 | 390 | true 391 | 392 | 393 | true 394 | 395 | 396 | true 397 | 398 | 399 | true 400 | 401 | 402 | true 403 | 404 | 405 | true 406 | 407 | 408 | 409 | 410 | 411 | -------------------------------------------------------------------------------- /C.vcxproj.filters: -------------------------------------------------------------------------------- 1 |  2 | 3 | 4 | 5 | {4FC737F1-C7A5-4376-A066-2A32D752A2FF} 6 | cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx 7 | 8 | 9 | {93995380-89BD-4b04-88EB-625FBE52EBFB} 10 | h;hh;hpp;hxx;hm;inl;inc;xsd 11 | 12 | 13 | {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} 14 | rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav 15 | 16 | 17 | 18 | 19 | Source Files 20 | 21 | 22 | Source Files 23 | 24 | 25 | Source Files 26 | 27 | 28 | Source Files 29 | 30 | 31 | Source Files 32 | 33 | 34 | Source Files 35 | 36 | 37 | Source Files 38 | 39 | 40 | Source Files 41 | 42 | 43 | Source Files 44 | 45 | 46 | Source Files 47 | 48 | 49 | Source Files 50 | 51 | 52 | Source Files 53 | 54 | 55 | Source Files 56 | 57 | 58 | Source Files 59 | 60 | 61 | Source Files 62 | 63 | 64 | Source Files 65 | 66 | 67 | Source Files 68 | 69 | 70 | Source Files 71 | 72 | 73 | Source Files 74 | 75 | 76 | Source Files 77 | 78 | 79 | Source Files 80 | 81 | 82 | Source Files 83 | 84 | 85 | Source Files 86 | 87 | 88 | Source Files 89 | 90 | 91 | Source Files 92 | 93 | 94 | Source Files 95 | 96 | 97 | Source Files 98 | 99 | 100 | Source Files 101 | 102 | 103 | Source Files 104 | 105 | 106 | Source Files 107 | 108 | 109 | Source Files 110 | 111 | 112 | Source Files 113 | 114 | 115 | Source Files 116 | 117 | 118 | Source Files 119 | 120 | 121 | Source Files 122 | 123 | 124 | Source Files 125 | 126 | 127 | Source Files 128 | 129 | 130 | Source Files 131 | 132 | 133 | Source Files 134 | 135 | 136 | Source Files 137 | 138 | 139 | Source Files 140 | 141 | 142 | Source Files 143 | 144 | 145 | Source Files 146 | 147 | 148 | Source Files 149 | 150 | 151 | Source Files 152 | 153 | 154 | Source Files 155 | 156 | 157 | Source Files 158 | 159 | 160 | Source Files 161 | 162 | 163 | Source Files 164 | 165 | 166 | Source Files 167 | 168 | 169 | Source Files 170 | 171 | 172 | Source Files 173 | 174 | 175 | Source Files 176 | 177 | 178 | Source Files 179 | 180 | 181 | Source Files 182 | 183 | 184 | Source Files 185 | 186 | 187 | Source Files 188 | 189 | 190 | Source Files 191 | 192 | 193 | Source Files 194 | 195 | 196 | Source Files 197 | 198 | 199 | Source Files 200 | 201 | 202 | Source Files 203 | 204 | 205 | Source Files 206 | 207 | 208 | Source Files 209 | 210 | 211 | Source Files 212 | 213 | 214 | Source Files 215 | 216 | 217 | Source Files 218 | 219 | 220 | Source Files 221 | 222 | 223 | Source Files 224 | 225 | 226 | Source Files 227 | 228 | 229 | Source Files 230 | 231 | 232 | Source Files 233 | 234 | 235 | Source Files 236 | 237 | 238 | Source Files 239 | 240 | 241 | Source Files 242 | 243 | 244 | Source Files 245 | 246 | 247 | Source Files 248 | 249 | 250 | Source Files 251 | 252 | 253 | Source Files 254 | 255 | 256 | Source Files 257 | 258 | 259 | Source Files 260 | 261 | 262 | Source Files 263 | 264 | 265 | Source Files 266 | 267 | 268 | Source Files 269 | 270 | 271 | Source Files 272 | 273 | 274 | Source Files 275 | 276 | 277 | Source Files 278 | 279 | 280 | Source Files 281 | 282 | 283 | Source Files 284 | 285 | 286 | Source Files 287 | 288 | 289 | Source Files 290 | 291 | 292 | Source Files 293 | 294 | 295 | Source Files 296 | 297 | 298 | Source Files 299 | 300 | 301 | Source Files 302 | 303 | 304 | Source Files 305 | 306 | 307 | Source Files 308 | 309 | 310 | Source Files 311 | 312 | 313 | Source Files 314 | 315 | 316 | Source Files 317 | 318 | 319 | Source Files 320 | 321 | 322 | Source Files 323 | 324 | 325 | -------------------------------------------------------------------------------- /그래프/1043_거짓말.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1043_거짓말.cpp -------------------------------------------------------------------------------- /그래프/11403_경로찾기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/11403_경로찾기.cpp -------------------------------------------------------------------------------- /그래프/11404_플로이드.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/11404_플로이드.cpp -------------------------------------------------------------------------------- /그래프/11657_타임머신.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/11657_타임머신.cpp -------------------------------------------------------------------------------- /그래프/1197_최소신장트리.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1197_최소신장트리.cpp -------------------------------------------------------------------------------- /그래프/1219_세일즈맨의고민.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1219_세일즈맨의고민.cpp -------------------------------------------------------------------------------- /그래프/1325_효율적인해킹.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1325_효율적인해킹.cpp -------------------------------------------------------------------------------- /그래프/1389_케빈베이컨의6단계법칙.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1389_케빈베이컨의6단계법칙.cpp -------------------------------------------------------------------------------- /그래프/1414_불우이웃돕기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1414_불우이웃돕기.cpp -------------------------------------------------------------------------------- /그래프/1516_게임개발.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1516_게임개발.cpp -------------------------------------------------------------------------------- /그래프/1707_이분그래프.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1707_이분그래프.cpp -------------------------------------------------------------------------------- /그래프/1717_집합표현하기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1717_집합표현하기.cpp -------------------------------------------------------------------------------- /그래프/17472_다리만들기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/17472_다리만들기.cpp -------------------------------------------------------------------------------- /그래프/1753_최단경로.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1753_최단경로.cpp -------------------------------------------------------------------------------- /그래프/18352_특정거리도시찾기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | void BFS(int node); 8 | 9 | static vector < vector > A; 10 | static vector answer; 11 | static vector visited; 12 | 13 | int main() 14 | { 15 | ios::sync_with_stdio(false); 16 | cin.tie(NULL); 17 | cout.tie(NULL); 18 | 19 | long N, M, K, X; 20 | cin >> N >> M >> K >> X; 21 | A.resize(N + 1); 22 | for (int i = 0; i < M; i++) { 23 | int S, E; 24 | cin >> S >> E; 25 | A[S].push_back(E); 26 | } 27 | visited.resize(N + 1); 28 | for (int i = 0; i <= N; i++) { 29 | visited[i] = -1; 30 | } 31 | BFS(X); 32 | for (int i = 0; i <= N; i++) { 33 | if (visited[i] == K) { 34 | answer.push_back(i); 35 | } 36 | } 37 | if (answer.empty()) { 38 | cout << -1 << "\n"; 39 | } 40 | else { 41 | sort(answer.begin(), answer.end()); 42 | for (int temp : answer) { 43 | cout << temp << "\n"; 44 | } 45 | } 46 | } 47 | 48 | void BFS(int node) { 49 | queue queue; 50 | queue.push(node); 51 | visited[node]++; 52 | while (!queue.empty()) { 53 | int now_node = queue.front(); 54 | queue.pop(); 55 | for (int i : A[now_node]) { 56 | if (visited[i] == -1) { 57 | visited[i] = visited[now_node] + 1; 58 | queue.push(i); 59 | } 60 | } 61 | } 62 | } -------------------------------------------------------------------------------- /그래프/1854_K번째최단경로.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1854_K번째최단경로.cpp -------------------------------------------------------------------------------- /그래프/1916_최소비용구하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | typedef pair edge; 8 | static int N, M; 9 | static vector dist; 10 | static vector visited; 11 | static vector < vector > mlist; 12 | int dijkstra(int start, int end); 13 | 14 | int main() 15 | { 16 | ios::sync_with_stdio(false); 17 | cin.tie(NULL); 18 | cout.tie(NULL); 19 | 20 | cin >> N >> M; 21 | 22 | dist.resize(N + 1); 23 | std::fill(dist.begin(), dist.end(), INT_MAX); 24 | 25 | visited.resize(N + 1); 26 | std::fill(visited.begin(), visited.end(), false); 27 | mlist.resize(N + 1); 28 | 29 | for (int i = 0; i < M; i++) { // 가중치가 있는 인접 리스트 초기화 30 | int start, end, weight; 31 | cin >> start >> end >> weight; 32 | mlist[start].push_back(make_pair(end, weight)); 33 | } 34 | 35 | int startIndex, endIndex; 36 | cin >> startIndex >> endIndex; 37 | 38 | int result = dijkstra(startIndex, endIndex); 39 | cout << result << "\n"; 40 | } 41 | 42 | int dijkstra(int start, int end) { // 다익스트라 알고리즘 43 | priority_queue, greater> pq; 44 | pq.push(make_pair(0, start)); // 비용 기준 정렬을 위해 데이터 순서를 비용, 노드로 설정 45 | dist[start] = 0; 46 | while (!pq.empty()) { 47 | edge nowNode = pq.top(); 48 | pq.pop(); 49 | int now = nowNode.second; 50 | if (!visited[now]) { 51 | visited[now] = true; 52 | for (edge n : mlist[now]) { // 선택노드 + 비용 < 타켓노드인 경우 값을 갱신하는 부분 53 | if (dist[n.first] > dist[now] + n.second) { 54 | dist[n.first] = dist[now] + n.second; 55 | pq.push(make_pair(dist[n.first], n.first)); 56 | } 57 | } 58 | } 59 | } 60 | return dist[end]; 61 | } 62 | -------------------------------------------------------------------------------- /그래프/1948_임계경로.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1948_임계경로.cpp -------------------------------------------------------------------------------- /그래프/1976_여행계획짜기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/1976_여행계획짜기.cpp -------------------------------------------------------------------------------- /그래프/2251_물통.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/2251_물통.cpp -------------------------------------------------------------------------------- /그래프/2252_줄세우기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그래프/2252_줄세우기.cpp -------------------------------------------------------------------------------- /그리디/11047_동전개수최솟값.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그리디/11047_동전개수최솟값.cpp -------------------------------------------------------------------------------- /그리디/1541_잃어버린괄호.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그리디/1541_잃어버린괄호.cpp -------------------------------------------------------------------------------- /그리디/1715_ 카드정렬하기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그리디/1715_ 카드정렬하기.cpp -------------------------------------------------------------------------------- /그리디/1744_수묶기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그리디/1744_수묶기.cpp -------------------------------------------------------------------------------- /그리디/1931_회의실배정.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/그리디/1931_회의실배정.cpp -------------------------------------------------------------------------------- /기하/11758_CCW.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int x1, y1, x2, y2, x3, y3; 7 | cin >> x1 >> y1>> x2>> y2>> x3>> y3; 8 | int result = (x1 * y2 + x2 * y3 + x3 * y1) - (x2 * y1 + x3 * y2 + x1 * y3); 9 | int ans = 0; 10 | if (result > 0) ans = 1; 11 | else if (result < 0) ans = -1; 12 | else ans = 0; 13 | cout << ans; 14 | } 15 | -------------------------------------------------------------------------------- /기하/17387_선분교차.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/기하/17387_선분교차.cpp -------------------------------------------------------------------------------- /기하/2162_선분그룹.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/기하/2162_선분그룹.cpp -------------------------------------------------------------------------------- /기하/2166_다각형의면적.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/기하/2166_다각형의면적.cpp -------------------------------------------------------------------------------- /동적계획법/10844_계단수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/동적계획법/10844_계단수.cpp -------------------------------------------------------------------------------- /동적계획법/11049_행렬곱연산횟수의최솟값.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/동적계획법/11049_행렬곱연산횟수의최솟값.cpp -------------------------------------------------------------------------------- /동적계획법/11726_타일채우기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/동적계획법/11726_타일채우기.cpp -------------------------------------------------------------------------------- /동적계획법/1328_빌딩.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/동적계획법/1328_빌딩.cpp -------------------------------------------------------------------------------- /동적계획법/13398_연속합2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/동적계획법/13398_연속합2.cpp -------------------------------------------------------------------------------- /동적계획법/14403_가장길게증가하는부분수열.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/동적계획법/14403_가장길게증가하는부분수열.cpp -------------------------------------------------------------------------------- /동적계획법/14501_퇴사.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | static int N; 7 | static vector D, T, P; 8 | 9 | int main() 10 | { 11 | cin >> N; 12 | D.resize(N + 2); 13 | T.resize(N + 1); 14 | P.resize(N + 1); 15 | 16 | for (int i = 1; i <= N; i++) 17 | { 18 | cin >> T[i] >> P[i]; 19 | } 20 | 21 | for (int i = N; i > 0; i--) { 22 | if (i + T[i] > N + 1) { 23 | D[i] = D[i + 1]; 24 | } 25 | else { 26 | D[i] = max(D[i + 1], P[i] + D[i + T[i]]); 27 | } 28 | } 29 | 30 | cout << D[1]; 31 | } 32 | -------------------------------------------------------------------------------- /동적계획법/1463_1로만들기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | static int N; 7 | static vector D; 8 | 9 | int main() 10 | { 11 | cin >> N; 12 | D.resize(N + 1); 13 | 14 | D[1] = 0; 15 | for (int i = 2; i <= N; i++) { 16 | D[i] = D[i - 1] + 1; 17 | if (i % 2 == 0)D[i] = min(D[i], D[i / 2] + 1); 18 | if (i % 3 == 0)D[i] = min(D[i], D[i / 3] + 1); 19 | } 20 | cout << D[N]; 21 | } 22 | -------------------------------------------------------------------------------- /동적계획법/1915_가장큰정사각형.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | static int N, M; 6 | static int D[1001][1001]; 7 | 8 | int main() 9 | { 10 | cin >> N >> M; 11 | long max = 0; 12 | for (int i = 0; i < N; i++) { 13 | string mline; 14 | cin >> mline; 15 | for (int j = 0; j < M; j++) { 16 | D[i][j] = mline[j] - '0'; 17 | if (D[i][j] == 1 && j > 0 && i > 0) { 18 | D[i][j] = min(D[i - 1][j - 1], min(D[i - 1][j], D[i][j - 1])) + D[i][j]; 19 | } 20 | if (max < D[i][j]) { 21 | max = D[i][j]; 22 | } 23 | } 24 | } 25 | cout << max* max << "\n"; 26 | } 27 | 28 | -------------------------------------------------------------------------------- /동적계획법/2098_외판원순회.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | static int INF = 1000000 * 16 + 1; 6 | static int N; 7 | static int W[16][16]; 8 | static int D[16][(1 << 16)]; 9 | int tsp(int c, int v); 10 | int main() 11 | { 12 | cin >> N; 13 | for (int i = 0; i < N; i++) { 14 | for (int j = 0; j < N; j++) { 15 | cin >> W[i][j]; 16 | } 17 | } 18 | cout << tsp(0, 1) << "\n"; 19 | } 20 | int tsp(int c, int v) { // 모든 경우의 수에 대한 완전 탐색, 재귀 구현 21 | if (v == (1 << N) - 1) { // 모든 노드를 방문한 경우 22 | return W[c][0] == 0 ? INF : W[c][0]; 23 | } 24 | // 이미 방문한 노드인 경우 → 이미 계산한 경우 바로 반환(메모이제이션) 25 | if (D[c][v] != 0) { 26 | return D[c][v]; 27 | } 28 | int min_val = INF; 29 | for (int i = 0; i < N; i++) { 30 | // 방문한 적이 없고 갈 수 있는 도시인 경우 31 | if ((v & (1 << i)) == 0 && W[c][i] != 0) { 32 | min_val = min(min_val, tsp(i, (v | (1 << i))) + W[c][i]); 33 | } 34 | } 35 | D[c][v] = min_val; 36 | return D[c][v]; 37 | } 38 | -------------------------------------------------------------------------------- /동적계획법/2193_이친수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | static int N; 5 | static long D[91][2]; 6 | 7 | int main() 8 | { 9 | cin >> N; 10 | 11 | D[1][1] = 1; 12 | D[1][0] = 0; 13 | for (int i = 2; i <= N; i++) { 14 | D[i][0] = D[i - 1][1] + D[i - 1][0]; 15 | D[i][1] = D[i - 1][0]; 16 | } 17 | cout << D[N][0] + D[N][1]; 18 | } 19 | -------------------------------------------------------------------------------- /동적계획법/2342_DDR.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/동적계획법/2342_DDR.cpp -------------------------------------------------------------------------------- /동적계획법/2747_피보나치수_BottomUp.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | static int N; 6 | static vector D; 7 | 8 | int main() 9 | { 10 | cin >> N; 11 | D.resize(N + 1); 12 | 13 | for (int i = 0; i <= N; i++) { 14 | D[i] = -1; 15 | } 16 | D[0] = 0; 17 | D[1] = 1; 18 | for (int i = 2; i <= N; i++) { 19 | D[i] = D[i - 1] + D[i - 2]; 20 | } 21 | 22 | cout << D[N]; 23 | } 24 | -------------------------------------------------------------------------------- /동적계획법/2747_피보나치수_TopDown.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/동적계획법/2747_피보나치수_TopDown.cpp -------------------------------------------------------------------------------- /동적계획법/9252_LCS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/동적계획법/9252_LCS.cpp -------------------------------------------------------------------------------- /자료구조/10986_나머지합.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/10986_나머지합.cpp -------------------------------------------------------------------------------- /자료구조/11003_최솟값찾기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/11003_최솟값찾기.cpp -------------------------------------------------------------------------------- /자료구조/11286_절댓값힙.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/11286_절댓값힙.cpp -------------------------------------------------------------------------------- /자료구조/11659_구간합구하기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/11659_구간합구하기.cpp -------------------------------------------------------------------------------- /자료구조/11660_구간합구하기2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/11660_구간합구하기2.cpp -------------------------------------------------------------------------------- /자료구조/11720_숫자의합.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/11720_숫자의합.cpp -------------------------------------------------------------------------------- /자료구조/1253_좋은수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/1253_좋은수.cpp -------------------------------------------------------------------------------- /자료구조/12891_DNA비밀번호.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/12891_DNA비밀번호.cpp -------------------------------------------------------------------------------- /자료구조/1546_평균.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/1546_평균.cpp -------------------------------------------------------------------------------- /자료구조/17298_오큰수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/17298_오큰수.cpp -------------------------------------------------------------------------------- /자료구조/1874_스택수열.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/1874_스택수열.cpp -------------------------------------------------------------------------------- /자료구조/1940_주몽.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/1940_주몽.cpp -------------------------------------------------------------------------------- /자료구조/2018_연속된자연수의합.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/2018_연속된자연수의합.cpp -------------------------------------------------------------------------------- /자료구조/2164_카드.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/자료구조/2164_카드.cpp -------------------------------------------------------------------------------- /정렬/10989_수정렬하기3.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정렬/10989_수정렬하기3.cpp -------------------------------------------------------------------------------- /정렬/11004_K번째수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | void quickSort(vector &A, int S, int E, int K); 6 | int partition(vector &A, int S, int E); 7 | void swap(vector &A, int i, int j); 8 | 9 | int main() 10 | { 11 | ios::sync_with_stdio(false); 12 | cin.tie(NULL); 13 | cout.tie(NULL); 14 | 15 | int N, K; 16 | cin >> N >> K; 17 | vector A(N, 0); 18 | for (int i = 0; i < N; i++) { 19 | cin >> A[i]; 20 | } 21 | quickSort(A, 0, N-1, K-1); 22 | cout << A[K - 1]; 23 | } 24 | 25 | void quickSort(vector &A, int S, int E, int K) { 26 | int pivot = partition(A, S, E); 27 | if (pivot == K)// K번째 수가 pivot이면 더이상 구할 필요 없음 28 | return; 29 | else if (K < pivot) // K가 pivot보다 작으면 왼쪽 그룹만 정렬 수행하기 30 | quickSort(A, S, pivot - 1, K); 31 | else // K가 pivot보다 크면 오른쪽 그룹만 정렬 수행하기 32 | quickSort(A, pivot + 1, E, K); 33 | } 34 | int partition(vector &A, int S, int E) { 35 | if (S + 1 == E) { 36 | if (A[S] > A[E])swap(A, S, E); 37 | return E; 38 | } 39 | int M = (S + E) / 2; 40 | swap(A, S, M); // 중앙값을 1번째 요소로 이동하기 41 | int pivot = A[S]; 42 | int i = S + 1, j = E; 43 | while (i <= j) { 44 | while (j >= S + 1 && pivot < A[j]) { //피벗보다 작은 수가 나올때까지 j-- 45 | j--; 46 | } 47 | while (i <= E && pivot > A[i] ) { //피벗보다 큰 수가 나올 까지 i++ 48 | i++; 49 | } 50 | 51 | if (i < j) { 52 | swap(A, i++, j--); // 찾은 i와 j를 교환하기 53 | } 54 | else { 55 | break; 56 | } 57 | } 58 | // i == j 피벗의 값을 양쪽으로 분리한 가운데에 오도록 설정하기 59 | A[S] = A[j]; 60 | A[j] = pivot; 61 | return j; 62 | } 63 | void swap(vector &A, int i, int j) { 64 | int temp = A[i]; 65 | A[i] = A[j]; 66 | A[j] = temp; 67 | } 68 | -------------------------------------------------------------------------------- /정렬/11399_ATM.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정렬/11399_ATM.cpp -------------------------------------------------------------------------------- /정렬/1377_버블소트1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정렬/1377_버블소트1.cpp -------------------------------------------------------------------------------- /정렬/1427_내림차순정렬.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정렬/1427_내림차순정렬.cpp -------------------------------------------------------------------------------- /정렬/1517_버블소트2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정렬/1517_버블소트2.cpp -------------------------------------------------------------------------------- /정렬/2750_수정렬하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | ios::sync_with_stdio(false); 9 | cin.tie(NULL); 10 | cout.tie(NULL); 11 | 12 | int N; 13 | cin >> N; 14 | vector A(N, 0); 15 | for (int i = 0; i < N; i++) { 16 | cin >> A[i]; 17 | } 18 | 19 | for (int i = 0; i < N - 1; i++) { 20 | for (int j = 0; j < N - 1 - i; j++) { 21 | if (A[j] > A[j + 1]) { 22 | int temp = A[j]; 23 | A[j] = A[j + 1]; 24 | A[j + 1] = temp; 25 | } 26 | } 27 | } 28 | 29 | for (int i = 0; i < N; i++) { 30 | cout << A[i] << "\n"; 31 | } 32 | } -------------------------------------------------------------------------------- /정렬/2751_수정렬하기2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정렬/2751_수정렬하기2.cpp -------------------------------------------------------------------------------- /정수론/1016_제곱이아닌수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정수론/1016_제곱이아닌수.cpp -------------------------------------------------------------------------------- /정수론/1033_칵테일.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정수론/1033_칵테일.cpp -------------------------------------------------------------------------------- /정수론/11689_GDCNK1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정수론/11689_GDCNK1.cpp -------------------------------------------------------------------------------- /정수론/1456_거의소수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정수론/1456_거의소수.cpp -------------------------------------------------------------------------------- /정수론/1747_소수팰린드롬.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정수론/1747_소수팰린드롬.cpp -------------------------------------------------------------------------------- /정수론/1850_최대공약수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int gcd(long a, long b); 6 | int main() 7 | { 8 | ios::sync_with_stdio(false); 9 | cin.tie(NULL); 10 | cout.tie(NULL); 11 | 12 | long a, b; 13 | cin >> a >> b; 14 | long result = gcd(a, b); 15 | while (result > 0) { 16 | cout << 1; 17 | result--; 18 | } 19 | cout << '\n'; 20 | } 21 | 22 | int gcd(long a, long b) { 23 | if (b == 0) 24 | return a; 25 | else 26 | return gcd(b, a % b); 27 | } -------------------------------------------------------------------------------- /정수론/1929_소수구하기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정수론/1929_소수구하기.cpp -------------------------------------------------------------------------------- /정수론/1934_최소공배수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정수론/1934_최소공배수.cpp -------------------------------------------------------------------------------- /정수론/21568_AxByC.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/정수론/21568_AxByC.cpp -------------------------------------------------------------------------------- /조합/1010_다리놓기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | static int T, N, M; 5 | static int D[31][31]; 6 | 7 | int main() 8 | { 9 | for (int i = 0; i <= 30; i++) { 10 | D[i][1] = i; 11 | D[i][0] = 1; 12 | D[i][i] = 1; 13 | } 14 | for (int i = 2; i <= 30; i++) { 15 | for (int j = 1; j < i; j++) { 16 | D[i][j] = D[i - 1][j] + D[i - 1][j - 1]; 17 | } 18 | } 19 | 20 | cin >> T; 21 | for (int i = 0; i < T; i++) { 22 | cin >> N >> M; 23 | cout << D[M][N] << "\n"; 24 | } 25 | } 26 | -------------------------------------------------------------------------------- /조합/11050_이항계수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | static int N, K; 5 | static int D[11][11]; 6 | 7 | int main() 8 | { 9 | cin >> N >> K; 10 | for (int i = 0; i <= N; i++) { 11 | D[i][1] = i; 12 | D[i][0] = 1; 13 | D[i][i] = 1; 14 | } 15 | for (int i = 2; i <= N; i++) { 16 | for (int j = 1; j < i; j++) { 17 | D[i][j] = D[i - 1][j] + D[i - 1][j - 1]; 18 | } 19 | } 20 | cout << D[N][K] << "\n"; 21 | } 22 | -------------------------------------------------------------------------------- /조합/11051_이항계수2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | static int N, K; 5 | static int D[1001][1001]; 6 | 7 | int main() 8 | { 9 | cin >> N >> K; 10 | for (int i = 0; i <= N; i++) { 11 | D[i][1] = i; 12 | D[i][0] = 1; 13 | D[i][i] = 1; 14 | } 15 | for (int i = 2; i <= N; i++) { 16 | for (int j = 1; j < i; j++) { 17 | D[i][j] = D[i - 1][j] + D[i - 1][j - 1]; 18 | D[i][j] = D[i][j] % 10007; 19 | } 20 | } 21 | cout << D[N][K] << "\n"; 22 | } 23 | -------------------------------------------------------------------------------- /조합/1256_사전.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/조합/1256_사전.cpp -------------------------------------------------------------------------------- /조합/13251_조약돌꺼내기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/조합/13251_조약돌꺼내기.cpp -------------------------------------------------------------------------------- /조합/1722_순열의순서.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/조합/1722_순열의순서.cpp -------------------------------------------------------------------------------- /조합/1947_선물전달.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | static int N; 5 | static int mod = 1000000000; 6 | static long D[1000001]; 7 | 8 | int main() 9 | { 10 | cin >> N; 11 | D[1] = 0; 12 | D[2] = 1; 13 | for (int i = 3; i <= N; i++) { 14 | D[i] = (i - 1) * (D[i - 1] + D[i - 2]) % mod; 15 | } 16 | cout << D[N]; 17 | } -------------------------------------------------------------------------------- /조합/2775_부녀회장이될테야.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/조합/2775_부녀회장이될테야.cpp -------------------------------------------------------------------------------- /탐색/1167_트리의지름.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/탐색/1167_트리의지름.cpp -------------------------------------------------------------------------------- /탐색/11724_연결요소의개수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/탐색/11724_연결요소의개수.cpp -------------------------------------------------------------------------------- /탐색/1260_DFS와BFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/탐색/1260_DFS와BFS.cpp -------------------------------------------------------------------------------- /탐색/1300_K번째수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/탐색/1300_K번째수.cpp -------------------------------------------------------------------------------- /탐색/13023_친구관계파악하기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/탐색/13023_친구관계파악하기.cpp -------------------------------------------------------------------------------- /탐색/15649_N과M.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | static int N, M; 5 | static bool V[8]; // 숫자 사용 여부 저장하기 6 | static int S[8]; // 수열 정보 저장하기 7 | 8 | void backtracking(int length); 9 | int main() { 10 | cin >> N >> M; 11 | backtracking(0); 12 | } 13 | 14 | void backtracking(int length) { 15 | if (length == M) { // 길이가 M인 수열이 만들어진 경우 16 | for (int i = 0; i < M; ++i) { 17 | cout << S[i] + 1 << ' '; 18 | } 19 | cout << '\n'; 20 | return; 21 | } 22 | 23 | for (int i = 0; i < N; ++i) { 24 | if (!V[i]) { 25 | V[i] = true; // 수 사용 저장하기 26 | S[length] = i; // 수열에 수 사용하기 27 | backtracking(length + 1); 28 | V[i] = false; // 수 반납 저장하기 29 | } 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /탐색/17136_색종이붙이기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | static int M[10][10]; 7 | static int S[6] = { 0, 5, 5, 5, 5, 5 }; // 색종이 남은 개수 (1~5 크기) 8 | static int result = INT_MAX; // 최소 사용 개수 9 | void backtracking(int xy, int useCnt); 10 | bool check(int x, int y, int size); 11 | void fill(int x, int y, int size, int num); 12 | 13 | int main() { 14 | for (int i = 0; i < 10; ++i) { 15 | for (int j = 0; j < 10; ++j) { 16 | cin >> M[i][j]; 17 | } 18 | } 19 | // 1이 적힌 모든 칸을 붙이는 색종이를 사용한 경우의 수를 백트래킹으로 탐색 20 | backtracking(0, 0); 21 | 22 | if (result == INT_MAX) 23 | cout << -1 << '\n'; 24 | else 25 | cout << result << '\n'; 26 | } 27 | 28 | void backtracking(int xy, int useCnt) { 29 | if (xy == 100) { // 1이 적힌 모든 칸을 붙였을 때(x, y 좌표를 끝까지 탐색한 경우) 탐색 종료 30 | result = min(result, useCnt); 31 | return; 32 | } 33 | 34 | int x = xy % 10; 35 | int y = xy / 10; 36 | 37 | // 가지치기: 이전에 최소로 사용한 색종이 수보다 현재 사용한 색종이가 많으면 탐색 중단 38 | if (result <= useCnt) return; 39 | 40 | if (M[y][x] == 1) { 41 | for (int i = 5; i >= 1; --i) { 42 | if (S[i] > 0 && check(x, y, i)) { 43 | S[i]--; // 종이 사용하기 44 | fill(x, y, i, 0); // 종이 붙이기: 종이로 덮이는 부분 1 → 0으로 변경 45 | backtracking(xy + 1, useCnt + 1); 46 | S[i]++; // 사용한 종이 다시 채우기 47 | fill(x, y, i, 1); // 종이 떼어 내기: 기존에 덮인 부분 0 → 1로 변경 48 | } 49 | } 50 | } 51 | else { 52 | backtracking(xy + 1, useCnt); // 현재 좌표의 값이 0이면 바로 다음 칸 이동 53 | } 54 | } 55 | 56 | bool check(int x, int y, int size) { 57 | if (x + size > 10 || y + size > 10) return false; 58 | for (int i = y; i < y + size; ++i) { 59 | for (int j = x; j < x + size; ++j) { 60 | if (M[i][j] != 1) return false; 61 | } 62 | } 63 | return true; 64 | } 65 | 66 | void fill(int x, int y, int size, int num) { 67 | for (int i = y; i < y + size; ++i) { 68 | for (int j = x; j < x + size; ++j) { 69 | M[i][j] = num; 70 | } 71 | } 72 | } 73 | -------------------------------------------------------------------------------- /탐색/1920_원하는정수찾기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/탐색/1920_원하는정수찾기.cpp -------------------------------------------------------------------------------- /탐색/2023_신기한소수.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/탐색/2023_신기한소수.cpp -------------------------------------------------------------------------------- /탐색/2178_미로탐색.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/탐색/2178_미로탐색.cpp -------------------------------------------------------------------------------- /탐색/2343_블루레이.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/탐색/2343_블루레이.cpp -------------------------------------------------------------------------------- /탐색/9663_NQueen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | static int A[15]; // 퀸 배치 정보 6 | static int N; // 체스판 크기 7 | static int cnt = 0; // 정답 수 저장 8 | void backtracking(int row); 9 | bool check(int row); 10 | 11 | int main() { 12 | cin >> N; 13 | backtracking(0); 14 | cout << cnt << '\n'; 15 | } 16 | 17 | void backtracking(int row) { 18 | if (row == N) { // 퀸 N개를 모두 배치한 경우 19 | cnt++; 20 | return; 21 | } 22 | 23 | for (int i = 0; i < N; ++i) { 24 | A[row] = i; 25 | if (check(row)) { // 배치한 퀸이 이전 퀸들과 서로 공격할 수 없는지 체크하기 26 | backtracking(row + 1); 27 | } 28 | } 29 | } 30 | 31 | bool check(int row) { 32 | for (int i = 0; i < row; ++i) { 33 | if (A[i] == A[row]) return false; // 같은 열 34 | if (abs(row - i) == abs(A[i] - A[row])) return false; // 같은 대각선 35 | } 36 | return true; 37 | } 38 | -------------------------------------------------------------------------------- /트리/1068_리프노드.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | static int N; 7 | static vector < vector > tree; 8 | static int answer = 0; 9 | static int deleteNode = 0; 10 | static vector visited; 11 | void DFS(int number); 12 | 13 | int main() 14 | { 15 | ios::sync_with_stdio(false); 16 | cin.tie(NULL); 17 | cout.tie(NULL); 18 | 19 | cin >> N; 20 | 21 | visited.resize(N); 22 | tree.resize(N); 23 | int root = 0; 24 | 25 | for (int i = 0; i < N; i++) { 26 | int p; 27 | cin >> p; 28 | if(p != -1){ 29 | tree[i].push_back(p); 30 | tree[p].push_back(i); 31 | } 32 | else { 33 | root = i; 34 | } 35 | } 36 | 37 | cin >> deleteNode; 38 | if (deleteNode == root) { 39 | cout << 0 << "\n"; 40 | } 41 | else { 42 | DFS(root); 43 | cout << answer << "\n"; 44 | } 45 | } 46 | 47 | void DFS(int number) { 48 | visited[number] = true; 49 | int cNode = 0; 50 | for (int i : tree[number]) { 51 | if (visited[i] == false && i != deleteNode ) { 52 | cNode++; 53 | DFS(i); 54 | } 55 | } 56 | if (cNode == 0) { 57 | answer++; 58 | } 59 | } -------------------------------------------------------------------------------- /트리/10868_최솟값.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/트리/10868_최솟값.cpp -------------------------------------------------------------------------------- /트리/11437_LCA.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/트리/11437_LCA.cpp -------------------------------------------------------------------------------- /트리/11438_LCA2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/트리/11438_LCA2.cpp -------------------------------------------------------------------------------- /트리/11505_구간곱구하기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/트리/11505_구간곱구하기.cpp -------------------------------------------------------------------------------- /트리/11725_트리의부모찾기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/트리/11725_트리의부모찾기.cpp -------------------------------------------------------------------------------- /트리/14425_문자열찾기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/트리/14425_문자열찾기.cpp -------------------------------------------------------------------------------- /트리/1991_트리순회.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/트리/1991_트리순회.cpp -------------------------------------------------------------------------------- /트리/2042_구간합구하기.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/doitcodingtest/C/130051dd10f10d974331d3703f72391364300568/트리/2042_구간합구하기.cpp --------------------------------------------------------------------------------