PageSourceSearch

https://stalker5217.github.io/algorithm/brute-force/

html stalker5217.github.io collected 2026-10-03 09:59:17 UTC 25,683 bytes, 790 lines download raw bytes

1<!doctype html>
2<!--
3  Minimal Mistakes Jekyll Theme 4.17.0 by Michael Rose
4  Copyright 2013-2019 Michael Rose - mademistakes.com | @mmistakes
5  Free for personal and commercial use under the MIT license
6  https://github.com/mmistakes/minimal-mistakes/blob/master/LICENSE
7-->
8<html lang="en" class="no-js">
9  <head>
10    <meta charset="utf-8">
11
12<!-- begin _includes/seo.html --><title>[Algorithm] Brute Force - DEV HISTORY</title>
13<meta name="description" content="완전 탐색에 대해 알아봅시다">
14
15
16  <meta name="author" content="SONG">
17
18
19<meta property="og:type" content="article">
20<meta property="og:locale" content="en_US">
21<meta property="og:site_name" content="DEV HISTORY">
22<meta property="og:title" content="[Algorithm] Brute Force">
23<meta property="og:url" content="https://stalker5217.github.io/algorithm/brute-force/">
24
25
26  <meta property="og:description" content="완전 탐색에 대해 알아봅시다">
27
28
29
30
31
32
33
34  <meta property="article:published_time" content="2020-11-16T00:00:00+00:00">
35
36
37
38
39
40  
41
42  
43
44
45<link rel="canonical" href="https://stalker5217.github.io/algorithm/brute-force/">
46
47
48
49
50<script type="application/ld+json">
51  {
52    "@context": "https://schema.org",
53    
54      "@type": "Person",
55      "name": "Song",
56      "url": "https://stalker5217.github.io/"
57    
58  }
59</script>
59
60
61
62
63
64
65
66<!-- end _includes/seo.html -->
67
68
69<link href="/feed.xml" type="application/atom+xml" rel="alternate" title="DEV HISTORY Feed">
70
71<!-- https://t.co/dKP3o1e -->
72<meta name="viewport" content="width=device-width, initial-scale=1.0">
73
74<script>
75  document.documentElement.className = document.documentElement.className.replace(/\bno-js\b/g, '') + ' js ';
76</script>
76
77
78<!-- For all browsers -->
79<link rel="stylesheet" href="/assets/css/main.css">
80
81<!--[if IE]>
82  <style>
83    /* old IE unsupported flexbox fixes */
84    .greedy-nav .site-title {
85      padding-right: 3em;
86    }
87    .greedy-nav button {
88      position: absolute;
89      top: 0;
90      right: 0;
91      height: 100%;
92    }
93  </style>
94<![endif]-->
95
96
97
98    <!-- start custom head snippets -->
99
100<!-- insert favicons. use https://realfavicongenerator.net/ -->
101<link rel="shortcut icon" href="/assets/images/favicon/favicon.ico">
102
103<!-- end custom head snippets -->
104
105  </head>
106
107  <body class="layout--single">
108    <nav class="skip-links">
109  <h2 class="screen-reader-text">Skip links</h2>
110  <ul>
111    <li><a href="#site-nav" class="screen-reader-shortcut">Skip to primary navigation</a></li>
112    <li><a href="#main" class="screen-reader-shortcut">Skip to content</a></li>
113    <li><a href="#footer" class="screen-reader-shortcut">Skip to footer</a></li>
114  </ul>
115</nav>
116
117    <!--[if lt IE 9]>
118<div class="notice--danger align-center" style="margin: 0;">You are using an <strong>outdated</strong> browser. Please <a href="https://browsehappy.com/">upgrade your browser</a> to improve your experience.</div>
119<![endif]-->
120
121    
122
123<div class="masthead">
124  <div class="masthead__inner-wrap">
125    <div class="masthead__menu">
126      <nav id="site-nav" class="greedy-nav">
127        
128        <a class="site-title" href="/">
129          DEV HISTORY
130          
131        </a>
132        <ul class="visible-links"><li class="masthead__menu-item">
133              <a href="/categories/" >Categories</a>
134            </li><li class="masthead__menu-item">
135              <a href="/tags/" >Tags</a>
136            </li></ul>
137        
138        <button class="search__toggle" type="button">
139          <span class="visually-hidden">Toggle search</span>
140          <svg class="icon" width="16" height="16" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 15.99 16">
141            <path d="M15.5,13.12L13.19,10.8a1.69,1.69,0,0,0-1.28-.55l-0.06-.06A6.5,6.5,0,0,0,5.77,0,6.5,6.5,0,0,0,2.46,11.59a6.47,6.47,0,0,0,7.74.26l0.05,0.05a1.65,1.65,0,0,0,.5,1.24l2.38,2.38A1.68,1.68,0,0,0,15.5,13.12ZM6.4,2A4.41,4.41,0,1,1,2,6.4,4.43,4.43,0,0,1,6.4,2Z" transform="translate(-.01)"></path>
142          </svg>
143        </button>
144        
145        <button class="greedy-nav__toggle hidden" type="button">
146          <span class="visually-hidden">Toggle menu</span>
147          <div class="navicon"></div>
148        </button>
149        <ul class="hidden-links hidden"></ul>
150      </nav>
151    </div>
152  </div>
153</div>
154
155
156    <div class="initial-content">
157      
158
159
160
161<div id="main" role="main">
162  
163  <div class="sidebar sticky">
164  
165
166
167<div itemscope itemtype="https://schema.org/Person">
168
169  
170    <div class="author__avatar">
171      
172
173      
174        <img src="/assets/images/avatar/hkkb.png" alt="SONG" itemprop="image">
175      
176    </div>
177  
178
179  <div class="author__content">
180    
181      <h3 class="author__name" itemprop="name">SONG</h3>
182    
183    
184      <div class="author__bio" itemprop="description">
185        <p>공부하는 중입니다</p>
186
187      </div>
188    
189  </div>
190
191  <div class="author__urls-wrapper">
192    <button class="btn btn--inverse">Follow</button>
193    <ul class="author__urls social-icons">
194      
195        <li itemprop="homeLocation" itemscope itemtype="https://schema.org/Place">
196          <i class="fas fa-fw fa-map-marker-alt" aria-hidden="true"></i> <span itemprop="name">Seoul, Korea</span>
197        </li>
198      
199
200      
201        
202          
203            <li><a href="https://github.com/stalker5217" rel="nofollow noopener noreferrer"><i class="fab fa-fw fa-github" aria-hidden="true"></i> GitHub</a></li>
204          
205        
206          
207        
208          
209        
210          
211        
212          
213        
214          
215        
216      
217
218      
219
220      
221        <li>
222          <a href="mailto:[email protected]">
223            <meta itemprop="email" content="[email protected]" />
224            <i class="fas fa-fw fa-envelope-square" aria-hidden="true"></i> Email
225          </a>
226        </li>
227      
228
229      
230
231      
232
233      
234
235      
236
237      
238
239      
240
241      
242
243      
244
245      
246
247      
248
249      
250
251      
252
253      
254
255      
256
257      
258
259      
260
261      
262
263      
264
265      
266
267      
268
269      
270
271      
272
273      <!--
274  <li>
275    <a href="http://link-to-whatever-social-network.com/user/" itemprop="sameAs" rel="nofollow noopener noreferrer">
276      <i class="fas fa-fw" aria-hidden="true"></i> Custom Social Profile Link
277    </a>
278  </li>
279-->
280    </ul>
281  </div>
282</div>
283
284  
285  
286  </div>
287
288
289
290  <article class="page" itemscope itemtype="https://schema.org/CreativeWork">
291    <meta itemprop="headline" content="[Algorithm] Brute Force">
292    <meta itemprop="description" content="완전 탐색에 대해 알아봅시다">
293    <meta itemprop="datePublished" content="November 16, 2020">
294    
295
296    <div class="page__inner-wrap">
297      
298        <header>
299          <h1 id="page-title" class="page__title" itemprop="headline">[Algorithm] Brute Force
300</h1>
301          
302            <p class="page__meta"><i class="far fa-clock" aria-hidden="true"></i> 
303
304
305
306
307  1 minute read
308
309</p>
310          
311        </header>
312      
313
314      <section class="page__content" itemprop="text">
315        
316          <aside class="sidebar__right ">
317            <nav class="toc">
318              <header><h4 class="nav__title"><i class="fas fa-file-alt"></i> On this page</h4></header>
319              <ul class="toc__menu">
320  <li><a href="#무식하게-풀기">무식하게 풀기</a>
321    <ul>
322      <li><a href="#permutation">Permutation</a></li>
323      <li><a href="#combination">Combination</a></li>
324    </ul>
325  </li>
326</ul>
327            </nav>
328          </aside>
329        
330        <h2 id="무식하게-풀기">무식하게 풀기</h2>
331
332<p>전산학에서 brute force란 가능한 방법을 전부 만들어 보는 알고리즘들을 가리켜서 
333흔히 <strong>완전 탐색(Exhaustive Search)</strong>라고 부른다. 그리고 이 완전 탐색의 소요 시간은 만들어지는 경우의 수에 비례한다.</p>
334
335<p>자료 구조에 따라 구분을 하자면 선형 자료 구조를 대상으로는 흔히 Permutation, Combination이 대표적이며, 
336그래프를 대상으로는 DFS, BFS가 대표적인 완전 탐색의 유형이다.</p>
337
338<h3 id="permutation">Permutation</h3>
339
340<p><strong>순열</strong>을 의미하며 서로 다른 N개의 원소를 일렬로 줄 세운 경우의 수(N!)를 나타낸다.</p>
341
342<div class="language-cpp highlighter-rouge"><div class="highlight"><pre class="highlight"><code><span class="cp">#include &lt;iostream&gt;
343#include &lt;vector&gt;
344#include &lt;algorithm&gt;
345</span>
346<span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
347
348<span class="kt">void</span> <span class="nf">permutation</span><span class="p">(</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="o">&amp;</span> <span class="n">arr</span><span class="p">,</span> <span class="k">const</span> <span class="kt">int</span> <span class="n">curPos</span><span class="p">){</span>
349	<span class="k">if</span><span class="p">(</span><span class="n">curPos</span> <span class="o">==</span> <span class="n">arr</span><span class="p">.</span><span class="n">size</span><span class="p">()){</span>
350		<span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">el</span> <span class="o">:</span> <span class="n">arr</span><span class="p">)</span> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="n">el</span> <span class="o">&lt;&lt;</span> <span class="s">" "</span><span class="p">;</span>
351		<span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">"</span><span class="se">\n</span><span class="s">"</span><span class="p">;</span>
352		<span class="k">return</span><span class="p">;</span>
353	<span class="p">}</span>
354
355	<span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="n">curPos</span> <span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">arr</span><span class="p">.</span><span class="n">size</span><span class="p">()</span> <span class="p">;</span> <span class="n">i</span><span class="o">++</span><span class="p">){</span>
356		<span class="n">swap</span><span class="p">(</span><span class="n">arr</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="n">arr</span><span class="p">[</span><span class="n">curPos</span><span class="p">]);
356</span>
357		<span class="n">permutation</span><span class="p">(</span><span class="n">arr</span><span class="p">,</span> <span class="n">curPos</span> <span class="o">+</span> <span class="mi">1</span><span class="p">);</span>
358		<span class="n">swap</span><span class="p">(</span><span class="n">arr</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="n">arr</span><span class="p">[</span><span class="n">curPos</span><span class="p">]);</span>
359	<span class="p">}</span>
360<span class="p">}</span>
361
362<span class="kt">int</span> <span class="nf">main</span><span class="p">(){</span>
363	<span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="n">arr</span> <span class="o">=</span> <span class="p">{</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">};</span>
364	<span class="n">permutation</span><span class="p">(</span><span class="n">arr</span><span class="p">,</span> <span class="mi">0</span><span class="p">);</span> <span class="c1">// 5! 개의 출력</span>
365	
366	<span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
367<span class="p">}</span>
368</code></pre></div></div>
369
370<h3 id="combination">Combination</h3>
371
372<p><strong>조합</strong>을 의미하며 서로 다른 N개의 원소에서 R개의 원소를 순서 없이 골라낸 경우(nCk)의 수를 나타낸다.</p>
373
374<div class="language-cpp highlighter-rouge"><div class="highlight"><pre class="highlight"><code><span class="cp">#include &lt;iostream&gt;
375#include &lt;vector&gt;
376#include &lt;algorithm&gt;
377</span>
378<span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
379
380<span class="kt">void</span> <span class="nf">combination</span><span class="p">(</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="o">&amp;</span> <span class="n">arr</span><span class="p">,</span> <span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="o">&amp;</span> <span class="n">picked</span><span class="p">,</span> <span class="k">const</span> <span class="kt">int</span> <span class="n">k</span><span class="p">,</span> <span class="k">const</span> <span class="kt">int</span> <span class="n">curPos</span><span class="p">){</span>
381	<span class="k">if</span><span class="p">(</span><span class="n">k</span> <span class="o">==</span> <span class="mi">0</span><span class="p">){</span>
382		<span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">el</span> <span class="o">:</span> <span class="n">picked</span><span class="p">)</span> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="n">el</span> <span class="o">&lt;&lt;</span> <span class="s">" "</span><span class="p">;</span>
383		<span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">"</span><span class="se">\n</span><span class="s">"</span><span class="p">;</span>
384		<span class="k">return</span><span class="p">;</span>
385	<span class="p">}</span>
386
387	<span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="n">curPos</span> <span class="p">;</span> <span class="n">i</span> <span class="o">&lt;=</span> <span class="n">arr</span><span class="p">.</span><span class="n">size</span><span class="p">()</span> <span class="o">-</span> <span class="n">k</span> <span class="p">;</span> <span class="n">i</span><span class="o">++</span><span class="p">){</span>
388		<span class="n">picked</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">arr</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
389		<span class="n">combination</span><span class="p">(</span><span class="n">arr</span><span class="p">,</span> <span class="n">picked</span><span class="p">,</span> <span class="n">k</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">);</span>
390		<span class="n">picked</span><span class="p">.</span><span class="n">pop_back</span><span class="p">();</span>
391	<span class="p">}</span>
392<span class="p">}</span>
393
394<span class="kt">int</span> <span class="nf">main</span><span class="p">(){</span>
395	<span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="n">arr</span> <span class="o">=</span> <span class="p">{</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">};</span>
396	<span class="n">vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="n">picked</span><span class="p">;</span> 
397	<span class="n">combination</span><span class="p">(</span><span class="n">arr</span><span class="p">,</span> <span class="n">picked</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">0</span><span class="p">);</span> <span class="c1">// 5C2개 출력</span>
398	
399	<span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
400<span class="p">}</span>
401</code></pre></div></div>
402
403        
404      </section>
405
406      <footer class="page__meta">
407        
408        
409  
410
411
412  
413  
414  
415
416  <p class="page__taxonomy">
417    <strong><i class="fas fa-fw fa-tags" aria-hidden="true"></i> Tags: </strong>
418    <span itemprop="keywords">
419    
420      
421      
422      <a href="/tags/#algorithm" class="page__taxonomy-item" rel="tag">algorithm</a><span class="sep">, </span>
423    
424      
425      
426      <a href="/tags/#brute-force" class="page__taxonomy-item" rel="tag">brute-force</a><span class="sep">, </span>
427    
428      
429      
430      <a href="/tags/#exhaustive-search" class="page__taxonomy-item" rel="tag">exhaustive search</a>
431    
432    </span>
433  </p>
434
435
436
437
438  
439
440
441  
442  
443  
444
445  <p class="page__taxonomy">
446    <strong><i class="fas fa-fw fa-folder-open" aria-hidden="true"></i> Categories: </strong>
447    <span itemprop="keywords">
448    
449      
450      
451      <a href="/categories/#algorithm" class="page__taxonomy-item" rel="tag">algorithm</a>
452    
453    </span>
454  </p>
455
456
457        
458          <p class="page__date"><strong><i class="fas fa-fw fa-calendar-alt" aria-hidden="true"></i> Updated:</strong> <time datetime="2020-11-16T00:00:00+00:00">November 16, 2020</time></p>
459        
460      </footer>
461
462      <section class="page__share">
463  
464    <h4 class="page__share-title">Share on</h4>
465  
466
467  <a href="https://twitter.com/intent/tweet?text=%5BAlgorithm%5D+Brute+Force%20https%3A%2F%2Fstalker5217.github.io%2Falgorithm%2Fbrute-force%2F" class="btn btn--twitter" onclick="window.open(this.href, 'window', 'left=20,top=20,width=500,height=500,toolbar=1,resizable=0'); return false;" title="Share on Twitter"><i class="fab fa-fw fa-twitter" aria-hidden="true"></i><span> Twitter</span></a>
468
469  <a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fstalker5217.github.io%2Falgorithm%2Fbrute-force%2F" class="btn btn--facebook" onclick="window.open(this.href, 'window', 'left=20,top=20,width=500,height=500,toolbar=1,resizable=0'); return false;" title="Share on Facebook"><i class="fab fa-fw fa-facebook" aria-hidden="true"></i><span> Facebook</span></a>
470
471  <a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fstalker5217.github.io%2Falgorithm%2Fbrute-force%2F" class="btn btn--linkedin" onclick="window.open(this.href, 'window', 'left=20,top=20,width=500,height=500,toolbar=1,resizable=0'); return false;" title="Share on LinkedIn"><i class="fab fa-fw fa-linkedin" aria-hidden="true"></i><span> LinkedIn</span></a>
472</section>
473
474
475      
476  <nav class="pagination">
477    
478      <a href="/algorithm/trie/" class="pagination--pager" title="[Algorithm] 트라이
479">Previous</a>
480    
481    
482      <a href="#" class="pagination--pager disabled">Next</a>
483    
484  </nav>
485
486    </div>
487
488    
489      <div class="page__comments">
490  
491  
492      <h4 class="page__comments-title">Leave a comment</h4>
493      <section id="disqus_thread"></section>
494    
495</div>
496
497    
498  </article>
499
500  
501  
502    <div class="page__related">
503      <h4 class="page__related-title">You may also enjoy</h4>
504      <div class="grid__wrapper">
505        
506          
507
508
509
510<div class="grid__item">
511  <article class="archive__item" itemscope itemtype="https://schema.org/CreativeWork">
512    
513    <h2 class="archive__item-title" itemprop="headline">
514      
515        <a href="/algorithm/trie/" rel="permalink">[Algorithm] 트라이
516</a>
517      
518    </h2>
519    
520      <p class="page__meta"><i class="far fa-clock" aria-hidden="true"></i> 
521
522
523
524
525  4 minute read
526
527</p>
528    
529    <p class="archive__item-excerpt" itemprop="description">트라이, 그리고 아호코라식 알고리즘에 대해 알아봅시다
530</p>
531  </article>
532</div>
533
534        
535          
536
537
538
539<div class="grid__item">
540  <article class="archive__item" itemscope itemtype="https://schema.org/CreativeWork">
541    
542    <h2 class="archive__item-title" itemprop="headline">
543      
544        <a href="/algorithm/segment-tree/" rel="permalink">[Algorithm] 세그먼트 트리
545</a>
546      
547    </h2>
548    
549      <p class="page__meta"><i class="far fa-clock" aria-hidden="true"></i> 
550
551
552
553
554  4 minute read
555
556</p>
557    
558    <p class="archive__item-excerpt" itemprop="description">세그먼트 트리 그리고 세그먼트 트리의 한 종류인 펜윅 트리에 대하여 알아봅시다
559</p>
560  </article>
561</div>
562
563        
564          
565
566
567
568<div class="grid__item">
569  <article class="archive__item" itemscope itemtype="https://schema.org/CreativeWork">
570    
571    <h2 class="archive__item-title" itemprop="headline">
572      
573        <a href="/java/java-memory/" rel="permalink">[Java] 자바 실행 구조 &amp; 가비지 컬렉터
574</a>
575      
576    </h2>
577    
578      <p class="page__meta"><i class="far fa-clock" aria-hidden="true"></i> 
579
580
581
582
583  2 minute read
584
585</p>
586    
587    <p class="archive__item-excerpt" itemprop="description">자바 메모리 구조와 가비지 컬렉터에 대해 알아봅시다
588</p>
589  </article>
590</div>
591
592        
593          
594
595
596
597<div class="grid__item">
598  <article class="archive__item" itemscope itemtype="https://schema.org/CreativeWork">
599    
600    <h2 class="archive__item-title" itemprop="headline">
601      
602        <a href="/web/rest-api/" rel="permalink">[Web] REST API
603</a>
604      
605    </h2>
606    
607      <p class="page__meta"><i class="far fa-clock" aria-hidden="true"></i> 
608
609
610
611
612  1 minute read
613
614</p>
615    
616    <p class="archive__item-excerpt" itemprop="description">REST API에 대해서 알아봅시다
617</p>
618  </article>
619</div>
620
621        
622      </div>
623    </div>
624  
625  
626</div>
627
628    </div>
629
630    
631      <div class="search-content">
632        <div class="search-content__inner-wrap"><form class="search-content__form" onkeydown="return event.key != 'Enter';">
633    <label class="sr-only" for="search">
634      Enter your search term...
635    </label>
636    <input type="search" id="search" class="search-input" tabindex="-1" placeholder="Enter your search term..." />
637  </form>
638  <div id="results" class="results"></div></div>
639
640      </div>
641    
642
643    <div id="footer" class="page__footer">
644      <footer>
645        <!-- start custom footer snippets -->
646
647<!-- end custom footer snippets -->
648        <div class="page__footer-follow">
649  <ul class="social-icons">
650    
651      <li><strong>Follow:</strong></li>
652    
653
654    
655      
656        
657          <li><a href="https://github.com/stalker5217" rel="nofollow noopener noreferrer"><i class="fab fa-fw fa-github" aria-hidden="true"></i> GitHub</a></li>
658        
659      
660        
661      
662        
663      
664        
665      
666        
667      
668        
669      
670    
671
672    <li><a href="/feed.xml"><i class="fas fa-fw fa-rss-square" aria-hidden="true"></i> Feed</a></li>
673  </ul>
674</div>
675
676<div class="page__footer-copyright">&copy; 2020 Song. Powered by <a href="https://jekyllrb.com" rel="nofollow">Jekyll</a> &amp;
676 <a href="https://mademistakes.com/work/minimal-mistakes-jekyll-theme/" rel="nofollow">Minimal Mistakes</a>.</div>
677
678      </footer>
679    </div>
680
681    
682  
682<script src="/assets/js/main.min.js"></script>
682
683  
683<script src="https://kit.fontawesome.com/4eee35f757.js"></script>
683
684
685
686
687
688<script src="/assets/js/lunr/lunr.min.js"></script>
vendor: 1 bytes, line 688
688
689<script src="/assets/js/lunr/lunr-store.js"></script>
vendor: 1 bytes, line 689
689
690<script src="/assets/js/lunr/lunr-en.js"></script>
690
691
692
693
694
695  
695<script>
696  var _gaq = _gaq || [];
697  _gaq.push(['_setAccount', 'UA-158094943-1']);
698  
699  _gaq.push(['_trackPageview']);
700
701  (function() {
702    var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true;
703    ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js';
704    var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s);
705  })();
706</script>
706
707
708
709
710
711
712
713    
714  
714<script>
715    var disqus_config = function () {
716      this.page.url = "https://stalker5217.github.io/algorithm/brute-force/";  // Replace PAGE_URL with your page's canonical URL variable
717      this.page.identifier = "/algorithm/brute-force"; // Replace PAGE_IDENTIFIER with your page's unique identifier variable
718    };
719    (function() { // DON'T EDIT BELOW THIS LINE
720      var d = document, s = d.createElement('script');
721      s.src = 'https://stalker5217-github-io.disqus.com/embed.js';
722      s.setAttribute('data-timestamp', +new Date());
723      (d.head || d.body).appendChild(s);
724    })();
725  </script>
725
726<noscript>Please enable JavaScript to view the <a href="https://disqus.com/?ref_noscript">comments powered by Disqus.</a></noscript>
727
728
729  
730
731
732
733
734<script src="https://cdn.jsdelivr.net/npm/vue"></script>
vendor: 1 bytes, line 734
734
735<script>
736  new Vue({
737    el : '#category_tag_menu',
738    data : {
739      flag_c : false,
740      flag_t : false
741    },
742    methods : {
743      togglec: function(){
744        this.flag_c = !this.flag_c;
745      },
746      togglet: function(){
747        this.flag_t = !this.flag_t;
748      }
749    }
750  });
751</script>
751
752
753<!-- Global site tag (gtag.js) - Google Analytics -->
vendor: 64 bytes, lines 753-754
753
754<script async src="https://www.googletagmanager.com/gtag/js?id=
754UA-158094943-1
vendor: 12 bytes, line 754
754"></script>
755<script>
756  
vendor: 134 bytes, lines 756-760
756window.dataLayer = window.dataLayer || [];
757  function gtag(){dataLayer.push(arguments);}
758  gtag('js', new Date());
759
760  gtag('config', '
760UA-158094943-1
vendor: 4 bytes, line 760
760');
761</script>
761
762
763
764<script type="text/x-mathjax-config">
765  MathJax.Hub.Config({
766      TeX: {
767        equationNumbers: {
768          autoNumber: "AMS"
769        }
770      },
771      tex2jax: {
772        inlineMath: [ ['$', '$'] ],
773        displayMath: [ ['$$', '$$'] , ["\\[","\\]"] ],
774        processEscapes: true,
775      },
776      displayAlign: "left"
777  });
778  MathJax.Hub.Register.MessageHook("Math Processing Error",function (message) {
779      alert("Math Processing Error: "+message[1]);
780    });
781  MathJax.Hub.Register.MessageHook("TeX Jax - parse error",function (message) {
782      alert("Math Processing Error: "+message[1]);
783    });
784  </script>
784
785  
785<script type="text/javascript" async
786    src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML">
787  </script>
787
788
789  </body>
790</html>

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.