diff --git a/cpTool/SAMPLE.md b/cpTool/SAMPLE.md
index b54826e..6120dce 100644
--- a/cpTool/SAMPLE.md
+++ b/cpTool/SAMPLE.md
@@ -4,9 +4,9 @@
 
 >	Automated by [cp-tool](https://github.com/jspw/cp-tool)
 
-This is a repository to keep track of my problem solving practice.
+This is a repository to keep track of my problem-solving practice.
 For now, It contains all the problems I have solved at 
-- **[Codeforces](https://codeforces.com/)** 
+- **[Codeforces](https://codeforces.com/)**
 
 ## User Details ([tourist](https://codeforces.com/profile/tourist))
 
@@ -26,5 +26,5 @@ For now, It contains all the problems I have solved at
 ## Submissions 
 
 <table align="center" border = "0px" cellpadding ="2px" cellspacing ="2px" >
-<tr><th>#</th><th>Probelm</th><th>Catagory</th><th>Rating</th><th>Tags</th><th>Solution</th><th>Submission Time</th></tr>
+<tr><th>#</th><th>Problem</th><th>Category</th><th>Rating</th><th>Tags</th><th>Solution</th><th>Submission Time</th></tr>
 <tr><td>1501</td><td><a href=https://codeforces.com/contest/1470/problem/E>Strange Permutation</a></td><td>E</td><td>3200</td><td>binary search, combinatorics, data structures, dp, graphs, implementation, two pointers</td><td><a href=https://codeforces.com/contest/1470/submission/103440669>GNU C++17 (64)</a></td><td>05 January 2021 15:50:55</td></tr><tr><td>1500</td><td><a href=https://codeforces.com/contest/1470/problem/C>Strange Shuffle</a></td><td>C</td><td>2500</td><td>binary search, brute force, constructive algorithms, interactive</td><td><a href=https://codeforces.com/contest/1470/submission/103424863>GNU C++17 (64)</a></td><td>05 January 2021 15:21:51</td></tr><tr><td>1499</td><td><a href=https://codeforces.com/contest/1470/problem/D>Strange Housing</a></td><td>D</td><td>2200</td><td>constructive algorithms, dfs and similar, graph matchings, graphs, greedy</td><td><a href=https://codeforces.com/contest/1470/submission/103415926>GNU C++17 (64)</a></td><td>05 January 2021 15:08:04</td></tr><tr><td>1498</td><td><a href=https://codeforces.com/contest/1470/problem/B>Strange Definition</a></td><td>B</td><td>1900</td><td>bitmasks, graphs, hashing, math, number theory</td><td><a href=https://codeforces.com/contest/1470/submission/103406584>GNU C++17 (64)</a></td><td>05 January 2021 14:54:50</td></tr><tr><td>1497</td><td><a href=https://codeforces.com/contest/1470/problem/A>Strange Birthday Party</a></td><td>A</td><td>1300</td><td>binary search, dp, greedy, sortings, two pointers</td><td><a href=https://codeforces.com/contest/1470/submission/103395440>GNU C++17 (64)</a></td><td>05 January 2021 14:41:31</td></tr><tr><td>1496</td><td><a href=https://codeforces.com/contest/1466/problem/H>Finding satisfactory solutions</a></td><td>H</td><td>3300</td><td>combinatorics, dp, graphs, greedy, math</td><td><a href=https://codeforces.com/contest/1466/submission/102836716>GNU C++17 (64)</a></td><td>30 December 2020 16:22:39</td></tr><tr><td>1495</td><td><a href=https://codeforces.com/contest/1466/problem/G>Song of the Sirens</a></td><td>G</td><td>2600</td><td>combinatorics, divide and conquer, hashing, math, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/1466/submission/102810637>GNU C++17 (64)</a></td><td>30 December 2020 15:22:57</td></tr><tr><td>1494</td><td><a href=https://codeforces.com/contest/1466/problem/F>Euclid's nightmare</a></td><td>F</td><td>2100</td><td>bitmasks, dfs and similar, dsu, graphs, greedy, math, sortings</td><td><a href=https://codeforces.com/contest/1466/submission/102792021>GNU C++17 (64)</a></td><td>30 December 2020 14:54:48</td></tr><tr><td>1493</td><td><a href=https://codeforces.com/contest/1466/problem/E>Apollo versus Pan</a></td><td>E</td><td>1800</td><td>bitmasks, brute force, math</td><td><a href=https://codeforces.com/contest/1466/submission/102787316>GNU C++17 (64)</a></td><td>30 December 2020 14:49:34</td></tr><tr><td>1492</td><td><a href=https://codeforces.com/contest/1466/problem/D>13th Labour of Heracles</a></td><td>D</td><td>1500</td><td>data structures, greedy, sortings, trees</td><td><a href=https://codeforces.com/contest/1466/submission/102781664>GNU C++17 (64)</a></td><td>30 December 2020 14:44:23</td></tr><tr><td>1491</td><td><a href=https://codeforces.com/contest/1466/problem/C>Canine poetry</a></td><td>C</td><td>1300</td><td>dp, greedy, strings</td><td><a href=https://codeforces.com/contest/1466/submission/102778093>GNU C++17 (64)</a></td><td>30 December 2020 14:41:23</td></tr><tr><td>1490</td><td><a href=https://codeforces.com/contest/1466/problem/B>Last minute enhancements</a></td><td>B</td><td>800</td><td>dp, greedy</td><td><a href=https://codeforces.com/contest/1466/submission/102774188>GNU C++17 (64)</a></td><td>30 December 2020 14:38:02</td></tr><tr><td>1489</td><td><a href=https://codeforces.com/contest/1466/problem/A>Bovine Dilemma</a></td><td>A</td><td>800</td><td>brute force, geometry, math</td><td><a href=https://codeforces.com/contest/1466/submission/102773393>GNU C++17 (64)</a></td><td>30 December 2020 14:36:16</td></tr><tr><td>1488</td><td><a href=https://codeforces.com/contest/1468/problem/B>Bakery</a></td><td>B</td><td>2900</td><td>data structures, dsu</td><td><a href=https://codeforces.com/contest/1468/submission/102326567>GNU C++17 (64)</a></td><td>25 December 2020 14:46:15</td></tr><tr><td>1487</td><td><a href=https://codeforces.com/contest/1468/problem/M>Similar Sets</a></td><td>M</td><td>2300</td><td>data structures, graphs, implementation</td><td><a href=https://codeforces.com/contest/1468/submission/102322520>GNU C++17 (64)</a></td><td>25 December 2020 14:14:28</td></tr><tr><td>1486</td><td><a href=https://codeforces.com/contest/1468/problem/G>Hobbits</a></td><td>G</td><td>2500</td><td>binary search, geometry</td><td><a href=https://codeforces.com/contest/1468/submission/102318508>GNU C++17 (64)</a></td><td>25 December 2020 13:41:27</td></tr><tr><td>1485</td><td><a href=https://codeforces.com/contest/1468/problem/L>Prime Divisors Selection</a></td><td>L</td><td>2700</td><td>binary search, greedy, math, number theory</td><td><a href=https://codeforces.com/contest/1468/submission/102316716>GNU C++17 (64)</a></td><td>25 December 2020 13:26:49</td></tr><tr><td>1484</td><td><a href=https://codeforces.com/contest/1468/problem/I>Plane Tiling</a></td><td>I</td><td>2500</td><td>geometry, implementation, math</td><td><a href=https://codeforces.com/contest/1468/submission/102312661>GNU C++17 (64)</a></td><td>25 December 2020 12:54:38</td></tr><tr><td>1483</td><td><a href=https://codeforces.com/contest/1468/problem/H>K and Medians</a></td><td>H</td><td>2200</td><td>constructive algorithms, greedy, math</td><td><a href=https://codeforces.com/contest/1468/submission/102310919>GNU C++17 (64)</a></td><td>25 December 2020 12:41:16</td></tr><tr><td>1482</td><td><a href=https://codeforces.com/contest/1468/problem/J>Road Reform</a></td><td>J</td><td>1800</td><td>dsu, graphs, greedy</td><td><a href=https://codeforces.com/contest/1468/submission/102308347>GNU C++17 (64)</a></td><td>25 December 2020 12:22:10</td></tr><tr><td>1481</td><td><a href=https://codeforces.com/contest/1468/problem/A>LaIS</a></td><td>A</td><td>2200</td><td>data structures, dp, greedy</td><td><a href=https://codeforces.com/contest/1468/submission/102307916>GNU C++17 (64)</a></td><td>25 December 2020 12:18:55</td></tr><tr><td>1480</td><td><a href=https://codeforces.com/contest/1468/problem/K>The Robot</a></td><td>K</td><td>1600</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/1468/submission/102306595>GNU C++17 (64)</a></td><td>25 December 2020 12:08:58</td></tr><tr><td>1479</td><td><a href=https://codeforces.com/contest/1468/problem/D>Firecrackers</a></td><td>D</td><td>1700</td><td>binary search, sortings</td><td><a href=https://codeforces.com/contest/1468/submission/102305771>GNU C++17 (64)</a></td><td>25 December 2020 12:03:13</td></tr><tr><td>1478</td><td><a href=https://codeforces.com/contest/1468/problem/C>Berpizza</a></td><td>C</td><td>1400</td><td>data structures, implementation</td><td><a href=https://codeforces.com/contest/1468/submission/102304322>GNU C++17 (64)</a></td><td>25 December 2020 11:53:21</td></tr><tr><td>1477</td><td><a href=https://codeforces.com/contest/1468/problem/F>Full Turn</a></td><td>F</td><td>1700</td><td>geometry, hashing, number theory</td><td><a href=https://codeforces.com/contest/1468/submission/102303826>GNU C++17 (64)</a></td><td>25 December 2020 11:50:00</td></tr><tr><td>1476</td><td><a href=https://codeforces.com/contest/1468/problem/N>Waste Sorting</a></td><td>N</td><td>900</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/1468/submission/102303467>GNU C++17 (64)</a></td><td>25 December 2020 11:47:40</td></tr><tr><td>1475</td><td><a href=https://codeforces.com/contest/1468/problem/E>Four Segments</a></td><td>E</td><td>800</td><td>greedy</td><td><a href=https://codeforces.com/contest/1468/submission/102303096>GNU C++17 (64)</a></td><td>25 December 2020 11:45:17</td></tr><tr><td>1474</td><td><a href=https://codeforces.com/contest/1464/problem/E>No Game No Life</a></td><td>E</td><td>2700</td><td>bitmasks, dp, games, math, matrices, probabilities</td><td><a href=https://codeforces.com/contest/1464/submission/101882555>GNU C++17 (64)</a></td><td>20 December 2020 15:50:44</td></tr><tr><td>1473</td><td><a href=https://codeforces.com/contest/1464/problem/C>Poman Numbers</a></td><td>C</td><td>2300</td><td>bitmasks, constructive algorithms, dp, greedy, math</td><td><a href=https://codeforces.com/contest/1464/submission/101876637>GNU C++17 (64)</a></td><td>20 December 2020 15:32:09</td></tr><tr><td>1472</td><td><a href=https://codeforces.com/contest/1464/problem/B>Grime Zoo</a></td><td>B</td><td>2100</td><td>brute force, data structures, greedy, implementation, ternary search</td><td><a href=https://codeforces.com/contest/1464/submission/101870962>GNU C++17 (64)</a></td><td>20 December 2020 15:19:04</td></tr><tr><td>1471</td><td><a href=https://codeforces.com/contest/1464/problem/A>Peaceful Rooks</a></td><td>A</td><td>1700</td><td>constructive algorithms, dfs and similar, dsu, graphs</td><td><a href=https://codeforces.com/contest/1464/submission/101859824>GNU C++17 (64)</a></td><td>20 December 2020 15:07:07</td></tr><tr><td>1470</td><td><a href=https://codeforces.com/contest/1458/problem/C>Latin Square</a></td><td>C</td><td>2700</td><td>math, matrices</td><td><a href=https://codeforces.com/contest/1458/submission/101749748>GNU C++17 (64)</a></td><td>19 December 2020 10:47:12</td></tr><tr><td>1469</td><td><a href=https://codeforces.com/contest/1458/problem/D>Flip and Reverse</a></td><td>D</td><td>3100</td><td>data structures, graphs, greedy</td><td><a href=https://codeforces.com/contest/1458/submission/101742255>GNU C++17 (64)</a></td><td>19 December 2020 10:25:32</td></tr><tr><td>1468</td><td><a href=https://codeforces.com/contest/1458/problem/E>Nim Shortcuts</a></td><td>E</td><td>3100</td><td>data structures, games</td><td><a href=https://codeforces.com/contest/1458/submission/101737863>GNU C++17 (64)</a></td><td>19 December 2020 10:13:51</td></tr><tr><td>1467</td><td><a href=https://codeforces.com/contest/1458/problem/B>Glass Half Spilled</a></td><td>B</td><td>2000</td><td>dp</td><td><a href=https://codeforces.com/contest/1458/submission/101728732>GNU C++17 (64)</a></td><td>19 December 2020 09:52:59</td></tr><tr><td>1466</td><td><a href=https://codeforces.com/contest/1458/problem/A>Row GCD</a></td><td>A</td><td>1600</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/1458/submission/101720547>GNU C++17 (64)</a></td><td>19 December 2020 09:41:02</td></tr><tr><td>1465</td><td><a href=https://codeforces.com/contest/1450/problem/G>Communism</a></td><td>G</td><td>3500</td><td>bitmasks, dp, trees</td><td><a href=https://codeforces.com/contest/1450/submission/100574054>GNU C++17 (64)</a></td><td>06 December 2020 16:59:29</td></tr><tr><td>1464</td><td><a href=https://codeforces.com/contest/1450/problem/H1>Multithreading (Easy Version)</a></td><td>H1</td><td>2900</td><td>combinatorics, fft, math</td><td><a href=https://codeforces.com/contest/1450/submission/100555346>GNU C++17</a></td><td>06 December 2020 15:35:10</td></tr><tr><td>1463</td><td><a href=https://codeforces.com/contest/1450/problem/E>Capitalism</a></td><td>E</td><td>2700</td><td>constructive algorithms, dfs and similar, graphs, shortest paths</td><td><a href=https://codeforces.com/contest/1450/submission/100550861>GNU C++17</a></td><td>06 December 2020 15:21:28</td></tr><tr><td>1462</td><td><a href=https://codeforces.com/contest/1450/problem/F>The Struggling Contestant</a></td><td>F</td><td>2400</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/1450/submission/100546605>GNU C++17</a></td><td>06 December 2020 15:10:04</td></tr><tr><td>1461</td><td><a href=https://codeforces.com/contest/1450/problem/C2>Errich-Tac-Toe (Hard Version)</a></td><td>C2</td><td>2300</td><td>constructive algorithms, math</td><td><a href=https://codeforces.com/contest/1450/submission/100540996>GNU C++17</a></td><td>06 December 2020 14:57:47</td></tr><tr><td>1460</td><td><a href=https://codeforces.com/contest/1450/problem/C1>Errich-Tac-Toe (Easy Version)</a></td><td>C1</td><td>2100</td><td>constructive algorithms, math</td><td><a href=https://codeforces.com/contest/1450/submission/100540805>GNU C++17</a></td><td>06 December 2020 14:57:28</td></tr><tr><td>1459</td><td><a href=https://codeforces.com/contest/1450/problem/D>Rating Compression</a></td><td>D</td><td>1800</td><td>binary search, data structures, greedy, implementation, two pointers</td><td><a href=https://codeforces.com/contest/1450/submission/100535288>GNU C++17</a></td><td>06 December 2020 14:47:21</td></tr><tr><td>1458</td><td><a href=https://codeforces.com/contest/1450/problem/B>Balls of Steel</a></td><td>B</td><td>1000</td><td>brute force, geometry, greedy</td><td><a href=https://codeforces.com/contest/1450/submission/100528730>GNU C++17</a></td><td>06 December 2020 14:39:04</td></tr><tr><td>1457</td><td><a href=https://codeforces.com/contest/1450/problem/A>Avoid Trygub</a></td><td>A</td><td>800</td><td>constructive algorithms, sortings</td><td><a href=https://codeforces.com/contest/1450/submission/100524562>GNU C++17</a></td><td>06 December 2020 14:35:38</td></tr><tr><td>1456</td><td><a href=https://codeforces.com/contest/996/problem/B>World Cup</a></td><td>B</td><td>1300</td><td>binary search, math</td><td><a href=https://codeforces.com/contest/996/submission/99499177>GNU C++17</a></td><td>24 November 2020 17:58:16</td></tr><tr><td>1455</td><td><a href=https://codeforces.com/contest/996/problem/A>Hit the Lottery</a></td><td>A</td><td>800</td><td>dp, greedy</td><td><a href=https://codeforces.com/contest/996/submission/99499022>GNU C++17</a></td><td>24 November 2020 17:56:20</td></tr><tr><td>1454</td><td><a href=https://codeforces.com/contest/995/problem/F>Cowmpany Cowmpensation</a></td><td>F</td><td>2700</td><td>combinatorics, dp, math, trees</td><td><a href=https://codeforces.com/contest/995/submission/99498747>GNU C++17</a></td><td>24 November 2020 17:53:17</td></tr><tr><td>1453</td><td><a href=https://codeforces.com/contest/995/problem/C>Leaving the Bar</a></td><td>C</td><td>2300</td><td>brute force, data structures, geometry, greedy, math, sortings</td><td><a href=https://codeforces.com/contest/995/submission/99498153>GNU C++17</a></td><td>24 November 2020 17:46:03</td></tr><tr><td>1452</td><td><a href=https://codeforces.com/contest/213/problem/A>Game</a></td><td>A</td><td>1700</td><td>dfs and similar, greedy</td><td><a href=https://codeforces.com/contest/213/submission/1954282>Delphi</a></td><td>30 July 2012 15:42:21</td></tr><tr><td>1451</td><td><a href=https://codeforces.com/contest/995/problem/E>Number Clicker</a></td><td>E</td><td>2700</td><td>divide and conquer, graphs, meet-in-the-middle, number theory</td><td><a href=https://codeforces.com/contest/995/submission/99496107>GNU C++17</a></td><td>24 November 2020 17:22:47</td></tr><tr><td>1450</td><td><a href=https://codeforces.com/contest/995/problem/B>Suit and Tie</a></td><td>B</td><td>1400</td><td>greedy, implementation, math</td><td><a href=https://codeforces.com/contest/995/submission/99492957>GNU C++17</a></td><td>24 November 2020 16:54:19</td></tr><tr><td>1449</td><td><a href=https://codeforces.com/contest/995/problem/A>Tesla</a></td><td>A</td><td>2100</td><td>constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/995/submission/99492485>GNU C++17</a></td><td>24 November 2020 16:50:59</td></tr><tr><td>1448</td><td><a href=https://codeforces.com/contest/1431/problem/I>Cyclic Shifts</a></td><td>I</td><td>2900</td><td>*special, strings</td><td><a href=https://codeforces.com/contest/1431/submission/98218966>Kotlin</a></td><td>12 November 2020 16:27:01</td></tr><tr><td>1447</td><td><a href=https://codeforces.com/contest/1431/problem/J>Zero-XOR Array</a></td><td>J</td><td>3400</td><td>*special, dp</td><td><a href=https://codeforces.com/contest/1431/submission/98217910>Kotlin</a></td><td>12 November 2020 16:13:46</td></tr><tr><td>1446</td><td><a href=https://codeforces.com/contest/1431/problem/H>Rogue-like Game</a></td><td>H</td><td>2600</td><td>*special, brute force, greedy, two pointers</td><td><a href=https://codeforces.com/contest/1431/submission/98212910>Kotlin</a></td><td>12 November 2020 15:17:30</td></tr><tr><td>1445</td><td><a href=https://codeforces.com/contest/1431/problem/G>Number Deletion Game</a></td><td>G</td><td>2100</td><td>*special, dp, games, greedy</td><td><a href=https://codeforces.com/contest/1431/submission/98211527>Kotlin</a></td><td>12 November 2020 15:03:47</td></tr><tr><td>1444</td><td><a href=https://codeforces.com/contest/1431/problem/F>Neural Network Problem</a></td><td>F</td><td>2100</td><td>*special, binary search, greedy</td><td><a href=https://codeforces.com/contest/1431/submission/98210807>Kotlin</a></td><td>12 November 2020 14:57:01</td></tr><tr><td>1443</td><td><a href=https://codeforces.com/contest/1431/problem/E>Chess Match</a></td><td>E</td><td>2000</td><td>*special</td><td><a href=https://codeforces.com/contest/1431/submission/98210075>Kotlin</a></td><td>12 November 2020 14:49:59</td></tr><tr><td>1442</td><td><a href=https://codeforces.com/contest/1431/problem/D>Used Markers</a></td><td>D</td><td>1500</td><td>*special, greedy</td><td><a href=https://codeforces.com/contest/1431/submission/98209667>Kotlin</a></td><td>12 November 2020 14:46:15</td></tr><tr><td>1441</td><td><a href=https://codeforces.com/contest/1431/problem/C>Black Friday</a></td><td>C</td><td>1600</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1431/submission/98208912>Kotlin</a></td><td>12 November 2020 14:40:24</td></tr><tr><td>1440</td><td><a href=https://codeforces.com/contest/1431/problem/B>Polycarp and the Language of Gods</a></td><td>B</td><td>1400</td><td>*special, implementation, two pointers</td><td><a href=https://codeforces.com/contest/1431/submission/98208643>Kotlin</a></td><td>12 November 2020 14:38:20</td></tr><tr><td>1439</td><td><a href=https://codeforces.com/contest/1431/problem/A>Selling Hamburgers</a></td><td>A</td><td>800</td><td>*special</td><td><a href=https://codeforces.com/contest/1431/submission/98208429>Kotlin</a></td><td>12 November 2020 14:36:08</td></tr><tr><td>1438</td><td><a href=https://codeforces.com/contest/1432/problem/F>Platforms Jumping</a></td><td>F</td><td>undefined</td><td>*special, greedy, implementation</td><td><a href=https://codeforces.com/contest/1432/submission/98198779>Kotlin</a></td><td>12 November 2020 12:29:19</td></tr><tr><td>1437</td><td><a href=https://codeforces.com/contest/1432/problem/E>Binary String Minimizing</a></td><td>E</td><td>undefined</td><td>*special, greedy</td><td><a href=https://codeforces.com/contest/1432/submission/98198432>Kotlin</a></td><td>12 November 2020 12:24:32</td></tr><tr><td>1436</td><td><a href=https://codeforces.com/contest/1335/problem/B>Construct the String</a></td><td>B</td><td>900</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/1335/submission/76500977>GNU C++17</a></td><td>13 April 2020 14:36:47</td></tr><tr><td>1435</td><td><a href=https://codeforces.com/contest/1432/problem/C>Equalize Prices Again</a></td><td>C</td><td>undefined</td><td>*special, math</td><td><a href=https://codeforces.com/contest/1432/submission/98197974>Kotlin</a></td><td>12 November 2020 12:18:21</td></tr><tr><td>1434</td><td><a href=https://codeforces.com/contest/1335/problem/A>Candies and Two Sisters</a></td><td>A</td><td>800</td><td>math</td><td><a href=https://codeforces.com/contest/1335/submission/76501630>GNU C++17</a></td><td>13 April 2020 14:37:14</td></tr><tr><td>1433</td><td><a href=https://codeforces.com/contest/1347/problem/A>A+B (Trial Problem)</a></td><td>A</td><td>800</td><td>*special</td><td><a href=https://codeforces.com/contest/1347/submission/81886400>Kotlin</a></td><td>29 May 2020 12:55:58</td></tr><tr><td>1432</td><td><a href=https://codeforces.com/contest/1441/problem/E>Differentiating Games</a></td><td>E</td><td>3400</td><td>games, interactive</td><td><a href=https://codeforces.com/contest/1441/submission/97370281>GNU C++17 (64)</a></td><td>01 November 2020 16:01:06</td></tr><tr><td>1431</td><td><a href=https://codeforces.com/contest/1441/problem/A>Identify the Operations</a></td><td>A</td><td>1800</td><td>combinatorics, greedy</td><td><a href=https://codeforces.com/contest/1441/submission/97365086>GNU C++17 (64)</a></td><td>01 November 2020 14:57:02</td></tr><tr><td>1430</td><td><a href=https://codeforces.com/contest/1441/problem/D>Black, White and Grey Tree</a></td><td>D</td><td>3000</td><td></td><td><a href=https://codeforces.com/contest/1441/submission/97364701>GNU C++17 (64)</a></td><td>01 November 2020 14:52:44</td></tr><tr><td>1429</td><td><a href=https://codeforces.com/contest/1441/problem/B>Graph Transpositions</a></td><td>B</td><td>2400</td><td>graphs, shortest paths</td><td><a href=https://codeforces.com/contest/1441/submission/97362951>GNU C++17 (64)</a></td><td>01 November 2020 14:34:01</td></tr><tr><td>1428</td><td><a href=https://codeforces.com/contest/1441/problem/C>Sum</a></td><td>C</td><td>2800</td><td>divide and conquer, greedy</td><td><a href=https://codeforces.com/contest/1441/submission/97361600>GNU C++17 (64)</a></td><td>01 November 2020 14:18:23</td></tr><tr><td>1427</td><td><a href=https://codeforces.com/contest/1434/problem/E>A Convex Game</a></td><td>E</td><td>3500</td><td>dsu, games</td><td><a href=https://codeforces.com/contest/1434/submission/96677024>GNU C++17 (64)</a></td><td>25 October 2020 12:04:27</td></tr><tr><td>1426</td><td><a href=https://codeforces.com/contest/1434/problem/C>Solo mid Oracle</a></td><td>C</td><td>2100</td><td>binary search, greedy, math, ternary search</td><td><a href=https://codeforces.com/contest/1434/submission/96660091>GNU C++17 (64)</a></td><td>25 October 2020 11:26:04</td></tr><tr><td>1425</td><td><a href=https://codeforces.com/contest/1434/problem/B>Shurikens</a></td><td>B</td><td>1700</td><td>data structures, greedy, implementation</td><td><a href=https://codeforces.com/contest/1434/submission/96653756>GNU C++17 (64)</a></td><td>25 October 2020 11:15:04</td></tr><tr><td>1424</td><td><a href=https://codeforces.com/contest/1434/problem/A>Perform Easily</a></td><td>A</td><td>1900</td><td>binary search, brute force, data structures, dp, greedy, sortings, two pointers</td><td><a href=https://codeforces.com/contest/1434/submission/96649454>GNU C++17 (64)</a></td><td>25 October 2020 11:08:49</td></tr><tr><td>1423</td><td><a href=https://codeforces.com/contest/1423/problem/J>Bubble Cup hypothesis</a></td><td>J</td><td>2400</td><td>bitmasks, constructive algorithms, dp, math</td><td><a href=https://codeforces.com/contest/1423/submission/94779119>GNU C++11</a></td><td>05 October 2020 14:27:22</td></tr><tr><td>1422</td><td><a href=https://codeforces.com/contest/818/problem/G>Four Melodies</a></td><td>G</td><td>2600</td><td>flows, graphs</td><td><a href=https://codeforces.com/contest/818/submission/95416429>GNU C++17</a></td><td>13 October 2020 11:11:19</td></tr><tr><td>1421</td><td><a href=https://codeforces.com/contest/1427/problem/E>Xum</a></td><td>E</td><td>2500</td><td>bitmasks, constructive algorithms, math, matrices, number theory</td><td><a href=https://codeforces.com/contest/1427/submission/95121842>GNU C++17</a></td><td>10 October 2020 15:53:30</td></tr><tr><td>1420</td><td><a href=https://codeforces.com/contest/1427/problem/D>Unshuffling a Deck</a></td><td>D</td><td>2000</td><td>constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/1427/submission/95114512>GNU C++17</a></td><td>10 October 2020 15:32:19</td></tr><tr><td>1419</td><td><a href=https://codeforces.com/contest/1427/problem/C>The Hard Work of Paparazzi</a></td><td>C</td><td>2000</td><td>dp</td><td><a href=https://codeforces.com/contest/1427/submission/95102987>GNU C++17</a></td><td>10 October 2020 15:07:51</td></tr><tr><td>1418</td><td><a href=https://codeforces.com/contest/1427/problem/B>Chess Cheater</a></td><td>B</td><td>1400</td><td>greedy, implementation, sortings</td><td><a href=https://codeforces.com/contest/1427/submission/95097962>GNU C++17</a></td><td>10 October 2020 14:59:57</td></tr><tr><td>1417</td><td><a href=https://codeforces.com/contest/1427/problem/A>Avoiding Zero</a></td><td>A</td><td>900</td><td>math, sortings</td><td><a href=https://codeforces.com/contest/1427/submission/95092599>GNU C++17</a></td><td>10 October 2020 14:52:44</td></tr><tr><td>1416</td><td><a href=https://codeforces.com/contest/1423/problem/C>Dušan's Railway</a></td><td>C</td><td>3500</td><td>divide and conquer, graphs, trees</td><td><a href=https://codeforces.com/contest/1423/submission/94789081>GNU C++17</a></td><td>05 October 2020 15:54:23</td></tr><tr><td>1415</td><td><a href=https://codeforces.com/contest/1423/problem/I>Lookup Tables</a></td><td>I</td><td>3000</td><td>bitmasks</td><td><a href=https://codeforces.com/contest/1423/submission/94786050>GNU C++17</a></td><td>05 October 2020 15:26:57</td></tr><tr><td>1414</td><td><a href=https://codeforces.com/contest/1423/problem/F>Coins</a></td><td>F</td><td>2700</td><td>math</td><td><a href=https://codeforces.com/contest/1423/submission/94784528>GNU C++17</a></td><td>05 October 2020 15:13:39</td></tr><tr><td>1413</td><td><a href=https://codeforces.com/contest/1423/problem/H>Virus</a></td><td>H</td><td>2500</td><td>data structures, divide and conquer, dsu, graphs</td><td><a href=https://codeforces.com/contest/1423/submission/94781814>GNU C++17</a></td><td>05 October 2020 14:49:43</td></tr><tr><td>1412</td><td><a href=https://codeforces.com/contest/1423/problem/L>Light switches</a></td><td>L</td><td>2600</td><td>meet-in-the-middle</td><td><a href=https://codeforces.com/contest/1423/submission/94780014>GNU C++11</a></td><td>05 October 2020 14:34:39</td></tr><tr><td>1411</td><td><a href=https://codeforces.com/contest/1423/problem/B>Valuable Paper</a></td><td>B</td><td>1900</td><td>binary search, flows, graph matchings, graphs</td><td><a href=https://codeforces.com/contest/1423/submission/94771096>GNU C++11</a></td><td>05 October 2020 13:22:40</td></tr><tr><td>1410</td><td><a href=https://codeforces.com/contest/1423/problem/K>Lonely Numbers</a></td><td>K</td><td>1600</td><td>binary search, math, number theory, two pointers</td><td><a href=https://codeforces.com/contest/1423/submission/94770723>GNU C++11</a></td><td>05 October 2020 13:19:31</td></tr><tr><td>1409</td><td><a href=https://codeforces.com/contest/1408/problem/H>Rainbow Triples</a></td><td>H</td><td>3300</td><td>binary search, data structures, flows, greedy</td><td><a href=https://codeforces.com/contest/1408/submission/94340051>GNU C++17</a></td><td>30 September 2020 16:46:48</td></tr><tr><td>1408</td><td><a href=https://codeforces.com/contest/1408/problem/I>Bitwise Magic</a></td><td>I</td><td>3200</td><td>dp, math</td><td><a href=https://codeforces.com/contest/1408/submission/94333335>GNU C++17</a></td><td>30 September 2020 16:13:26</td></tr><tr><td>1407</td><td><a href=https://codeforces.com/contest/1408/problem/G>Clusterization Counting</a></td><td>G</td><td>2700</td><td>combinatorics, dp, dsu, fft, graphs, trees</td><td><a href=https://codeforces.com/contest/1408/submission/94320762>GNU C++17</a></td><td>30 September 2020 15:25:41</td></tr><tr><td>1406</td><td><a href=https://codeforces.com/contest/1408/problem/E>Avoid Rainbow Cycles</a></td><td>E</td><td>2400</td><td>data structures, dsu, graphs, greedy, sortings, trees</td><td><a href=https://codeforces.com/contest/1408/submission/94315651>GNU C++17</a></td><td>30 September 2020 15:11:40</td></tr><tr><td>1405</td><td><a href=https://codeforces.com/contest/1408/problem/F>Two Different</a></td><td>F</td><td>2300</td><td>constructive algorithms, divide and conquer</td><td><a href=https://codeforces.com/contest/1408/submission/94313708>GNU C++17</a></td><td>30 September 2020 15:06:46</td></tr><tr><td>1404</td><td><a href=https://codeforces.com/contest/1408/problem/B>Arrays Sum</a></td><td>B</td><td>1400</td><td>constructive algorithms, greedy, math</td><td><a href=https://codeforces.com/contest/1408/submission/94308857>GNU C++17</a></td><td>30 September 2020 14:55:57</td></tr><tr><td>1403</td><td><a href=https://codeforces.com/contest/1408/problem/D>Searchlights</a></td><td>D</td><td>2000</td><td>binary search, brute force, data structures, dp, implementation, sortings, two pointers</td><td><a href=https://codeforces.com/contest/1408/submission/94306623>GNU C++17</a></td><td>30 September 2020 14:51:01</td></tr><tr><td>1402</td><td><a href=https://codeforces.com/contest/1408/problem/C>Discrete Acceleration</a></td><td>C</td><td>1500</td><td>binary search, dp, implementation, math, two pointers</td><td><a href=https://codeforces.com/contest/1408/submission/94303937>GNU C++17</a></td><td>30 September 2020 14:46:00</td></tr><tr><td>1401</td><td><a href=https://codeforces.com/contest/1408/problem/A>Circle Coloring</a></td><td>A</td><td>800</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/1408/submission/94298674>GNU C++17</a></td><td>30 September 2020 14:36:36</td></tr><tr><td>1400</td><td><a href=https://codeforces.com/contest/1416/problem/F>Showing Off</a></td><td>F</td><td>3300</td><td>flows, graph matchings, greedy, implementation</td><td><a href=https://codeforces.com/contest/1416/submission/94006266>GNU C++17</a></td><td>27 September 2020 16:25:34</td></tr><tr><td>1399</td><td><a href=https://codeforces.com/contest/1416/problem/D>Graph and Queries</a></td><td>D</td><td>2600</td><td>data structures, dsu, graphs, implementation, trees</td><td><a href=https://codeforces.com/contest/1416/submission/93996097>GNU C++17</a></td><td>27 September 2020 15:56:55</td></tr><tr><td>1398</td><td><a href=https://codeforces.com/contest/1416/problem/E>Split</a></td><td>E</td><td>3200</td><td>binary search, data structures, dp, greedy</td><td><a href=https://codeforces.com/contest/1416/submission/93989598>GNU C++17</a></td><td>27 September 2020 15:41:35</td></tr><tr><td>1397</td><td><a href=https://codeforces.com/contest/1416/problem/B>Make Them Equal</a></td><td>B</td><td>2000</td><td>constructive algorithms, greedy, math</td><td><a href=https://codeforces.com/contest/1416/submission/93977851>GNU C++17</a></td><td>27 September 2020 15:19:09</td></tr><tr><td>1396</td><td><a href=https://codeforces.com/contest/1416/problem/C>XOR Inverse</a></td><td>C</td><td>2000</td><td>bitmasks, data structures, divide and conquer, dp, greedy, math, sortings, strings, trees</td><td><a href=https://codeforces.com/contest/1416/submission/93974213>GNU C++17</a></td><td>27 September 2020 15:13:46</td></tr><tr><td>1395</td><td><a href=https://codeforces.com/contest/1416/problem/A>k-Amazing Numbers</a></td><td>A</td><td>1500</td><td>binary search, data structures, implementation, two pointers</td><td><a href=https://codeforces.com/contest/1416/submission/93970422>GNU C++17</a></td><td>27 September 2020 15:08:48</td></tr><tr><td>1394</td><td><a href=https://codeforces.com/contest/1420/problem/E>Battle Lemmings</a></td><td>E</td><td>2500</td><td>dp, greedy</td><td><a href=https://codeforces.com/contest/1420/submission/93725673>GNU C++17</a></td><td>24 September 2020 18:39:06</td></tr><tr><td>1393</td><td><a href=https://codeforces.com/contest/1420/problem/C2>Pokémon Army (hard version)</a></td><td>C2</td><td>2100</td><td>data structures, divide and conquer, dp, greedy, implementation</td><td><a href=https://codeforces.com/contest/1420/submission/93722025>GNU C++17</a></td><td>24 September 2020 18:07:57</td></tr><tr><td>1392</td><td><a href=https://codeforces.com/contest/1420/problem/C1>Pokémon Army (easy version)</a></td><td>C1</td><td>1300</td><td>constructive algorithms, dp, greedy</td><td><a href=https://codeforces.com/contest/1420/submission/93721971>GNU C++17</a></td><td>24 September 2020 18:07:38</td></tr><tr><td>1391</td><td><a href=https://codeforces.com/contest/1420/problem/B>Rock and Lever</a></td><td>B</td><td>1200</td><td>bitmasks, math</td><td><a href=https://codeforces.com/contest/1420/submission/93721944>GNU C++17</a></td><td>24 September 2020 18:07:29</td></tr><tr><td>1390</td><td><a href=https://codeforces.com/contest/1420/problem/A>Cubes Sorting</a></td><td>A</td><td>900</td><td>math, sortings</td><td><a href=https://codeforces.com/contest/1420/submission/93721913>GNU C++17</a></td><td>24 September 2020 18:07:20</td></tr><tr><td>1389</td><td><a href=https://codeforces.com/contest/1420/problem/D>Rescue Nibel!</a></td><td>D</td><td>1800</td><td>combinatorics, data structures, sortings</td><td><a href=https://codeforces.com/contest/1420/submission/93721869>GNU C++17</a></td><td>24 September 2020 18:07:03</td></tr><tr><td>1388</td><td><a href=https://codeforces.com/contest/1418/problem/F>Equal Product</a></td><td>F</td><td>3000</td><td>data structures, math, number theory, two pointers</td><td><a href=https://codeforces.com/contest/1418/submission/92854209>GNU C++17</a></td><td>14 September 2020 19:11:31</td></tr><tr><td>1387</td><td><a href=https://codeforces.com/contest/1418/problem/G>Three Occurrences</a></td><td>G</td><td>2500</td><td>data structures, divide and conquer, hashing, two pointers</td><td><a href=https://codeforces.com/contest/1418/submission/92851496>GNU C++17</a></td><td>14 September 2020 18:33:24</td></tr><tr><td>1386</td><td><a href=https://codeforces.com/contest/1418/problem/E>Expected Damage</a></td><td>E</td><td>2400</td><td>binary search, combinatorics, probabilities</td><td><a href=https://codeforces.com/contest/1418/submission/92848941>GNU C++17</a></td><td>14 September 2020 18:02:48</td></tr><tr><td>1385</td><td><a href=https://codeforces.com/contest/1418/problem/D>Trash Problem</a></td><td>D</td><td>2100</td><td>data structures, implementation</td><td><a href=https://codeforces.com/contest/1418/submission/92847661>GNU C++17</a></td><td>14 September 2020 17:48:09</td></tr><tr><td>1384</td><td><a href=https://codeforces.com/contest/1418/problem/C>Mortal Kombat Tower</a></td><td>C</td><td>1500</td><td>dp, graphs, greedy, shortest paths</td><td><a href=https://codeforces.com/contest/1418/submission/92845615>GNU C++17</a></td><td>14 September 2020 17:25:55</td></tr><tr><td>1383</td><td><a href=https://codeforces.com/contest/1418/problem/B>Negative Prefixes</a></td><td>B</td><td>1300</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/1418/submission/92844166>GNU C++17</a></td><td>14 September 2020 17:11:05</td></tr><tr><td>1382</td><td><a href=https://codeforces.com/contest/1418/problem/A>Buying Torches</a></td><td>A</td><td>1000</td><td>math</td><td><a href=https://codeforces.com/contest/1418/submission/92843051>GNU C++17</a></td><td>14 September 2020 17:00:32</td></tr><tr><td>1381</td><td><a href=https://codeforces.com/contest/1407/problem/E>Egor in the Republic of Dagestan</a></td><td>E</td><td>2500</td><td>constructive algorithms, dfs and similar, dp, graphs, greedy, shortest paths</td><td><a href=https://codeforces.com/contest/1407/submission/92381728>GNU C++17</a></td><td>09 September 2020 19:19:37</td></tr><tr><td>1380</td><td><a href=https://codeforces.com/contest/1407/problem/D>Discrete Centrifugal Jumps</a></td><td>D</td><td>2200</td><td>data structures, dp, graphs</td><td><a href=https://codeforces.com/contest/1407/submission/92380944>GNU C++17</a></td><td>09 September 2020 19:03:27</td></tr><tr><td>1379</td><td><a href=https://codeforces.com/contest/1407/problem/C>Chocolate Bunny</a></td><td>C</td><td>1600</td><td>constructive algorithms, interactive, math, two pointers</td><td><a href=https://codeforces.com/contest/1407/submission/92379604>GNU C++17</a></td><td>09 September 2020 18:39:13</td></tr><tr><td>1378</td><td><a href=https://codeforces.com/contest/1407/problem/B>Big Vova</a></td><td>B</td><td>1300</td><td>brute force, greedy, math, number theory</td><td><a href=https://codeforces.com/contest/1407/submission/92379085>GNU C++17</a></td><td>09 September 2020 18:30:05</td></tr><tr><td>1377</td><td><a href=https://codeforces.com/contest/1407/problem/A>Ahahahahahahahaha</a></td><td>A</td><td>1100</td><td>constructive algorithms, math</td><td><a href=https://codeforces.com/contest/1407/submission/92378645>GNU C++17</a></td><td>09 September 2020 18:22:04</td></tr><tr><td>1376</td><td><a href=https://codeforces.com/contest/1404/problem/D>Game of Pairs</a></td><td>D</td><td>2800</td><td>constructive algorithms, dfs and similar, interactive, math, number theory</td><td><a href=https://codeforces.com/contest/1404/submission/92052815>GNU C++17</a></td><td>06 September 2020 15:26:23</td></tr><tr><td>1375</td><td><a href=https://codeforces.com/contest/1404/problem/C>Fixed Point Removal</a></td><td>C</td><td>2300</td><td>binary search, constructive algorithms, data structures, greedy, two pointers</td><td><a href=https://codeforces.com/contest/1404/submission/92038202>GNU C++17</a></td><td>06 September 2020 14:54:35</td></tr><tr><td>1374</td><td><a href=https://codeforces.com/contest/1404/problem/B>Tree Tag</a></td><td>B</td><td>1900</td><td>dfs and similar, dp, games, trees</td><td><a href=https://codeforces.com/contest/1404/submission/92031704>GNU C++17</a></td><td>06 September 2020 14:45:28</td></tr><tr><td>1373</td><td><a href=https://codeforces.com/contest/1404/problem/A>Balanced Bitstring</a></td><td>A</td><td>1500</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/1404/submission/92023610>GNU C++17</a></td><td>06 September 2020 14:37:30</td></tr><tr><td>1372</td><td><a href=https://codeforces.com/contest/1396/problem/E>Distance Matching</a></td><td>E</td><td>3200</td><td>constructive algorithms, dfs and similar, trees</td><td><a href=https://codeforces.com/contest/1396/submission/91420325>GNU C++17</a></td><td>30 August 2020 16:34:23</td></tr><tr><td>1371</td><td><a href=https://codeforces.com/contest/1396/problem/D>Rainbow Rectangles</a></td><td>D</td><td>3300</td><td>data structures, sortings, two pointers</td><td><a href=https://codeforces.com/contest/1396/submission/91388366>GNU C++17</a></td><td>30 August 2020 15:34:50</td></tr><tr><td>1370</td><td><a href=https://codeforces.com/contest/1396/problem/C>Monster Invaders</a></td><td>C</td><td>2300</td><td>dp, greedy, implementation</td><td><a href=https://codeforces.com/contest/1396/submission/91373061>GNU C++14</a></td><td>30 August 2020 15:07:20</td></tr><tr><td>1369</td><td><a href=https://codeforces.com/contest/1396/problem/B>Stoned Game</a></td><td>B</td><td>1800</td><td>brute force, constructive algorithms, games, greedy</td><td><a href=https://codeforces.com/contest/1396/submission/91358979>GNU C++14</a></td><td>30 August 2020 14:43:45</td></tr><tr><td>1368</td><td><a href=https://codeforces.com/contest/1396/problem/A>Multiples of Length</a></td><td>A</td><td>1600</td><td>constructive algorithms, greedy, number theory</td><td><a href=https://codeforces.com/contest/1396/submission/91354401>GNU C++17</a></td><td>30 August 2020 14:39:46</td></tr><tr><td>1367</td><td><a href=https://codeforces.com/contest/1392/problem/F>Omkar and Landslide</a></td><td>F</td><td>2400</td><td>binary search, constructive algorithms, data structures, greedy, math</td><td><a href=https://codeforces.com/contest/1392/submission/90153735>GNU C++17</a></td><td>16 August 2020 16:39:32</td></tr><tr><td>1366</td><td><a href=https://codeforces.com/contest/1392/problem/G>Omkar and Pies</a></td><td>G</td><td>2900</td><td>bitmasks, dfs and similar, dp, math, shortest paths</td><td><a href=https://codeforces.com/contest/1392/submission/90143993>GNU C++17</a></td><td>16 August 2020 16:07:46</td></tr><tr><td>1365</td><td><a href=https://codeforces.com/contest/1392/problem/H>ZS Shuffles Cards</a></td><td>H</td><td>3000</td><td>combinatorics, dp, math, probabilities</td><td><a href=https://codeforces.com/contest/1392/submission/90134242>GNU C++17</a></td><td>16 August 2020 15:42:54</td></tr><tr><td>1364</td><td><a href=https://codeforces.com/contest/1392/problem/E>Omkar and Duck</a></td><td>E</td><td>2100</td><td>bitmasks, constructive algorithms, interactive, math</td><td><a href=https://codeforces.com/contest/1392/submission/90099293>GNU C++17</a></td><td>16 August 2020 14:47:28</td></tr><tr><td>1363</td><td><a href=https://codeforces.com/contest/1392/problem/D>Omkar and Bed Wars</a></td><td>D</td><td>1700</td><td>dp, greedy</td><td><a href=https://codeforces.com/contest/1392/submission/90095139>GNU C++17</a></td><td>16 August 2020 14:42:40</td></tr><tr><td>1362</td><td><a href=https://codeforces.com/contest/1392/problem/C>Omkar and Waterslide</a></td><td>C</td><td>1200</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/1392/submission/90091305>GNU C++17</a></td><td>16 August 2020 14:38:52</td></tr><tr><td>1361</td><td><a href=https://codeforces.com/contest/1392/problem/B>Omkar and Infinity Clock</a></td><td>B</td><td>800</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/1392/submission/90089860>GNU C++17</a></td><td>16 August 2020 14:37:22</td></tr><tr><td>1360</td><td><a href=https://codeforces.com/contest/1392/problem/A>Omkar and Password</a></td><td>A</td><td>800</td><td>greedy, math</td><td><a href=https://codeforces.com/contest/1392/submission/90089492>GNU C++17</a></td><td>16 August 2020 14:35:59</td></tr><tr><td>1359</td><td><a href=https://codeforces.com/contest/1394/problem/D>Boboniu and Jianghu</a></td><td>D</td><td>2800</td><td>dp, greedy, sortings, trees</td><td><a href=https://codeforces.com/contest/1394/submission/89702037>GNU C++17</a></td><td>12 August 2020 15:35:11</td></tr><tr><td>1358</td><td><a href=https://codeforces.com/contest/1394/problem/B>Boboniu Walks on Graph</a></td><td>B</td><td>2300</td><td>brute force, dfs and similar, graphs, hashing</td><td><a href=https://codeforces.com/contest/1394/submission/89692882>GNU C++17</a></td><td>12 August 2020 15:19:22</td></tr><tr><td>1357</td><td><a href=https://codeforces.com/contest/1394/problem/A>Boboniu Chats with Du</a></td><td>A</td><td>1800</td><td>dp, greedy, sortings, two pointers</td><td><a href=https://codeforces.com/contest/1394/submission/89660007>GNU C++17</a></td><td>12 August 2020 14:40:13</td></tr><tr><td>1356</td><td><a href=https://codeforces.com/contest/1383/problem/F>Special Edges</a></td><td>F</td><td>3200</td><td>flows, graphs</td><td><a href=https://codeforces.com/contest/1383/submission/87911622>GNU C++17</a></td><td>24 July 2020 16:02:18</td></tr><tr><td>1355</td><td><a href=https://codeforces.com/contest/1383/problem/C>String Transformation 2</a></td><td>C</td><td>3100</td><td>bitmasks, dp, graphs, trees</td><td><a href=https://codeforces.com/contest/1383/submission/87903412>GNU C++17</a></td><td>24 July 2020 15:40:59</td></tr><tr><td>1354</td><td><a href=https://codeforces.com/contest/1383/problem/D>Rearrange</a></td><td>D</td><td>2800</td><td>brute force, constructive algorithms, graphs, greedy, sortings</td><td><a href=https://codeforces.com/contest/1383/submission/87893217>GNU C++17</a></td><td>24 July 2020 15:18:17</td></tr><tr><td>1353</td><td><a href=https://codeforces.com/contest/1383/problem/E>Strange Operation</a></td><td>E</td><td>2800</td><td>combinatorics, data structures, dp</td><td><a href=https://codeforces.com/contest/1383/submission/87883167>GNU C++17</a></td><td>24 July 2020 14:59:50</td></tr><tr><td>1352</td><td><a href=https://codeforces.com/contest/1383/problem/B>GameGame</a></td><td>B</td><td>1900</td><td>bitmasks, constructive algorithms, dp, games, greedy, math</td><td><a href=https://codeforces.com/contest/1383/submission/87873092>GNU C++17</a></td><td>24 July 2020 14:43:55</td></tr><tr><td>1351</td><td><a href=https://codeforces.com/contest/1383/problem/A>String Transformation 1</a></td><td>A</td><td>1700</td><td>dsu, graphs, greedy, sortings, strings, trees, two pointers</td><td><a href=https://codeforces.com/contest/1383/submission/87871300>GNU C++17</a></td><td>24 July 2020 14:38:10</td></tr><tr><td>1350</td><td><a href=https://codeforces.com/contest/1375/problem/H>Set Merging</a></td><td>H</td><td>3300</td><td>constructive algorithms, divide and conquer</td><td><a href=https://codeforces.com/contest/1375/submission/85990887>GNU C++17</a></td><td>04 July 2020 16:59:56</td></tr><tr><td>1349</td><td><a href=https://codeforces.com/contest/1375/problem/G>Tree Modification</a></td><td>G</td><td>2800</td><td>brute force, constructive algorithms, dfs and similar, graph matchings, graphs, trees</td><td><a href=https://codeforces.com/contest/1375/submission/85969935>GNU C++17</a></td><td>04 July 2020 15:58:41</td></tr><tr><td>1348</td><td><a href=https://codeforces.com/contest/1375/problem/E>Inversion SwapSort</a></td><td>E</td><td>2500</td><td>constructive algorithms, greedy, sortings</td><td><a href=https://codeforces.com/contest/1375/submission/85960652>GNU C++17</a></td><td>04 July 2020 15:36:43</td></tr><tr><td>1347</td><td><a href=https://codeforces.com/contest/1375/problem/F>Integer Game</a></td><td>F</td><td>2600</td><td>constructive algorithms, games, interactive, math</td><td><a href=https://codeforces.com/contest/1375/submission/85958098>GNU C++17</a></td><td>04 July 2020 15:31:16</td></tr><tr><td>1346</td><td><a href=https://codeforces.com/contest/1375/problem/D>Replace by MEX</a></td><td>D</td><td>1900</td><td>brute force, constructive algorithms, sortings</td><td><a href=https://codeforces.com/contest/1375/submission/85947097>GNU C++17</a></td><td>04 July 2020 15:11:06</td></tr><tr><td>1345</td><td><a href=https://codeforces.com/contest/1375/problem/C>Element Extermination</a></td><td>C</td><td>1400</td><td>constructive algorithms, data structures, greedy</td><td><a href=https://codeforces.com/contest/1375/submission/85942661>GNU C++17</a></td><td>04 July 2020 15:04:04</td></tr><tr><td>1344</td><td><a href=https://codeforces.com/contest/1375/problem/B>Neighbor Grid</a></td><td>B</td><td>1200</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/1375/submission/85931506>GNU C++17</a></td><td>04 July 2020 14:48:27</td></tr><tr><td>1343</td><td><a href=https://codeforces.com/contest/1375/problem/A>Sign Flipping</a></td><td>A</td><td>1100</td><td>constructive algorithms, math</td><td><a href=https://codeforces.com/contest/1375/submission/85930693>GNU C++17</a></td><td>04 July 2020 14:46:17</td></tr><tr><td>1342</td><td><a href=https://codeforces.com/contest/1368/problem/H1>Breadboard Capacity (easy version)</a></td><td>H1</td><td>3300</td><td>dp, flows, greedy</td><td><a href=https://codeforces.com/contest/1368/submission/84253937>GNU C++17</a></td><td>18 June 2020 17:05:22</td></tr><tr><td>1341</td><td><a href=https://codeforces.com/contest/1368/problem/F>Lamps on a Circle</a></td><td>F</td><td>2600</td><td>games, implementation, interactive, math</td><td><a href=https://codeforces.com/contest/1368/submission/84240610>GNU C++17</a></td><td>18 June 2020 16:33:39</td></tr><tr><td>1340</td><td><a href=https://codeforces.com/contest/1368/problem/E>Ski Accidents</a></td><td>E</td><td>2500</td><td>constructive algorithms, graphs, greedy</td><td><a href=https://codeforces.com/contest/1368/submission/84233462>GNU C++17</a></td><td>18 June 2020 16:17:36</td></tr><tr><td>1339</td><td><a href=https://codeforces.com/contest/1368/problem/G>Shifting Dominoes</a></td><td>G</td><td>3200</td><td>data structures, geometry, graphs, trees</td><td><a href=https://codeforces.com/contest/1368/submission/84230234>GNU C++17</a></td><td>18 June 2020 16:10:55</td></tr><tr><td>1338</td><td><a href=https://codeforces.com/contest/1368/problem/D>AND, OR and square sum</a></td><td>D</td><td>1700</td><td>bitmasks, greedy, math</td><td><a href=https://codeforces.com/contest/1368/submission/84175956>GNU C++17</a></td><td>18 June 2020 14:52:29</td></tr><tr><td>1337</td><td><a href=https://codeforces.com/contest/1368/problem/C>Even Picture</a></td><td>C</td><td>1500</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/1368/submission/84174240>GNU C++17</a></td><td>18 June 2020 14:50:49</td></tr><tr><td>1336</td><td><a href=https://codeforces.com/contest/1368/problem/B>Codeforces Subsequences</a></td><td>B</td><td>1500</td><td>brute force, constructive algorithms, greedy, math, strings</td><td><a href=https://codeforces.com/contest/1368/submission/84171375>GNU C++17</a></td><td>18 June 2020 14:47:48</td></tr><tr><td>1335</td><td><a href=https://codeforces.com/contest/1368/problem/A>C+=</a></td><td>A</td><td>800</td><td>brute force, greedy, implementation, math</td><td><a href=https://codeforces.com/contest/1368/submission/84170729>GNU C++17</a></td><td>18 June 2020 14:46:00</td></tr><tr><td>1334</td><td><a href=https://codeforces.com/contest/1361/problem/F>Johnny and New Toy</a></td><td>F</td><td>3300</td><td>data structures, implementation, math</td><td><a href=https://codeforces.com/contest/1361/submission/82547256>GNU C++17</a></td><td>04 June 2020 16:23:58</td></tr><tr><td>1333</td><td><a href=https://codeforces.com/contest/1361/problem/D>Johnny and James</a></td><td>D</td><td>2900</td><td>greedy, implementation, math, trees</td><td><a href=https://codeforces.com/contest/1361/submission/82532533>GNU C++17</a></td><td>04 June 2020 15:46:45</td></tr><tr><td>1332</td><td><a href=https://codeforces.com/contest/1361/problem/E>James and the Chase</a></td><td>E</td><td>3000</td><td>dfs and similar, graphs, probabilities, trees</td><td><a href=https://codeforces.com/contest/1361/submission/82521789>GNU C++17</a></td><td>04 June 2020 15:23:59</td></tr><tr><td>1331</td><td><a href=https://codeforces.com/contest/1361/problem/C>Johnny and Megan's Necklace</a></td><td>C</td><td>2500</td><td>binary search, bitmasks, constructive algorithms, dfs and similar, dsu, graphs</td><td><a href=https://codeforces.com/contest/1361/submission/82504494>GNU C++17</a></td><td>04 June 2020 14:56:30</td></tr><tr><td>1330</td><td><a href=https://codeforces.com/contest/1361/problem/B>Johnny and Grandmaster</a></td><td>B</td><td>1900</td><td>greedy, implementation, math, sortings</td><td><a href=https://codeforces.com/contest/1361/submission/82495175>GNU C++17</a></td><td>04 June 2020 14:44:23</td></tr><tr><td>1329</td><td><a href=https://codeforces.com/contest/1361/problem/A>Johnny and Contribution</a></td><td>A</td><td>1700</td><td>constructive algorithms, graphs, greedy, sortings</td><td><a href=https://codeforces.com/contest/1361/submission/82492363>GNU C++17</a></td><td>04 June 2020 14:38:10</td></tr><tr><td>1328</td><td><a href=https://codeforces.com/contest/1346/problem/H>Game with Segments</a></td><td>H</td><td>2700</td><td>*special, data structures, games</td><td><a href=https://codeforces.com/contest/1346/submission/81908741>Kotlin</a></td><td>29 May 2020 16:18:20</td></tr><tr><td>1327</td><td><a href=https://codeforces.com/contest/1346/problem/I>Pac-Man 2.0</a></td><td>I</td><td>2900</td><td>*special, dp</td><td><a href=https://codeforces.com/contest/1346/submission/81907156>Kotlin</a></td><td>29 May 2020 16:04:12</td></tr><tr><td>1326</td><td><a href=https://codeforces.com/contest/1346/problem/G>Two IP Cameras</a></td><td>G</td><td>2300</td><td>*special, math, number theory</td><td><a href=https://codeforces.com/contest/1346/submission/81899660>Kotlin</a></td><td>29 May 2020 15:06:28</td></tr><tr><td>1325</td><td><a href=https://codeforces.com/contest/1346/problem/F>Dune II: Battle For Arrakis</a></td><td>F</td><td>2000</td><td>*special, data structures, greedy, math</td><td><a href=https://codeforces.com/contest/1346/submission/81898123>Kotlin</a></td><td>29 May 2020 14:56:05</td></tr><tr><td>1324</td><td><a href=https://codeforces.com/contest/1346/problem/E>Magic Tricks</a></td><td>E</td><td>1700</td><td>*special, dp, graphs</td><td><a href=https://codeforces.com/contest/1346/submission/81896742>Kotlin</a></td><td>29 May 2020 14:47:20</td></tr><tr><td>1323</td><td><a href=https://codeforces.com/contest/1346/problem/D>Constructing the Dungeon</a></td><td>D</td><td>1600</td><td>*special, graphs, greedy</td><td><a href=https://codeforces.com/contest/1346/submission/81896273>Kotlin</a></td><td>29 May 2020 14:44:27</td></tr><tr><td>1322</td><td><a href=https://codeforces.com/contest/1346/problem/C>Spring Cleaning</a></td><td>C</td><td>1600</td><td>*special, greedy, sortings</td><td><a href=https://codeforces.com/contest/1346/submission/81895804>Kotlin</a></td><td>29 May 2020 14:41:30</td></tr><tr><td>1321</td><td><a href=https://codeforces.com/contest/1346/problem/B>Boot Camp</a></td><td>B</td><td>1400</td><td>*special, greedy</td><td><a href=https://codeforces.com/contest/1346/submission/81895278>Kotlin</a></td><td>29 May 2020 14:38:19</td></tr><tr><td>1320</td><td><a href=https://codeforces.com/contest/1346/problem/A>Color Revolution</a></td><td>A</td><td>1000</td><td>*special, math</td><td><a href=https://codeforces.com/contest/1346/submission/81895010>Kotlin</a></td><td>29 May 2020 14:35:58</td></tr><tr><td>1319</td><td><a href=https://codeforces.com/contest/1347/problem/E>Special Permutation</a></td><td>E</td><td>1600</td><td>*special, constructive algorithms</td><td><a href=https://codeforces.com/contest/1347/submission/81887964>Kotlin</a></td><td>29 May 2020 13:14:30</td></tr><tr><td>1318</td><td><a href=https://codeforces.com/contest/1347/problem/D>Alice, Bob and Candies</a></td><td>D</td><td>1300</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1347/submission/81887414>Kotlin</a></td><td>29 May 2020 13:07:33</td></tr><tr><td>1317</td><td><a href=https://codeforces.com/contest/1347/problem/C>Sum of Round Numbers</a></td><td>C</td><td>800</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1347/submission/81887157>Kotlin</a></td><td>29 May 2020 13:04:14</td></tr><tr><td>1316</td><td><a href=https://codeforces.com/contest/1347/problem/B>Square?</a></td><td>B</td><td>900</td><td>*special, implementation, math</td><td><a href=https://codeforces.com/contest/1347/submission/81886832>Kotlin</a></td><td>29 May 2020 13:00:48</td></tr><tr><td>1315</td><td><a href=https://codeforces.com/contest/1344/problem/E>Train Tracks</a></td><td>E</td><td>3100</td><td>data structures, trees</td><td><a href=https://codeforces.com/contest/1344/submission/79212690>GNU C++17</a></td><td>06 May 2020 22:36:42</td></tr><tr><td>1314</td><td><a href=https://codeforces.com/contest/1349/problem/B>Orac and Medians</a></td><td>B</td><td>2000</td><td>constructive algorithms, greedy, math</td><td><a href=https://codeforces.com/contest/1349/submission/79831429>GNU C++17</a></td><td>12 May 2020 12:54:57</td></tr><tr><td>1313</td><td><a href=https://codeforces.com/contest/1349/problem/C>Orac and Game of Life</a></td><td>C</td><td>2000</td><td>dfs and similar, graphs, implementation, shortest paths</td><td><a href=https://codeforces.com/contest/1349/submission/79825864>GNU C++17</a></td><td>12 May 2020 12:47:50</td></tr><tr><td>1312</td><td><a href=https://codeforces.com/contest/1349/problem/A>Orac and LCM</a></td><td>A</td><td>1600</td><td>data structures, math, number theory</td><td><a href=https://codeforces.com/contest/1349/submission/79816948>GNU C++17</a></td><td>12 May 2020 12:38:52</td></tr><tr><td>1311</td><td><a href=https://codeforces.com/contest/1344/problem/F>Piet's Palette</a></td><td>F</td><td>3200</td><td>matrices</td><td><a href=https://codeforces.com/contest/1344/submission/79201012>GNU C++17</a></td><td>06 May 2020 16:39:45</td></tr><tr><td>1310</td><td><a href=https://codeforces.com/contest/1344/problem/D>Résumé Review</a></td><td>D</td><td>2700</td><td>binary search, greedy, math</td><td><a href=https://codeforces.com/contest/1344/submission/79172745>GNU C++17</a></td><td>06 May 2020 15:10:32</td></tr><tr><td>1309</td><td><a href=https://codeforces.com/contest/1344/problem/C>Quantifier Question</a></td><td>C</td><td>2600</td><td>dfs and similar, dp, graphs, math</td><td><a href=https://codeforces.com/contest/1344/submission/79163314>GNU C++17</a></td><td>06 May 2020 14:55:51</td></tr><tr><td>1308</td><td><a href=https://codeforces.com/contest/1344/problem/B>Monopole Magnets</a></td><td>B</td><td>2000</td><td>constructive algorithms, dfs and similar, dsu, graphs</td><td><a href=https://codeforces.com/contest/1344/submission/79154263>GNU C++17</a></td><td>06 May 2020 14:45:09</td></tr><tr><td>1307</td><td><a href=https://codeforces.com/contest/1344/problem/A>Hilbert's Hotel</a></td><td>A</td><td>1600</td><td>math, number theory, sortings</td><td><a href=https://codeforces.com/contest/1344/submission/79148790>GNU C++17</a></td><td>06 May 2020 14:37:14</td></tr><tr><td>1306</td><td><a href=https://codeforces.com/contest/1340/problem/C>Nastya and Unexpected Guest</a></td><td>C</td><td>2400</td><td>dfs and similar, dp, graphs, shortest paths</td><td><a href=https://codeforces.com/contest/1340/submission/77808028>GNU C++17</a></td><td>23 April 2020 15:33:47</td></tr><tr><td>1305</td><td><a href=https://codeforces.com/contest/1340/problem/D>Nastya and Time Machine</a></td><td>D</td><td>2600</td><td>constructive algorithms, dfs and similar, graphs, trees</td><td><a href=https://codeforces.com/contest/1340/submission/77803432>GNU C++17</a></td><td>23 April 2020 15:26:18</td></tr><tr><td>1304</td><td><a href=https://codeforces.com/contest/1340/problem/A>Nastya and Strange Generator</a></td><td>A</td><td>1500</td><td>brute force, data structures, greedy, implementation</td><td><a href=https://codeforces.com/contest/1340/submission/77775868>GNU C++17</a></td><td>23 April 2020 14:54:02</td></tr><tr><td>1303</td><td><a href=https://codeforces.com/contest/1340/problem/B>Nastya and Scoreboard</a></td><td>B</td><td>1700</td><td>bitmasks, dp, graphs, greedy</td><td><a href=https://codeforces.com/contest/1340/submission/77770331>GNU C++17</a></td><td>23 April 2020 14:49:29</td></tr><tr><td>1302</td><td><a href=https://codeforces.com/contest/1336/problem/D>Yui and Mahjong Set</a></td><td>D</td><td>3200</td><td>constructive algorithms, interactive</td><td><a href=https://codeforces.com/contest/1336/submission/76891278>GNU C++17</a></td><td>15 April 2020 16:55:11</td></tr><tr><td>1301</td><td><a href=https://codeforces.com/contest/1336/problem/C>Kaavi and Magic Spell</a></td><td>C</td><td>2200</td><td>dp, strings</td><td><a href=https://codeforces.com/contest/1336/submission/76845451>GNU C++17</a></td><td>15 April 2020 15:11:05</td></tr><tr><td>1300</td><td><a href=https://codeforces.com/contest/1336/problem/B>Xenia and Colorful Gems</a></td><td>B</td><td>1700</td><td>binary search, greedy, math, sortings, two pointers</td><td><a href=https://codeforces.com/contest/1336/submission/76815615>GNU C++17</a></td><td>15 April 2020 14:42:40</td></tr><tr><td>1299</td><td><a href=https://codeforces.com/contest/1336/problem/A>Linova and Kingdom</a></td><td>A</td><td>1600</td><td>dfs and similar, dp, greedy, sortings, trees</td><td><a href=https://codeforces.com/contest/1336/submission/76808444>GNU C++17</a></td><td>15 April 2020 14:38:24</td></tr><tr><td>1298</td><td><a href=https://codeforces.com/contest/1335/problem/F>Robots on a Grid</a></td><td>F</td><td>2200</td><td>data structures, dfs and similar, dsu, graphs, greedy, matrices</td><td><a href=https://codeforces.com/contest/1335/submission/76532374>GNU C++17</a></td><td>13 April 2020 14:57:33</td></tr><tr><td>1297</td><td><a href=https://codeforces.com/contest/1335/problem/E2>Three Blocks Palindrome (hard version)</a></td><td>E2</td><td>1800</td><td>brute force, data structures, dp, two pointers</td><td><a href=https://codeforces.com/contest/1335/submission/76520445>GNU C++17</a></td><td>13 April 2020 14:47:40</td></tr><tr><td>1296</td><td><a href=https://codeforces.com/contest/1335/problem/E1>Three Blocks Palindrome (easy version)</a></td><td>E1</td><td>1700</td><td>binary search, brute force, data structures, dp, two pointers</td><td><a href=https://codeforces.com/contest/1335/submission/76519193>GNU C++17</a></td><td>13 April 2020 14:46:46</td></tr><tr><td>1295</td><td><a href=https://codeforces.com/contest/1335/problem/D>Anti-Sudoku</a></td><td>D</td><td>1300</td><td>constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/1335/submission/76511824>GNU C++17</a></td><td>13 April 2020 14:41:48</td></tr><tr><td>1294</td><td><a href=https://codeforces.com/contest/1335/problem/C>Two Teams Composing</a></td><td>C</td><td>1100</td><td>binary search, greedy, implementation, sortings</td><td><a href=https://codeforces.com/contest/1335/submission/76505406>GNU C++17</a></td><td>13 April 2020 14:38:49</td></tr><tr><td>1293</td><td><a href=https://codeforces.com/contest/1338/problem/E>JYPnation</a></td><td>E</td><td>3500</td><td>graphs</td><td><a href=https://codeforces.com/contest/1338/submission/76397300>GNU C++17</a></td><td>12 April 2020 15:51:17</td></tr><tr><td>1292</td><td><a href=https://codeforces.com/contest/1338/problem/D>Nested Rubber Bands</a></td><td>D</td><td>2700</td><td>constructive algorithms, dfs and similar, dp, math, trees</td><td><a href=https://codeforces.com/contest/1338/submission/76383105>GNU C++17</a></td><td>12 April 2020 15:19:15</td></tr><tr><td>1291</td><td><a href=https://codeforces.com/contest/1338/problem/C>Perfect Triples</a></td><td>C</td><td>2200</td><td>bitmasks, brute force, constructive algorithms, divide and conquer, math</td><td><a href=https://codeforces.com/contest/1338/submission/76355433>GNU C++17</a></td><td>12 April 2020 14:32:32</td></tr><tr><td>1290</td><td><a href=https://codeforces.com/contest/1338/problem/B>Edge Weight Assignment</a></td><td>B</td><td>1800</td><td>bitmasks, constructive algorithms, dfs and similar, greedy, math, trees</td><td><a href=https://codeforces.com/contest/1338/submission/76346805>GNU C++17</a></td><td>12 April 2020 14:21:50</td></tr><tr><td>1289</td><td><a href=https://codeforces.com/contest/1338/problem/A>Powered Addition</a></td><td>A</td><td>1500</td><td>greedy, math</td><td><a href=https://codeforces.com/contest/1338/submission/76334223>GNU C++17</a></td><td>12 April 2020 14:08:24</td></tr><tr><td>1288</td><td><a href=https://codeforces.com/contest/1329/problem/D>Dreamoon Likes Strings</a></td><td>D</td><td>3100</td><td>constructive algorithms, data structures</td><td><a href=https://codeforces.com/contest/1329/submission/75398925>GNU C++17</a></td><td>03 April 2020 16:01:50</td></tr><tr><td>1287</td><td><a href=https://codeforces.com/contest/1329/problem/C>Drazil Likes Heap</a></td><td>C</td><td>2400</td><td>constructive algorithms, data structures, greedy, implementation</td><td><a href=https://codeforces.com/contest/1329/submission/75371549>GNU C++17</a></td><td>03 April 2020 15:05:57</td></tr><tr><td>1286</td><td><a href=https://codeforces.com/contest/1329/problem/A>Dreamoon Likes Coloring</a></td><td>A</td><td>1800</td><td>constructive algorithms, greedy, implementation, math</td><td><a href=https://codeforces.com/contest/1329/submission/75356344>GNU C++17</a></td><td>03 April 2020 14:43:03</td></tr><tr><td>1285</td><td><a href=https://codeforces.com/contest/1329/problem/B>Dreamoon Likes Sequences</a></td><td>B</td><td>1700</td><td>bitmasks, combinatorics, math</td><td><a href=https://codeforces.com/contest/1329/submission/75353754>GNU C++17</a></td><td>03 April 2020 14:38:45</td></tr><tr><td>1284</td><td><a href=https://codeforces.com/contest/1331/problem/B>Limericks</a></td><td>B</td><td>undefined</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/1331/submission/75138864>GNU C++17</a></td><td>01 April 2020 15:34:49</td></tr><tr><td>1283</td><td><a href=https://codeforces.com/contest/1331/problem/H>It's showtime</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1331/submission/75136973>UnknownX</a></td><td>01 April 2020 15:30:53</td></tr><tr><td>1282</td><td><a href=https://codeforces.com/contest/1331/problem/G>Lingua Romana</a></td><td>G</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1331/submission/75126515>GNU C++17</a></td><td>01 April 2020 15:11:46</td></tr><tr><td>1281</td><td><a href=https://codeforces.com/contest/1331/problem/E>Jordan Smiley</a></td><td>E</td><td>undefined</td><td>dfs and similar, geometry, implementation</td><td><a href=https://codeforces.com/contest/1331/submission/75121826>GNU C++17</a></td><td>01 April 2020 15:04:28</td></tr><tr><td>1280</td><td><a href=https://codeforces.com/contest/1331/problem/D>Again?</a></td><td>D</td><td>undefined</td><td>implementation</td><td><a href=https://codeforces.com/contest/1331/submission/75115172>GNU C++17</a></td><td>01 April 2020 14:56:16</td></tr><tr><td>1279</td><td><a href=https://codeforces.com/contest/1331/problem/C>...And after happily lived ever they</a></td><td>C</td><td>undefined</td><td>bitmasks</td><td><a href=https://codeforces.com/contest/1331/submission/75114312>GNU C++17</a></td><td>01 April 2020 14:55:15</td></tr><tr><td>1278</td><td><a href=https://codeforces.com/contest/1331/problem/F>Elementary!</a></td><td>F</td><td>undefined</td><td>brute force, dp, strings</td><td><a href=https://codeforces.com/contest/1331/submission/75100523>GNU C++17</a></td><td>01 April 2020 14:43:06</td></tr><tr><td>1277</td><td><a href=https://codeforces.com/contest/1331/problem/A>Is it rated?</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1331/submission/75093592>GNU C++17</a></td><td>01 April 2020 14:38:10</td></tr><tr><td>1276</td><td><a href=https://codeforces.com/contest/1326/problem/F2>Wise Men (Hard Version)</a></td><td>F2</td><td>3200</td><td>bitmasks, dp, math</td><td><a href=https://codeforces.com/contest/1326/submission/73707244>GNU C++17</a></td><td>19 March 2020 15:51:52</td></tr><tr><td>1275</td><td><a href=https://codeforces.com/contest/1326/problem/E>Bombs</a></td><td>E</td><td>2400</td><td>data structures, two pointers</td><td><a href=https://codeforces.com/contest/1326/submission/73691711>GNU C++17</a></td><td>19 March 2020 15:17:37</td></tr><tr><td>1274</td><td><a href=https://codeforces.com/contest/1326/problem/F1>Wise Men (Easy Version)</a></td><td>F1</td><td>2600</td><td>bitmasks, brute force, dp, meet-in-the-middle</td><td><a href=https://codeforces.com/contest/1326/submission/73688148>GNU C++17</a></td><td>19 March 2020 15:10:50</td></tr><tr><td>1273</td><td><a href=https://codeforces.com/contest/1326/problem/D1>Prefix-Suffix Palindrome (Easy version)</a></td><td>D1</td><td>1500</td><td>hashing, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/1326/submission/73675799>GNU C++17</a></td><td>19 March 2020 14:51:50</td></tr><tr><td>1272</td><td><a href=https://codeforces.com/contest/1326/problem/D2>Prefix-Suffix Palindrome (Hard version)</a></td><td>D2</td><td>1800</td><td>binary search, greedy, hashing, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/1326/submission/73675730>GNU C++17</a></td><td>19 March 2020 14:51:44</td></tr><tr><td>1271</td><td><a href=https://codeforces.com/contest/1326/problem/C>Permutation Partitions</a></td><td>C</td><td>1300</td><td>combinatorics, greedy, math</td><td><a href=https://codeforces.com/contest/1326/submission/73665615>GNU C++17</a></td><td>19 March 2020 14:41:08</td></tr><tr><td>1270</td><td><a href=https://codeforces.com/contest/1326/problem/B>Maximums</a></td><td>B</td><td>900</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/1326/submission/73663786>GNU C++17</a></td><td>19 March 2020 14:39:24</td></tr><tr><td>1269</td><td><a href=https://codeforces.com/contest/1326/problem/A>Bad Ugly Numbers</a></td><td>A</td><td>1000</td><td>constructive algorithms, number theory</td><td><a href=https://codeforces.com/contest/1326/submission/73662259>GNU C++17</a></td><td>19 March 2020 14:37:32</td></tr><tr><td>1268</td><td><a href=https://codeforces.com/contest/1305/problem/H>Kuroni the Private Tutor</a></td><td>H</td><td>3500</td><td>binary search, greedy</td><td><a href=https://codeforces.com/contest/1305/submission/72346555>GNU C++17</a></td><td>03 March 2020 16:16:03</td></tr><tr><td>1267</td><td><a href=https://codeforces.com/contest/1305/problem/F>Kuroni and the Punishment</a></td><td>F</td><td>2500</td><td>math, number theory, probabilities</td><td><a href=https://codeforces.com/contest/1305/submission/72330171>GNU C++17</a></td><td>03 March 2020 15:20:36</td></tr><tr><td>1266</td><td><a href=https://codeforces.com/contest/1305/problem/D>Kuroni and the Celebration</a></td><td>D</td><td>1900</td><td>constructive algorithms, dfs and similar, interactive, trees</td><td><a href=https://codeforces.com/contest/1305/submission/72324838>GNU C++17</a></td><td>03 March 2020 15:05:07</td></tr><tr><td>1265</td><td><a href=https://codeforces.com/contest/1305/problem/E>Kuroni and the Score Distribution</a></td><td>E</td><td>2200</td><td>constructive algorithms, greedy, implementation, math</td><td><a href=https://codeforces.com/contest/1305/submission/72323181>GNU C++17</a></td><td>03 March 2020 15:00:38</td></tr><tr><td>1264</td><td><a href=https://codeforces.com/contest/1305/problem/B>Kuroni and Simple Strings</a></td><td>B</td><td>1200</td><td>constructive algorithms, greedy, strings, two pointers</td><td><a href=https://codeforces.com/contest/1305/submission/72315845>GNU C++17</a></td><td>03 March 2020 14:42:23</td></tr><tr><td>1263</td><td><a href=https://codeforces.com/contest/1305/problem/C>Kuroni and Impossible Calculation</a></td><td>C</td><td>1600</td><td>brute force, combinatorics, math, number theory</td><td><a href=https://codeforces.com/contest/1305/submission/72314331>GNU C++17</a></td><td>03 March 2020 14:40:03</td></tr><tr><td>1262</td><td><a href=https://codeforces.com/contest/1305/problem/A>Kuroni and the Gifts</a></td><td>A</td><td>800</td><td>brute force, constructive algorithms, greedy, sortings</td><td><a href=https://codeforces.com/contest/1305/submission/72311492>GNU C++17</a></td><td>03 March 2020 14:36:19</td></tr><tr><td>1261</td><td><a href=https://codeforces.com/contest/1297/problem/I>Falling Blocks</a></td><td>I</td><td>undefined</td><td>*special, data structures</td><td><a href=https://codeforces.com/contest/1297/submission/71987288>Kotlin</a></td><td>27 February 2020 15:50:45</td></tr><tr><td>1260</td><td><a href=https://codeforces.com/contest/1297/problem/G>M-numbers</a></td><td>G</td><td>undefined</td><td>*special, dp, math</td><td><a href=https://codeforces.com/contest/1297/submission/71982605>Kotlin</a></td><td>27 February 2020 14:48:43</td></tr><tr><td>1259</td><td><a href=https://codeforces.com/contest/1297/problem/H>Paint the String</a></td><td>H</td><td>undefined</td><td>*special, dp, strings</td><td><a href=https://codeforces.com/contest/1297/submission/71981312>Kotlin</a></td><td>27 February 2020 14:34:10</td></tr><tr><td>1258</td><td><a href=https://codeforces.com/contest/1297/problem/E>Modernization of Treeland</a></td><td>E</td><td>undefined</td><td>*special, dfs and similar, trees</td><td><a href=https://codeforces.com/contest/1297/submission/71979950>Kotlin</a></td><td>27 February 2020 14:18:33</td></tr><tr><td>1257</td><td><a href=https://codeforces.com/contest/1297/problem/F>Movie Fan</a></td><td>F</td><td>undefined</td><td>*special, data structures, greedy, implementation, sortings</td><td><a href=https://codeforces.com/contest/1297/submission/71979860>Kotlin</a></td><td>27 February 2020 14:17:30</td></tr><tr><td>1256</td><td><a href=https://codeforces.com/contest/1297/problem/D>Bonus Distribution </a></td><td>D</td><td>undefined</td><td>*special, binary search, greedy, sortings</td><td><a href=https://codeforces.com/contest/1297/submission/71978118>Kotlin</a></td><td>27 February 2020 13:59:38</td></tr><tr><td>1255</td><td><a href=https://codeforces.com/contest/1297/problem/C>Dream Team</a></td><td>C</td><td>undefined</td><td>*special, greedy</td><td><a href=https://codeforces.com/contest/1297/submission/71976730>Kotlin</a></td><td>27 February 2020 13:46:52</td></tr><tr><td>1254</td><td><a href=https://codeforces.com/contest/1297/problem/B>Cartoons</a></td><td>B</td><td>undefined</td><td>*special, implementation, sortings</td><td><a href=https://codeforces.com/contest/1297/submission/71976328>Kotlin</a></td><td>27 February 2020 13:43:03</td></tr><tr><td>1253</td><td><a href=https://codeforces.com/contest/1297/problem/A>Likes Display</a></td><td>A</td><td>undefined</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1297/submission/71976013>Kotlin</a></td><td>27 February 2020 13:40:10</td></tr><tr><td>1252</td><td><a href=https://codeforces.com/contest/1310/problem/B>Double Elimination</a></td><td>B</td><td>2500</td><td>dp, implementation</td><td><a href=https://codeforces.com/contest/1310/submission/71765655>GNU C++17</a></td><td>24 February 2020 13:26:04</td></tr><tr><td>1251</td><td><a href=https://codeforces.com/contest/1310/problem/D>Tourism</a></td><td>D</td><td>2300</td><td>dp, graphs, probabilities</td><td><a href=https://codeforces.com/contest/1310/submission/71708864>GNU C++17</a></td><td>23 February 2020 16:35:56</td></tr><tr><td>1250</td><td><a href=https://codeforces.com/contest/1298/problem/F1>Median on Segments (Permutations Edition)</a></td><td>F1</td><td>undefined</td><td>*special, sortings</td><td><a href=https://codeforces.com/contest/1298/submission/71760512>Kotlin</a></td><td>24 February 2020 11:42:41</td></tr><tr><td>1249</td><td><a href=https://codeforces.com/contest/1298/problem/F2>Median on Segments (General Case Edition)</a></td><td>F2</td><td>undefined</td><td>*special, sortings</td><td><a href=https://codeforces.com/contest/1298/submission/71760469>Kotlin</a></td><td>24 February 2020 11:41:53</td></tr><tr><td>1248</td><td><a href=https://codeforces.com/contest/1298/problem/E>Mentors</a></td><td>E</td><td>undefined</td><td>*special, data structures, implementation</td><td><a href=https://codeforces.com/contest/1298/submission/71759102>Kotlin</a></td><td>24 February 2020 11:11:16</td></tr><tr><td>1247</td><td><a href=https://codeforces.com/contest/1298/problem/D>Bus Video System</a></td><td>D</td><td>undefined</td><td>*special, combinatorics, math</td><td><a href=https://codeforces.com/contest/1298/submission/71758724>Kotlin</a></td><td>24 February 2020 11:01:36</td></tr><tr><td>1246</td><td><a href=https://codeforces.com/contest/1298/problem/C>File Name</a></td><td>C</td><td>undefined</td><td>*special, strings</td><td><a href=https://codeforces.com/contest/1298/submission/71758454>Kotlin</a></td><td>24 February 2020 10:54:57</td></tr><tr><td>1245</td><td><a href=https://codeforces.com/contest/1298/problem/B>Remove Duplicates</a></td><td>B</td><td>undefined</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1298/submission/71758096>Kotlin</a></td><td>24 February 2020 10:47:23</td></tr><tr><td>1244</td><td><a href=https://codeforces.com/contest/1298/problem/A>Restoring Three Numbers</a></td><td>A</td><td>undefined</td><td>*special, math</td><td><a href=https://codeforces.com/contest/1298/submission/71757922>Kotlin</a></td><td>24 February 2020 10:43:17</td></tr><tr><td>1243</td><td><a href=https://codeforces.com/contest/1310/problem/F>Bad Cryptography</a></td><td>F</td><td>3400</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/1310/submission/71727149>GNU C++17</a></td><td>23 February 2020 18:33:38</td></tr><tr><td>1242</td><td><a href=https://codeforces.com/contest/1310/problem/C>Au Pont Rouge</a></td><td>C</td><td>2800</td><td>binary search, dp, strings</td><td><a href=https://codeforces.com/contest/1310/submission/71717859>GNU C++17</a></td><td>23 February 2020 17:28:54</td></tr><tr><td>1241</td><td><a href=https://codeforces.com/contest/1310/problem/E>Strange Function</a></td><td>E</td><td>2900</td><td>dp</td><td><a href=https://codeforces.com/contest/1310/submission/71707282>GNU C++17</a></td><td>23 February 2020 16:28:27</td></tr><tr><td>1240</td><td><a href=https://codeforces.com/contest/1310/problem/A>Recommendations</a></td><td>A</td><td>1700</td><td>data structures, greedy, sortings</td><td><a href=https://codeforces.com/contest/1310/submission/71702546>GNU C++17</a></td><td>23 February 2020 16:09:00</td></tr><tr><td>1239</td><td><a href=https://codeforces.com/contest/1307/problem/E>Cow and Treats</a></td><td>E</td><td>2500</td><td>binary search, combinatorics, dp, greedy, implementation, math</td><td><a href=https://codeforces.com/contest/1307/submission/71303695>GNU C++17</a></td><td>17 February 2020 16:10:56</td></tr><tr><td>1238</td><td><a href=https://codeforces.com/contest/1307/problem/D>Cow and Fields</a></td><td>D</td><td>1900</td><td>binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings</td><td><a href=https://codeforces.com/contest/1307/submission/71296119>GNU C++17</a></td><td>17 February 2020 15:53:34</td></tr><tr><td>1237</td><td><a href=https://codeforces.com/contest/1307/problem/C>Cow and Message</a></td><td>C</td><td>1500</td><td>brute force, dp, math, strings</td><td><a href=https://codeforces.com/contest/1307/submission/71289237>GNU C++17</a></td><td>17 February 2020 15:40:57</td></tr><tr><td>1236</td><td><a href=https://codeforces.com/contest/1307/problem/B>Cow and Friend</a></td><td>B</td><td>1300</td><td>geometry, greedy, math</td><td><a href=https://codeforces.com/contest/1307/submission/71287424>GNU C++17</a></td><td>17 February 2020 15:37:41</td></tr><tr><td>1235</td><td><a href=https://codeforces.com/contest/1307/problem/A>Cow and Haybales</a></td><td>A</td><td>800</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/1307/submission/71287149>GNU C++17</a></td><td>17 February 2020 15:35:54</td></tr><tr><td>1234</td><td><a href=https://codeforces.com/contest/1302/problem/J>Keep talking and nobody explodes -- hard</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1302/submission/70177768>GNU C++17</a></td><td>03 February 2020 19:02:08</td></tr><tr><td>1233</td><td><a href=https://codeforces.com/contest/1302/problem/F>Keep talking and nobody explodes -- easy</a></td><td>F</td><td>undefined</td><td>bitmasks, brute force, expression parsing</td><td><a href=https://codeforces.com/contest/1302/submission/70176610>GNU C++17</a></td><td>03 February 2020 18:41:52</td></tr><tr><td>1232</td><td><a href=https://codeforces.com/contest/1302/problem/H>Who needs suffix structures?</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1302/submission/70176293>GNU C++17</a></td><td>03 February 2020 18:36:28</td></tr><tr><td>1231</td><td><a href=https://codeforces.com/contest/1302/problem/E>Amazing bitset</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1302/submission/70174952>GNU C++17</a></td><td>03 February 2020 18:16:26</td></tr><tr><td>1230</td><td><a href=https://codeforces.com/contest/1302/problem/D>Dijkstra</a></td><td>D</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1302/submission/70174488>GNU C++17</a></td><td>03 February 2020 18:10:04</td></tr><tr><td>1229</td><td><a href=https://codeforces.com/contest/1302/problem/B>DAG</a></td><td>B</td><td>undefined</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/1302/submission/70172154>GNU C++17</a></td><td>03 February 2020 17:39:15</td></tr><tr><td>1228</td><td><a href=https://codeforces.com/contest/1302/problem/C>Segment tree or Fenwick?</a></td><td>C</td><td>undefined</td><td>data structures</td><td><a href=https://codeforces.com/contest/1302/submission/70168844>GNU C++17</a></td><td>03 February 2020 16:59:15</td></tr><tr><td>1227</td><td><a href=https://codeforces.com/contest/1302/problem/A>Nash equilibrium</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1302/submission/70167082>GNU C++17</a></td><td>03 February 2020 16:40:16</td></tr><tr><td>1226</td><td><a href=https://codeforces.com/contest/1290/problem/C>Prefix Enlightenment</a></td><td>C</td><td>2400</td><td>dfs and similar, dsu, graphs</td><td><a href=https://codeforces.com/contest/1290/submission/70064543>GNU C++17</a></td><td>02 February 2020 15:17:41</td></tr><tr><td>1225</td><td><a href=https://codeforces.com/contest/1290/problem/D>Coffee Varieties (hard version)</a></td><td>D</td><td>3000</td><td>constructive algorithms, graphs, interactive</td><td><a href=https://codeforces.com/contest/1290/submission/70071102>GNU C++17</a></td><td>02 February 2020 15:40:38</td></tr><tr><td>1224</td><td><a href=https://codeforces.com/contest/1290/problem/F>Making Shapes</a></td><td>F</td><td>3500</td><td>dp</td><td><a href=https://codeforces.com/contest/1290/submission/70059398>GNU C++17</a></td><td>02 February 2020 15:02:09</td></tr><tr><td>1223</td><td><a href=https://codeforces.com/contest/1290/problem/A>Mind Control</a></td><td>A</td><td>1600</td><td>brute force, data structures, implementation</td><td><a href=https://codeforces.com/contest/1290/submission/70040962>GNU C++17</a></td><td>02 February 2020 14:20:30</td></tr><tr><td>1222</td><td><a href=https://codeforces.com/contest/1290/problem/B>Irreducible Anagrams</a></td><td>B</td><td>1800</td><td>binary search, constructive algorithms, data structures, strings, two pointers</td><td><a href=https://codeforces.com/contest/1290/submission/70038396>GNU C++17</a></td><td>02 February 2020 14:15:40</td></tr><tr><td>1221</td><td><a href=https://codeforces.com/contest/1292/problem/E>Rin and The Unknown Flower</a></td><td>E</td><td>3500</td><td>constructive algorithms, greedy, interactive, math</td><td><a href=https://codeforces.com/contest/1292/submission/69145246>GNU C++17</a></td><td>19 January 2020 15:32:49</td></tr><tr><td>1220</td><td><a href=https://codeforces.com/contest/1292/problem/C>Xenon's Attack on the Gangs</a></td><td>C</td><td>2300</td><td>combinatorics, dfs and similar, dp, greedy, trees</td><td><a href=https://codeforces.com/contest/1292/submission/69117304>GNU C++17</a></td><td>19 January 2020 14:10:14</td></tr><tr><td>1219</td><td><a href=https://codeforces.com/contest/1292/problem/D>Chaotic V.</a></td><td>D</td><td>2700</td><td>dp, graphs, greedy, math, number theory, trees</td><td><a href=https://codeforces.com/contest/1292/submission/69114171>GNU C++17</a></td><td>19 January 2020 14:04:03</td></tr><tr><td>1218</td><td><a href=https://codeforces.com/contest/1292/problem/B>Aroma's Search</a></td><td>B</td><td>1700</td><td>brute force, constructive algorithms, geometry, greedy, implementation</td><td><a href=https://codeforces.com/contest/1292/submission/69100917>GNU C++17</a></td><td>19 January 2020 13:41:21</td></tr><tr><td>1217</td><td><a href=https://codeforces.com/contest/1292/problem/A>NEKO's Maze Game</a></td><td>A</td><td>1400</td><td>data structures, dsu, implementation</td><td><a href=https://codeforces.com/contest/1292/submission/69100064>GNU C++17</a></td><td>19 January 2020 13:37:19</td></tr><tr><td>1216</td><td><a href=https://codeforces.com/contest/1284/problem/F>New Year and Social Network</a></td><td>F</td><td>3200</td><td>data structures, graph matchings, graphs, math, trees</td><td><a href=https://codeforces.com/contest/1284/submission/68184113>GNU C++17</a></td><td>04 January 2020 13:15:51</td></tr><tr><td>1215</td><td><a href=https://codeforces.com/contest/1284/problem/E>New Year and Castle Construction</a></td><td>E</td><td>2500</td><td>combinatorics, geometry, math, sortings</td><td><a href=https://codeforces.com/contest/1284/submission/68177272>GNU C++17</a></td><td>04 January 2020 12:43:21</td></tr><tr><td>1214</td><td><a href=https://codeforces.com/contest/1284/problem/D>New Year and Conference</a></td><td>D</td><td>2100</td><td>binary search, data structures, hashing, sortings</td><td><a href=https://codeforces.com/contest/1284/submission/68175595>GNU C++17</a></td><td>04 January 2020 12:35:36</td></tr><tr><td>1213</td><td><a href=https://codeforces.com/contest/1284/problem/A>New Year and Naming</a></td><td>A</td><td>800</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/1284/submission/68167466>GNU C++17</a></td><td>04 January 2020 12:12:33</td></tr><tr><td>1212</td><td><a href=https://codeforces.com/contest/1284/problem/C>New Year and Permutation</a></td><td>C</td><td>1600</td><td>combinatorics, math</td><td><a href=https://codeforces.com/contest/1284/submission/68166572>GNU C++17</a></td><td>04 January 2020 12:11:09</td></tr><tr><td>1211</td><td><a href=https://codeforces.com/contest/1284/problem/B>New Year and Ascent Sequence</a></td><td>B</td><td>1400</td><td>binary search, combinatorics, data structures, dp, implementation, sortings</td><td><a href=https://codeforces.com/contest/1284/submission/68164981>GNU C++17</a></td><td>04 January 2020 12:09:02</td></tr><tr><td>1210</td><td><a href=https://codeforces.com/contest/1270/problem/D>Strange Device</a></td><td>D</td><td>1900</td><td>constructive algorithms, interactive, math, sortings</td><td><a href=https://codeforces.com/contest/1270/submission/67907915>GNU C++17</a></td><td>29 December 2019 15:13:00</td></tr><tr><td>1209</td><td><a href=https://codeforces.com/contest/1270/problem/F>Awesome Substrings</a></td><td>F</td><td>2600</td><td>math, strings</td><td><a href=https://codeforces.com/contest/1270/submission/67895722>GNU C++17</a></td><td>29 December 2019 14:35:37</td></tr><tr><td>1208</td><td><a href=https://codeforces.com/contest/1270/problem/C>Make Good</a></td><td>C</td><td>1400</td><td>bitmasks, constructive algorithms, math</td><td><a href=https://codeforces.com/contest/1270/submission/67886747>GNU C++17</a></td><td>29 December 2019 14:17:59</td></tr><tr><td>1207</td><td><a href=https://codeforces.com/contest/1270/problem/E>Divide Points</a></td><td>E</td><td>2300</td><td>constructive algorithms, geometry, math</td><td><a href=https://codeforces.com/contest/1270/submission/67883277>GNU C++17</a></td><td>29 December 2019 14:12:55</td></tr><tr><td>1206</td><td><a href=https://codeforces.com/contest/1270/problem/B>Interesting Subarray</a></td><td>B</td><td>1200</td><td>constructive algorithms, greedy, math</td><td><a href=https://codeforces.com/contest/1270/submission/67878326>GNU C++17</a></td><td>29 December 2019 14:07:46</td></tr><tr><td>1205</td><td><a href=https://codeforces.com/contest/106/problem/A>Card Game</a></td><td>A</td><td>1000</td><td>implementation</td><td><a href=https://codeforces.com/contest/106/submission/617478>Delphi</a></td><td>19 August 2011 15:30:39</td></tr><tr><td>1204</td><td><a href=https://codeforces.com/contest/1268/problem/E>Happy Cactus</a></td><td>E</td><td>3400</td><td>dp</td><td><a href=https://codeforces.com/contest/1268/submission/67361424>GNU C++17</a></td><td>21 December 2019 12:39:54</td></tr><tr><td>1203</td><td><a href=https://codeforces.com/contest/1268/problem/D>Invertation in Tournament</a></td><td>D</td><td>3200</td><td>brute force, divide and conquer, graphs, math</td><td><a href=https://codeforces.com/contest/1268/submission/67348266>GNU C++17</a></td><td>21 December 2019 11:54:23</td></tr><tr><td>1202</td><td><a href=https://codeforces.com/contest/1268/problem/C>K Integers</a></td><td>C</td><td>2300</td><td>binary search, data structures</td><td><a href=https://codeforces.com/contest/1268/submission/67338375>GNU C++17</a></td><td>21 December 2019 11:23:56</td></tr><tr><td>1201</td><td><a href=https://codeforces.com/contest/1268/problem/B>Domino for Young</a></td><td>B</td><td>2000</td><td>dp, greedy, math</td><td><a href=https://codeforces.com/contest/1268/submission/67331667>GNU C++17</a></td><td>21 December 2019 11:09:38</td></tr><tr><td>1200</td><td><a href=https://codeforces.com/contest/1268/problem/A>Long Beautiful Integer</a></td><td>A</td><td>1700</td><td>constructive algorithms, greedy, implementation, strings</td><td><a href=https://codeforces.com/contest/1268/submission/67329853>GNU C++17</a></td><td>21 December 2019 11:06:50</td></tr><tr><td>1199</td><td><a href=https://codeforces.com/contest/1266/problem/F>Almost Same Distance</a></td><td>F</td><td>2900</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/1266/submission/67103000>GNU C++17</a></td><td>17 December 2019 16:10:44</td></tr><tr><td>1198</td><td><a href=https://codeforces.com/contest/1266/problem/E>Spaceship Solitaire</a></td><td>E</td><td>2100</td><td>data structures, greedy, implementation</td><td><a href=https://codeforces.com/contest/1266/submission/67090096>GNU C++17</a></td><td>17 December 2019 15:32:58</td></tr><tr><td>1197</td><td><a href=https://codeforces.com/contest/1266/problem/D>Decreasing Debts</a></td><td>D</td><td>2000</td><td>constructive algorithms, data structures, graphs, greedy, implementation, math, two pointers</td><td><a href=https://codeforces.com/contest/1266/submission/67085154>GNU C++17</a></td><td>17 December 2019 15:23:07</td></tr><tr><td>1196</td><td><a href=https://codeforces.com/contest/1266/problem/C>Diverse Matrix</a></td><td>C</td><td>1400</td><td>constructive algorithms, greedy, math, number theory</td><td><a href=https://codeforces.com/contest/1266/submission/67081843>GNU C++17</a></td><td>17 December 2019 15:17:16</td></tr><tr><td>1195</td><td><a href=https://codeforces.com/contest/225/problem/A>Dice Tower</a></td><td>A</td><td>1100</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/225/submission/2213870>GNU C++</a></td><td>19 September 2012 16:02:23</td></tr><tr><td>1194</td><td><a href=https://codeforces.com/contest/1266/problem/A>Competitive Programmer</a></td><td>A</td><td>1000</td><td>chinese remainder theorem, math</td><td><a href=https://codeforces.com/contest/1266/submission/67077698>GNU C++17</a></td><td>17 December 2019 15:06:59</td></tr><tr><td>1193</td><td><a href=https://codeforces.com/contest/1275/problem/E1>Контрольная сумма</a></td><td>E1</td><td>undefined</td><td>*special</td><td><a href=https://codeforces.com/contest/1275/submission/66620376>GNU C++17</a></td><td>11 December 2019 06:41:20</td></tr><tr><td>1192</td><td><a href=https://codeforces.com/contest/1275/problem/D>Storage2</a></td><td>D</td><td>undefined</td><td>*special</td><td><a href=https://codeforces.com/contest/1275/submission/66618902>GNU C++17</a></td><td>11 December 2019 05:59:44</td></tr><tr><td>1191</td><td><a href=https://codeforces.com/contest/1275/problem/B>Code Review</a></td><td>B</td><td>undefined</td><td>*special</td><td><a href=https://codeforces.com/contest/1275/submission/66618428>GNU C++17</a></td><td>11 December 2019 05:45:20</td></tr><tr><td>1190</td><td><a href=https://codeforces.com/contest/1275/problem/A>Скрытый друг</a></td><td>A</td><td>undefined</td><td>*special</td><td><a href=https://codeforces.com/contest/1275/submission/66618319>GNU C++17</a></td><td>11 December 2019 05:41:49</td></tr><tr><td>1189</td><td><a href=https://codeforces.com/contest/1275/problem/C>#define Задача B ...</a></td><td>C</td><td>undefined</td><td>*special</td><td><a href=https://codeforces.com/contest/1275/submission/66618248>GNU C++17</a></td><td>11 December 2019 05:39:29</td></tr><tr><td>1188</td><td><a href=https://codeforces.com/contest/1275/problem/F>Шардирование постов</a></td><td>F</td><td>undefined</td><td>*special, binary search, interactive</td><td><a href=https://codeforces.com/contest/1275/submission/66618168>GNU C++17</a></td><td>11 December 2019 05:36:10</td></tr><tr><td>1187</td><td><a href=https://codeforces.com/contest/1264/problem/E>Beautiful League</a></td><td>E</td><td>2700</td><td>constructive algorithms, flows, graph matchings</td><td><a href=https://codeforces.com/contest/1264/submission/66338115>GNU C++17</a></td><td>05 December 2019 15:21:38</td></tr><tr><td>1186</td><td><a href=https://codeforces.com/contest/1264/problem/D2>Beautiful Bracket Sequence (hard version)</a></td><td>D2</td><td>2900</td><td>combinatorics, probabilities</td><td><a href=https://codeforces.com/contest/1264/submission/66335577>GNU C++17</a></td><td>05 December 2019 15:13:29</td></tr><tr><td>1185</td><td><a href=https://codeforces.com/contest/1264/problem/D1>Beautiful Bracket Sequence (easy version)</a></td><td>D1</td><td>2600</td><td>combinatorics, dp, probabilities</td><td><a href=https://codeforces.com/contest/1264/submission/66334668>GNU C++17</a></td><td>05 December 2019 15:10:52</td></tr><tr><td>1184</td><td><a href=https://codeforces.com/contest/1264/problem/C>Beautiful Mirrors with queries</a></td><td>C</td><td>2400</td><td>data structures, probabilities</td><td><a href=https://codeforces.com/contest/1264/submission/66330012>GNU C++17</a></td><td>05 December 2019 14:58:09</td></tr><tr><td>1183</td><td><a href=https://codeforces.com/contest/1264/problem/A>Beautiful Regional Contest</a></td><td>A</td><td>1500</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/1264/submission/66323882>GNU C++17</a></td><td>05 December 2019 14:44:16</td></tr><tr><td>1182</td><td><a href=https://codeforces.com/contest/1264/problem/B>Beautiful Sequence</a></td><td>B</td><td>1900</td><td>brute force, constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/1264/submission/66322874>GNU C++17</a></td><td>05 December 2019 14:41:02</td></tr><tr><td>1181</td><td><a href=https://codeforces.com/contest/1261/problem/F>Xor-Set</a></td><td>F</td><td>3100</td><td>bitmasks, divide and conquer, math</td><td><a href=https://codeforces.com/contest/1261/submission/65651526>GNU C++17</a></td><td>24 November 2019 09:50:43</td></tr><tr><td>1180</td><td><a href=https://codeforces.com/contest/1261/problem/C>Arson In Berland Forest</a></td><td>C</td><td>2200</td><td>binary search, brute force, data structures, dfs and similar, graphs, greedy, shortest paths</td><td><a href=https://codeforces.com/contest/1261/submission/65642046>GNU C++17</a></td><td>24 November 2019 09:03:27</td></tr><tr><td>1179</td><td><a href=https://codeforces.com/contest/1261/problem/E>Not Same</a></td><td>E</td><td>2600</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/1261/submission/65636308>GNU C++17</a></td><td>24 November 2019 08:40:39</td></tr><tr><td>1178</td><td><a href=https://codeforces.com/contest/1261/problem/D1>Wrong Answer on test 233 (Easy Version)</a></td><td>D1</td><td>2200</td><td>combinatorics, dp</td><td><a href=https://codeforces.com/contest/1261/submission/65632929>GNU C++17</a></td><td>24 November 2019 08:29:07</td></tr><tr><td>1177</td><td><a href=https://codeforces.com/contest/1261/problem/D2>Wrong Answer on test 233 (Hard Version)</a></td><td>D2</td><td>2400</td><td>combinatorics, fft, math, number theory</td><td><a href=https://codeforces.com/contest/1261/submission/65632855>GNU C++17</a></td><td>24 November 2019 08:28:52</td></tr><tr><td>1176</td><td><a href=https://codeforces.com/contest/1261/problem/B1>Optimal Subsequences (Easy Version)</a></td><td>B1</td><td>1600</td><td>data structures, dp, greedy</td><td><a href=https://codeforces.com/contest/1261/submission/65627296>GNU C++17</a></td><td>24 November 2019 08:12:19</td></tr><tr><td>1175</td><td><a href=https://codeforces.com/contest/1261/problem/B2>Optimal Subsequences (Hard Version)</a></td><td>B2</td><td>1800</td><td>binary search, constructive algorithms, data structures, greedy, sortings</td><td><a href=https://codeforces.com/contest/1261/submission/65627239>GNU C++17</a></td><td>24 November 2019 08:12:09</td></tr><tr><td>1174</td><td><a href=https://codeforces.com/contest/1261/problem/A>Messy</a></td><td>A</td><td>1700</td><td>brute force, constructive algorithms, greedy, implementation</td><td><a href=https://codeforces.com/contest/1261/submission/65626236>GNU C++17</a></td><td>24 November 2019 08:08:13</td></tr><tr><td>1173</td><td><a href=https://codeforces.com/contest/1246/problem/F>Cursor Distance</a></td><td>F</td><td>3500</td><td></td><td><a href=https://codeforces.com/contest/1246/submission/63481339>GNU C++17</a></td><td>26 October 2019 12:51:37</td></tr><tr><td>1172</td><td><a href=https://codeforces.com/contest/1246/problem/D>Tree Factory</a></td><td>D</td><td>2500</td><td>constructive algorithms, divide and conquer, greedy, trees</td><td><a href=https://codeforces.com/contest/1246/submission/63460125>GNU C++17</a></td><td>26 October 2019 11:40:18</td></tr><tr><td>1171</td><td><a href=https://codeforces.com/contest/1246/problem/C>Rock Is Push</a></td><td>C</td><td>2200</td><td>data structures, dp</td><td><a href=https://codeforces.com/contest/1246/submission/63454015>GNU C++17</a></td><td>26 October 2019 11:28:01</td></tr><tr><td>1170</td><td><a href=https://codeforces.com/contest/1246/problem/A>p-binary</a></td><td>A</td><td>1600</td><td>bitmasks, brute force, math</td><td><a href=https://codeforces.com/contest/1246/submission/63443580>GNU C++17</a></td><td>26 October 2019 11:13:50</td></tr><tr><td>1169</td><td><a href=https://codeforces.com/contest/1246/problem/B>Power Products</a></td><td>B</td><td>1800</td><td>hashing, implementation, math</td><td><a href=https://codeforces.com/contest/1246/submission/63440705>GNU C++17</a></td><td>26 October 2019 11:11:00</td></tr><tr><td>1168</td><td><a href=https://codeforces.com/contest/23/problem/B>Party</a></td><td>B</td><td>1600</td><td>constructive algorithms, graphs, math</td><td><a href=https://codeforces.com/contest/23/submission/97315>Delphi</a></td><td>09 July 2010 15:05:50</td></tr><tr><td>1167</td><td><a href=https://codeforces.com/contest/1209/problem/F>Koala and Notebook</a></td><td>F</td><td>2600</td><td>data structures, dfs and similar, graphs, shortest paths, strings, trees</td><td><a href=https://codeforces.com/contest/1209/submission/60548870>GNU C++17</a></td><td>14 September 2019 13:53:25</td></tr><tr><td>1166</td><td><a href=https://codeforces.com/contest/1209/problem/G1>Into Blocks (easy version)</a></td><td>G1</td><td>2000</td><td>data structures, dsu, greedy, implementation, two pointers</td><td><a href=https://codeforces.com/contest/1209/submission/60543295>GNU C++17</a></td><td>14 September 2019 13:33:29</td></tr><tr><td>1165</td><td><a href=https://codeforces.com/contest/1209/problem/E2>Rotate Columns (hard version)</a></td><td>E2</td><td>2500</td><td>bitmasks, dp, greedy, sortings</td><td><a href=https://codeforces.com/contest/1209/submission/60541156>GNU C++17</a></td><td>14 September 2019 13:26:54</td></tr><tr><td>1164</td><td><a href=https://codeforces.com/contest/1209/problem/E1>Rotate Columns (easy version)</a></td><td>E1</td><td>2000</td><td>bitmasks, brute force, dp, greedy, sortings</td><td><a href=https://codeforces.com/contest/1209/submission/60540929>GNU C++17</a></td><td>14 September 2019 13:26:14</td></tr><tr><td>1163</td><td><a href=https://codeforces.com/contest/1209/problem/D>Cow and Snacks</a></td><td>D</td><td>1700</td><td>dfs and similar, dsu, graphs</td><td><a href=https://codeforces.com/contest/1209/submission/60538028>GNU C++17</a></td><td>14 September 2019 13:18:23</td></tr><tr><td>1162</td><td><a href=https://codeforces.com/contest/1209/problem/C>Paint the Digits</a></td><td>C</td><td>1500</td><td>constructive algorithms, greedy, implementation</td><td><a href=https://codeforces.com/contest/1209/submission/60537103>GNU C++17</a></td><td>14 September 2019 13:16:06</td></tr><tr><td>1161</td><td><a href=https://codeforces.com/contest/1209/problem/B>Koala and Lights</a></td><td>B</td><td>1300</td><td>implementation, math, number theory</td><td><a href=https://codeforces.com/contest/1209/submission/60533467>GNU C++17</a></td><td>14 September 2019 13:08:39</td></tr><tr><td>1160</td><td><a href=https://codeforces.com/contest/1209/problem/A>Paint the Numbers</a></td><td>A</td><td>800</td><td>greedy, implementation, math</td><td><a href=https://codeforces.com/contest/1209/submission/60532527>GNU C++17</a></td><td>14 September 2019 13:06:24</td></tr><tr><td>1159</td><td><a href=https://codeforces.com/contest/1211/problem/I>Unusual Graph</a></td><td>I</td><td>3000</td><td>*special, graphs</td><td><a href=https://codeforces.com/contest/1211/submission/60229477>Kotlin</a></td><td>07 September 2019 16:01:33</td></tr><tr><td>1158</td><td><a href=https://codeforces.com/contest/1211/problem/H>Road Repair in Treeland</a></td><td>H</td><td>3100</td><td>*special, binary search, dp, trees</td><td><a href=https://codeforces.com/contest/1211/submission/60228910>Kotlin</a></td><td>07 September 2019 15:52:36</td></tr><tr><td>1157</td><td><a href=https://codeforces.com/contest/1211/problem/G>King's Path</a></td><td>G</td><td>2500</td><td>*special, math, trees</td><td><a href=https://codeforces.com/contest/1211/submission/60227082>Kotlin</a></td><td>07 September 2019 15:23:56</td></tr><tr><td>1156</td><td><a href=https://codeforces.com/contest/1211/problem/F>kotlinkotlinkotlinkotlin...</a></td><td>F</td><td>2300</td><td>*special, graphs, implementation, strings</td><td><a href=https://codeforces.com/contest/1211/submission/60225404>Kotlin</a></td><td>07 September 2019 14:59:28</td></tr><tr><td>1155</td><td><a href=https://codeforces.com/contest/1211/problem/E>Double Permutation Inc.</a></td><td>E</td><td>2000</td><td>*special, binary search, greedy</td><td><a href=https://codeforces.com/contest/1211/submission/60225001>Kotlin</a></td><td>07 September 2019 14:54:26</td></tr><tr><td>1154</td><td><a href=https://codeforces.com/contest/1211/problem/D>Teams</a></td><td>D</td><td>2000</td><td>*special, binary search, greedy, math</td><td><a href=https://codeforces.com/contest/1211/submission/60224391>Kotlin</a></td><td>07 September 2019 14:47:03</td></tr><tr><td>1153</td><td><a href=https://codeforces.com/contest/1211/problem/C>Ice Cream</a></td><td>C</td><td>1700</td><td>*special, greedy, sortings</td><td><a href=https://codeforces.com/contest/1211/submission/60224075>Kotlin</a></td><td>07 September 2019 14:43:17</td></tr><tr><td>1152</td><td><a href=https://codeforces.com/contest/1211/problem/B>Traveling Around the Golden Ring of Berland</a></td><td>B</td><td>1500</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1211/submission/60223753>Kotlin</a></td><td>07 September 2019 14:39:14</td></tr><tr><td>1151</td><td><a href=https://codeforces.com/contest/1211/problem/A>Three Problems</a></td><td>A</td><td>1000</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1211/submission/60223650>Kotlin</a></td><td>07 September 2019 14:37:01</td></tr><tr><td>1150</td><td><a href=https://codeforces.com/contest/1212/problem/H>Berland Federalization</a></td><td>H</td><td>2200</td><td>*special, dp, trees</td><td><a href=https://codeforces.com/contest/1212/submission/60218283>Kotlin</a></td><td>07 September 2019 12:38:24</td></tr><tr><td>1149</td><td><a href=https://codeforces.com/contest/1212/problem/F>One-Based Arithmetic</a></td><td>F</td><td>1800</td><td>*special, brute force</td><td><a href=https://codeforces.com/contest/1212/submission/60217147>Kotlin</a></td><td>07 September 2019 12:14:25</td></tr><tr><td>1148</td><td><a href=https://codeforces.com/contest/101606/problem/H>Hiking</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32310769>GNU C++14</a></td><td>14 November 2017 12:13:35</td></tr><tr><td>1147</td><td><a href=https://codeforces.com/contest/1212/problem/B>Two-gram</a></td><td>B</td><td>900</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1212/submission/60198239>Kotlin</a></td><td>07 September 2019 03:26:10</td></tr><tr><td>1146</td><td><a href=https://codeforces.com/contest/1212/problem/E>Booking System</a></td><td>E</td><td>1600</td><td>*special, greedy</td><td><a href=https://codeforces.com/contest/1212/submission/60215644>Kotlin</a></td><td>07 September 2019 11:45:50</td></tr><tr><td>1145</td><td><a href=https://codeforces.com/contest/1212/problem/D>Divide by three, multiply by two</a></td><td>D</td><td>1400</td><td>*special, math</td><td><a href=https://codeforces.com/contest/1212/submission/60198531>Kotlin</a></td><td>07 September 2019 03:38:52</td></tr><tr><td>1144</td><td><a href=https://codeforces.com/contest/1212/problem/C>Less or Equal</a></td><td>C</td><td>1200</td><td>*special, sortings</td><td><a href=https://codeforces.com/contest/1212/submission/60198315>Kotlin</a></td><td>07 September 2019 03:30:06</td></tr><tr><td>1143</td><td><a href=https://codeforces.com/contest/1212/problem/A>Wrong Subtraction</a></td><td>A</td><td>800</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1212/submission/60198062>Kotlin</a></td><td>07 September 2019 03:17:41</td></tr><tr><td>1142</td><td><a href=https://codeforces.com/contest/1208/problem/H>Red Blue Tree</a></td><td>H</td><td>3500</td><td>data structures, implementation, trees</td><td><a href=https://codeforces.com/contest/1208/submission/59484058>GNU C++17</a></td><td>25 August 2019 16:38:36</td></tr><tr><td>1141</td><td><a href=https://codeforces.com/contest/1208/problem/G>Polygons</a></td><td>G</td><td>2800</td><td>greedy, math, number theory</td><td><a href=https://codeforces.com/contest/1208/submission/59465495>GNU C++17</a></td><td>25 August 2019 15:16:03</td></tr><tr><td>1140</td><td><a href=https://codeforces.com/contest/1208/problem/F>Bits And Pieces</a></td><td>F</td><td>2600</td><td>bitmasks, dfs and similar, dp, greedy</td><td><a href=https://codeforces.com/contest/1208/submission/59463879>GNU C++17</a></td><td>25 August 2019 15:10:49</td></tr><tr><td>1139</td><td><a href=https://codeforces.com/contest/1208/problem/E>Let Them Slide</a></td><td>E</td><td>2200</td><td>data structures, implementation</td><td><a href=https://codeforces.com/contest/1208/submission/59458500>GNU C++17</a></td><td>25 August 2019 14:55:49</td></tr><tr><td>1138</td><td><a href=https://codeforces.com/contest/1208/problem/C>Magic Grid</a></td><td>C</td><td>1800</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/1208/submission/59454101>GNU C++17</a></td><td>25 August 2019 14:45:27</td></tr><tr><td>1137</td><td><a href=https://codeforces.com/contest/1208/problem/D>Restore Permutation</a></td><td>D</td><td>1900</td><td>binary search, data structures, greedy, implementation</td><td><a href=https://codeforces.com/contest/1208/submission/59453338>GNU C++17</a></td><td>25 August 2019 14:43:44</td></tr><tr><td>1136</td><td><a href=https://codeforces.com/contest/1208/problem/B>Uniqueness</a></td><td>B</td><td>1500</td><td>binary search, brute force, implementation, two pointers</td><td><a href=https://codeforces.com/contest/1208/submission/59451380>GNU C++17</a></td><td>25 August 2019 14:40:04</td></tr><tr><td>1135</td><td><a href=https://codeforces.com/contest/1208/problem/A>XORinacci</a></td><td>A</td><td>900</td><td>math</td><td><a href=https://codeforces.com/contest/1208/submission/59449116>GNU C++17</a></td><td>25 August 2019 14:35:52</td></tr><tr><td>1134</td><td><a href=https://codeforces.com/contest/1043/problem/D>Mysterious Crime</a></td><td>D</td><td>1700</td><td>brute force, combinatorics, math, meet-in-the-middle, two pointers</td><td><a href=https://codeforces.com/contest/1043/submission/45024674>GNU C++14</a></td><td>28 October 2018 20:50:12</td></tr><tr><td>1133</td><td><a href=https://codeforces.com/contest/1198/problem/F>GCD Groups 2</a></td><td>F</td><td>2900</td><td>greedy, number theory, probabilities</td><td><a href=https://codeforces.com/contest/1198/submission/58020980>GNU C++17</a></td><td>30 July 2019 15:52:53</td></tr><tr><td>1132</td><td><a href=https://codeforces.com/contest/1198/problem/D>Rectangle Painting 1</a></td><td>D</td><td>2300</td><td>dp</td><td><a href=https://codeforces.com/contest/1198/submission/58008663>GNU C++17</a></td><td>30 July 2019 15:13:25</td></tr><tr><td>1131</td><td><a href=https://codeforces.com/contest/1198/problem/E>Rectangle Painting 2</a></td><td>E</td><td>2500</td><td>flows, graph matchings, graphs</td><td><a href=https://codeforces.com/contest/1198/submission/58006936>GNU C++17</a></td><td>30 July 2019 15:08:22</td></tr><tr><td>1130</td><td><a href=https://codeforces.com/contest/1198/problem/B>Welfare State</a></td><td>B</td><td>1600</td><td>binary search, brute force, data structures, sortings</td><td><a href=https://codeforces.com/contest/1198/submission/58004780>GNU C++17</a></td><td>30 July 2019 15:02:31</td></tr><tr><td>1129</td><td><a href=https://codeforces.com/contest/1198/problem/C>Matching vs  Independent Set</a></td><td>C</td><td>2000</td><td>constructive algorithms, graphs, greedy, sortings</td><td><a href=https://codeforces.com/contest/1198/submission/57997749>GNU C++17</a></td><td>30 July 2019 14:46:49</td></tr><tr><td>1128</td><td><a href=https://codeforces.com/contest/1198/problem/A>MP3</a></td><td>A</td><td>1600</td><td>sortings, two pointers</td><td><a href=https://codeforces.com/contest/1198/submission/57995575>GNU C++17</a></td><td>30 July 2019 14:41:56</td></tr><tr><td>1127</td><td><a href=https://codeforces.com/contest/1148/problem/G>Gold Experience</a></td><td>G</td><td>3300</td><td>constructive algorithms, graphs, math, number theory, probabilities</td><td><a href=https://codeforces.com/contest/1148/submission/54939995>GNU C++17</a></td><td>01 June 2019 16:13:50</td></tr><tr><td>1126</td><td><a href=https://codeforces.com/contest/1148/problem/E>Earth Wind and Fire</a></td><td>E</td><td>2300</td><td>constructive algorithms, greedy, math, sortings, two pointers</td><td><a href=https://codeforces.com/contest/1148/submission/54931357>GNU C++17</a></td><td>01 June 2019 15:30:39</td></tr><tr><td>1125</td><td><a href=https://codeforces.com/contest/1148/problem/F>Foo Fighters</a></td><td>F</td><td>2700</td><td>bitmasks, constructive algorithms</td><td><a href=https://codeforces.com/contest/1148/submission/54928567>GNU C++17</a></td><td>01 June 2019 15:17:51</td></tr><tr><td>1124</td><td><a href=https://codeforces.com/contest/1148/problem/D>Dirty Deeds Done Dirt Cheap</a></td><td>D</td><td>1800</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/1148/submission/54925990>GNU C++17</a></td><td>01 June 2019 15:05:34</td></tr><tr><td>1123</td><td><a href=https://codeforces.com/contest/1148/problem/B>Born This Way</a></td><td>B</td><td>1600</td><td>binary search, brute force, two pointers</td><td><a href=https://codeforces.com/contest/1148/submission/54923457>GNU C++17</a></td><td>01 June 2019 14:53:44</td></tr><tr><td>1122</td><td><a href=https://codeforces.com/contest/1148/problem/C>Crazy Diamond</a></td><td>C</td><td>1700</td><td>constructive algorithms, sortings</td><td><a href=https://codeforces.com/contest/1148/submission/54921281>GNU C++17</a></td><td>01 June 2019 14:45:18</td></tr><tr><td>1121</td><td><a href=https://codeforces.com/contest/1148/problem/A>Another One Bites The Dust</a></td><td>A</td><td>800</td><td>greedy</td><td><a href=https://codeforces.com/contest/1148/submission/54919915>GNU C++17</a></td><td>01 June 2019 14:41:41</td></tr><tr><td>1120</td><td><a href=https://codeforces.com/contest/1170/problem/I>Good Subsets</a></td><td>I</td><td>undefined</td><td>*special, dp</td><td><a href=https://codeforces.com/contest/1170/submission/54765451>Kotlin</a></td><td>28 May 2019 16:59:50</td></tr><tr><td>1119</td><td><a href=https://codeforces.com/contest/1170/problem/G>Graph Decomposition</a></td><td>G</td><td>undefined</td><td>*special, graphs</td><td><a href=https://codeforces.com/contest/1170/submission/54762607>Kotlin</a></td><td>28 May 2019 16:13:36</td></tr><tr><td>1118</td><td><a href=https://codeforces.com/contest/1170/problem/H>Longest Saw</a></td><td>H</td><td>undefined</td><td>*special, constructive algorithms</td><td><a href=https://codeforces.com/contest/1170/submission/54760261>Kotlin</a></td><td>28 May 2019 15:40:57</td></tr><tr><td>1117</td><td><a href=https://codeforces.com/contest/1170/problem/E>Sliding Doors</a></td><td>E</td><td>undefined</td><td>*special, binary search</td><td><a href=https://codeforces.com/contest/1170/submission/54758921>Kotlin</a></td><td>28 May 2019 15:23:50</td></tr><tr><td>1116</td><td><a href=https://codeforces.com/contest/1170/problem/F>Wheels</a></td><td>F</td><td>undefined</td><td>*special, binary search, greedy</td><td><a href=https://codeforces.com/contest/1170/submission/54758319>Kotlin</a></td><td>28 May 2019 15:16:26</td></tr><tr><td>1115</td><td><a href=https://codeforces.com/contest/1170/problem/D>Decoding of Integer Sequences</a></td><td>D</td><td>undefined</td><td>*special, data structures, implementation</td><td><a href=https://codeforces.com/contest/1170/submission/54757710>Kotlin</a></td><td>28 May 2019 15:09:12</td></tr><tr><td>1114</td><td><a href=https://codeforces.com/contest/1170/problem/C>Minus and Minus Give Plus</a></td><td>C</td><td>undefined</td><td>*special, implementation, strings</td><td><a href=https://codeforces.com/contest/1170/submission/54755665>Kotlin</a></td><td>28 May 2019 14:44:58</td></tr><tr><td>1113</td><td><a href=https://codeforces.com/contest/1170/problem/B>Bad Days</a></td><td>B</td><td>undefined</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/1170/submission/54755390>Kotlin</a></td><td>28 May 2019 14:41:47</td></tr><tr><td>1112</td><td><a href=https://codeforces.com/contest/1170/problem/A>Three Integers Again</a></td><td>A</td><td>undefined</td><td>*special, math</td><td><a href=https://codeforces.com/contest/1170/submission/54755269>Kotlin</a></td><td>28 May 2019 14:40:21</td></tr><tr><td>1111</td><td><a href=https://codeforces.com/contest/1164/problem/U>The Greatest Possible Value (3 points)</a></td><td>U</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53785875></a></td><td>05 May 2019 10:03:50</td></tr><tr><td>1110</td><td><a href=https://codeforces.com/contest/1164/problem/T>Compute the Product (3 points)</a></td><td>T</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53784594></a></td><td>05 May 2019 09:47:23</td></tr><tr><td>1109</td><td><a href=https://codeforces.com/contest/1164/problem/L>Queens (2 points)</a></td><td>L</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53784080></a></td><td>05 May 2019 09:40:07</td></tr><tr><td>1108</td><td><a href=https://codeforces.com/contest/1164/problem/I>Maximum Value (2 points)</a></td><td>I</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53783197></a></td><td>05 May 2019 09:28:23</td></tr><tr><td>1107</td><td><a href=https://codeforces.com/contest/1164/problem/F>Regular Polygon (1 point)</a></td><td>F</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53782719></a></td><td>05 May 2019 09:22:40</td></tr><tr><td>1106</td><td><a href=https://codeforces.com/contest/1164/problem/M>Seven Digit Number (2 points)</a></td><td>M</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53781968></a></td><td>05 May 2019 09:12:57</td></tr><tr><td>1105</td><td><a href=https://codeforces.com/contest/1164/problem/B>Triangle Area (1 point)</a></td><td>B</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53781764></a></td><td>05 May 2019 09:10:23</td></tr><tr><td>1104</td><td><a href=https://codeforces.com/contest/1164/problem/D>Multiple of 29 (1 point)</a></td><td>D</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53781511></a></td><td>05 May 2019 09:07:27</td></tr><tr><td>1103</td><td><a href=https://codeforces.com/contest/1164/problem/C>7-digit Number (1 point)</a></td><td>C</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53781199></a></td><td>05 May 2019 09:03:58</td></tr><tr><td>1102</td><td><a href=https://codeforces.com/contest/1164/problem/S>Find Distance (3 points)</a></td><td>S</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53781054></a></td><td>05 May 2019 09:01:51</td></tr><tr><td>1101</td><td><a href=https://codeforces.com/contest/1164/problem/H>Circle Radius (2 points)</a></td><td>H</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53780144></a></td><td>05 May 2019 08:50:57</td></tr><tr><td>1100</td><td><a href=https://codeforces.com/contest/1164/problem/R>Divisible by 83 (3 points)</a></td><td>R</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53779752></a></td><td>05 May 2019 08:46:14</td></tr><tr><td>1099</td><td><a href=https://codeforces.com/contest/1164/problem/Q>Surjective Functions (3 points)</a></td><td>Q</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53779720></a></td><td>05 May 2019 08:45:55</td></tr><tr><td>1098</td><td><a href=https://codeforces.com/contest/1164/problem/P>Equilateral Triangles (2 points)</a></td><td>P</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53779703></a></td><td>05 May 2019 08:45:44</td></tr><tr><td>1097</td><td><a href=https://codeforces.com/contest/1164/problem/O>Greatest Prime Divisor (2 points)</a></td><td>O</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53779689></a></td><td>05 May 2019 08:45:38</td></tr><tr><td>1096</td><td><a href=https://codeforces.com/contest/1164/problem/N>All Streets (2 points)</a></td><td>N</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53779686></a></td><td>05 May 2019 08:45:33</td></tr><tr><td>1095</td><td><a href=https://codeforces.com/contest/1164/problem/J>Eleven Segments (2 points)</a></td><td>J</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53779587></a></td><td>05 May 2019 08:44:19</td></tr><tr><td>1094</td><td><a href=https://codeforces.com/contest/1164/problem/G>Find Number (1 point)</a></td><td>G</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53779531></a></td><td>05 May 2019 08:43:42</td></tr><tr><td>1093</td><td><a href=https://codeforces.com/contest/1164/problem/E>Least Possible Difference (1 point)</a></td><td>E</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53779524></a></td><td>05 May 2019 08:43:36</td></tr><tr><td>1092</td><td><a href=https://codeforces.com/contest/1164/problem/A>Three Friends (1 point)</a></td><td>A</td><td>undefined</td><td>math</td><td><a href=https://codeforces.com/contest/1164/submission/53779465></a></td><td>05 May 2019 08:43:02</td></tr><tr><td>1091</td><td><a href=https://codeforces.com/contest/1146/problem/H>Satanic Panic</a></td><td>H</td><td>2900</td><td>dp, geometry</td><td><a href=https://codeforces.com/contest/1146/submission/53068227>GNU C++17</a></td><td>20 April 2019 19:09:55</td></tr><tr><td>1090</td><td><a href=https://codeforces.com/contest/1146/problem/F>Leaf Partition</a></td><td>F</td><td>2500</td><td>dp, trees</td><td><a href=https://codeforces.com/contest/1146/submission/53066321>GNU C++17</a></td><td>20 April 2019 18:52:55</td></tr><tr><td>1089</td><td><a href=https://codeforces.com/contest/1146/problem/G>Zoning Restrictions</a></td><td>G</td><td>2700</td><td>dp, flows, graphs</td><td><a href=https://codeforces.com/contest/1146/submission/53065345>GNU C++17</a></td><td>20 April 2019 18:45:33</td></tr><tr><td>1088</td><td><a href=https://codeforces.com/contest/1146/problem/E>Hot is Cold</a></td><td>E</td><td>2400</td><td>bitmasks, data structures, divide and conquer, implementation</td><td><a href=https://codeforces.com/contest/1146/submission/53063358>GNU C++17</a></td><td>20 April 2019 18:32:19</td></tr><tr><td>1087</td><td><a href=https://codeforces.com/contest/1146/problem/D>Frog Jumping</a></td><td>D</td><td>2100</td><td>dfs and similar, math, number theory</td><td><a href=https://codeforces.com/contest/1146/submission/53060551>GNU C++17</a></td><td>20 April 2019 18:17:53</td></tr><tr><td>1086</td><td><a href=https://codeforces.com/contest/1146/problem/C>Tree Diameter</a></td><td>C</td><td>1700</td><td>bitmasks, graphs, interactive</td><td><a href=https://codeforces.com/contest/1146/submission/53058489>GNU C++17</a></td><td>20 April 2019 18:10:09</td></tr><tr><td>1085</td><td><a href=https://codeforces.com/contest/1146/problem/B>Hate "A"</a></td><td>B</td><td>1100</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/1146/submission/53057452>GNU C++17</a></td><td>20 April 2019 18:07:37</td></tr><tr><td>1084</td><td><a href=https://codeforces.com/contest/1146/problem/A>Love "A"</a></td><td>A</td><td>800</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/1146/submission/53056898>GNU C++17</a></td><td>20 April 2019 18:05:50</td></tr><tr><td>1083</td><td><a href=https://codeforces.com/contest/1119/problem/F>Niyaz and Small Degrees</a></td><td>F</td><td>3400</td><td>data structures, dp, trees</td><td><a href=https://codeforces.com/contest/1119/submission/52405024>GNU C++17</a></td><td>06 April 2019 12:54:44</td></tr><tr><td>1082</td><td><a href=https://codeforces.com/contest/1119/problem/E>Pavel and Triangles</a></td><td>E</td><td>1900</td><td>brute force, dp, fft, greedy, ternary search</td><td><a href=https://codeforces.com/contest/1119/submission/52388780>GNU C++17</a></td><td>06 April 2019 11:48:00</td></tr><tr><td>1081</td><td><a href=https://codeforces.com/contest/1119/problem/D>Frets On Fire</a></td><td>D</td><td>1800</td><td>binary search, sortings</td><td><a href=https://codeforces.com/contest/1119/submission/52387452>GNU C++17</a></td><td>06 April 2019 11:44:30</td></tr><tr><td>1080</td><td><a href=https://codeforces.com/contest/1119/problem/C>Ramesses and Corner Inversion</a></td><td>C</td><td>1500</td><td>constructive algorithms, greedy, implementation, math</td><td><a href=https://codeforces.com/contest/1119/submission/52385893>GNU C++17</a></td><td>06 April 2019 11:40:48</td></tr><tr><td>1079</td><td><a href=https://codeforces.com/contest/1119/problem/B>Alyona and a Narrow Fridge</a></td><td>B</td><td>1300</td><td>binary search, flows, greedy, sortings</td><td><a href=https://codeforces.com/contest/1119/submission/52384891>GNU C++17</a></td><td>06 April 2019 11:38:14</td></tr><tr><td>1078</td><td><a href=https://codeforces.com/contest/1119/problem/A>Ilya and a Colorful Walk</a></td><td>A</td><td>1100</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/1119/submission/52384630>GNU C++17</a></td><td>06 April 2019 11:36:35</td></tr><tr><td>1077</td><td><a href=https://codeforces.com/contest/1116/problem/D5>Creeper</a></td><td>D5</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50662253>Q#</a></td><td>02 March 2019 00:44:00</td></tr><tr><td>1076</td><td><a href=https://codeforces.com/contest/1116/problem/D4>TIE fighter</a></td><td>D4</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50660632>Q#</a></td><td>01 March 2019 22:43:29</td></tr><tr><td>1075</td><td><a href=https://codeforces.com/contest/1116/problem/B1>Distinguish three-qubit states</a></td><td>B1</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50661328>Q#</a></td><td>01 March 2019 23:33:45</td></tr><tr><td>1074</td><td><a href=https://codeforces.com/contest/1116/problem/A1>Generate state |00⟩ + |01⟩ + |10⟩</a></td><td>A1</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50655252>Q#</a></td><td>01 March 2019 19:16:45</td></tr><tr><td>1073</td><td><a href=https://codeforces.com/contest/1116/problem/D3>X-wing fighter</a></td><td>D3</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50660337>Q#</a></td><td>01 March 2019 22:27:51</td></tr><tr><td>1072</td><td><a href=https://codeforces.com/contest/1116/problem/A2>Generate equal superposition of four basis states</a></td><td>A2</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50659517>Q#</a></td><td>01 March 2019 21:48:39</td></tr><tr><td>1071</td><td><a href=https://codeforces.com/contest/1116/problem/D2>Pattern of increasing blocks</a></td><td>D2</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50655881>Q#</a></td><td>01 March 2019 19:32:03</td></tr><tr><td>1070</td><td><a href=https://codeforces.com/contest/1116/problem/C3>``Is the number of ones divisible by 3?'' oracle</a></td><td>C3</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50652416>Q#</a></td><td>01 March 2019 18:09:05</td></tr><tr><td>1069</td><td><a href=https://codeforces.com/contest/1116/problem/C2>``Is the bit string periodic?'' oracle</a></td><td>C2</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50651776>Q#</a></td><td>01 March 2019 17:54:15</td></tr><tr><td>1068</td><td><a href=https://codeforces.com/contest/1116/problem/C1>Alternating bits oracle</a></td><td>C1</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50650898>Q#</a></td><td>01 March 2019 17:33:53</td></tr><tr><td>1067</td><td><a href=https://codeforces.com/contest/1116/problem/D1>Block diagonal matrix</a></td><td>D1</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/1116/submission/50650371>Q#</a></td><td>01 March 2019 17:22:55</td></tr><tr><td>1066</td><td><a href=https://codeforces.com/contest/1110/problem/F>Nearest Leaf</a></td><td>F</td><td>2600</td><td>data structures, trees</td><td><a href=https://codeforces.com/contest/1110/submission/49588803>GNU C++14</a></td><td>07 February 2019 14:56:46</td></tr><tr><td>1065</td><td><a href=https://codeforces.com/contest/1110/problem/G>Tree-Tac-Toe </a></td><td>G</td><td>3100</td><td>constructive algorithms, games, trees</td><td><a href=https://codeforces.com/contest/1110/submission/49584456>GNU C++14</a></td><td>07 February 2019 14:37:59</td></tr><tr><td>1064</td><td><a href=https://codeforces.com/contest/1110/problem/D>Jongmah</a></td><td>D</td><td>2200</td><td>dp</td><td><a href=https://codeforces.com/contest/1110/submission/49574216>GNU C++14</a></td><td>07 February 2019 14:01:24</td></tr><tr><td>1063</td><td><a href=https://codeforces.com/contest/1110/problem/E>Magic Stones</a></td><td>E</td><td>2200</td><td>constructive algorithms, math, sortings</td><td><a href=https://codeforces.com/contest/1110/submission/49571919>GNU C++14</a></td><td>07 February 2019 13:54:41</td></tr><tr><td>1062</td><td><a href=https://codeforces.com/contest/1110/problem/C>Meaningless Operations</a></td><td>C</td><td>1500</td><td>constructive algorithms, math, number theory</td><td><a href=https://codeforces.com/contest/1110/submission/49566100>GNU C++14</a></td><td>07 February 2019 13:42:22</td></tr><tr><td>1061</td><td><a href=https://codeforces.com/contest/1110/problem/B>Tape</a></td><td>B</td><td>1400</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/1110/submission/49563879>GNU C++14</a></td><td>07 February 2019 13:38:46</td></tr><tr><td>1060</td><td><a href=https://codeforces.com/contest/1110/problem/A>Parity</a></td><td>A</td><td>900</td><td>math</td><td><a href=https://codeforces.com/contest/1110/submission/49563075>GNU C++14</a></td><td>07 February 2019 13:36:22</td></tr><tr><td>1059</td><td><a href=https://codeforces.com/contest/1054/problem/H>Epic Convolution</a></td><td>H</td><td>3500</td><td>chinese remainder theorem, fft, math, number theory</td><td><a href=https://codeforces.com/contest/1054/submission/48070928>GNU C++14</a></td><td>07 January 2019 22:48:26</td></tr><tr><td>1058</td><td><a href=https://codeforces.com/contest/438/problem/E>The Child and Binary Tree</a></td><td>E</td><td>3100</td><td>combinatorics, divide and conquer, fft, number theory</td><td><a href=https://codeforces.com/contest/438/submission/48043927>GNU C++14</a></td><td>06 January 2019 23:02:04</td></tr><tr><td>1057</td><td><a href=https://codeforces.com/contest/866/problem/G>Flowers and Chocolate</a></td><td>G</td><td>3300</td><td>math</td><td><a href=https://codeforces.com/contest/866/submission/48042200>GNU C++14</a></td><td>06 January 2019 20:36:24</td></tr><tr><td>1056</td><td><a href=https://codeforces.com/contest/1097/problem/H>Mateusz and an Infinite Sequence</a></td><td>H</td><td>3400</td><td>bitmasks, brute force, dp, strings</td><td><a href=https://codeforces.com/contest/1097/submission/47950190>GNU C++14</a></td><td>04 January 2019 23:31:13</td></tr><tr><td>1055</td><td><a href=https://codeforces.com/contest/1097/problem/G>Vladislav and a Great Legend</a></td><td>G</td><td>3000</td><td>combinatorics, dp, trees</td><td><a href=https://codeforces.com/contest/1097/submission/47932161>GNU C++14</a></td><td>04 January 2019 16:14:01</td></tr><tr><td>1054</td><td><a href=https://codeforces.com/contest/1097/problem/E>Egor and an RPG game</a></td><td>E</td><td>3400</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/1097/submission/47941027>GNU C++14</a></td><td>04 January 2019 17:23:05</td></tr><tr><td>1053</td><td><a href=https://codeforces.com/contest/1097/problem/F>Alex and a TV Show</a></td><td>F</td><td>2500</td><td>bitmasks, combinatorics, number theory</td><td><a href=https://codeforces.com/contest/1097/submission/47919370>GNU C++14</a></td><td>04 January 2019 15:17:51</td></tr><tr><td>1052</td><td><a href=https://codeforces.com/contest/1097/problem/D>Makoto and a Blackboard</a></td><td>D</td><td>2200</td><td>dp, math, number theory, probabilities</td><td><a href=https://codeforces.com/contest/1097/submission/47911474>GNU C++14</a></td><td>04 January 2019 14:58:08</td></tr><tr><td>1051</td><td><a href=https://codeforces.com/contest/1097/problem/C>Yuhao and a Parenthesis</a></td><td>C</td><td>1400</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/1097/submission/47906986>GNU C++14</a></td><td>04 January 2019 14:51:28</td></tr><tr><td>1050</td><td><a href=https://codeforces.com/contest/1097/problem/B>Petr and a Combination Lock</a></td><td>B</td><td>1200</td><td>bitmasks, brute force, dp</td><td><a href=https://codeforces.com/contest/1097/submission/47902342>GNU C++14</a></td><td>04 January 2019 14:47:16</td></tr><tr><td>1049</td><td><a href=https://codeforces.com/contest/1097/problem/A>Gennady and a Card Game</a></td><td>A</td><td>800</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/1097/submission/47901870>GNU C++14</a></td><td>04 January 2019 14:45:55</td></tr><tr><td>1048</td><td><a href=https://codeforces.com/contest/756/problem/F>Long number</a></td><td>F</td><td>3400</td><td>expression parsing, math, number theory</td><td><a href=https://codeforces.com/contest/756/submission/24053908>GNU C++14</a></td><td>22 January 2017 21:14:24</td></tr><tr><td>1047</td><td><a href=https://codeforces.com/contest/1091/problem/H>New Year and the Tricolore Recreation</a></td><td>H</td><td>3200</td><td>games</td><td><a href=https://codeforces.com/contest/1091/submission/47758745>GNU C++14</a></td><td>30 December 2018 16:29:18</td></tr><tr><td>1046</td><td><a href=https://codeforces.com/contest/1091/problem/G>New Year and the Factorisation Collaboration</a></td><td>G</td><td>3200</td><td>interactive, math, number theory</td><td><a href=https://codeforces.com/contest/1091/submission/47753526>Java 8</a></td><td>30 December 2018 15:55:39</td></tr><tr><td>1045</td><td><a href=https://codeforces.com/contest/1091/problem/F>New Year and the Mallard Expedition</a></td><td>F</td><td>2600</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/1091/submission/47748362>GNU C++14</a></td><td>30 December 2018 15:30:19</td></tr><tr><td>1044</td><td><a href=https://codeforces.com/contest/1091/problem/E>New Year and the Acquaintance Estimation</a></td><td>E</td><td>2400</td><td>binary search, data structures, graphs, greedy, implementation, math, sortings</td><td><a href=https://codeforces.com/contest/1091/submission/47739626>GNU C++14</a></td><td>30 December 2018 14:59:34</td></tr><tr><td>1043</td><td><a href=https://codeforces.com/contest/1091/problem/D>New Year and the Permutation Concatenation</a></td><td>D</td><td>1700</td><td>combinatorics, dp, math</td><td><a href=https://codeforces.com/contest/1091/submission/47733861>GNU C++14</a></td><td>30 December 2018 14:46:48</td></tr><tr><td>1042</td><td><a href=https://codeforces.com/contest/1091/problem/C>New Year and the Sphere Transmission</a></td><td>C</td><td>1400</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/1091/submission/47729741>GNU C++14</a></td><td>30 December 2018 14:40:02</td></tr><tr><td>1041</td><td><a href=https://codeforces.com/contest/1091/problem/B>New Year and the Treasure Geolocation</a></td><td>B</td><td>1200</td><td>brute force, constructive algorithms, greedy, implementation</td><td><a href=https://codeforces.com/contest/1091/submission/47727280>GNU C++14</a></td><td>30 December 2018 14:37:32</td></tr><tr><td>1040</td><td><a href=https://codeforces.com/contest/1091/problem/A>New Year and the Christmas Ornament</a></td><td>A</td><td>800</td><td>brute force, implementation, math</td><td><a href=https://codeforces.com/contest/1091/submission/47726595>GNU C++14</a></td><td>30 December 2018 14:35:48</td></tr><tr><td>1039</td><td><a href=https://codeforces.com/contest/1081/problem/G>Mergesort Strikes Back</a></td><td>G</td><td>3200</td><td>math, probabilities</td><td><a href=https://codeforces.com/contest/1081/submission/47131312>GNU C++14</a></td><td>16 December 2018 16:23:51</td></tr><tr><td>1038</td><td><a href=https://codeforces.com/contest/1081/problem/F>Tricky Interactor</a></td><td>F</td><td>2600</td><td>constructive algorithms, implementation, interactive</td><td><a href=https://codeforces.com/contest/1081/submission/47123236>GNU C++14</a></td><td>16 December 2018 15:26:48</td></tr><tr><td>1037</td><td><a href=https://codeforces.com/contest/1081/problem/E>Missing Numbers</a></td><td>E</td><td>1900</td><td>binary search, constructive algorithms, greedy, math, number theory</td><td><a href=https://codeforces.com/contest/1081/submission/47117343>GNU C++14</a></td><td>16 December 2018 14:58:41</td></tr><tr><td>1036</td><td><a href=https://codeforces.com/contest/1081/problem/B>Farewell Party</a></td><td>B</td><td>1500</td><td>constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/1081/submission/47114485>GNU C++14</a></td><td>16 December 2018 14:47:31</td></tr><tr><td>1035</td><td><a href=https://codeforces.com/contest/1081/problem/D>Maximum Distance</a></td><td>D</td><td>1800</td><td>dsu, graphs, shortest paths, sortings</td><td><a href=https://codeforces.com/contest/1081/submission/47113486>GNU C++14</a></td><td>16 December 2018 14:44:03</td></tr><tr><td>1034</td><td><a href=https://codeforces.com/contest/1081/problem/C>Colorful Bricks</a></td><td>C</td><td>1500</td><td>combinatorics, dp, math</td><td><a href=https://codeforces.com/contest/1081/submission/47111844>GNU C++14</a></td><td>16 December 2018 14:39:34</td></tr><tr><td>1033</td><td><a href=https://codeforces.com/contest/1081/problem/A>Definite Game</a></td><td>A</td><td>800</td><td>constructive algorithms, math</td><td><a href=https://codeforces.com/contest/1081/submission/47109099>GNU C++14</a></td><td>16 December 2018 14:35:48</td></tr><tr><td>1032</td><td><a href=https://codeforces.com/contest/1055/problem/D>Refactoring</a></td><td>D</td><td>2400</td><td>greedy, implementation, strings</td><td><a href=https://codeforces.com/contest/1055/submission/45528324>GNU C++14</a></td><td>10 November 2018 15:52:17</td></tr><tr><td>1031</td><td><a href=https://codeforces.com/contest/1055/problem/F>Tree and XOR</a></td><td>F</td><td>2900</td><td>strings, trees</td><td><a href=https://codeforces.com/contest/1055/submission/45525732>GNU C++14</a></td><td>10 November 2018 15:34:28</td></tr><tr><td>1030</td><td><a href=https://codeforces.com/contest/1055/problem/E>Segments on the Line</a></td><td>E</td><td>2500</td><td>binary search, dp</td><td><a href=https://codeforces.com/contest/1055/submission/45522574>GNU C++14</a></td><td>10 November 2018 15:15:04</td></tr><tr><td>1029</td><td><a href=https://codeforces.com/contest/1055/problem/C>Lucky Days</a></td><td>C</td><td>1900</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/1055/submission/45518312>GNU C++14</a></td><td>10 November 2018 14:54:20</td></tr><tr><td>1028</td><td><a href=https://codeforces.com/contest/1055/problem/B>Alice and Hairdresser</a></td><td>B</td><td>1300</td><td>dsu, implementation</td><td><a href=https://codeforces.com/contest/1055/submission/45516408>GNU C++14</a></td><td>10 November 2018 14:47:05</td></tr><tr><td>1027</td><td><a href=https://codeforces.com/contest/1055/problem/A>Metro</a></td><td>A</td><td>900</td><td>graphs</td><td><a href=https://codeforces.com/contest/1055/submission/45514551>GNU C++14</a></td><td>10 November 2018 14:41:21</td></tr><tr><td>1026</td><td><a href=https://codeforces.com/contest/1044/problem/E>Grid Sort</a></td><td>E</td><td>3100</td><td>implementation</td><td><a href=https://codeforces.com/contest/1044/submission/45300245>GNU C++14</a></td><td>04 November 2018 19:46:53</td></tr><tr><td>1025</td><td><a href=https://codeforces.com/contest/1044/problem/F>DFS</a></td><td>F</td><td>2700</td><td>data structures</td><td><a href=https://codeforces.com/contest/1044/submission/45296297>GNU C++14</a></td><td>04 November 2018 19:05:07</td></tr><tr><td>1024</td><td><a href=https://codeforces.com/contest/1044/problem/B>Intersecting Subtrees</a></td><td>B</td><td>1900</td><td>dfs and similar, interactive, trees</td><td><a href=https://codeforces.com/contest/1044/submission/45294645>GNU C++14</a></td><td>04 November 2018 18:50:42</td></tr><tr><td>1023</td><td><a href=https://codeforces.com/contest/1044/problem/D>Deduction Queries</a></td><td>D</td><td>2400</td><td>data structures, dsu</td><td><a href=https://codeforces.com/contest/1044/submission/45293664>GNU C++14</a></td><td>04 November 2018 18:42:41</td></tr><tr><td>1022</td><td><a href=https://codeforces.com/contest/1044/problem/C>Optimal Polygon Perimeter</a></td><td>C</td><td>2100</td><td>dp, geometry</td><td><a href=https://codeforces.com/contest/1044/submission/45291358>GNU C++14</a></td><td>04 November 2018 18:26:59</td></tr><tr><td>1021</td><td><a href=https://codeforces.com/contest/1044/problem/A>The Tower is Going Home</a></td><td>A</td><td>1700</td><td>binary search, two pointers</td><td><a href=https://codeforces.com/contest/1044/submission/45289985>GNU C++14</a></td><td>04 November 2018 18:19:25</td></tr><tr><td>1020</td><td><a href=https://codeforces.com/contest/1043/problem/G>Speckled Band</a></td><td>G</td><td>3500</td><td>data structures, divide and conquer, hashing, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/1043/submission/45149486>GNU C++14</a></td><td>31 October 2018 18:54:00</td></tr><tr><td>1019</td><td><a href=https://codeforces.com/contest/1043/problem/F>Make It One</a></td><td>F</td><td>2500</td><td>bitmasks, combinatorics, dp, math, number theory, shortest paths</td><td><a href=https://codeforces.com/contest/1043/submission/45006395>GNU C++11</a></td><td>28 October 2018 16:12:37</td></tr><tr><td>1018</td><td><a href=https://codeforces.com/contest/1043/problem/E>Train Hard, Win Easy</a></td><td>E</td><td>1900</td><td>constructive algorithms, greedy, math, sortings</td><td><a href=https://codeforces.com/contest/1043/submission/45002689>GNU C++14</a></td><td>28 October 2018 15:56:05</td></tr><tr><td>1017</td><td><a href=https://codeforces.com/contest/1043/problem/C>Smallest Word</a></td><td>C</td><td>1500</td><td>constructive algorithms, greedy, implementation</td><td><a href=https://codeforces.com/contest/1043/submission/44999861>GNU C++14</a></td><td>28 October 2018 15:46:24</td></tr><tr><td>1016</td><td><a href=https://codeforces.com/contest/1043/problem/B>Lost Array</a></td><td>B</td><td>1200</td><td>implementation</td><td><a href=https://codeforces.com/contest/1043/submission/44996520>GNU C++14</a></td><td>28 October 2018 15:38:58</td></tr><tr><td>1015</td><td><a href=https://codeforces.com/contest/458/problem/C>Elections</a></td><td>C</td><td>2100</td><td>data structures, ternary search</td><td><a href=https://codeforces.com/contest/458/submission/7416545>GNU C++</a></td><td>10 August 2014 17:40:52</td></tr><tr><td>1014</td><td><a href=https://codeforces.com/contest/899/problem/F>Letters Removing</a></td><td>F</td><td>2100</td><td>data structures, strings</td><td><a href=https://codeforces.com/contest/899/submission/44463457>GNU C++11</a></td><td>17 October 2018 22:47:50</td></tr><tr><td>1013</td><td><a href=https://codeforces.com/contest/847/problem/D>Dog Show</a></td><td>D</td><td>2200</td><td>data structures, greedy</td><td><a href=https://codeforces.com/contest/847/submission/30471735>GNU C++11</a></td><td>18 September 2017 14:44:15</td></tr><tr><td>1012</td><td><a href=https://codeforces.com/contest/863/problem/D>Yet Another Array Queries Problem</a></td><td>D</td><td>1800</td><td>data structures, implementation</td><td><a href=https://codeforces.com/contest/863/submission/44462614>GNU C++14</a></td><td>17 October 2018 21:47:03</td></tr><tr><td>1011</td><td><a href=https://codeforces.com/contest/762/problem/E>Radio stations</a></td><td>E</td><td>2200</td><td>binary search, data structures</td><td><a href=https://codeforces.com/contest/762/submission/44462365>GNU C++14</a></td><td>17 October 2018 21:33:01</td></tr><tr><td>1010</td><td><a href=https://codeforces.com/contest/892/problem/E>Envy</a></td><td>E</td><td>2300</td><td>graphs</td><td><a href=https://codeforces.com/contest/892/submission/44446976>GNU C++14</a></td><td>17 October 2018 14:18:09</td></tr><tr><td>1009</td><td><a href=https://codeforces.com/contest/1033/problem/E>Hidden Bipartite Graph</a></td><td>E</td><td>2800</td><td>binary search, constructive algorithms, dfs and similar, graphs, interactive</td><td><a href=https://codeforces.com/contest/1033/submission/43970771>GNU C++14</a></td><td>07 October 2018 18:58:22</td></tr><tr><td>1008</td><td><a href=https://codeforces.com/contest/1033/problem/G>Chip Game</a></td><td>G</td><td>3500</td><td>games</td><td><a href=https://codeforces.com/contest/1033/submission/43968349>GNU C++14</a></td><td>07 October 2018 18:36:57</td></tr><tr><td>1007</td><td><a href=https://codeforces.com/contest/1033/problem/F>Boolean Computer</a></td><td>F</td><td>2800</td><td>bitmasks, brute force, fft, math</td><td><a href=https://codeforces.com/contest/1033/submission/43965076>GNU C++14</a></td><td>07 October 2018 18:09:15</td></tr><tr><td>1006</td><td><a href=https://codeforces.com/contest/1033/problem/D>Divisors</a></td><td>D</td><td>2000</td><td>interactive, math, number theory</td><td><a href=https://codeforces.com/contest/1033/submission/43958178>GNU C++14</a></td><td>07 October 2018 17:29:30</td></tr><tr><td>1005</td><td><a href=https://codeforces.com/contest/1033/problem/C>Permutation Game</a></td><td>C</td><td>1600</td><td>brute force, dp, games</td><td><a href=https://codeforces.com/contest/1033/submission/43953103>GNU C++14</a></td><td>07 October 2018 17:12:44</td></tr><tr><td>1004</td><td><a href=https://codeforces.com/contest/1033/problem/B>Square Difference</a></td><td>B</td><td>1100</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/1033/submission/43952241>GNU C++14</a></td><td>07 October 2018 17:08:29</td></tr><tr><td>1003</td><td><a href=https://codeforces.com/contest/1033/problem/A>King Escape</a></td><td>A</td><td>1000</td><td>dfs and similar, graphs, implementation</td><td><a href=https://codeforces.com/contest/1033/submission/43952162>GNU C++14</a></td><td>07 October 2018 17:06:59</td></tr><tr><td>1002</td><td><a href=https://codeforces.com/contest/1037/problem/G>A Game on Strings</a></td><td>G</td><td>3200</td><td>games</td><td><a href=https://codeforces.com/contest/1037/submission/42400284>GNU C++11</a></td><td>02 September 2018 16:32:48</td></tr><tr><td>1001</td><td><a href=https://codeforces.com/contest/1037/problem/H>Security</a></td><td>H</td><td>3200</td><td>data structures, string suffix structures</td><td><a href=https://codeforces.com/contest/1037/submission/42390789>GNU C++11</a></td><td>02 September 2018 15:47:19</td></tr><tr><td>1000</td><td><a href=https://codeforces.com/contest/1037/problem/E>Trips</a></td><td>E</td><td>2200</td><td>graphs</td><td><a href=https://codeforces.com/contest/1037/submission/42383633>GNU C++11</a></td><td>02 September 2018 15:20:43</td></tr><tr><td>999</td><td><a href=https://codeforces.com/contest/1037/problem/F>Maximum Reduction</a></td><td>F</td><td>2500</td><td>combinatorics, data structures, math</td><td><a href=https://codeforces.com/contest/1037/submission/42381395>GNU C++11</a></td><td>02 September 2018 15:14:05</td></tr><tr><td>998</td><td><a href=https://codeforces.com/contest/1037/problem/D>Valid BFS?</a></td><td>D</td><td>1700</td><td>dfs and similar, graphs, shortest paths, trees</td><td><a href=https://codeforces.com/contest/1037/submission/42369087>GNU C++11</a></td><td>02 September 2018 14:44:47</td></tr><tr><td>997</td><td><a href=https://codeforces.com/contest/1037/problem/C>Equalize</a></td><td>C</td><td>1300</td><td>dp, greedy, strings</td><td><a href=https://codeforces.com/contest/1037/submission/42367060>GNU C++11</a></td><td>02 September 2018 14:39:51</td></tr><tr><td>996</td><td><a href=https://codeforces.com/contest/1037/problem/B>Reach Median</a></td><td>B</td><td>1300</td><td>greedy</td><td><a href=https://codeforces.com/contest/1037/submission/42366092>GNU C++11</a></td><td>02 September 2018 14:37:31</td></tr><tr><td>995</td><td><a href=https://codeforces.com/contest/1037/problem/A>Packets</a></td><td>A</td><td>1300</td><td>constructive algorithms, greedy, math</td><td><a href=https://codeforces.com/contest/1037/submission/42365839>GNU C++11</a></td><td>02 September 2018 14:36:25</td></tr><tr><td>994</td><td><a href=https://codeforces.com/contest/986/problem/D>Perfect Encoding</a></td><td>D</td><td>3100</td><td>fft, math</td><td><a href=https://codeforces.com/contest/986/submission/38733857>GNU C++14</a></td><td>29 May 2018 16:08:39</td></tr><tr><td>993</td><td><a href=https://codeforces.com/contest/1002/problem/C2>Distinguish zero state and plus state without errors</a></td><td>C2</td><td>1800</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40047429>Q#</a></td><td>07 July 2018 00:46:01</td></tr><tr><td>992</td><td><a href=https://codeforces.com/contest/1002/problem/A4>Generate W state</a></td><td>A4</td><td>1900</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40046309>Q#</a></td><td>06 July 2018 23:07:06</td></tr><tr><td>991</td><td><a href=https://codeforces.com/contest/1002/problem/D3>Oracle for majority function</a></td><td>D3</td><td>1600</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40041026>Q#</a></td><td>06 July 2018 18:33:36</td></tr><tr><td>990</td><td><a href=https://codeforces.com/contest/1002/problem/C1>Distinguish zero state and plus state with minimum error</a></td><td>C1</td><td>1700</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40040760>Q#</a></td><td>06 July 2018 18:24:44</td></tr><tr><td>989</td><td><a href=https://codeforces.com/contest/1002/problem/E2>Another array reconstruction algorithm</a></td><td>E2</td><td>1900</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40039388>Q#</a></td><td>06 July 2018 17:45:55</td></tr><tr><td>988</td><td><a href=https://codeforces.com/contest/1002/problem/B4>Distinguish four 2-qubit states - 2</a></td><td>B4</td><td>1700</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40038460>Q#</a></td><td>06 July 2018 17:23:38</td></tr><tr><td>987</td><td><a href=https://codeforces.com/contest/1002/problem/E1>Bernstein-Vazirani algorithm</a></td><td>E1</td><td>1500</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40035899>Q#</a></td><td>06 July 2018 16:27:07</td></tr><tr><td>986</td><td><a href=https://codeforces.com/contest/1002/problem/B3>Distinguish four 2-qubit states</a></td><td>B3</td><td>1600</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40035628>Q#</a></td><td>06 July 2018 16:22:07</td></tr><tr><td>985</td><td><a href=https://codeforces.com/contest/1002/problem/D2>Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2</a></td><td>D2</td><td>1300</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40035448>Q#</a></td><td>06 July 2018 16:18:32</td></tr><tr><td>984</td><td><a href=https://codeforces.com/contest/1002/problem/D1>Oracle for f(x) = b * x mod 2</a></td><td>D1</td><td>1200</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40035302>Q#</a></td><td>06 July 2018 16:15:26</td></tr><tr><td>983</td><td><a href=https://codeforces.com/contest/1002/problem/B2>Distinguish GHZ state and W state</a></td><td>B2</td><td>1600</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40035207>Q#</a></td><td>06 July 2018 16:13:32</td></tr><tr><td>982</td><td><a href=https://codeforces.com/contest/1002/problem/B1>Distinguish zero state and W state</a></td><td>B1</td><td>1300</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40035171>Q#</a></td><td>06 July 2018 16:12:51</td></tr><tr><td>981</td><td><a href=https://codeforces.com/contest/1002/problem/A3>Generate superposition of two basis states</a></td><td>A3</td><td>1500</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40035044>Q#</a></td><td>06 July 2018 16:10:27</td></tr><tr><td>980</td><td><a href=https://codeforces.com/contest/1002/problem/A2>Generate superposition of zero state and a basis state</a></td><td>A2</td><td>1300</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40034831>Q#</a></td><td>06 July 2018 16:06:19</td></tr><tr><td>979</td><td><a href=https://codeforces.com/contest/1002/problem/A1>Generate superposition of all basis states</a></td><td>A1</td><td>800</td><td></td><td><a href=https://codeforces.com/contest/1002/submission/40034609>Q#</a></td><td>06 July 2018 16:01:53</td></tr><tr><td>978</td><td><a href=https://codeforces.com/contest/1001/problem/I>Deutsch-Jozsa algorithm</a></td><td>I</td><td>1700</td><td>*special</td><td><a href=https://codeforces.com/contest/1001/submission/39873196>Q#</a></td><td>02 July 2018 15:58:44</td></tr><tr><td>977</td><td><a href=https://codeforces.com/contest/1001/problem/H>Oracle for f(x) = parity of the number of 1s in x</a></td><td>H</td><td>1200</td><td>*special</td><td><a href=https://codeforces.com/contest/1001/submission/39872969>Q#</a></td><td>02 July 2018 15:48:26</td></tr><tr><td>976</td><td><a href=https://codeforces.com/contest/1001/problem/G>Oracle for f(x) = k-th element of x</a></td><td>G</td><td>1400</td><td>*special</td><td><a href=https://codeforces.com/contest/1001/submission/39872944>Q#</a></td><td>02 July 2018 15:46:47</td></tr><tr><td>975</td><td><a href=https://codeforces.com/contest/1001/problem/F>Distinguish multi-qubit basis states</a></td><td>F</td><td>1300</td><td>*special</td><td><a href=https://codeforces.com/contest/1001/submission/39872916>Q#</a></td><td>02 July 2018 15:45:31</td></tr><tr><td>974</td><td><a href=https://codeforces.com/contest/1001/problem/E>Distinguish Bell states</a></td><td>E</td><td>1600</td><td>*special</td><td><a href=https://codeforces.com/contest/1001/submission/39872807>Q#</a></td><td>02 July 2018 15:40:53</td></tr><tr><td>973</td><td><a href=https://codeforces.com/contest/1001/problem/D>Distinguish plus state and minus state</a></td><td>D</td><td>1400</td><td>*special</td><td><a href=https://codeforces.com/contest/1001/submission/39872708>Q#</a></td><td>02 July 2018 15:36:29</td></tr><tr><td>972</td><td><a href=https://codeforces.com/contest/1001/problem/C>Generate GHZ state</a></td><td>C</td><td>1400</td><td>*special</td><td><a href=https://codeforces.com/contest/1001/submission/39872682>Q#</a></td><td>02 July 2018 15:34:49</td></tr><tr><td>971</td><td><a href=https://codeforces.com/contest/1001/problem/B>Generate Bell state</a></td><td>B</td><td>1400</td><td>*special</td><td><a href=https://codeforces.com/contest/1001/submission/39872554>Q#</a></td><td>02 July 2018 15:28:24</td></tr><tr><td>970</td><td><a href=https://codeforces.com/contest/1001/problem/A>Generate plus state or minus state</a></td><td>A</td><td>1100</td><td>*special</td><td><a href=https://codeforces.com/contest/1001/submission/39870762>Q#</a></td><td>02 July 2018 14:12:55</td></tr><tr><td>969</td><td><a href=https://codeforces.com/contest/986/problem/E>Prince's Problem</a></td><td>E</td><td>2800</td><td>brute force, data structures, math, number theory, trees</td><td><a href=https://codeforces.com/contest/986/submission/38747055>GNU C++14</a></td><td>29 May 2018 17:12:00</td></tr><tr><td>968</td><td><a href=https://codeforces.com/contest/986/problem/F>Oppa Funcan Style Remastered</a></td><td>F</td><td>3300</td><td>graphs, math, number theory, shortest paths</td><td><a href=https://codeforces.com/contest/986/submission/38743952>GNU C++14</a></td><td>29 May 2018 16:53:52</td></tr><tr><td>967</td><td><a href=https://codeforces.com/contest/986/problem/C>AND Graph</a></td><td>C</td><td>2500</td><td>bitmasks, dfs and similar, dsu, graphs</td><td><a href=https://codeforces.com/contest/986/submission/38736843>GNU C++14</a></td><td>29 May 2018 16:19:22</td></tr><tr><td>966</td><td><a href=https://codeforces.com/contest/986/problem/B>Petr and Permutations</a></td><td>B</td><td>1800</td><td>combinatorics, math</td><td><a href=https://codeforces.com/contest/986/submission/38727078>GNU C++14</a></td><td>29 May 2018 15:49:24</td></tr><tr><td>965</td><td><a href=https://codeforces.com/contest/986/problem/A>Fair</a></td><td>A</td><td>1600</td><td>graphs, greedy, number theory, shortest paths</td><td><a href=https://codeforces.com/contest/986/submission/38722963>GNU C++14</a></td><td>29 May 2018 15:39:21</td></tr><tr><td>964</td><td><a href=https://codeforces.com/contest/981/problem/H>K Paths</a></td><td>H</td><td>3100</td><td>combinatorics, data structures, dp, fft, math</td><td><a href=https://codeforces.com/contest/981/submission/38672896>GNU C++14</a></td><td>27 May 2018 16:53:47</td></tr><tr><td>963</td><td><a href=https://codeforces.com/contest/981/problem/G>Magic multisets</a></td><td>G</td><td>2500</td><td>data structures</td><td><a href=https://codeforces.com/contest/981/submission/38667922>GNU C++14</a></td><td>27 May 2018 15:52:54</td></tr><tr><td>962</td><td><a href=https://codeforces.com/contest/981/problem/F>Round Marriage</a></td><td>F</td><td>2500</td><td>binary search, graph matchings, greedy</td><td><a href=https://codeforces.com/contest/981/submission/38665996>GNU C++14</a></td><td>27 May 2018 15:34:53</td></tr><tr><td>961</td><td><a href=https://codeforces.com/contest/981/problem/E>Addition on Segments</a></td><td>E</td><td>2200</td><td>bitmasks, data structures, divide and conquer, dp</td><td><a href=https://codeforces.com/contest/981/submission/38663058>GNU C++14</a></td><td>27 May 2018 15:14:03</td></tr><tr><td>960</td><td><a href=https://codeforces.com/contest/981/problem/D>Bookshelves</a></td><td>D</td><td>1900</td><td>bitmasks, dp, greedy</td><td><a href=https://codeforces.com/contest/981/submission/38660572>GNU C++14</a></td><td>27 May 2018 15:02:45</td></tr><tr><td>959</td><td><a href=https://codeforces.com/contest/981/problem/C>Useful Decomposition</a></td><td>C</td><td>1400</td><td>implementation, trees</td><td><a href=https://codeforces.com/contest/981/submission/38659452>GNU C++14</a></td><td>27 May 2018 14:58:51</td></tr><tr><td>958</td><td><a href=https://codeforces.com/contest/981/problem/B>Businessmen Problems</a></td><td>B</td><td>1000</td><td>sortings</td><td><a href=https://codeforces.com/contest/981/submission/38657939>GNU C++14</a></td><td>27 May 2018 14:54:15</td></tr><tr><td>957</td><td><a href=https://codeforces.com/contest/981/problem/A>Antipalindrome</a></td><td>A</td><td>900</td><td>brute force, implementation, strings</td><td><a href=https://codeforces.com/contest/981/submission/38657451>GNU C++14</a></td><td>27 May 2018 14:51:29</td></tr><tr><td>956</td><td><a href=https://codeforces.com/contest/966/problem/C>Big Secret</a></td><td>C</td><td>2200</td><td>constructive algorithms, data structures, greedy, math</td><td><a href=https://codeforces.com/contest/966/submission/37723619>GNU C++14</a></td><td>29 April 2018 15:04:31</td></tr><tr><td>955</td><td><a href=https://codeforces.com/contest/966/problem/E>May Holidays</a></td><td>E</td><td>2900</td><td>data structures, trees</td><td><a href=https://codeforces.com/contest/966/submission/37721887>GNU C++14</a></td><td>29 April 2018 14:48:01</td></tr><tr><td>954</td><td><a href=https://codeforces.com/contest/966/problem/D>Aztec Catacombs</a></td><td>D</td><td>2600</td><td>constructive algorithms, graphs</td><td><a href=https://codeforces.com/contest/966/submission/37721182>GNU C++14</a></td><td>29 April 2018 14:41:49</td></tr><tr><td>953</td><td><a href=https://codeforces.com/contest/966/problem/A>Stairs and Elevators</a></td><td>A</td><td>1600</td><td>binary search, data structures, greedy</td><td><a href=https://codeforces.com/contest/966/submission/37711125>GNU C++14</a></td><td>29 April 2018 13:33:59</td></tr><tr><td>952</td><td><a href=https://codeforces.com/contest/966/problem/B>Resource Distribution</a></td><td>B</td><td>1700</td><td>binary search, data structures, greedy, two pointers</td><td><a href=https://codeforces.com/contest/966/submission/37710216>GNU C++14</a></td><td>29 April 2018 13:29:35</td></tr><tr><td>951</td><td><a href=https://codeforces.com/contest/947/problem/A>Primal Sport</a></td><td>A</td><td>1700</td><td>brute force, math, number theory</td><td><a href=https://codeforces.com/contest/947/submission/36163072>GNU C++14</a></td><td>10 March 2018 16:19:15</td></tr><tr><td>950</td><td><a href=https://codeforces.com/contest/947/problem/C>Perfect Security</a></td><td>C</td><td>1800</td><td>data structures, greedy, strings, trees</td><td><a href=https://codeforces.com/contest/947/submission/36161780>GNU C++14</a></td><td>10 March 2018 16:11:49</td></tr><tr><td>949</td><td><a href=https://codeforces.com/contest/947/problem/B>Producing Snow</a></td><td>B</td><td>1600</td><td>binary search, data structures, implementation</td><td><a href=https://codeforces.com/contest/947/submission/36160738>GNU C++14</a></td><td>10 March 2018 16:05:53</td></tr><tr><td>948</td><td><a href=https://codeforces.com/contest/101606/problem/K>Knightsbridge Rises</a></td><td>K</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32311416>GNU C++14</a></td><td>14 November 2017 12:36:27</td></tr><tr><td>947</td><td><a href=https://codeforces.com/contest/101606/problem/G>Gentlebots</a></td><td>G</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32311047>GNU C++14</a></td><td>14 November 2017 12:23:54</td></tr><tr><td>946</td><td><a href=https://codeforces.com/contest/101606/problem/L>Lizard Lounge</a></td><td>L</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32310338>GNU C++14</a></td><td>14 November 2017 11:56:58</td></tr><tr><td>945</td><td><a href=https://codeforces.com/contest/101606/problem/E>Education</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32310203>GNU C++14</a></td><td>14 November 2017 11:52:18</td></tr><tr><td>944</td><td><a href=https://codeforces.com/contest/101606/problem/B>Breaking Biscuits</a></td><td>B</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32310132>GNU C++14</a></td><td>14 November 2017 11:48:50</td></tr><tr><td>943</td><td><a href=https://codeforces.com/contest/101606/problem/I>I Work All Day</a></td><td>I</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32309930>GNU C++14</a></td><td>14 November 2017 11:40:28</td></tr><tr><td>942</td><td><a href=https://codeforces.com/contest/101606/problem/F>Flipping Coins</a></td><td>F</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32309886>GNU C++14</a></td><td>14 November 2017 11:39:20</td></tr><tr><td>941</td><td><a href=https://codeforces.com/contest/101606/problem/D>Deranging Hat</a></td><td>D</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32309799>GNU C++14</a></td><td>14 November 2017 11:36:06</td></tr><tr><td>940</td><td><a href=https://codeforces.com/contest/101606/problem/C>Cued In</a></td><td>C</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32309731>GNU C++14</a></td><td>14 November 2017 11:33:10</td></tr><tr><td>939</td><td><a href=https://codeforces.com/contest/101606/problem/J>Just A Minim</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32309610>GNU C++14</a></td><td>14 November 2017 11:28:04</td></tr><tr><td>938</td><td><a href=https://codeforces.com/contest/101606/problem/A>Alien Sunset</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/101606/submission/32309582>GNU C++14</a></td><td>14 November 2017 11:26:25</td></tr><tr><td>937</td><td><a href=https://codeforces.com/contest/723/problem/E>One-Way Reform</a></td><td>E</td><td>2200</td><td>constructive algorithms, dfs and similar, flows, graphs, greedy</td><td><a href=https://codeforces.com/contest/723/submission/32231520>GNU C++14</a></td><td>11 November 2017 22:09:17</td></tr><tr><td>936</td><td><a href=https://codeforces.com/contest/508/problem/D>Tanya and Password</a></td><td>D</td><td>2500</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/508/submission/32228776>GNU C++14</a></td><td>11 November 2017 19:10:22</td></tr><tr><td>935</td><td><a href=https://codeforces.com/contest/757/problem/F>Team Rocket Rises Again</a></td><td>F</td><td>2800</td><td>data structures, graphs, shortest paths</td><td><a href=https://codeforces.com/contest/757/submission/23762892>GNU C++11</a></td><td>12 January 2017 17:34:49</td></tr><tr><td>934</td><td><a href=https://codeforces.com/contest/860/problem/E>Arkady and a Nobody-men</a></td><td>E</td><td>2700</td><td>data structures, dfs and similar, trees</td><td><a href=https://codeforces.com/contest/860/submission/32155358>GNU C++14</a></td><td>09 November 2017 10:45:38</td></tr><tr><td>933</td><td><a href=https://codeforces.com/contest/17/problem/E>Palisection</a></td><td>E</td><td>2900</td><td>strings</td><td><a href=https://codeforces.com/contest/17/submission/31475516>GNU C++14</a></td><td>18 October 2017 09:45:27</td></tr><tr><td>932</td><td><a href=https://codeforces.com/contest/875/problem/E>Delivery Club</a></td><td>E</td><td>2600</td><td>binary search, data structures, dp</td><td><a href=https://codeforces.com/contest/875/submission/31464940>GNU C++14</a></td><td>17 October 2017 22:59:06</td></tr><tr><td>931</td><td><a href=https://codeforces.com/contest/343/problem/E>Pumping Stations</a></td><td>E</td><td>2900</td><td>brute force, dfs and similar, divide and conquer, flows, graphs, greedy, trees</td><td><a href=https://codeforces.com/contest/343/submission/4470358>GNU C++</a></td><td>14 September 2013 17:35:31</td></tr><tr><td>930</td><td><a href=https://codeforces.com/contest/866/problem/D>Buy Low Sell High</a></td><td>D</td><td>2400</td><td>data structures, greedy, two pointers</td><td><a href=https://codeforces.com/contest/866/submission/30877994>GNU C++11</a></td><td>30 September 2017 17:53:26</td></tr><tr><td>929</td><td><a href=https://codeforces.com/contest/866/problem/F>Egg Roulette</a></td><td>F</td><td>3300</td><td>combinatorics, meet-in-the-middle</td><td><a href=https://codeforces.com/contest/866/submission/30883978>GNU C++11</a></td><td>30 September 2017 19:43:24</td></tr><tr><td>928</td><td><a href=https://codeforces.com/contest/866/problem/C>Gotta Go Fast</a></td><td>C</td><td>2400</td><td>binary search, dp, probabilities</td><td><a href=https://codeforces.com/contest/866/submission/30875892>GNU C++11</a></td><td>30 September 2017 17:24:50</td></tr><tr><td>927</td><td><a href=https://codeforces.com/contest/866/problem/B>Ordering Pizza</a></td><td>B</td><td>1900</td><td>greedy, implementation, sortings</td><td><a href=https://codeforces.com/contest/866/submission/30874326>GNU C++11</a></td><td>30 September 2017 17:13:51</td></tr><tr><td>926</td><td><a href=https://codeforces.com/contest/866/problem/A>Save the problem!</a></td><td>A</td><td>1400</td><td>combinatorics, constructive algorithms, math</td><td><a href=https://codeforces.com/contest/866/submission/30872518>GNU C++11</a></td><td>30 September 2017 17:06:51</td></tr><tr><td>925</td><td><a href=https://codeforces.com/contest/859/problem/E>Desk Disorder</a></td><td>E</td><td>2100</td><td>combinatorics, dfs and similar, dsu, graphs, trees</td><td><a href=https://codeforces.com/contest/859/submission/30400405>GNU C++14</a></td><td>16 September 2017 19:26:20</td></tr><tr><td>924</td><td><a href=https://codeforces.com/contest/855/problem/D>Rowena Ravenclaw's Diadem</a></td><td>D</td><td>2500</td><td>trees</td><td><a href=https://codeforces.com/contest/855/submission/30685377>GNU C++11</a></td><td>24 September 2017 16:52:32</td></tr><tr><td>923</td><td><a href=https://codeforces.com/contest/855/problem/F>Nagini</a></td><td>F</td><td>3100</td><td>binary search, data structures</td><td><a href=https://codeforces.com/contest/855/submission/30684189>GNU C++11</a></td><td>24 September 2017 16:36:56</td></tr><tr><td>922</td><td><a href=https://codeforces.com/contest/855/problem/C>Helga Hufflepuff's Cup</a></td><td>C</td><td>2000</td><td>dp, trees</td><td><a href=https://codeforces.com/contest/855/submission/30674920>GNU C++11</a></td><td>24 September 2017 15:02:46</td></tr><tr><td>921</td><td><a href=https://codeforces.com/contest/855/problem/E>Salazar Slytherin's Locket</a></td><td>E</td><td>2200</td><td>bitmasks, dp</td><td><a href=https://codeforces.com/contest/855/submission/30673508>GNU C++14</a></td><td>24 September 2017 14:54:58</td></tr><tr><td>920</td><td><a href=https://codeforces.com/contest/855/problem/B>Marvolo Gaunt's Ring</a></td><td>B</td><td>1500</td><td>brute force, data structures, dp</td><td><a href=https://codeforces.com/contest/855/submission/30669313>GNU C++11</a></td><td>24 September 2017 14:38:13</td></tr><tr><td>919</td><td><a href=https://codeforces.com/contest/855/problem/A>Tom Riddle's Diary</a></td><td>A</td><td>800</td><td>brute force, implementation, strings</td><td><a href=https://codeforces.com/contest/855/submission/30668142>GNU C++11</a></td><td>24 September 2017 14:35:52</td></tr><tr><td>918</td><td><a href=https://codeforces.com/contest/847/problem/J>Students Initiation</a></td><td>J</td><td>2400</td><td>binary search, flows, graphs</td><td><a href=https://codeforces.com/contest/847/submission/30471048>GNU C++11</a></td><td>18 September 2017 14:32:49</td></tr><tr><td>917</td><td><a href=https://codeforces.com/contest/847/problem/K>Travel Cards</a></td><td>K</td><td>1800</td><td>greedy, implementation, sortings</td><td><a href=https://codeforces.com/contest/847/submission/30469955>GNU C++11</a></td><td>18 September 2017 14:15:34</td></tr><tr><td>916</td><td><a href=https://codeforces.com/contest/847/problem/L>Berland SU Computer Network</a></td><td>L</td><td>2400</td><td>dfs and similar, hashing, trees</td><td><a href=https://codeforces.com/contest/847/submission/30469704>GNU C++11</a></td><td>18 September 2017 14:11:28</td></tr><tr><td>915</td><td><a href=https://codeforces.com/contest/847/problem/F>Berland Elections</a></td><td>F</td><td>2100</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/847/submission/30468712>GNU C++11</a></td><td>18 September 2017 13:56:27</td></tr><tr><td>914</td><td><a href=https://codeforces.com/contest/847/problem/I>Noise Level</a></td><td>I</td><td>1900</td><td>dfs and similar, implementation, math</td><td><a href=https://codeforces.com/contest/847/submission/30467605>GNU C++11</a></td><td>18 September 2017 13:40:46</td></tr><tr><td>913</td><td><a href=https://codeforces.com/contest/847/problem/C>Sum of Nestings</a></td><td>C</td><td>1800</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/847/submission/30467117>GNU C++11</a></td><td>18 September 2017 13:34:52</td></tr><tr><td>912</td><td><a href=https://codeforces.com/contest/847/problem/H>Load Testing</a></td><td>H</td><td>1600</td><td>greedy</td><td><a href=https://codeforces.com/contest/847/submission/30466527>GNU C++11</a></td><td>18 September 2017 13:26:45</td></tr><tr><td>911</td><td><a href=https://codeforces.com/contest/847/problem/B>Preparing for Merge Sort</a></td><td>B</td><td>1600</td><td>binary search, data structures</td><td><a href=https://codeforces.com/contest/847/submission/30466097>GNU C++11</a></td><td>18 September 2017 13:21:43</td></tr><tr><td>910</td><td><a href=https://codeforces.com/contest/847/problem/A>Union of Doubly Linked Lists</a></td><td>A</td><td>1500</td><td>implementation</td><td><a href=https://codeforces.com/contest/847/submission/30465514>GNU C++11</a></td><td>18 September 2017 13:16:01</td></tr><tr><td>909</td><td><a href=https://codeforces.com/contest/847/problem/M>Weather Tomorrow</a></td><td>M</td><td>1000</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/847/submission/30465123>GNU C++11</a></td><td>18 September 2017 13:11:43</td></tr><tr><td>908</td><td><a href=https://codeforces.com/contest/847/problem/G>University Classes</a></td><td>G</td><td>900</td><td>implementation</td><td><a href=https://codeforces.com/contest/847/submission/30465040>GNU C++11</a></td><td>18 September 2017 13:10:17</td></tr><tr><td>907</td><td><a href=https://codeforces.com/contest/847/problem/E>Packmen</a></td><td>E</td><td>1800</td><td>binary search, dp</td><td><a href=https://codeforces.com/contest/847/submission/30464988>GNU C++11</a></td><td>18 September 2017 13:09:05</td></tr><tr><td>906</td><td><a href=https://codeforces.com/contest/859/problem/F>Ordering T-Shirts</a></td><td>F</td><td>2800</td><td>greedy</td><td><a href=https://codeforces.com/contest/859/submission/30399806>GNU C++14</a></td><td>16 September 2017 19:20:36</td></tr><tr><td>905</td><td><a href=https://codeforces.com/contest/859/problem/G>Circle of Numbers</a></td><td>G</td><td>3000</td><td>math</td><td><a href=https://codeforces.com/contest/859/submission/30399335>GNU C++14</a></td><td>16 September 2017 19:11:40</td></tr><tr><td>904</td><td><a href=https://codeforces.com/contest/859/problem/D>Third Month Insanity</a></td><td>D</td><td>2100</td><td>dp, probabilities, trees</td><td><a href=https://codeforces.com/contest/859/submission/30392672>GNU C++14</a></td><td>16 September 2017 17:51:07</td></tr><tr><td>903</td><td><a href=https://codeforces.com/contest/859/problem/C>Pie Rules</a></td><td>C</td><td>1500</td><td>dp, games</td><td><a href=https://codeforces.com/contest/859/submission/30390934>GNU C++14</a></td><td>16 September 2017 17:42:27</td></tr><tr><td>902</td><td><a href=https://codeforces.com/contest/859/problem/A>Declined Finalists</a></td><td>A</td><td>800</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/859/submission/30389617>GNU C++14</a></td><td>16 September 2017 17:37:33</td></tr><tr><td>901</td><td><a href=https://codeforces.com/contest/859/problem/B>Lazy Security Guard</a></td><td>B</td><td>1000</td><td>brute force, geometry, math</td><td><a href=https://codeforces.com/contest/859/submission/30389453>GNU C++14</a></td><td>16 September 2017 17:36:15</td></tr><tr><td>900</td><td><a href=https://codeforces.com/contest/827/problem/E>Rusty String</a></td><td>E</td><td>2700</td><td>fft, math, strings</td><td><a href=https://codeforces.com/contest/827/submission/30327342>GNU C++14</a></td><td>14 September 2017 12:01:55</td></tr><tr><td>899</td><td><a href=https://codeforces.com/contest/856/problem/F>To Play or not to Play</a></td><td>F</td><td>3000</td><td>greedy</td><td><a href=https://codeforces.com/contest/856/submission/30270052>GNU C++14</a></td><td>11 September 2017 16:27:33</td></tr><tr><td>898</td><td><a href=https://codeforces.com/contest/852/problem/H>Bob and stages</a></td><td>H</td><td>3000</td><td>dp, geometry</td><td><a href=https://codeforces.com/contest/852/submission/30033306>Java 8</a></td><td>03 September 2017 12:10:16</td></tr><tr><td>897</td><td><a href=https://codeforces.com/contest/852/problem/A>Digits</a></td><td>A</td><td>2500</td><td>brute force, implementation, math</td><td><a href=https://codeforces.com/contest/852/submission/30032726>GNU C++14</a></td><td>03 September 2017 11:54:01</td></tr><tr><td>896</td><td><a href=https://codeforces.com/contest/852/problem/I>Dating</a></td><td>I</td><td>2300</td><td>brute force, dfs and similar, graphs, trees</td><td><a href=https://codeforces.com/contest/852/submission/30030674>GNU C++14</a></td><td>03 September 2017 11:02:44</td></tr><tr><td>895</td><td><a href=https://codeforces.com/contest/852/problem/D>Exploration plan</a></td><td>D</td><td>2100</td><td>binary search, flows, graph matchings, shortest paths</td><td><a href=https://codeforces.com/contest/852/submission/30030025>GNU C++14</a></td><td>03 September 2017 10:46:58</td></tr><tr><td>894</td><td><a href=https://codeforces.com/contest/852/problem/C>Property</a></td><td>C</td><td>2100</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/852/submission/30029869>Java 8</a></td><td>03 September 2017 10:42:43</td></tr><tr><td>893</td><td><a href=https://codeforces.com/contest/852/problem/G>Bathroom terminal</a></td><td>G</td><td>1700</td><td>implementation</td><td><a href=https://codeforces.com/contest/852/submission/30029432>GNU C++14</a></td><td>03 September 2017 10:29:51</td></tr><tr><td>892</td><td><a href=https://codeforces.com/contest/852/problem/E>Casinos and travel</a></td><td>E</td><td>2100</td><td>dp</td><td><a href=https://codeforces.com/contest/852/submission/30029400>GNU C++14</a></td><td>03 September 2017 10:28:59</td></tr><tr><td>891</td><td><a href=https://codeforces.com/contest/852/problem/F>Product transformation</a></td><td>F</td><td>2200</td><td>combinatorics, math, number theory</td><td><a href=https://codeforces.com/contest/852/submission/30029310>Java 8</a></td><td>03 September 2017 10:26:02</td></tr><tr><td>890</td><td><a href=https://codeforces.com/contest/852/problem/B>Neural Network country</a></td><td>B</td><td>2000</td><td>dp, matrices</td><td><a href=https://codeforces.com/contest/852/submission/30028901>GNU C++14</a></td><td>03 September 2017 10:10:29</td></tr><tr><td>889</td><td><a href=https://codeforces.com/contest/843/problem/E>Maximum Flow</a></td><td>E</td><td>3000</td><td>flows, graphs</td><td><a href=https://codeforces.com/contest/843/submission/29762394>GNU C++11</a></td><td>24 August 2017 21:56:46</td></tr><tr><td>888</td><td><a href=https://codeforces.com/contest/843/problem/C>Upgrading Tree</a></td><td>C</td><td>2600</td><td>constructive algorithms, dfs and similar, graphs, math, trees</td><td><a href=https://codeforces.com/contest/843/submission/29747919>GNU C++11</a></td><td>24 August 2017 17:32:35</td></tr><tr><td>887</td><td><a href=https://codeforces.com/contest/843/problem/B>Interactive LowerBound</a></td><td>B</td><td>2000</td><td>brute force, interactive, probabilities</td><td><a href=https://codeforces.com/contest/843/submission/29739815>GNU C++11</a></td><td>24 August 2017 16:49:47</td></tr><tr><td>886</td><td><a href=https://codeforces.com/contest/843/problem/A>Sorting by Subsequences</a></td><td>A</td><td>1400</td><td>dfs and similar, dsu, implementation, math, sortings</td><td><a href=https://codeforces.com/contest/843/submission/29736447>GNU C++11</a></td><td>24 August 2017 16:38:37</td></tr><tr><td>885</td><td><a href=https://codeforces.com/contest/799/problem/E>Aquarium decoration</a></td><td>E</td><td>2500</td><td>data structures, greedy, two pointers</td><td><a href=https://codeforces.com/contest/799/submission/27056967>GNU C++11</a></td><td>12 May 2017 14:59:29</td></tr><tr><td>884</td><td><a href=https://codeforces.com/contest/799/problem/G>Cut the pie</a></td><td>G</td><td>3500</td><td>binary search, data structures, geometry</td><td><a href=https://codeforces.com/contest/799/submission/27036616>GNU C++11</a></td><td>11 May 2017 17:32:57</td></tr><tr><td>883</td><td><a href=https://codeforces.com/contest/799/problem/F>Beautiful fountains rows</a></td><td>F</td><td>3500</td><td>data structures</td><td><a href=https://codeforces.com/contest/799/submission/27030563>GNU C++11</a></td><td>11 May 2017 16:56:31</td></tr><tr><td>882</td><td><a href=https://codeforces.com/contest/799/problem/D>Field expansion</a></td><td>D</td><td>2100</td><td>brute force, dp, meet-in-the-middle</td><td><a href=https://codeforces.com/contest/799/submission/27022631>GNU C++11</a></td><td>11 May 2017 16:12:20</td></tr><tr><td>881</td><td><a href=https://codeforces.com/contest/799/problem/B>T-shirt buying</a></td><td>B</td><td>1400</td><td>data structures, implementation</td><td><a href=https://codeforces.com/contest/799/submission/27019416>GNU C++11</a></td><td>11 May 2017 15:54:05</td></tr><tr><td>880</td><td><a href=https://codeforces.com/contest/799/problem/C>Fountains</a></td><td>C</td><td>1800</td><td>binary search, data structures, implementation</td><td><a href=https://codeforces.com/contest/799/submission/27018858>GNU C++11</a></td><td>11 May 2017 15:51:19</td></tr><tr><td>879</td><td><a href=https://codeforces.com/contest/799/problem/A>Carrot Cakes</a></td><td>A</td><td>1100</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/799/submission/27018375>GNU C++11</a></td><td>11 May 2017 15:48:54</td></tr><tr><td>878</td><td><a href=https://codeforces.com/contest/776/problem/F>Sherlock's bet to Moriarty</a></td><td>F</td><td>2800</td><td>constructive algorithms, data structures, divide and conquer, geometry, graphs, implementation, trees</td><td><a href=https://codeforces.com/contest/776/submission/24940601>GNU C++11</a></td><td>23 February 2017 16:48:09</td></tr><tr><td>877</td><td><a href=https://codeforces.com/contest/776/problem/G>Sherlock and the Encrypted Data</a></td><td>G</td><td>2900</td><td>bitmasks, combinatorics, dp</td><td><a href=https://codeforces.com/contest/776/submission/24933167>GNU C++11</a></td><td>23 February 2017 15:49:18</td></tr><tr><td>876</td><td><a href=https://codeforces.com/contest/776/problem/D>The Door Problem</a></td><td>D</td><td>2000</td><td>2-sat, dfs and similar, dsu, graphs</td><td><a href=https://codeforces.com/contest/776/submission/24926240>GNU C++11</a></td><td>23 February 2017 15:14:00</td></tr><tr><td>875</td><td><a href=https://codeforces.com/contest/776/problem/C>Molly's Chemicals</a></td><td>C</td><td>1800</td><td>binary search, brute force, data structures, implementation, math</td><td><a href=https://codeforces.com/contest/776/submission/24924230>GNU C++11</a></td><td>23 February 2017 15:06:45</td></tr><tr><td>874</td><td><a href=https://codeforces.com/contest/776/problem/E>The Holmes Children</a></td><td>E</td><td>2100</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/776/submission/24922427>GNU C++11</a></td><td>23 February 2017 15:01:11</td></tr><tr><td>873</td><td><a href=https://codeforces.com/contest/776/problem/B>Sherlock and his girlfriend</a></td><td>B</td><td>1200</td><td>constructive algorithms, number theory</td><td><a href=https://codeforces.com/contest/776/submission/24919248>GNU C++11</a></td><td>23 February 2017 14:52:26</td></tr><tr><td>872</td><td><a href=https://codeforces.com/contest/776/problem/A>A Serial Killer</a></td><td>A</td><td>900</td><td>brute force, implementation, strings</td><td><a href=https://codeforces.com/contest/776/submission/24918716>GNU C++11</a></td><td>23 February 2017 14:51:02</td></tr><tr><td>871</td><td><a href=https://codeforces.com/contest/756/problem/D>Bacterial Melee</a></td><td>D</td><td>2400</td><td>brute force, combinatorics, dp, string suffix structures</td><td><a href=https://codeforces.com/contest/756/submission/24039817>GNU C++14</a></td><td>22 January 2017 18:34:47</td></tr><tr><td>870</td><td><a href=https://codeforces.com/contest/756/problem/C>Nikita and stack</a></td><td>C</td><td>2200</td><td>data structures</td><td><a href=https://codeforces.com/contest/756/submission/24041809>GNU C++14</a></td><td>22 January 2017 18:47:01</td></tr><tr><td>869</td><td><a href=https://codeforces.com/contest/756/problem/A>Pavel and barbecue</a></td><td>A</td><td>1700</td><td>constructive algorithms, dfs and similar</td><td><a href=https://codeforces.com/contest/756/submission/24037453>GNU C++14</a></td><td>22 January 2017 18:24:57</td></tr><tr><td>868</td><td><a href=https://codeforces.com/contest/756/problem/B>Travel Card</a></td><td>B</td><td>1600</td><td>binary search, dp</td><td><a href=https://codeforces.com/contest/756/submission/24036019>GNU C++14</a></td><td>22 January 2017 18:19:44</td></tr><tr><td>867</td><td><a href=https://codeforces.com/contest/755/problem/G>PolandBall and Many Other Balls</a></td><td>G</td><td>3200</td><td>combinatorics, divide and conquer, dp, fft, math, number theory</td><td><a href=https://codeforces.com/contest/755/submission/23864695>GNU C++14</a></td><td>15 January 2017 18:59:46</td></tr><tr><td>866</td><td><a href=https://codeforces.com/contest/755/problem/E>PolandBall and White-Red graph</a></td><td>E</td><td>2400</td><td>constructive algorithms, graphs, shortest paths</td><td><a href=https://codeforces.com/contest/755/submission/23856305>GNU C++14</a></td><td>15 January 2017 17:45:29</td></tr><tr><td>865</td><td><a href=https://codeforces.com/contest/755/problem/F>PolandBall and Gifts</a></td><td>F</td><td>2600</td><td>bitmasks, dp, greedy</td><td><a href=https://codeforces.com/contest/755/submission/23854346>GNU C++14</a></td><td>15 January 2017 17:35:26</td></tr><tr><td>864</td><td><a href=https://codeforces.com/contest/755/problem/C>PolandBall and Forest</a></td><td>C</td><td>1300</td><td>dfs and similar, dsu, graphs, interactive, trees</td><td><a href=https://codeforces.com/contest/755/submission/23852255>GNU C++14</a></td><td>15 January 2017 17:27:09</td></tr><tr><td>863</td><td><a href=https://codeforces.com/contest/755/problem/D>PolandBall and Polygon</a></td><td>D</td><td>2000</td><td>data structures</td><td><a href=https://codeforces.com/contest/755/submission/23850075>GNU C++14</a></td><td>15 January 2017 17:18:03</td></tr><tr><td>862</td><td><a href=https://codeforces.com/contest/755/problem/B>PolandBall and Game</a></td><td>B</td><td>1100</td><td>binary search, data structures, games, greedy, sortings, strings</td><td><a href=https://codeforces.com/contest/755/submission/23847935>GNU C++14</a></td><td>15 January 2017 17:10:18</td></tr><tr><td>861</td><td><a href=https://codeforces.com/contest/755/problem/A>PolandBall and Hypothesis</a></td><td>A</td><td>800</td><td>brute force, graphs, math, number theory</td><td><a href=https://codeforces.com/contest/755/submission/23846955>GNU C++14</a></td><td>15 January 2017 17:07:52</td></tr><tr><td>860</td><td><a href=https://codeforces.com/contest/757/problem/G>Can Bash Save the Day?</a></td><td>G</td><td>3400</td><td>data structures, divide and conquer, graphs, trees</td><td><a href=https://codeforces.com/contest/757/submission/23782048>GNU C++14</a></td><td>13 January 2017 10:31:09</td></tr><tr><td>859</td><td><a href=https://codeforces.com/contest/757/problem/D>Felicity's Big Secret Revealed</a></td><td>D</td><td>2200</td><td>bitmasks, dp</td><td><a href=https://codeforces.com/contest/757/submission/23749937>GNU C++11</a></td><td>12 January 2017 16:09:46</td></tr><tr><td>858</td><td><a href=https://codeforces.com/contest/757/problem/C>Felicity is Coming!</a></td><td>C</td><td>1900</td><td>data structures, hashing, sortings, strings</td><td><a href=https://codeforces.com/contest/757/submission/23747486>GNU C++11</a></td><td>12 January 2017 16:00:11</td></tr><tr><td>857</td><td><a href=https://codeforces.com/contest/757/problem/E>Bash Plays with Functions</a></td><td>E</td><td>2500</td><td>brute force, combinatorics, dp, number theory</td><td><a href=https://codeforces.com/contest/757/submission/23746626>GNU C++11</a></td><td>12 January 2017 15:56:56</td></tr><tr><td>856</td><td><a href=https://codeforces.com/contest/757/problem/B>Bash's Big Day</a></td><td>B</td><td>1400</td><td>greedy, math, number theory</td><td><a href=https://codeforces.com/contest/757/submission/23740589>GNU C++11</a></td><td>12 January 2017 15:40:35</td></tr><tr><td>855</td><td><a href=https://codeforces.com/contest/757/problem/A>Gotta Catch Em' All!</a></td><td>A</td><td>1000</td><td>implementation</td><td><a href=https://codeforces.com/contest/757/submission/23740335>GNU C++11</a></td><td>12 January 2017 15:39:56</td></tr><tr><td>854</td><td><a href=https://codeforces.com/contest/750/problem/F>New Year and Finding Roots</a></td><td>F</td><td>2800</td><td>constructive algorithms, implementation, interactive, trees</td><td><a href=https://codeforces.com/contest/750/submission/23449466>GNU C++11</a></td><td>30 December 2016 16:19:45</td></tr><tr><td>853</td><td><a href=https://codeforces.com/contest/750/problem/G>New Year and Binary Tree Paths</a></td><td>G</td><td>3200</td><td>bitmasks, brute force, combinatorics, dp</td><td><a href=https://codeforces.com/contest/750/submission/23441840>GNU C++11</a></td><td>30 December 2016 15:27:25</td></tr><tr><td>852</td><td><a href=https://codeforces.com/contest/750/problem/D>New Year and Fireworks</a></td><td>D</td><td>1900</td><td>brute force, data structures, dfs and similar, dp, implementation</td><td><a href=https://codeforces.com/contest/750/submission/23432322>GNU C++11</a></td><td>30 December 2016 14:41:20</td></tr><tr><td>851</td><td><a href=https://codeforces.com/contest/750/problem/B>New Year and North Pole</a></td><td>B</td><td>1300</td><td>geometry, implementation</td><td><a href=https://codeforces.com/contest/750/submission/23425358>GNU C++11</a></td><td>30 December 2016 14:23:33</td></tr><tr><td>850</td><td><a href=https://codeforces.com/contest/750/problem/C>New Year and Rating</a></td><td>C</td><td>1600</td><td>binary search, greedy, math</td><td><a href=https://codeforces.com/contest/750/submission/23423631>GNU C++11</a></td><td>30 December 2016 14:20:37</td></tr><tr><td>849</td><td><a href=https://codeforces.com/contest/750/problem/A>New Year and Hurry</a></td><td>A</td><td>800</td><td>binary search, brute force, implementation, math</td><td><a href=https://codeforces.com/contest/750/submission/23420989>GNU C++11</a></td><td>30 December 2016 14:16:27</td></tr><tr><td>848</td><td><a href=https://codeforces.com/contest/744/problem/D>Hongcow Draws a Circle</a></td><td>D</td><td>3200</td><td>geometry</td><td><a href=https://codeforces.com/contest/744/submission/23101161>GNU C++11</a></td><td>18 December 2016 12:42:24</td></tr><tr><td>847</td><td><a href=https://codeforces.com/contest/744/problem/B>Hongcow's Game</a></td><td>B</td><td>1900</td><td>bitmasks, divide and conquer, interactive</td><td><a href=https://codeforces.com/contest/744/submission/23055547>GNU C++11</a></td><td>17 December 2016 16:49:10</td></tr><tr><td>846</td><td><a href=https://codeforces.com/contest/744/problem/C>Hongcow Buys a Deck of Cards</a></td><td>C</td><td>2400</td><td>bitmasks, brute force, dp</td><td><a href=https://codeforces.com/contest/744/submission/23057499>GNU C++11</a></td><td>17 December 2016 17:00:13</td></tr><tr><td>845</td><td><a href=https://codeforces.com/contest/744/problem/E>Hongcow Masters the Cyclic Shift</a></td><td>E</td><td>3200</td><td>strings, two pointers</td><td><a href=https://codeforces.com/contest/744/submission/23063797>GNU C++11</a></td><td>17 December 2016 17:39:11</td></tr><tr><td>844</td><td><a href=https://codeforces.com/contest/744/problem/A>Hongcow Builds A Nation</a></td><td>A</td><td>1500</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/744/submission/23052903>GNU C++11</a></td><td>17 December 2016 16:39:42</td></tr><tr><td>843</td><td><a href=https://codeforces.com/contest/717/problem/I>Cowboy Beblop at his computer</a></td><td>I</td><td>2800</td><td>geometry</td><td><a href=https://codeforces.com/contest/717/submission/20532920>Java 8</a></td><td>11 September 2016 13:39:52</td></tr><tr><td>842</td><td><a href=https://codeforces.com/contest/717/problem/A>Festival Organization</a></td><td>A</td><td>2900</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/717/submission/20530305>Java 8</a></td><td>11 September 2016 11:57:19</td></tr><tr><td>841</td><td><a href=https://codeforces.com/contest/717/problem/G>Underfail</a></td><td>G</td><td>2400</td><td>flows</td><td><a href=https://codeforces.com/contest/717/submission/20529407>GNU C++11</a></td><td>11 September 2016 11:24:38</td></tr><tr><td>840</td><td><a href=https://codeforces.com/contest/717/problem/H>Pokermon League challenge</a></td><td>H</td><td>2400</td><td>math, probabilities</td><td><a href=https://codeforces.com/contest/717/submission/20528498>GNU C++11</a></td><td>11 September 2016 10:52:51</td></tr><tr><td>839</td><td><a href=https://codeforces.com/contest/717/problem/B>R3D3’s Summer Adventure</a></td><td>B</td><td>2700</td><td>dp, greedy</td><td><a href=https://codeforces.com/contest/717/submission/20528372>Java 8</a></td><td>11 September 2016 10:48:21</td></tr><tr><td>838</td><td><a href=https://codeforces.com/contest/717/problem/F>Heroes of Making Magic III</a></td><td>F</td><td>2600</td><td>data structures</td><td><a href=https://codeforces.com/contest/717/submission/20528238>GNU C++11</a></td><td>11 September 2016 10:44:06</td></tr><tr><td>837</td><td><a href=https://codeforces.com/contest/717/problem/E>Paint it really, really dark gray</a></td><td>E</td><td>1900</td><td>dfs and similar</td><td><a href=https://codeforces.com/contest/717/submission/20525219>GNU C++11</a></td><td>11 September 2016 09:24:12</td></tr><tr><td>836</td><td><a href=https://codeforces.com/contest/717/problem/C>Potions Homework</a></td><td>C</td><td>1200</td><td>implementation, sortings</td><td><a href=https://codeforces.com/contest/717/submission/20524804>GNU C++11</a></td><td>11 September 2016 09:15:57</td></tr><tr><td>835</td><td><a href=https://codeforces.com/contest/717/problem/D>Dexterina’s Lab</a></td><td>D</td><td>1900</td><td>games, matrices, probabilities</td><td><a href=https://codeforces.com/contest/717/submission/20524793>GNU C++11</a></td><td>11 September 2016 09:15:42</td></tr><tr><td>834</td><td><a href=https://codeforces.com/contest/710/problem/D>Two Arithmetic Progressions</a></td><td>D</td><td>2500</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/710/submission/20102628>GNU C++11</a></td><td>24 August 2016 09:36:58</td></tr><tr><td>833</td><td><a href=https://codeforces.com/contest/710/problem/F>String Set Queries</a></td><td>F</td><td>2400</td><td>brute force, data structures, hashing, interactive, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/710/submission/20058436>GNU C++11</a></td><td>22 August 2016 15:09:21</td></tr><tr><td>832</td><td><a href=https://codeforces.com/contest/710/problem/C>Magic Odd Square</a></td><td>C</td><td>1500</td><td>constructive algorithms, math</td><td><a href=https://codeforces.com/contest/710/submission/20056438>GNU C++11</a></td><td>22 August 2016 14:54:25</td></tr><tr><td>831</td><td><a href=https://codeforces.com/contest/710/problem/E>Generate a String</a></td><td>E</td><td>2000</td><td>dfs and similar, dp</td><td><a href=https://codeforces.com/contest/710/submission/20050515>GNU C++11</a></td><td>22 August 2016 14:22:26</td></tr><tr><td>830</td><td><a href=https://codeforces.com/contest/710/problem/B>Optimal Point on a Line</a></td><td>B</td><td>1400</td><td>brute force, sortings</td><td><a href=https://codeforces.com/contest/710/submission/20047656>GNU C++11</a></td><td>22 August 2016 14:12:57</td></tr><tr><td>829</td><td><a href=https://codeforces.com/contest/710/problem/A>King Moves</a></td><td>A</td><td>800</td><td>implementation</td><td><a href=https://codeforces.com/contest/710/submission/20047537>GNU C++11</a></td><td>22 August 2016 14:11:06</td></tr><tr><td>828</td><td><a href=https://codeforces.com/contest/695/problem/C>Limak and Shooting Points</a></td><td>C</td><td>2600</td><td>geometry, math</td><td><a href=https://codeforces.com/contest/695/submission/18867022>GNU C++11</a></td><td>03 July 2016 11:40:03</td></tr><tr><td>827</td><td><a href=https://codeforces.com/contest/695/problem/F>Coprime Permutation</a></td><td>F</td><td>3000</td><td>combinatorics, number theory</td><td><a href=https://codeforces.com/contest/695/submission/18866826>GNU C++11</a></td><td>03 July 2016 11:25:39</td></tr><tr><td>826</td><td><a href=https://codeforces.com/contest/695/problem/E>Huffman Coding on Segment</a></td><td>E</td><td>3100</td><td>data structures</td><td><a href=https://codeforces.com/contest/695/submission/18865864>GNU C++11</a></td><td>03 July 2016 10:04:54</td></tr><tr><td>825</td><td><a href=https://codeforces.com/contest/695/problem/D>Cron</a></td><td>D</td><td>2800</td><td></td><td><a href=https://codeforces.com/contest/695/submission/18865568>GNU C++11</a></td><td>03 July 2016 09:39:58</td></tr><tr><td>824</td><td><a href=https://codeforces.com/contest/695/problem/B>Break Up</a></td><td>B</td><td>2600</td><td>graphs</td><td><a href=https://codeforces.com/contest/695/submission/18865109>GNU C++11</a></td><td>03 July 2016 08:58:55</td></tr><tr><td>823</td><td><a href=https://codeforces.com/contest/695/problem/A>LRU</a></td><td>A</td><td>2400</td><td>bitmasks, dp, math, probabilities</td><td><a href=https://codeforces.com/contest/695/submission/18865063>GNU C++11</a></td><td>03 July 2016 08:54:14</td></tr><tr><td>822</td><td><a href=https://codeforces.com/contest/685/problem/E>Travelling Through the Snow Queen's Kingdom</a></td><td>E</td><td>2800</td><td>bitmasks, brute force, divide and conquer, graphs</td><td><a href=https://codeforces.com/contest/685/submission/18838973>GNU C++11</a></td><td>01 July 2016 10:53:08</td></tr><tr><td>821</td><td><a href=https://codeforces.com/contest/685/problem/D>Kay and Eternity</a></td><td>D</td><td>2600</td><td>brute force, implementation, sortings</td><td><a href=https://codeforces.com/contest/685/submission/18838398>GNU C++11</a></td><td>01 July 2016 10:11:45</td></tr><tr><td>820</td><td><a href=https://codeforces.com/contest/685/problem/C>Optimal Point</a></td><td>C</td><td>2900</td><td>binary search, math</td><td><a href=https://codeforces.com/contest/685/submission/18838237>GNU C++11</a></td><td>01 July 2016 10:00:09</td></tr><tr><td>819</td><td><a href=https://codeforces.com/contest/685/problem/B>Kay and Snowflake</a></td><td>B</td><td>1900</td><td>data structures, dfs and similar, dp, trees</td><td><a href=https://codeforces.com/contest/685/submission/18837684>GNU C++11</a></td><td>01 July 2016 09:21:48</td></tr><tr><td>818</td><td><a href=https://codeforces.com/contest/685/problem/A>Robbers' watch</a></td><td>A</td><td>1700</td><td>brute force, combinatorics, dp, math</td><td><a href=https://codeforces.com/contest/685/submission/18837562>GNU C++11</a></td><td>01 July 2016 09:11:58</td></tr><tr><td>817</td><td><a href=https://codeforces.com/contest/687/problem/E>TOF</a></td><td>E</td><td>2900</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/687/submission/18806260>GNU C++11</a></td><td>29 June 2016 18:50:29</td></tr><tr><td>816</td><td><a href=https://codeforces.com/contest/687/problem/D>Dividing Kingdom II</a></td><td>D</td><td>2500</td><td>brute force, data structures, dsu, graphs, sortings</td><td><a href=https://codeforces.com/contest/687/submission/18802718>GNU C++11</a></td><td>29 June 2016 18:23:56</td></tr><tr><td>815</td><td><a href=https://codeforces.com/contest/687/problem/C>The Values You Can Make</a></td><td>C</td><td>1900</td><td>dp</td><td><a href=https://codeforces.com/contest/687/submission/18790045>GNU C++11</a></td><td>29 June 2016 17:17:12</td></tr><tr><td>814</td><td><a href=https://codeforces.com/contest/687/problem/B>Remainders Game</a></td><td>B</td><td>1800</td><td>chinese remainder theorem, math, number theory</td><td><a href=https://codeforces.com/contest/687/submission/18788540>GNU C++11</a></td><td>29 June 2016 17:13:33</td></tr><tr><td>813</td><td><a href=https://codeforces.com/contest/687/problem/A>NP-Hard Problem</a></td><td>A</td><td>1500</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/687/submission/18786960>GNU C++11</a></td><td>29 June 2016 17:09:22</td></tr><tr><td>812</td><td><a href=https://codeforces.com/contest/643/problem/F>Bears and Juice</a></td><td>F</td><td>2900</td><td>dp, math, meet-in-the-middle</td><td><a href=https://codeforces.com/contest/643/submission/17792837>GNU C++11</a></td><td>07 May 2016 16:45:38</td></tr><tr><td>811</td><td><a href=https://codeforces.com/contest/643/problem/C>Levels and Regions</a></td><td>C</td><td>2400</td><td>dp</td><td><a href=https://codeforces.com/contest/643/submission/17791548>GNU C++11</a></td><td>07 May 2016 16:28:22</td></tr><tr><td>810</td><td><a href=https://codeforces.com/contest/643/problem/E>Bear and Destroying Subtrees</a></td><td>E</td><td>2700</td><td>dp, math, probabilities, trees</td><td><a href=https://codeforces.com/contest/643/submission/17788002>GNU C++11</a></td><td>07 May 2016 15:51:30</td></tr><tr><td>809</td><td><a href=https://codeforces.com/contest/643/problem/B>Bear and Two Paths</a></td><td>B</td><td>1600</td><td>constructive algorithms, graphs</td><td><a href=https://codeforces.com/contest/643/submission/17782930>GNU C++11</a></td><td>07 May 2016 15:18:49</td></tr><tr><td>808</td><td><a href=https://codeforces.com/contest/643/problem/A>Bear and Colors</a></td><td>A</td><td>1500</td><td>implementation</td><td><a href=https://codeforces.com/contest/643/submission/17780053>GNU C++11</a></td><td>07 May 2016 15:07:40</td></tr><tr><td>807</td><td><a href=https://codeforces.com/contest/641/problem/F>Little Artem and 2-SAT</a></td><td>F</td><td>3000</td><td></td><td><a href=https://codeforces.com/contest/641/submission/17496462>GNU C++11</a></td><td>24 April 2016 18:24:43</td></tr><tr><td>806</td><td><a href=https://codeforces.com/contest/641/problem/D>Little Artem and Random Variable</a></td><td>D</td><td>2400</td><td>dp, implementation, math, probabilities</td><td><a href=https://codeforces.com/contest/641/submission/17491883>GNU C++11</a></td><td>24 April 2016 17:41:45</td></tr><tr><td>805</td><td><a href=https://codeforces.com/contest/641/problem/C>Little Artem and Dance</a></td><td>C</td><td>1800</td><td>brute force, constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/641/submission/17488505>GNU C++11</a></td><td>24 April 2016 17:13:25</td></tr><tr><td>804</td><td><a href=https://codeforces.com/contest/641/problem/E>Little Artem and Time Machine</a></td><td>E</td><td>2000</td><td>data structures</td><td><a href=https://codeforces.com/contest/641/submission/17484622>GNU C++11</a></td><td>24 April 2016 16:48:59</td></tr><tr><td>803</td><td><a href=https://codeforces.com/contest/641/problem/B>Little Artem and Matrix</a></td><td>B</td><td>1400</td><td>implementation</td><td><a href=https://codeforces.com/contest/641/submission/17482236>GNU C++11</a></td><td>24 April 2016 16:39:47</td></tr><tr><td>802</td><td><a href=https://codeforces.com/contest/641/problem/A>Little Artem and Grasshopper</a></td><td>A</td><td>1000</td><td>implementation</td><td><a href=https://codeforces.com/contest/641/submission/17481728>GNU C++11</a></td><td>24 April 2016 16:37:59</td></tr><tr><td>801</td><td><a href=https://codeforces.com/contest/662/problem/D>International Olympiad</a></td><td>D</td><td>2000</td><td>constructive algorithms, greedy, implementation, math</td><td><a href=https://codeforces.com/contest/662/submission/17329570>GNU C++11</a></td><td>15 April 2016 16:00:52</td></tr><tr><td>800</td><td><a href=https://codeforces.com/contest/662/problem/E>To Hack or not to Hack</a></td><td>E</td><td>3100</td><td>brute force, dp, greedy</td><td><a href=https://codeforces.com/contest/662/submission/17329285>GNU C++11</a></td><td>15 April 2016 15:39:21</td></tr><tr><td>799</td><td><a href=https://codeforces.com/contest/662/problem/B>Graph Coloring</a></td><td>B</td><td>2200</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/662/submission/17328499>GNU C++11</a></td><td>15 April 2016 14:48:03</td></tr><tr><td>798</td><td><a href=https://codeforces.com/contest/662/problem/A>Gambling Nim</a></td><td>A</td><td>2400</td><td>bitmasks, math, matrices, probabilities</td><td><a href=https://codeforces.com/contest/662/submission/17328265>GNU C++11</a></td><td>15 April 2016 14:33:09</td></tr><tr><td>797</td><td><a href=https://codeforces.com/contest/639/problem/E>Bear and Paradox</a></td><td>E</td><td>2800</td><td>binary search, greedy, math, sortings</td><td><a href=https://codeforces.com/contest/639/submission/17000422>GNU C++11</a></td><td>28 March 2016 17:41:33</td></tr><tr><td>796</td><td><a href=https://codeforces.com/contest/639/problem/C>Bear and Polynomials</a></td><td>C</td><td>2200</td><td>hashing, implementation, math</td><td><a href=https://codeforces.com/contest/639/submission/16995363>GNU C++11</a></td><td>28 March 2016 17:06:52</td></tr><tr><td>795</td><td><a href=https://codeforces.com/contest/639/problem/D>Bear and Contribution</a></td><td>D</td><td>2400</td><td>data structures, greedy, sortings, two pointers</td><td><a href=https://codeforces.com/contest/639/submission/16992967>GNU C++11</a></td><td>28 March 2016 16:52:31</td></tr><tr><td>794</td><td><a href=https://codeforces.com/contest/639/problem/B>Bear and Forgotten Tree 3</a></td><td>B</td><td>1600</td><td>constructive algorithms, graphs, trees</td><td><a href=https://codeforces.com/contest/639/submission/16992843>GNU C++11</a></td><td>28 March 2016 16:51:59</td></tr><tr><td>793</td><td><a href=https://codeforces.com/contest/639/problem/A>Bear and Displayed Friends</a></td><td>A</td><td>1200</td><td>implementation</td><td><a href=https://codeforces.com/contest/639/submission/16990330>GNU C++11</a></td><td>28 March 2016 16:39:04</td></tr><tr><td>792</td><td><a href=https://codeforces.com/contest/645/problem/F>Cowslip Collections</a></td><td>F</td><td>2500</td><td>combinatorics, math, number theory</td><td><a href=https://codeforces.com/contest/645/submission/16789707>GNU C++11</a></td><td>18 March 2016 17:15:24</td></tr><tr><td>791</td><td><a href=https://codeforces.com/contest/645/problem/E>Intellectual Inquiry</a></td><td>E</td><td>2200</td><td>dp, greedy, strings</td><td><a href=https://codeforces.com/contest/645/submission/16788246>GNU C++11</a></td><td>18 March 2016 17:01:00</td></tr><tr><td>790</td><td><a href=https://codeforces.com/contest/645/problem/D>Robot Rapping Results Report</a></td><td>D</td><td>1800</td><td>binary search, dp, graphs</td><td><a href=https://codeforces.com/contest/645/submission/16786451>GNU C++11</a></td><td>18 March 2016 16:47:19</td></tr><tr><td>789</td><td><a href=https://codeforces.com/contest/645/problem/C>Enduring Exodus</a></td><td>C</td><td>1600</td><td>binary search, two pointers</td><td><a href=https://codeforces.com/contest/645/submission/16785938>GNU C++11</a></td><td>18 March 2016 16:43:25</td></tr><tr><td>788</td><td><a href=https://codeforces.com/contest/645/problem/A>Amity Assessment</a></td><td>A</td><td>1200</td><td>brute force, constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/645/submission/16785657>GNU C++11</a></td><td>18 March 2016 16:40:33</td></tr><tr><td>787</td><td><a href=https://codeforces.com/contest/645/problem/B>Mischievous Mess Makers</a></td><td>B</td><td>1200</td><td>greedy, math</td><td><a href=https://codeforces.com/contest/645/submission/16785533>GNU C++11</a></td><td>18 March 2016 16:38:16</td></tr><tr><td>786</td><td><a href=https://codeforces.com/contest/644/problem/C>Hostname Aliases</a></td><td>C</td><td>2100</td><td>*special, binary search, data structures, implementation, sortings, strings</td><td><a href=https://codeforces.com/contest/644/submission/16743202>GNU C++11</a></td><td>16 March 2016 11:40:49</td></tr><tr><td>785</td><td><a href=https://codeforces.com/contest/644/problem/B>Processing Queries</a></td><td>B</td><td>1700</td><td>*special, constructive algorithms, data structures, two pointers</td><td><a href=https://codeforces.com/contest/644/submission/16742841>GNU C++11</a></td><td>16 March 2016 11:24:43</td></tr><tr><td>784</td><td><a href=https://codeforces.com/contest/644/problem/A>Parliament of Berland</a></td><td>A</td><td>1000</td><td>*special, constructive algorithms</td><td><a href=https://codeforces.com/contest/644/submission/16742551>GNU C++11</a></td><td>16 March 2016 11:11:28</td></tr><tr><td>783</td><td><a href=https://codeforces.com/contest/637/problem/D>Running with Obstacles</a></td><td>D</td><td>1600</td><td>*special, data structures, dp, greedy</td><td><a href=https://codeforces.com/contest/637/submission/16698506>GNU C++11</a></td><td>13 March 2016 15:32:09</td></tr><tr><td>782</td><td><a href=https://codeforces.com/contest/637/problem/C>Promocodes with Mistakes</a></td><td>C</td><td>1400</td><td>*special, brute force, constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/637/submission/16694952>GNU C++11</a></td><td>13 March 2016 13:55:28</td></tr><tr><td>781</td><td><a href=https://codeforces.com/contest/637/problem/B>Chat Order</a></td><td>B</td><td>1200</td><td>*special, binary search, constructive algorithms, data structures, sortings</td><td><a href=https://codeforces.com/contest/637/submission/16694932>GNU C++11</a></td><td>13 March 2016 13:54:48</td></tr><tr><td>780</td><td><a href=https://codeforces.com/contest/637/problem/A>Voting for Photos</a></td><td>A</td><td>1000</td><td>*special, constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/637/submission/16694923>GNU C++11</a></td><td>13 March 2016 13:54:23</td></tr><tr><td>779</td><td><a href=https://codeforces.com/contest/650/problem/E>Clockwork Bomb</a></td><td>E</td><td>3200</td><td>data structures, dfs and similar, dsu, greedy, trees</td><td><a href=https://codeforces.com/contest/650/submission/16578790>GNU C++11</a></td><td>07 March 2016 11:07:46</td></tr><tr><td>778</td><td><a href=https://codeforces.com/contest/650/problem/D>Zip-line</a></td><td>D</td><td>2600</td><td>binary search, data structures, dp, hashing</td><td><a href=https://codeforces.com/contest/650/submission/16571229>GNU C++11</a></td><td>07 March 2016 10:05:46</td></tr><tr><td>777</td><td><a href=https://codeforces.com/contest/650/problem/B>Image Preview</a></td><td>B</td><td>1900</td><td>binary search, brute force, dp, two pointers</td><td><a href=https://codeforces.com/contest/650/submission/16567529>GNU C++11</a></td><td>07 March 2016 09:46:50</td></tr><tr><td>776</td><td><a href=https://codeforces.com/contest/650/problem/C>Table Compression</a></td><td>C</td><td>2200</td><td>dfs and similar, dp, dsu, graphs, greedy</td><td><a href=https://codeforces.com/contest/650/submission/16565085>GNU C++11</a></td><td>07 March 2016 09:37:16</td></tr><tr><td>775</td><td><a href=https://codeforces.com/contest/650/problem/A>Watchmen</a></td><td>A</td><td>1400</td><td>data structures, geometry, math</td><td><a href=https://codeforces.com/contest/650/submission/16562732>GNU C++11</a></td><td>07 March 2016 09:26:49</td></tr><tr><td>774</td><td><a href=https://codeforces.com/contest/627/problem/D>Preorder Test</a></td><td>D</td><td>2600</td><td>binary search, dfs and similar, dp, graphs, greedy, trees</td><td><a href=https://codeforces.com/contest/627/submission/16413455>GNU C++11</a></td><td>28 February 2016 19:27:20</td></tr><tr><td>773</td><td><a href=https://codeforces.com/contest/627/problem/C>Package Delivery</a></td><td>C</td><td>2200</td><td>data structures, divide and conquer, greedy</td><td><a href=https://codeforces.com/contest/627/submission/16412323>GNU C++11</a></td><td>28 February 2016 19:09:52</td></tr><tr><td>772</td><td><a href=https://codeforces.com/contest/627/problem/E>Orchestra</a></td><td>E</td><td>3000</td><td>two pointers</td><td><a href=https://codeforces.com/contest/627/submission/16410780>GNU C++11</a></td><td>28 February 2016 18:48:22</td></tr><tr><td>771</td><td><a href=https://codeforces.com/contest/627/problem/B>Factory Repairs</a></td><td>B</td><td>1700</td><td>data structures</td><td><a href=https://codeforces.com/contest/627/submission/16408496>GNU C++11</a></td><td>28 February 2016 18:21:13</td></tr><tr><td>770</td><td><a href=https://codeforces.com/contest/627/problem/A>XOR Equation</a></td><td>A</td><td>1700</td><td>dp, math</td><td><a href=https://codeforces.com/contest/627/submission/16407728>GNU C++11</a></td><td>28 February 2016 18:14:01</td></tr><tr><td>769</td><td><a href=https://codeforces.com/contest/633/problem/H>Fibonacci-ish II</a></td><td>H</td><td>3100</td><td>data structures, implementation</td><td><a href=https://codeforces.com/contest/633/submission/16369633>GNU C++11</a></td><td>26 February 2016 19:42:37</td></tr><tr><td>768</td><td><a href=https://codeforces.com/contest/633/problem/G>Yash And Trees</a></td><td>G</td><td>2800</td><td>bitmasks, data structures, dfs and similar, math, number theory</td><td><a href=https://codeforces.com/contest/633/submission/16365170>GNU C++11</a></td><td>26 February 2016 18:57:42</td></tr><tr><td>767</td><td><a href=https://codeforces.com/contest/633/problem/E>Startup Funding</a></td><td>E</td><td>2400</td><td>binary search, constructive algorithms, data structures, probabilities, two pointers</td><td><a href=https://codeforces.com/contest/633/submission/16363148>GNU C++11</a></td><td>26 February 2016 18:37:51</td></tr><tr><td>766</td><td><a href=https://codeforces.com/contest/633/problem/F>The Chocolate Spree</a></td><td>F</td><td>2600</td><td>dfs and similar, dp, graphs, trees</td><td><a href=https://codeforces.com/contest/633/submission/16360649>GNU C++11</a></td><td>26 February 2016 18:14:13</td></tr><tr><td>765</td><td><a href=https://codeforces.com/contest/633/problem/D>Fibonacci-ish</a></td><td>D</td><td>2000</td><td>brute force, dp, hashing, implementation, math</td><td><a href=https://codeforces.com/contest/633/submission/16359500>GNU C++11</a></td><td>26 February 2016 18:04:04</td></tr><tr><td>764</td><td><a href=https://codeforces.com/contest/633/problem/C>Spy Syndrome 2</a></td><td>C</td><td>1900</td><td>data structures, dp, hashing, implementation, sortings, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/633/submission/16358402>GNU C++11</a></td><td>26 February 2016 17:55:16</td></tr><tr><td>763</td><td><a href=https://codeforces.com/contest/633/problem/B>A Trivial Problem</a></td><td>B</td><td>1300</td><td>brute force, constructive algorithms, math, number theory</td><td><a href=https://codeforces.com/contest/633/submission/16351831>GNU C++11</a></td><td>26 February 2016 17:18:56</td></tr><tr><td>762</td><td><a href=https://codeforces.com/contest/633/problem/A>Ebony and Ivory</a></td><td>A</td><td>1100</td><td>brute force, math, number theory</td><td><a href=https://codeforces.com/contest/633/submission/16351110>GNU C++11</a></td><td>26 February 2016 17:16:43</td></tr><tr><td>761</td><td><a href=https://codeforces.com/contest/626/problem/G>Raffles</a></td><td>G</td><td>3100</td><td>data structures, dp, greedy, math</td><td><a href=https://codeforces.com/contest/626/submission/16008099>GNU C++11</a></td><td>13 February 2016 20:20:24</td></tr><tr><td>760</td><td><a href=https://codeforces.com/contest/626/problem/E>Simple Skewness</a></td><td>E</td><td>2400</td><td>binary search, math, ternary search</td><td><a href=https://codeforces.com/contest/626/submission/15999995>GNU C++11</a></td><td>13 February 2016 18:40:56</td></tr><tr><td>759</td><td><a href=https://codeforces.com/contest/626/problem/F>Group Projects</a></td><td>F</td><td>2400</td><td>dp</td><td><a href=https://codeforces.com/contest/626/submission/15997185>GNU C++11</a></td><td>13 February 2016 18:17:34</td></tr><tr><td>758</td><td><a href=https://codeforces.com/contest/626/problem/D>Jerry's Protest</a></td><td>D</td><td>1800</td><td>brute force, combinatorics, dp, probabilities</td><td><a href=https://codeforces.com/contest/626/submission/15994387>GNU C++11</a></td><td>13 February 2016 17:58:18</td></tr><tr><td>757</td><td><a href=https://codeforces.com/contest/626/problem/C>Block Towers</a></td><td>C</td><td>1600</td><td>brute force, greedy, math, number theory</td><td><a href=https://codeforces.com/contest/626/submission/15992308>GNU C++11</a></td><td>13 February 2016 17:44:55</td></tr><tr><td>756</td><td><a href=https://codeforces.com/contest/626/problem/B>Cards</a></td><td>B</td><td>1300</td><td>constructive algorithms, dp, math</td><td><a href=https://codeforces.com/contest/626/submission/15991887>GNU C++11</a></td><td>13 February 2016 17:42:23</td></tr><tr><td>755</td><td><a href=https://codeforces.com/contest/626/problem/A>Robot Sequence</a></td><td>A</td><td>1000</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/626/submission/15990789>GNU C++11</a></td><td>13 February 2016 17:37:08</td></tr><tr><td>754</td><td><a href=https://codeforces.com/contest/620/problem/F>Xors on Segments</a></td><td>F</td><td>2800</td><td>data structures, strings, trees</td><td><a href=https://codeforces.com/contest/620/submission/15476784>GNU C++11</a></td><td>21 January 2016 15:44:55</td></tr><tr><td>753</td><td><a href=https://codeforces.com/contest/620/problem/D>Professor GukiZ and Two Arrays</a></td><td>D</td><td>2200</td><td>binary search, two pointers</td><td><a href=https://codeforces.com/contest/620/submission/15476004>GNU C++11</a></td><td>21 January 2016 15:37:20</td></tr><tr><td>752</td><td><a href=https://codeforces.com/contest/620/problem/E>New Year Tree</a></td><td>E</td><td>2100</td><td>bitmasks, data structures, trees</td><td><a href=https://codeforces.com/contest/620/submission/15473382>GNU C++11</a></td><td>21 January 2016 15:17:23</td></tr><tr><td>751</td><td><a href=https://codeforces.com/contest/620/problem/C>Pearls in a Row</a></td><td>C</td><td>1500</td><td>greedy</td><td><a href=https://codeforces.com/contest/620/submission/15470876>GNU C++11</a></td><td>21 January 2016 15:04:35</td></tr><tr><td>750</td><td><a href=https://codeforces.com/contest/620/problem/B>Grandfather Dovlet’s calculator</a></td><td>B</td><td>1000</td><td>implementation</td><td><a href=https://codeforces.com/contest/620/submission/15470277>GNU C++11</a></td><td>21 January 2016 15:01:52</td></tr><tr><td>749</td><td><a href=https://codeforces.com/contest/620/problem/A>Professor GukiZ's Robot</a></td><td>A</td><td>800</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/620/submission/15470173>GNU C++11</a></td><td>21 January 2016 15:00:43</td></tr><tr><td>748</td><td><a href=https://codeforces.com/contest/611/problem/G>New Year and Cake</a></td><td>G</td><td>2900</td><td>geometry, two pointers</td><td><a href=https://codeforces.com/contest/611/submission/15128537>GNU C++11</a></td><td>30 December 2015 19:48:39</td></tr><tr><td>747</td><td><a href=https://codeforces.com/contest/611/problem/H>New Year  and Forgotten Tree</a></td><td>H</td><td>3200</td><td>constructive algorithms, flows, graphs</td><td><a href=https://codeforces.com/contest/611/submission/15124865>GNU C++11</a></td><td>30 December 2015 17:47:47</td></tr><tr><td>746</td><td><a href=https://codeforces.com/contest/611/problem/E>New Year and Three Musketeers</a></td><td>E</td><td>2400</td><td>data structures, greedy, sortings</td><td><a href=https://codeforces.com/contest/611/submission/15117658>GNU C++11</a></td><td>30 December 2015 16:29:18</td></tr><tr><td>745</td><td><a href=https://codeforces.com/contest/611/problem/F>New Year and Cleaning</a></td><td>F</td><td>2500</td><td>binary search, implementation</td><td><a href=https://codeforces.com/contest/611/submission/15114227>GNU C++11</a></td><td>30 December 2015 15:59:37</td></tr><tr><td>744</td><td><a href=https://codeforces.com/contest/611/problem/D>New Year and Ancient Prophecy</a></td><td>D</td><td>2000</td><td>dp, hashing, strings</td><td><a href=https://codeforces.com/contest/611/submission/15107147>GNU C++11</a></td><td>30 December 2015 15:23:44</td></tr><tr><td>743</td><td><a href=https://codeforces.com/contest/611/problem/C>New Year and Domino</a></td><td>C</td><td>1500</td><td>dp, implementation</td><td><a href=https://codeforces.com/contest/611/submission/15103816>GNU C++11</a></td><td>30 December 2015 15:15:11</td></tr><tr><td>742</td><td><a href=https://codeforces.com/contest/611/problem/A>New Year and Days</a></td><td>A</td><td>900</td><td>implementation</td><td><a href=https://codeforces.com/contest/611/submission/15101703>GNU C++11</a></td><td>30 December 2015 15:09:43</td></tr><tr><td>741</td><td><a href=https://codeforces.com/contest/611/problem/B>New Year and Old Property</a></td><td>B</td><td>1300</td><td>bitmasks, brute force, implementation</td><td><a href=https://codeforces.com/contest/611/submission/15101586>GNU C++11</a></td><td>30 December 2015 15:07:31</td></tr><tr><td>740</td><td><a href=https://codeforces.com/contest/607/problem/C>Marbles</a></td><td>C</td><td>2500</td><td>hashing, strings</td><td><a href=https://codeforces.com/contest/607/submission/14953869>GNU C++11</a></td><td>23 December 2015 17:57:54</td></tr><tr><td>739</td><td><a href=https://codeforces.com/contest/607/problem/D>Power Tree</a></td><td>D</td><td>2600</td><td>data structures, trees</td><td><a href=https://codeforces.com/contest/607/submission/14952244>GNU C++11</a></td><td>23 December 2015 17:43:23</td></tr><tr><td>738</td><td><a href=https://codeforces.com/contest/607/problem/B>Zuma</a></td><td>B</td><td>1900</td><td>dp</td><td><a href=https://codeforces.com/contest/607/submission/14943843>GNU C++11</a></td><td>23 December 2015 16:48:46</td></tr><tr><td>737</td><td><a href=https://codeforces.com/contest/607/problem/A>Chain Reaction</a></td><td>A</td><td>1600</td><td>binary search, dp</td><td><a href=https://codeforces.com/contest/607/submission/14942696>GNU C++11</a></td><td>23 December 2015 16:43:36</td></tr><tr><td>736</td><td><a href=https://codeforces.com/contest/596/problem/E>Wilbur and Strings</a></td><td>E</td><td>2500</td><td>dfs and similar, dp, graphs, strings</td><td><a href=https://codeforces.com/contest/596/submission/14279399>GNU C++11</a></td><td>15 November 2015 17:14:55</td></tr><tr><td>735</td><td><a href=https://codeforces.com/contest/596/problem/D>Wilbur and Trees</a></td><td>D</td><td>2300</td><td>dp, math, probabilities, sortings</td><td><a href=https://codeforces.com/contest/596/submission/14276759>GNU C++11</a></td><td>15 November 2015 16:58:19</td></tr><tr><td>734</td><td><a href=https://codeforces.com/contest/596/problem/C>Wilbur and Points</a></td><td>C</td><td>1700</td><td>combinatorics, greedy, sortings</td><td><a href=https://codeforces.com/contest/596/submission/14273406>GNU C++11</a></td><td>15 November 2015 16:44:32</td></tr><tr><td>733</td><td><a href=https://codeforces.com/contest/596/problem/B>Wilbur and Array</a></td><td>B</td><td>1100</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/596/submission/14272047>GNU C++11</a></td><td>15 November 2015 16:38:03</td></tr><tr><td>732</td><td><a href=https://codeforces.com/contest/596/problem/A>Wilbur and Swimming Pool</a></td><td>A</td><td>1100</td><td>geometry, implementation</td><td><a href=https://codeforces.com/contest/596/submission/14272013>GNU C++11</a></td><td>15 November 2015 16:36:46</td></tr><tr><td>731</td><td><a href=https://codeforces.com/contest/575/problem/E>Spectator Riots</a></td><td>E</td><td>2800</td><td>geometry</td><td><a href=https://codeforces.com/contest/575/submission/12869115>GNU C++11</a></td><td>06 September 2015 11:31:52</td></tr><tr><td>730</td><td><a href=https://codeforces.com/contest/575/problem/I>Robots protection</a></td><td>I</td><td>2800</td><td>data structures</td><td><a href=https://codeforces.com/contest/575/submission/12870532>GNU C++11</a></td><td>06 September 2015 12:17:21</td></tr><tr><td>729</td><td><a href=https://codeforces.com/contest/575/problem/A>Fibonotci</a></td><td>A</td><td>2700</td><td>data structures, math, matrices</td><td><a href=https://codeforces.com/contest/575/submission/12866819>GNU C++11</a></td><td>06 September 2015 10:17:49</td></tr><tr><td>728</td><td><a href=https://codeforces.com/contest/575/problem/B>Bribes</a></td><td>B</td><td>2200</td><td>dfs and similar, graphs, trees</td><td><a href=https://codeforces.com/contest/575/submission/12863959>GNU C++11</a></td><td>06 September 2015 08:57:37</td></tr><tr><td>727</td><td><a href=https://codeforces.com/contest/575/problem/G>Run for beer</a></td><td>G</td><td>2200</td><td>dfs and similar, shortest paths</td><td><a href=https://codeforces.com/contest/575/submission/12863210>GNU C++11</a></td><td>06 September 2015 08:40:00</td></tr><tr><td>726</td><td><a href=https://codeforces.com/contest/575/problem/F>Bulbo</a></td><td>F</td><td>2100</td><td>dp, greedy</td><td><a href=https://codeforces.com/contest/575/submission/12862376>GNU C++11</a></td><td>06 September 2015 08:23:42</td></tr><tr><td>725</td><td><a href=https://codeforces.com/contest/575/problem/H>Bots</a></td><td>H</td><td>1800</td><td>combinatorics, number theory</td><td><a href=https://codeforces.com/contest/575/submission/12861837>GNU C++11</a></td><td>06 September 2015 08:11:57</td></tr><tr><td>724</td><td><a href=https://codeforces.com/contest/575/problem/D>Tablecity</a></td><td>D</td><td>1700</td><td>constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/575/submission/12861707>GNU C++11</a></td><td>06 September 2015 08:03:32</td></tr><tr><td>723</td><td><a href=https://codeforces.com/contest/573/problem/B>Bear and Blocks</a></td><td>B</td><td>1600</td><td>binary search, data structures, dp, math</td><td><a href=https://codeforces.com/contest/573/submission/12747277>GNU C++11</a></td><td>29 August 2015 16:39:11</td></tr><tr><td>722</td><td><a href=https://codeforces.com/contest/573/problem/A>Bear and Poker</a></td><td>A</td><td>1300</td><td>implementation, math, number theory</td><td><a href=https://codeforces.com/contest/573/submission/12746067>GNU C++11</a></td><td>29 August 2015 16:31:35</td></tr><tr><td>721</td><td><a href=https://codeforces.com/contest/566/problem/A>Matching Names</a></td><td>A</td><td>2300</td><td>dfs and similar, strings, trees</td><td><a href=https://codeforces.com/contest/566/submission/12291750>GNU C++11</a></td><td>31 July 2015 12:55:12</td></tr><tr><td>720</td><td><a href=https://codeforces.com/contest/562/problem/C>Restoring Map</a></td><td>C</td><td>3200</td><td></td><td><a href=https://codeforces.com/contest/562/submission/12229977>GNU C++11</a></td><td>26 July 2015 11:13:51</td></tr><tr><td>719</td><td><a href=https://codeforces.com/contest/562/problem/G>Replicating Processes</a></td><td>G</td><td>2600</td><td></td><td><a href=https://codeforces.com/contest/562/submission/12229825>GNU C++11</a></td><td>26 July 2015 10:13:39</td></tr><tr><td>718</td><td><a href=https://codeforces.com/contest/562/problem/E>Max and Min</a></td><td>E</td><td>2500</td><td></td><td><a href=https://codeforces.com/contest/562/submission/12229723>Java 8</a></td><td>26 July 2015 09:32:29</td></tr><tr><td>717</td><td><a href=https://codeforces.com/contest/562/problem/D>Restructuring Company</a></td><td>D</td><td>1900</td><td></td><td><a href=https://codeforces.com/contest/562/submission/12229490>GNU C++11</a></td><td>26 July 2015 08:29:38</td></tr><tr><td>716</td><td><a href=https://codeforces.com/contest/562/problem/B>Clique in the Divisibility Graph</a></td><td>B</td><td>1500</td><td></td><td><a href=https://codeforces.com/contest/562/submission/12229433>GNU C++11</a></td><td>26 July 2015 08:17:46</td></tr><tr><td>715</td><td><a href=https://codeforces.com/contest/436/problem/D>Pudding Monsters</a></td><td>D</td><td>2800</td><td>dp</td><td><a href=https://codeforces.com/contest/436/submission/6881094>GNU C++</a></td><td>13 June 2014 16:49:45</td></tr><tr><td>714</td><td><a href=https://codeforces.com/contest/549/problem/F>Yura and Developers</a></td><td>F</td><td>2800</td><td>data structures, divide and conquer</td><td><a href=https://codeforces.com/contest/549/submission/11466701>GNU C++11</a></td><td>06 June 2015 14:08:45</td></tr><tr><td>713</td><td><a href=https://codeforces.com/contest/549/problem/B>Looksery Party</a></td><td>B</td><td>2300</td><td>constructive algorithms, dfs and similar, graphs, greedy</td><td><a href=https://codeforces.com/contest/549/submission/11465780>GNU C++11</a></td><td>06 June 2015 13:59:48</td></tr><tr><td>712</td><td><a href=https://codeforces.com/contest/549/problem/D>Haar Features</a></td><td>D</td><td>1900</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/549/submission/11464258>Java 7</a></td><td>06 June 2015 13:44:44</td></tr><tr><td>711</td><td><a href=https://codeforces.com/contest/549/problem/C>The Game Of Parity</a></td><td>C</td><td>2200</td><td>games</td><td><a href=https://codeforces.com/contest/549/submission/11463555>GNU C++11</a></td><td>06 June 2015 13:37:38</td></tr><tr><td>710</td><td><a href=https://codeforces.com/contest/549/problem/G>Happy Line</a></td><td>G</td><td>2200</td><td>constructive algorithms, greedy, sortings</td><td><a href=https://codeforces.com/contest/549/submission/11461524>GNU C++11</a></td><td>06 June 2015 13:17:33</td></tr><tr><td>709</td><td><a href=https://codeforces.com/contest/549/problem/H>Degenerate Matrix</a></td><td>H</td><td>2100</td><td>binary search, math</td><td><a href=https://codeforces.com/contest/549/submission/11459607>GNU C++11</a></td><td>06 June 2015 13:06:17</td></tr><tr><td>708</td><td><a href=https://codeforces.com/contest/549/problem/A>Face Detection</a></td><td>A</td><td>900</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/549/submission/11458439>GNU C++11</a></td><td>06 June 2015 13:01:28</td></tr><tr><td>707</td><td><a href=https://codeforces.com/contest/541/problem/C>Idempotent functions</a></td><td>C</td><td>2000</td><td></td><td><a href=https://codeforces.com/contest/541/submission/10987306>Java 8</a></td><td>03 May 2015 17:17:48</td></tr><tr><td>706</td><td><a href=https://codeforces.com/contest/541/problem/D>Superhero's Job</a></td><td>D</td><td>2600</td><td></td><td><a href=https://codeforces.com/contest/541/submission/10986907>GNU C++11</a></td><td>03 May 2015 17:03:40</td></tr><tr><td>705</td><td><a href=https://codeforces.com/contest/541/problem/A>Place Your Ad Here</a></td><td>A</td><td>2400</td><td></td><td><a href=https://codeforces.com/contest/541/submission/10986496>GNU C++11</a></td><td>03 May 2015 16:50:48</td></tr><tr><td>704</td><td><a href=https://codeforces.com/contest/541/problem/E>Playing on Graph</a></td><td>E</td><td>2600</td><td></td><td><a href=https://codeforces.com/contest/541/submission/10986094>GNU C++11</a></td><td>03 May 2015 16:38:52</td></tr><tr><td>703</td><td><a href=https://codeforces.com/contest/541/problem/F>Quest</a></td><td>F</td><td>2100</td><td></td><td><a href=https://codeforces.com/contest/541/submission/10985664>GNU C++11</a></td><td>03 May 2015 16:26:02</td></tr><tr><td>702</td><td><a href=https://codeforces.com/contest/532/problem/A>Berland Miners</a></td><td>A</td><td>3000</td><td></td><td><a href=https://codeforces.com/contest/532/submission/10759741>GNU C++11</a></td><td>17 April 2015 18:29:27</td></tr><tr><td>701</td><td><a href=https://codeforces.com/contest/532/problem/D>Landmarks</a></td><td>D</td><td>3000</td><td></td><td><a href=https://codeforces.com/contest/532/submission/10757471>GNU C++11</a></td><td>17 April 2015 17:38:13</td></tr><tr><td>700</td><td><a href=https://codeforces.com/contest/532/problem/F>Encoding</a></td><td>F</td><td>2400</td><td></td><td><a href=https://codeforces.com/contest/532/submission/10755969>GNU C++11</a></td><td>17 April 2015 17:06:57</td></tr><tr><td>699</td><td><a href=https://codeforces.com/contest/532/problem/C>Board Game</a></td><td>C</td><td>1700</td><td></td><td><a href=https://codeforces.com/contest/532/submission/10753514>GNU C++11</a></td><td>17 April 2015 16:23:26</td></tr><tr><td>698</td><td><a href=https://codeforces.com/contest/532/problem/B>Work Group</a></td><td>B</td><td>2000</td><td></td><td><a href=https://codeforces.com/contest/532/submission/10753153>GNU C++11</a></td><td>17 April 2015 16:14:39</td></tr><tr><td>697</td><td><a href=https://codeforces.com/contest/532/problem/E>Correcting Mistakes</a></td><td>E</td><td>1800</td><td></td><td><a href=https://codeforces.com/contest/532/submission/10753126>Java 8</a></td><td>17 April 2015 16:13:40</td></tr><tr><td>696</td><td><a href=https://codeforces.com/contest/526/problem/E>Transmitting Levels</a></td><td>E</td><td>2400</td><td>dp, implementation</td><td><a href=https://codeforces.com/contest/526/submission/10582137>GNU C++11</a></td><td>04 April 2015 17:23:38</td></tr><tr><td>695</td><td><a href=https://codeforces.com/contest/526/problem/D>Om Nom and Necklace</a></td><td>D</td><td>2200</td><td>hashing, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/526/submission/10580549>GNU C++11</a></td><td>04 April 2015 17:10:19</td></tr><tr><td>694</td><td><a href=https://codeforces.com/contest/526/problem/C>Om Nom and Candies</a></td><td>C</td><td>2000</td><td>brute force, greedy, math</td><td><a href=https://codeforces.com/contest/526/submission/10578449>GNU C++11</a></td><td>04 April 2015 16:53:42</td></tr><tr><td>693</td><td><a href=https://codeforces.com/contest/526/problem/B>Om Nom and Dark Park</a></td><td>B</td><td>1400</td><td>dfs and similar, greedy, implementation</td><td><a href=https://codeforces.com/contest/526/submission/10576165>GNU C++11</a></td><td>04 April 2015 16:41:15</td></tr><tr><td>692</td><td><a href=https://codeforces.com/contest/526/problem/A>King of Thieves</a></td><td>A</td><td>1300</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/526/submission/10575487>GNU C++11</a></td><td>04 April 2015 16:37:25</td></tr><tr><td>691</td><td><a href=https://codeforces.com/contest/524/problem/F>And Yet Another Bracket Sequence</a></td><td>F</td><td>2700</td><td>data structures, greedy, hashing, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/524/submission/10384194>GNU C++11</a></td><td>21 March 2015 15:55:45</td></tr><tr><td>690</td><td><a href=https://codeforces.com/contest/524/problem/D>Social Network</a></td><td>D</td><td>2100</td><td>greedy, two pointers</td><td><a href=https://codeforces.com/contest/524/submission/10381232>GNU C++11</a></td><td>21 March 2015 14:51:08</td></tr><tr><td>689</td><td><a href=https://codeforces.com/contest/524/problem/E>Rooks and Rectangles</a></td><td>E</td><td>2400</td><td>data structures, sortings</td><td><a href=https://codeforces.com/contest/524/submission/10380270>GNU C++11</a></td><td>21 March 2015 14:31:34</td></tr><tr><td>688</td><td><a href=https://codeforces.com/contest/524/problem/C>The Art of Dealing with ATM</a></td><td>C</td><td>1900</td><td>binary search, sortings</td><td><a href=https://codeforces.com/contest/524/submission/10379214>GNU C++11</a></td><td>21 March 2015 14:13:56</td></tr><tr><td>687</td><td><a href=https://codeforces.com/contest/524/problem/A>Возможно, вы знаете этих людей?</a></td><td>A</td><td>1600</td><td>implementation</td><td><a href=https://codeforces.com/contest/524/submission/10378853>GNU C++11</a></td><td>21 March 2015 14:06:03</td></tr><tr><td>686</td><td><a href=https://codeforces.com/contest/524/problem/B>Фото на память - 2 (round version)</a></td><td>B</td><td>1700</td><td>dp, greedy</td><td><a href=https://codeforces.com/contest/524/submission/10378825>Java 8</a></td><td>21 March 2015 14:04:30</td></tr><tr><td>685</td><td><a href=https://codeforces.com/contest/522/problem/D>Closest Equals</a></td><td>D</td><td>2000</td><td>*special, data structures</td><td><a href=https://codeforces.com/contest/522/submission/10204292>Java 8</a></td><td>08 March 2015 10:48:59</td></tr><tr><td>684</td><td><a href=https://codeforces.com/contest/522/problem/A>Reposts</a></td><td>A</td><td>1200</td><td>*special, dfs and similar, dp, graphs, trees</td><td><a href=https://codeforces.com/contest/522/submission/10204276>Java 8</a></td><td>08 March 2015 10:48:30</td></tr><tr><td>683</td><td><a href=https://codeforces.com/contest/522/problem/C>Chicken or Fish?</a></td><td>C</td><td>2100</td><td>greedy</td><td><a href=https://codeforces.com/contest/522/submission/10204264>GNU C++0x</a></td><td>08 March 2015 10:47:31</td></tr><tr><td>682</td><td><a href=https://codeforces.com/contest/522/problem/B>Photo to Remember</a></td><td>B</td><td>1100</td><td>*special, data structures, dp, implementation</td><td><a href=https://codeforces.com/contest/522/submission/10204254>GNU C++0x</a></td><td>08 March 2015 10:47:08</td></tr><tr><td>681</td><td><a href=https://codeforces.com/contest/513/problem/G1>Inversions problem</a></td><td>G1</td><td>1800</td><td>brute force, dfs and similar, dp, meet-in-the-middle</td><td><a href=https://codeforces.com/contest/513/submission/9751992>GNU C++</a></td><td>07 February 2015 17:38:52</td></tr><tr><td>680</td><td><a href=https://codeforces.com/contest/513/problem/F1>Scaygerboss</a></td><td>F1</td><td>2700</td><td>flows</td><td><a href=https://codeforces.com/contest/513/submission/9759734>GNU C++</a></td><td>07 February 2015 18:59:15</td></tr><tr><td>679</td><td><a href=https://codeforces.com/contest/513/problem/E1>Subarray Cuts</a></td><td>E1</td><td>2600</td><td>dp</td><td><a href=https://codeforces.com/contest/513/submission/9757858>GNU C++</a></td><td>07 February 2015 18:33:45</td></tr><tr><td>678</td><td><a href=https://codeforces.com/contest/513/problem/D1>Constrained Tree</a></td><td>D1</td><td>2400</td><td>dfs and similar</td><td><a href=https://codeforces.com/contest/513/submission/9754039>GNU C++0x</a></td><td>07 February 2015 17:56:13</td></tr><tr><td>677</td><td><a href=https://codeforces.com/contest/513/problem/B1>Permutations</a></td><td>B1</td><td>1400</td><td>brute force</td><td><a href=https://codeforces.com/contest/513/submission/9749001>GNU C++</a></td><td>07 February 2015 17:11:45</td></tr><tr><td>676</td><td><a href=https://codeforces.com/contest/513/problem/C>Second price auction</a></td><td>C</td><td>2000</td><td>bitmasks, probabilities</td><td><a href=https://codeforces.com/contest/513/submission/9749606>GNU C++</a></td><td>07 February 2015 17:16:05</td></tr><tr><td>675</td><td><a href=https://codeforces.com/contest/512/problem/E>Fox And Polygon</a></td><td>E</td><td>2900</td><td>constructive algorithms, divide and conquer</td><td><a href=https://codeforces.com/contest/512/submission/9689329>GNU C++</a></td><td>02 February 2015 18:27:38</td></tr><tr><td>674</td><td><a href=https://codeforces.com/contest/512/problem/C>Fox And Dinner</a></td><td>C</td><td>2300</td><td>flows, graph matchings</td><td><a href=https://codeforces.com/contest/512/submission/9686457>GNU C++</a></td><td>02 February 2015 17:46:50</td></tr><tr><td>673</td><td><a href=https://codeforces.com/contest/512/problem/D>Fox And Travelling</a></td><td>D</td><td>2900</td><td>dp, trees</td><td><a href=https://codeforces.com/contest/512/submission/9685060>GNU C++</a></td><td>02 February 2015 17:28:56</td></tr><tr><td>672</td><td><a href=https://codeforces.com/contest/512/problem/A>Fox And Names</a></td><td>A</td><td>1600</td><td>dfs and similar, graphs, greedy, sortings</td><td><a href=https://codeforces.com/contest/512/submission/9683617>GNU C++</a></td><td>02 February 2015 17:12:47</td></tr><tr><td>671</td><td><a href=https://codeforces.com/contest/512/problem/B>Fox And Jumping</a></td><td>B</td><td>1900</td><td>data structures, dp, math, number theory, shortest paths</td><td><a href=https://codeforces.com/contest/512/submission/9682911>GNU C++</a></td><td>02 February 2015 17:05:39</td></tr><tr><td>670</td><td><a href=https://codeforces.com/contest/507/problem/D>The Maths Lecture</a></td><td>D</td><td>2200</td><td>dp, implementation</td><td><a href=https://codeforces.com/contest/507/submission/9520456>GNU C++0x</a></td><td>23 January 2015 16:33:49</td></tr><tr><td>669</td><td><a href=https://codeforces.com/contest/507/problem/E>Breaking Good</a></td><td>E</td><td>2100</td><td>dfs and similar, dp, graphs, shortest paths</td><td><a href=https://codeforces.com/contest/507/submission/9520218>GNU C++0x</a></td><td>23 January 2015 16:32:03</td></tr><tr><td>668</td><td><a href=https://codeforces.com/contest/507/problem/C>Guess Your Way Out!</a></td><td>C</td><td>1700</td><td>implementation, math, trees</td><td><a href=https://codeforces.com/contest/507/submission/9517954>GNU C++0x</a></td><td>23 January 2015 16:18:12</td></tr><tr><td>667</td><td><a href=https://codeforces.com/contest/507/problem/B>Amr and Pins</a></td><td>B</td><td>1400</td><td>geometry, math</td><td><a href=https://codeforces.com/contest/507/submission/9515452>GNU C++0x</a></td><td>23 January 2015 16:06:14</td></tr><tr><td>666</td><td><a href=https://codeforces.com/contest/507/problem/A>Amr and Music</a></td><td>A</td><td>1000</td><td>greedy, implementation, sortings</td><td><a href=https://codeforces.com/contest/507/submission/9514951>GNU C++0x</a></td><td>23 January 2015 16:03:06</td></tr><tr><td>665</td><td><a href=https://codeforces.com/contest/100125/problem/K>Kingdom Subdivision</a></td><td>K</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100125/submission/9502601>GNU C++0x</a></td><td>22 January 2015 13:43:25</td></tr><tr><td>664</td><td><a href=https://codeforces.com/contest/100570/problem/F>Tree Query</a></td><td>F</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100570/submission/9381969>GNU C++</a></td><td>07 January 2015 18:34:32</td></tr><tr><td>663</td><td><a href=https://codeforces.com/contest/100570/problem/B>ShortestPath Query</a></td><td>B</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100570/submission/9381761>GNU C++</a></td><td>07 January 2015 18:11:00</td></tr><tr><td>662</td><td><a href=https://codeforces.com/contest/100570/problem/E>Palindrome Query</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100570/submission/9381675>GNU C++</a></td><td>07 January 2015 17:59:09</td></tr><tr><td>661</td><td><a href=https://codeforces.com/contest/100570/problem/C>Subrect Query</a></td><td>C</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100570/submission/9381504>GNU C++</a></td><td>07 January 2015 17:42:12</td></tr><tr><td>660</td><td><a href=https://codeforces.com/contest/100570/problem/A>LCM Query</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100570/submission/9381373>GNU C++</a></td><td>07 January 2015 17:32:10</td></tr><tr><td>659</td><td><a href=https://codeforces.com/contest/500/problem/F>New Year Shopping</a></td><td>F</td><td>2700</td><td>divide and conquer, dp</td><td><a href=https://codeforces.com/contest/500/submission/9316542>GNU C++</a></td><td>30 December 2014 15:55:57</td></tr><tr><td>658</td><td><a href=https://codeforces.com/contest/500/problem/E>New Year Domino</a></td><td>E</td><td>2300</td><td>data structures, dp, dsu</td><td><a href=https://codeforces.com/contest/500/submission/9314444>GNU C++</a></td><td>30 December 2014 15:39:59</td></tr><tr><td>657</td><td><a href=https://codeforces.com/contest/500/problem/D>New Year Santa Network</a></td><td>D</td><td>1900</td><td>combinatorics, dfs and similar, graphs, trees</td><td><a href=https://codeforces.com/contest/500/submission/9309948>GNU C++</a></td><td>30 December 2014 15:15:24</td></tr><tr><td>656</td><td><a href=https://codeforces.com/contest/500/problem/C>New Year Book Reading</a></td><td>C</td><td>1600</td><td>constructive algorithms, greedy, implementation, math</td><td><a href=https://codeforces.com/contest/500/submission/9308245>GNU C++</a></td><td>30 December 2014 15:09:45</td></tr><tr><td>655</td><td><a href=https://codeforces.com/contest/500/problem/A>New Year Transportation</a></td><td>A</td><td>1000</td><td>dfs and similar, graphs, implementation</td><td><a href=https://codeforces.com/contest/500/submission/9307130>GNU C++</a></td><td>30 December 2014 15:06:31</td></tr><tr><td>654</td><td><a href=https://codeforces.com/contest/500/problem/B>New Year Permutation</a></td><td>B</td><td>1600</td><td>dfs and similar, dsu, graphs, greedy, math, sortings</td><td><a href=https://codeforces.com/contest/500/submission/9306707>GNU C++</a></td><td>30 December 2014 15:05:04</td></tr><tr><td>653</td><td><a href=https://codeforces.com/contest/494/problem/D>Birthday</a></td><td>D</td><td>2700</td><td>data structures, dfs and similar, dp, trees</td><td><a href=https://codeforces.com/contest/494/submission/9118626>GNU C++</a></td><td>13 December 2014 19:21:22</td></tr><tr><td>652</td><td><a href=https://codeforces.com/contest/494/problem/C>Helping People</a></td><td>C</td><td>2600</td><td>dp, probabilities</td><td><a href=https://codeforces.com/contest/494/submission/9115660>GNU C++</a></td><td>13 December 2014 18:07:01</td></tr><tr><td>651</td><td><a href=https://codeforces.com/contest/494/problem/E>Sharti</a></td><td>E</td><td>3200</td><td>data structures, games</td><td><a href=https://codeforces.com/contest/494/submission/9112090>GNU C++</a></td><td>13 December 2014 17:32:52</td></tr><tr><td>650</td><td><a href=https://codeforces.com/contest/494/problem/B>Obsessive String</a></td><td>B</td><td>2000</td><td>dp, strings</td><td><a href=https://codeforces.com/contest/494/submission/9104681>GNU C++</a></td><td>13 December 2014 16:41:49</td></tr><tr><td>649</td><td><a href=https://codeforces.com/contest/494/problem/A>Treasure</a></td><td>A</td><td>1500</td><td>greedy</td><td><a href=https://codeforces.com/contest/494/submission/9103881>GNU C++</a></td><td>13 December 2014 16:33:35</td></tr><tr><td>648</td><td><a href=https://codeforces.com/contest/100553/problem/G>Gomoku</a></td><td>G</td><td>undefined</td><td>interactive</td><td><a href=https://codeforces.com/contest/100553/submission/9059666>GNU C++</a></td><td>09 December 2014 14:17:03</td></tr><tr><td>647</td><td><a href=https://codeforces.com/contest/492/problem/D>Vanya and Computer Game</a></td><td>D</td><td>1800</td><td>binary search, implementation, math, sortings</td><td><a href=https://codeforces.com/contest/492/submission/8912071>GNU C++</a></td><td>01 December 2014 17:01:25</td></tr><tr><td>646</td><td><a href=https://codeforces.com/contest/492/problem/E>Vanya and Field</a></td><td>E</td><td>2000</td><td>math</td><td><a href=https://codeforces.com/contest/492/submission/8911687>GNU C++</a></td><td>01 December 2014 16:59:15</td></tr><tr><td>645</td><td><a href=https://codeforces.com/contest/492/problem/C>Vanya and Exams</a></td><td>C</td><td>1400</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/492/submission/8909822>GNU C++</a></td><td>01 December 2014 16:48:37</td></tr><tr><td>644</td><td><a href=https://codeforces.com/contest/492/problem/A>Vanya and Cubes</a></td><td>A</td><td>800</td><td>implementation</td><td><a href=https://codeforces.com/contest/492/submission/8909344>GNU C++</a></td><td>01 December 2014 16:45:56</td></tr><tr><td>643</td><td><a href=https://codeforces.com/contest/492/problem/B>Vanya and Lanterns</a></td><td>B</td><td>1200</td><td>binary search, implementation, math, sortings</td><td><a href=https://codeforces.com/contest/492/submission/8909069>GNU C++</a></td><td>01 December 2014 16:44:34</td></tr><tr><td>642</td><td><a href=https://codeforces.com/contest/100500/problem/E>IBM Chill Zone</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632864>GNU C++</a></td><td>10 November 2014 17:00:23</td></tr><tr><td>641</td><td><a href=https://codeforces.com/contest/100500/problem/G>Swell Foop</a></td><td>G</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632854>GNU C++</a></td><td>10 November 2014 16:59:20</td></tr><tr><td>640</td><td><a href=https://codeforces.com/contest/100500/problem/B>Conference Room</a></td><td>B</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632743>GNU C++</a></td><td>10 November 2014 16:44:06</td></tr><tr><td>639</td><td><a href=https://codeforces.com/contest/100500/problem/A>Poetry Challenge</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632708>GNU C++</a></td><td>10 November 2014 16:37:26</td></tr><tr><td>638</td><td><a href=https://codeforces.com/contest/100500/problem/C>ICPC Giveaways</a></td><td>C</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632663>GNU C++</a></td><td>10 November 2014 16:31:37</td></tr><tr><td>637</td><td><a href=https://codeforces.com/contest/100500/problem/I>Hall of Fame</a></td><td>I</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632634>GNU C++</a></td><td>10 November 2014 16:27:54</td></tr><tr><td>636</td><td><a href=https://codeforces.com/contest/100500/problem/H>ICPC Quest</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632589>GNU C++</a></td><td>10 November 2014 16:22:07</td></tr><tr><td>635</td><td><a href=https://codeforces.com/contest/100500/problem/D>T-shirts</a></td><td>D</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632532>GNU C++</a></td><td>10 November 2014 16:12:45</td></tr><tr><td>634</td><td><a href=https://codeforces.com/contest/100500/problem/F>Door Lock</a></td><td>F</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632507>GNU C++</a></td><td>10 November 2014 16:09:53</td></tr><tr><td>633</td><td><a href=https://codeforces.com/contest/100500/problem/J>Bye Bye Russia</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100500/submission/8632485>GNU C++</a></td><td>10 November 2014 16:05:51</td></tr><tr><td>632</td><td><a href=https://codeforces.com/contest/100526/problem/H>Highway Hassle</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8594780>GNU C++</a></td><td>06 November 2014 18:19:26</td></tr><tr><td>631</td><td><a href=https://codeforces.com/contest/100526/problem/F>Floating Formation</a></td><td>F</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8592344>GNU C++</a></td><td>06 November 2014 15:09:09</td></tr><tr><td>630</td><td><a href=https://codeforces.com/contest/100526/problem/D>Dropping Directions</a></td><td>D</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8592217>GNU C++</a></td><td>06 November 2014 14:59:31</td></tr><tr><td>629</td><td><a href=https://codeforces.com/contest/100526/problem/A>Avoiding the Apocalypse</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8591705>GNU C++</a></td><td>06 November 2014 14:25:05</td></tr><tr><td>628</td><td><a href=https://codeforces.com/contest/100526/problem/I>Interesting Integers</a></td><td>I</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8591481>GNU C++</a></td><td>06 November 2014 14:09:27</td></tr><tr><td>627</td><td><a href=https://codeforces.com/contest/100526/problem/C>Citadel Construction</a></td><td>C</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8591346>GNU C++</a></td><td>06 November 2014 14:00:40</td></tr><tr><td>626</td><td><a href=https://codeforces.com/contest/100526/problem/E>Excellent Engineers</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8591056>GNU C++</a></td><td>06 November 2014 13:44:42</td></tr><tr><td>625</td><td><a href=https://codeforces.com/contest/100526/problem/B>Button Bashing</a></td><td>B</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8590985>GNU C++</a></td><td>06 November 2014 13:41:17</td></tr><tr><td>624</td><td><a href=https://codeforces.com/contest/100526/problem/G>Growling Gears</a></td><td>G</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8590911>GNU C++</a></td><td>06 November 2014 13:37:35</td></tr><tr><td>623</td><td><a href=https://codeforces.com/contest/100526/problem/J>Jury Jeopardy</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8590845>GNU C++</a></td><td>06 November 2014 13:34:34</td></tr><tr><td>622</td><td><a href=https://codeforces.com/contest/100526/problem/K>Key to Knowledge</a></td><td>K</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100526/submission/8590721>GNU C++</a></td><td>06 November 2014 13:28:23</td></tr><tr><td>621</td><td><a href=https://codeforces.com/contest/100514/problem/O>0x</a></td><td>O</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100514/submission/8514808>PHP</a></td><td>01 November 2014 15:40:12</td></tr><tr><td>620</td><td><a href=https://codeforces.com/contest/100514/problem/H>Peace of AmericaReunion</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100514/submission/8514762>GNU C++</a></td><td>01 November 2014 15:35:14</td></tr><tr><td>619</td><td><a href=https://codeforces.com/contest/100514/problem/E>Peace of AmericanWedding</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100514/submission/8514741>GNU C++</a></td><td>01 November 2014 15:33:08</td></tr><tr><td>618</td><td><a href=https://codeforces.com/contest/100514/problem/K>Crap</a></td><td>K</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100514/submission/8514647>GNU C++</a></td><td>01 November 2014 15:26:21</td></tr><tr><td>617</td><td><a href=https://codeforces.com/contest/100514/problem/M>oPlus</a></td><td>M</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100514/submission/8514599>GNU C++</a></td><td>01 November 2014 15:23:09</td></tr><tr><td>616</td><td><a href=https://codeforces.com/contest/100514/problem/J>Common</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100514/submission/8514576>GNU C++</a></td><td>01 November 2014 15:21:32</td></tr><tr><td>615</td><td><a href=https://codeforces.com/contest/100514/problem/I>Peace of AmericanPie</a></td><td>I</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100514/submission/8514518>GNU C++</a></td><td>01 November 2014 15:17:28</td></tr><tr><td>614</td><td><a href=https://codeforces.com/contest/100514/problem/R>6227020800</a></td><td>R</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100514/submission/8514496>GNU C++</a></td><td>01 November 2014 15:16:10</td></tr><tr><td>613</td><td><a href=https://codeforces.com/contest/100514/problem/Q>Peace of bzjd</a></td><td>Q</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100514/submission/8514474>GNU C++</a></td><td>01 November 2014 15:14:49</td></tr><tr><td>612</td><td><a href=https://codeforces.com/contest/100523/problem/J>Cave</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100523/submission/8486756>GNU C++</a></td><td>30 October 2014 14:09:37</td></tr><tr><td>611</td><td><a href=https://codeforces.com/contest/100523/problem/H>Afternoon Tea</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100523/submission/8486687>GNU C++</a></td><td>30 October 2014 14:06:09</td></tr><tr><td>610</td><td><a href=https://codeforces.com/contest/100523/problem/A>Arithmetic Rectangle</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100523/submission/8486215>GNU C++</a></td><td>30 October 2014 13:40:57</td></tr><tr><td>609</td><td><a href=https://codeforces.com/contest/482/problem/E>ELCA</a></td><td>E</td><td>3200</td><td>data structures, trees</td><td><a href=https://codeforces.com/contest/482/submission/8395481>GNU C++</a></td><td>24 October 2014 20:59:59</td></tr><tr><td>608</td><td><a href=https://codeforces.com/contest/482/problem/C>Game with Strings</a></td><td>C</td><td>2600</td><td>bitmasks, dp, probabilities</td><td><a href=https://codeforces.com/contest/482/submission/8384458>GNU C++</a></td><td>24 October 2014 17:34:25</td></tr><tr><td>607</td><td><a href=https://codeforces.com/contest/482/problem/D>Random Function and Tree</a></td><td>D</td><td>2700</td><td>combinatorics, dp, trees</td><td><a href=https://codeforces.com/contest/482/submission/8386071>GNU C++</a></td><td>24 October 2014 17:49:36</td></tr><tr><td>606</td><td><a href=https://codeforces.com/contest/482/problem/B>Interesting Array</a></td><td>B</td><td>1800</td><td>constructive algorithms, data structures, trees</td><td><a href=https://codeforces.com/contest/482/submission/8382609>GNU C++</a></td><td>24 October 2014 17:19:19</td></tr><tr><td>605</td><td><a href=https://codeforces.com/contest/482/problem/A>Diverse Permutation</a></td><td>A</td><td>1200</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/482/submission/8380309>GNU C++</a></td><td>24 October 2014 17:06:26</td></tr><tr><td>604</td><td><a href=https://codeforces.com/contest/474/problem/E>Pillars</a></td><td>E</td><td>2000</td><td>binary search, data structures, dp, sortings, trees</td><td><a href=https://codeforces.com/contest/474/submission/8112605>GNU C++</a></td><td>06 October 2014 16:01:03</td></tr><tr><td>603</td><td><a href=https://codeforces.com/contest/474/problem/F>Ant colony</a></td><td>F</td><td>2100</td><td>data structures, math, number theory</td><td><a href=https://codeforces.com/contest/474/submission/8110974>GNU C++</a></td><td>06 October 2014 15:50:24</td></tr><tr><td>602</td><td><a href=https://codeforces.com/contest/474/problem/D>Flowers</a></td><td>D</td><td>1700</td><td>dp</td><td><a href=https://codeforces.com/contest/474/submission/8109752>GNU C++</a></td><td>06 October 2014 15:44:17</td></tr><tr><td>601</td><td><a href=https://codeforces.com/contest/474/problem/C>Captain Marmot</a></td><td>C</td><td>2000</td><td>brute force, geometry</td><td><a href=https://codeforces.com/contest/474/submission/8109129>GNU C++</a></td><td>06 October 2014 15:41:37</td></tr><tr><td>600</td><td><a href=https://codeforces.com/contest/474/problem/B>Worms</a></td><td>B</td><td>1200</td><td>binary search, implementation</td><td><a href=https://codeforces.com/contest/474/submission/8107578>GNU C++</a></td><td>06 October 2014 15:33:19</td></tr><tr><td>599</td><td><a href=https://codeforces.com/contest/474/problem/A>Keyboard</a></td><td>A</td><td>900</td><td>implementation</td><td><a href=https://codeforces.com/contest/474/submission/8107540>GNU C++</a></td><td>06 October 2014 15:31:48</td></tr><tr><td>598</td><td><a href=https://codeforces.com/contest/472/problem/E>Design Tutorial: Learn from a Game</a></td><td>E</td><td>2800</td><td>constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/472/submission/8012060>GNU C++</a></td><td>28 September 2014 17:32:47</td></tr><tr><td>597</td><td><a href=https://codeforces.com/contest/472/problem/D>Design Tutorial: Inverse the Problem</a></td><td>D</td><td>1900</td><td>dfs and similar, dsu, shortest paths, trees</td><td><a href=https://codeforces.com/contest/472/submission/8002975>GNU C++</a></td><td>28 September 2014 16:04:30</td></tr><tr><td>596</td><td><a href=https://codeforces.com/contest/472/problem/C>Design Tutorial: Make It Nondeterministic</a></td><td>C</td><td>1400</td><td>greedy</td><td><a href=https://codeforces.com/contest/472/submission/7999042>GNU C++</a></td><td>28 September 2014 15:45:43</td></tr><tr><td>595</td><td><a href=https://codeforces.com/contest/472/problem/B>Design Tutorial: Learn from Life</a></td><td>B</td><td>1300</td><td></td><td><a href=https://codeforces.com/contest/472/submission/7996646>GNU C++</a></td><td>28 September 2014 15:38:54</td></tr><tr><td>594</td><td><a href=https://codeforces.com/contest/472/problem/A>Design Tutorial: Learn from Math</a></td><td>A</td><td>800</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/472/submission/7996316>GNU C++</a></td><td>28 September 2014 15:37:54</td></tr><tr><td>593</td><td><a href=https://codeforces.com/contest/466/problem/E>Information Graph</a></td><td>E</td><td>2100</td><td>dfs and similar, dsu, graphs, trees</td><td><a href=https://codeforces.com/contest/466/submission/7758393>GNU C++</a></td><td>12 September 2014 15:52:53</td></tr><tr><td>592</td><td><a href=https://codeforces.com/contest/466/problem/D>Increase Sequence</a></td><td>D</td><td>2100</td><td>combinatorics, dp</td><td><a href=https://codeforces.com/contest/466/submission/7756150>GNU C++</a></td><td>12 September 2014 15:42:53</td></tr><tr><td>591</td><td><a href=https://codeforces.com/contest/466/problem/C>Number of Ways</a></td><td>C</td><td>1700</td><td>binary search, brute force, data structures, dp, two pointers</td><td><a href=https://codeforces.com/contest/466/submission/7754473>GNU C++</a></td><td>12 September 2014 15:37:15</td></tr><tr><td>590</td><td><a href=https://codeforces.com/contest/466/problem/B>Wonder Room</a></td><td>B</td><td>2000</td><td>brute force, math</td><td><a href=https://codeforces.com/contest/466/submission/7753781>GNU C++</a></td><td>12 September 2014 15:35:09</td></tr><tr><td>589</td><td><a href=https://codeforces.com/contest/466/problem/A>Cheap Travel</a></td><td>A</td><td>1200</td><td>implementation</td><td><a href=https://codeforces.com/contest/466/submission/7753035>GNU C++</a></td><td>12 September 2014 15:31:09</td></tr><tr><td>588</td><td><a href=https://codeforces.com/contest/100484/problem/L>Cow Acrobats</a></td><td>L</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7743913>GNU C++</a></td><td>11 September 2014 14:29:15</td></tr><tr><td>587</td><td><a href=https://codeforces.com/contest/100484/problem/K>Completion</a></td><td>K</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7743821>GNU C++</a></td><td>11 September 2014 14:23:34</td></tr><tr><td>586</td><td><a href=https://codeforces.com/contest/100484/problem/J>Hexagon Game</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7743686>GNU C++</a></td><td>11 September 2014 14:16:33</td></tr><tr><td>585</td><td><a href=https://codeforces.com/contest/100484/problem/I>Random Route</a></td><td>I</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7743184>GNU C++</a></td><td>11 September 2014 13:49:08</td></tr><tr><td>584</td><td><a href=https://codeforces.com/contest/100484/problem/H>Advertisement</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7742997>GNU C++</a></td><td>11 September 2014 13:38:44</td></tr><tr><td>583</td><td><a href=https://codeforces.com/contest/100484/problem/G>Highways</a></td><td>G</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7742859>GNU C++</a></td><td>11 September 2014 13:31:19</td></tr><tr><td>582</td><td><a href=https://codeforces.com/contest/100484/problem/F>Dictionary</a></td><td>F</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7742781>GNU C++</a></td><td>11 September 2014 13:26:32</td></tr><tr><td>581</td><td><a href=https://codeforces.com/contest/100484/problem/E>Lock Manager</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7742595>GNU C++</a></td><td>11 September 2014 13:15:59</td></tr><tr><td>580</td><td><a href=https://codeforces.com/contest/100484/problem/D>Computer Dialogue</a></td><td>D</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7742445>GNU C++</a></td><td>11 September 2014 13:08:42</td></tr><tr><td>579</td><td><a href=https://codeforces.com/contest/64/problem/B>Expression</a></td><td>B</td><td>1500</td><td>*special, expression parsing</td><td><a href=https://codeforces.com/contest/64/submission/293669>Tcl</a></td><td>21 February 2011 16:04:59</td></tr><tr><td>578</td><td><a href=https://codeforces.com/contest/100484/problem/B>Loan</a></td><td>B</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7741968>GNU C++</a></td><td>11 September 2014 12:44:32</td></tr><tr><td>577</td><td><a href=https://codeforces.com/contest/100484/problem/A>Divisibility</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100484/submission/7741466>GNU C++</a></td><td>11 September 2014 12:13:27</td></tr><tr><td>576</td><td><a href=https://codeforces.com/contest/464/problem/D>World of Darkraft - 2</a></td><td>D</td><td>2700</td><td>dp, probabilities</td><td><a href=https://codeforces.com/contest/464/submission/7709708>GNU C++</a></td><td>07 September 2014 16:42:58</td></tr><tr><td>575</td><td><a href=https://codeforces.com/contest/464/problem/B>Restore Cube </a></td><td>B</td><td>2000</td><td>brute force, geometry</td><td><a href=https://codeforces.com/contest/464/submission/7707364>GNU C++</a></td><td>07 September 2014 16:15:58</td></tr><tr><td>574</td><td><a href=https://codeforces.com/contest/464/problem/C>Substitutes in Number</a></td><td>C</td><td>2100</td><td>dp</td><td><a href=https://codeforces.com/contest/464/submission/7704070>GNU C++</a></td><td>07 September 2014 15:49:52</td></tr><tr><td>573</td><td><a href=https://codeforces.com/contest/464/problem/A>No to Palindromes!</a></td><td>A</td><td>1700</td><td>greedy, strings</td><td><a href=https://codeforces.com/contest/464/submission/7701335>GNU C++</a></td><td>07 September 2014 15:35:45</td></tr><tr><td>572</td><td><a href=https://codeforces.com/contest/458/problem/D>Bingo!</a></td><td>D</td><td>2700</td><td>combinatorics, probabilities</td><td><a href=https://codeforces.com/contest/458/submission/7420493>GNU C++</a></td><td>10 August 2014 19:39:45</td></tr><tr><td>571</td><td><a href=https://codeforces.com/contest/458/problem/B>Distributed Join</a></td><td>B</td><td>1900</td><td>greedy</td><td><a href=https://codeforces.com/contest/458/submission/7417990>GNU C++</a></td><td>10 August 2014 18:15:39</td></tr><tr><td>570</td><td><a href=https://codeforces.com/contest/458/problem/A>Golden System</a></td><td>A</td><td>1700</td><td>math</td><td><a href=https://codeforces.com/contest/458/submission/7415509>GNU C++</a></td><td>10 August 2014 17:16:36</td></tr><tr><td>569</td><td><a href=https://codeforces.com/contest/455/problem/E>Function</a></td><td>E</td><td>2900</td><td>data structures</td><td><a href=https://codeforces.com/contest/455/submission/7394351>GNU C++</a></td><td>08 August 2014 17:20:42</td></tr><tr><td>568</td><td><a href=https://codeforces.com/contest/455/problem/D>Serega and Fun</a></td><td>D</td><td>2700</td><td>data structures</td><td><a href=https://codeforces.com/contest/455/submission/7390969>GNU C++</a></td><td>08 August 2014 16:50:55</td></tr><tr><td>567</td><td><a href=https://codeforces.com/contest/455/problem/C>Civilization</a></td><td>C</td><td>2100</td><td>dfs and similar, dp, dsu, ternary search, trees</td><td><a href=https://codeforces.com/contest/455/submission/7383856>GNU C++</a></td><td>08 August 2014 16:03:03</td></tr><tr><td>566</td><td><a href=https://codeforces.com/contest/455/problem/B>A Lot of Games</a></td><td>B</td><td>1900</td><td>dfs and similar, dp, games, implementation, strings, trees</td><td><a href=https://codeforces.com/contest/455/submission/7380394>GNU C++</a></td><td>08 August 2014 15:46:26</td></tr><tr><td>565</td><td><a href=https://codeforces.com/contest/455/problem/A>Boredom</a></td><td>A</td><td>1500</td><td>dp</td><td><a href=https://codeforces.com/contest/455/submission/7377249>GNU C++</a></td><td>08 August 2014 15:33:42</td></tr><tr><td>564</td><td><a href=https://codeforces.com/contest/452/problem/E>Three strings</a></td><td>E</td><td>2400</td><td>data structures, dsu, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/452/submission/7265530>GNU C++</a></td><td>27 July 2014 18:04:56</td></tr><tr><td>563</td><td><a href=https://codeforces.com/contest/452/problem/D>Washer, Dryer, Folder</a></td><td>D</td><td>1900</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/452/submission/7263835>GNU C++</a></td><td>27 July 2014 17:44:46</td></tr><tr><td>562</td><td><a href=https://codeforces.com/contest/452/problem/B>4-point polyline</a></td><td>B</td><td>1800</td><td>brute force, constructive algorithms, geometry, trees</td><td><a href=https://codeforces.com/contest/452/submission/7263420>GNU C++</a></td><td>27 July 2014 17:40:24</td></tr><tr><td>561</td><td><a href=https://codeforces.com/contest/452/problem/C>Magic Trick</a></td><td>C</td><td>2100</td><td>combinatorics, math, probabilities</td><td><a href=https://codeforces.com/contest/452/submission/7262766>GNU C++</a></td><td>27 July 2014 17:33:53</td></tr><tr><td>560</td><td><a href=https://codeforces.com/contest/452/problem/A>Eevee</a></td><td>A</td><td>1000</td><td>brute force, implementation, strings</td><td><a href=https://codeforces.com/contest/452/submission/7258696>GNU C++</a></td><td>27 July 2014 17:02:47</td></tr><tr><td>559</td><td><a href=https://codeforces.com/contest/442/problem/E>Gena and Second Distance</a></td><td>E</td><td>3100</td><td>geometry</td><td><a href=https://codeforces.com/contest/442/submission/6921847>GNU C++</a></td><td>19 June 2014 17:24:23</td></tr><tr><td>558</td><td><a href=https://codeforces.com/contest/442/problem/C>Artem and Array </a></td><td>C</td><td>2500</td><td>data structures, greedy</td><td><a href=https://codeforces.com/contest/442/submission/6919336>GNU C++</a></td><td>19 June 2014 16:44:22</td></tr><tr><td>557</td><td><a href=https://codeforces.com/contest/442/problem/D>Adam and Tree</a></td><td>D</td><td>2600</td><td>data structures, trees</td><td><a href=https://codeforces.com/contest/442/submission/6917753>GNU C++</a></td><td>19 June 2014 16:21:26</td></tr><tr><td>556</td><td><a href=https://codeforces.com/contest/442/problem/B>Andrey and Problem</a></td><td>B</td><td>1800</td><td>greedy, math, probabilities</td><td><a href=https://codeforces.com/contest/442/submission/6916976>GNU C++</a></td><td>19 June 2014 16:10:27</td></tr><tr><td>555</td><td><a href=https://codeforces.com/contest/442/problem/A>Borya and Hanabi</a></td><td>A</td><td>1700</td><td>bitmasks, brute force, implementation</td><td><a href=https://codeforces.com/contest/442/submission/6914458>GNU C++</a></td><td>19 June 2014 15:38:14</td></tr><tr><td>554</td><td><a href=https://codeforces.com/contest/436/problem/F>Banners</a></td><td>F</td><td>3000</td><td>brute force, data structures, dp</td><td><a href=https://codeforces.com/contest/436/submission/6886429>GNU C++</a></td><td>13 June 2014 21:33:45</td></tr><tr><td>553</td><td><a href=https://codeforces.com/contest/436/problem/C>Dungeons and Candies</a></td><td>C</td><td>1800</td><td>dsu, graphs, greedy, trees</td><td><a href=https://codeforces.com/contest/436/submission/6875335>GNU C++</a></td><td>13 June 2014 15:49:07</td></tr><tr><td>552</td><td><a href=https://codeforces.com/contest/436/problem/B>Om Nom and Spiders</a></td><td>B</td><td>1400</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/436/submission/6874241>GNU C++</a></td><td>13 June 2014 15:39:53</td></tr><tr><td>551</td><td><a href=https://codeforces.com/contest/436/problem/A>Feed with Candy</a></td><td>A</td><td>1500</td><td>greedy</td><td><a href=https://codeforces.com/contest/436/submission/6873988>GNU C++</a></td><td>13 June 2014 15:35:47</td></tr><tr><td>550</td><td><a href=https://codeforces.com/contest/412/problem/E>E-mail Addresses</a></td><td>E</td><td>1900</td><td>implementation</td><td><a href=https://codeforces.com/contest/412/submission/6406325>GNU C++</a></td><td>18 April 2014 16:33:53</td></tr><tr><td>549</td><td><a href=https://codeforces.com/contest/412/problem/D>Giving Awards</a></td><td>D</td><td>2000</td><td>dfs and similar</td><td><a href=https://codeforces.com/contest/412/submission/6405248>GNU C++</a></td><td>18 April 2014 16:25:15</td></tr><tr><td>548</td><td><a href=https://codeforces.com/contest/412/problem/A>Poster</a></td><td>A</td><td>900</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/412/submission/6404336>GNU C++</a></td><td>18 April 2014 16:17:46</td></tr><tr><td>547</td><td><a href=https://codeforces.com/contest/412/problem/B>Network Configuration</a></td><td>B</td><td>900</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/412/submission/6404191>GNU C++</a></td><td>18 April 2014 16:15:09</td></tr><tr><td>546</td><td><a href=https://codeforces.com/contest/412/problem/C>Pattern</a></td><td>C</td><td>1200</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/412/submission/6404170>GNU C++</a></td><td>18 April 2014 16:13:19</td></tr><tr><td>545</td><td><a href=https://codeforces.com/contest/418/problem/D>Big Problems for Organizers</a></td><td>D</td><td>2800</td><td>data structures, graphs, trees</td><td><a href=https://codeforces.com/contest/418/submission/6394549>GNU C++</a></td><td>17 April 2014 18:05:53</td></tr><tr><td>544</td><td><a href=https://codeforces.com/contest/418/problem/C>Square Table</a></td><td>C</td><td>2400</td><td>constructive algorithms, dp, math</td><td><a href=https://codeforces.com/contest/418/submission/6387160>GNU C++</a></td><td>17 April 2014 15:58:54</td></tr><tr><td>543</td><td><a href=https://codeforces.com/contest/418/problem/B>Cunning Gena</a></td><td>B</td><td>1900</td><td>bitmasks, dp, sortings</td><td><a href=https://codeforces.com/contest/418/submission/6386136>GNU C++</a></td><td>17 April 2014 15:49:48</td></tr><tr><td>542</td><td><a href=https://codeforces.com/contest/96/problem/A>Football</a></td><td>A</td><td>900</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/96/submission/546632>Delphi</a></td><td>15 July 2011 11:29:46</td></tr><tr><td>541</td><td><a href=https://codeforces.com/contest/409/problem/E>Dome</a></td><td>E</td><td>1800</td><td>*special</td><td><a href=https://codeforces.com/contest/409/submission/6229002>GNU C++</a></td><td>01 April 2014 17:03:07</td></tr><tr><td>540</td><td><a href=https://codeforces.com/contest/409/problem/D>Big Data</a></td><td>D</td><td>1700</td><td>*special</td><td><a href=https://codeforces.com/contest/409/submission/6226300>GNU C++</a></td><td>01 April 2014 16:52:52</td></tr><tr><td>539</td><td><a href=https://codeforces.com/contest/409/problem/H>A + B Strikes Back</a></td><td>H</td><td>1500</td><td>*special, brute force, constructive algorithms, dsu, implementation</td><td><a href=https://codeforces.com/contest/409/submission/6211134>GNU C++</a></td><td>01 April 2014 15:58:44</td></tr><tr><td>538</td><td><a href=https://codeforces.com/contest/409/problem/B>Mysterious Language</a></td><td>B</td><td>1700</td><td>*special</td><td><a href=https://codeforces.com/contest/409/submission/6210388>Mysterious Language</a></td><td>01 April 2014 15:55:46</td></tr><tr><td>537</td><td><a href=https://codeforces.com/contest/409/problem/C>Magnum Opus</a></td><td>C</td><td>1700</td><td>*special</td><td><a href=https://codeforces.com/contest/409/submission/6208379>GNU C++</a></td><td>01 April 2014 15:47:21</td></tr><tr><td>536</td><td><a href=https://codeforces.com/contest/409/problem/A>The Great Game</a></td><td>A</td><td>1700</td><td>*special</td><td><a href=https://codeforces.com/contest/409/submission/6207760>GNU C++</a></td><td>01 April 2014 15:44:46</td></tr><tr><td>535</td><td><a href=https://codeforces.com/contest/407/problem/D>Largest Submatrix 3</a></td><td>D</td><td>2700</td><td>dp, hashing</td><td><a href=https://codeforces.com/contest/407/submission/6186438>GNU C++</a></td><td>30 March 2014 08:46:29</td></tr><tr><td>534</td><td><a href=https://codeforces.com/contest/407/problem/C>Curious Array</a></td><td>C</td><td>2500</td><td>brute force, combinatorics, implementation, math</td><td><a href=https://codeforces.com/contest/407/submission/6183229>GNU C++</a></td><td>30 March 2014 07:53:56</td></tr><tr><td>533</td><td><a href=https://codeforces.com/contest/407/problem/A>Triangle</a></td><td>A</td><td>1600</td><td>brute force, geometry, implementation, math</td><td><a href=https://codeforces.com/contest/407/submission/6179819>GNU C++</a></td><td>30 March 2014 07:17:06</td></tr><tr><td>532</td><td><a href=https://codeforces.com/contest/407/problem/B>Long Path</a></td><td>B</td><td>1600</td><td>dp, implementation</td><td><a href=https://codeforces.com/contest/407/submission/6178779>GNU C++</a></td><td>30 March 2014 07:09:34</td></tr><tr><td>531</td><td><a href=https://codeforces.com/contest/388/problem/D>Fox and Perfect Sets</a></td><td>D</td><td>2700</td><td>math</td><td><a href=https://codeforces.com/contest/388/submission/5881221>GNU C++</a></td><td>03 February 2014 16:30:46</td></tr><tr><td>530</td><td><a href=https://codeforces.com/contest/388/problem/A>Fox and Box Accumulation</a></td><td>A</td><td>1400</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/388/submission/5878499>GNU C++</a></td><td>03 February 2014 16:10:59</td></tr><tr><td>529</td><td><a href=https://codeforces.com/contest/388/problem/C>Fox and Card Game</a></td><td>C</td><td>2000</td><td>games, greedy, sortings</td><td><a href=https://codeforces.com/contest/388/submission/5878094>GNU C++</a></td><td>03 February 2014 16:04:31</td></tr><tr><td>528</td><td><a href=https://codeforces.com/contest/388/problem/B>Fox and Minimal path</a></td><td>B</td><td>1900</td><td>bitmasks, constructive algorithms, graphs, implementation, math</td><td><a href=https://codeforces.com/contest/388/submission/5877357>GNU C++</a></td><td>03 February 2014 15:59:40</td></tr><tr><td>527</td><td><a href=https://codeforces.com/contest/379/problem/E>New Year Tree Decorations</a></td><td>E</td><td>2500</td><td>geometry, schedules, sortings</td><td><a href=https://codeforces.com/contest/379/submission/5580054>GNU C++</a></td><td>30 December 2013 16:29:34</td></tr><tr><td>526</td><td><a href=https://codeforces.com/contest/379/problem/D>New Year Letter</a></td><td>D</td><td>2000</td><td>bitmasks, brute force, dp</td><td><a href=https://codeforces.com/contest/379/submission/5577419>GNU C++</a></td><td>30 December 2013 16:04:56</td></tr><tr><td>525</td><td><a href=https://codeforces.com/contest/379/problem/B>New Year Present</a></td><td>B</td><td>1200</td><td>constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/379/submission/5571662>GNU C++</a></td><td>30 December 2013 15:36:42</td></tr><tr><td>524</td><td><a href=https://codeforces.com/contest/379/problem/C>New Year Ratings Change</a></td><td>C</td><td>1400</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/379/submission/5570734>GNU C++</a></td><td>30 December 2013 15:34:01</td></tr><tr><td>523</td><td><a href=https://codeforces.com/contest/379/problem/A>New Year Candles</a></td><td>A</td><td>1000</td><td>implementation</td><td><a href=https://codeforces.com/contest/379/submission/5570092>GNU C++</a></td><td>30 December 2013 15:31:32</td></tr><tr><td>522</td><td><a href=https://codeforces.com/contest/377/problem/E>Cookie Clicker</a></td><td>E</td><td>2800</td><td>dp, geometry</td><td><a href=https://codeforces.com/contest/377/submission/5565104>GNU C++</a></td><td>29 December 2013 23:36:09</td></tr><tr><td>521</td><td><a href=https://codeforces.com/contest/377/problem/C>Captains Mode</a></td><td>C</td><td>2200</td><td>bitmasks, dp, games</td><td><a href=https://codeforces.com/contest/377/submission/5557198>GNU C++</a></td><td>29 December 2013 16:24:02</td></tr><tr><td>520</td><td><a href=https://codeforces.com/contest/377/problem/B>Preparing for the Contest</a></td><td>B</td><td>1900</td><td>binary search, data structures, greedy, sortings</td><td><a href=https://codeforces.com/contest/377/submission/5555860>GNU C++</a></td><td>29 December 2013 16:08:39</td></tr><tr><td>519</td><td><a href=https://codeforces.com/contest/377/problem/D>Developing Game</a></td><td>D</td><td>2400</td><td>data structures</td><td><a href=https://codeforces.com/contest/377/submission/5554743>GNU C++</a></td><td>29 December 2013 15:55:41</td></tr><tr><td>518</td><td><a href=https://codeforces.com/contest/123/problem/E>Maze</a></td><td>E</td><td>2500</td><td>dfs and similar, dp, probabilities, trees</td><td><a href=https://codeforces.com/contest/123/submission/830913>Delphi</a></td><td>03 November 2011 16:30:36</td></tr><tr><td>517</td><td><a href=https://codeforces.com/contest/372/problem/D>Choosing Subtree is Fun</a></td><td>D</td><td>2600</td><td>binary search, data structures, dfs and similar, trees, two pointers</td><td><a href=https://codeforces.com/contest/372/submission/5430216>GNU C++</a></td><td>13 December 2013 15:38:22</td></tr><tr><td>516</td><td><a href=https://codeforces.com/contest/372/problem/C>Watching Fireworks is Fun</a></td><td>C</td><td>2100</td><td>data structures, dp, math</td><td><a href=https://codeforces.com/contest/372/submission/5423917>GNU C++</a></td><td>13 December 2013 14:27:41</td></tr><tr><td>515</td><td><a href=https://codeforces.com/contest/372/problem/B>Counting Rectangles is Fun</a></td><td>B</td><td>1900</td><td>brute force, divide and conquer, dp</td><td><a href=https://codeforces.com/contest/372/submission/5421838>GNU C++</a></td><td>13 December 2013 14:09:48</td></tr><tr><td>514</td><td><a href=https://codeforces.com/contest/372/problem/A>Counting Kangaroos is Fun</a></td><td>A</td><td>1600</td><td>binary search, greedy, sortings, two pointers</td><td><a href=https://codeforces.com/contest/372/submission/5420847>GNU C++</a></td><td>13 December 2013 14:03:27</td></tr><tr><td>513</td><td><a href=https://codeforces.com/contest/367/problem/E>Sereja and Intervals</a></td><td>E</td><td>2700</td><td>combinatorics, dp</td><td><a href=https://codeforces.com/contest/367/submission/5253117>GNU C++</a></td><td>26 November 2013 16:46:39</td></tr><tr><td>512</td><td><a href=https://codeforces.com/contest/367/problem/D>Sereja and Sets</a></td><td>D</td><td>2400</td><td>bitmasks, dfs and similar</td><td><a href=https://codeforces.com/contest/367/submission/5249684>GNU C++</a></td><td>26 November 2013 16:10:27</td></tr><tr><td>511</td><td><a href=https://codeforces.com/contest/367/problem/A>Sereja and Algorithm </a></td><td>A</td><td>1500</td><td>data structures, implementation</td><td><a href=https://codeforces.com/contest/367/submission/5248539>GNU C++</a></td><td>26 November 2013 15:59:34</td></tr><tr><td>510</td><td><a href=https://codeforces.com/contest/367/problem/C>Sereja and the Arrangement of Numbers</a></td><td>C</td><td>2000</td><td>graphs, greedy, sortings</td><td><a href=https://codeforces.com/contest/367/submission/5247815>GNU C++</a></td><td>26 November 2013 15:53:39</td></tr><tr><td>509</td><td><a href=https://codeforces.com/contest/367/problem/B>Sereja ans Anagrams</a></td><td>B</td><td>1900</td><td>binary search, data structures</td><td><a href=https://codeforces.com/contest/367/submission/5245452>GNU C++</a></td><td>26 November 2013 15:38:57</td></tr><tr><td>508</td><td><a href=https://codeforces.com/contest/100268/problem/L>Wi-fi Towers</a></td><td>L</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4936853>GNU C++</a></td><td>30 October 2013 16:17:25</td></tr><tr><td>507</td><td><a href=https://codeforces.com/contest/100268/problem/K>Doubly-sorted Grid</a></td><td>K</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4936696>GNU C++</a></td><td>30 October 2013 15:57:08</td></tr><tr><td>506</td><td><a href=https://codeforces.com/contest/100268/problem/B>Seven Kingdoms</a></td><td>B</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4936035>GNU C++</a></td><td>30 October 2013 14:51:33</td></tr><tr><td>505</td><td><a href=https://codeforces.com/contest/100268/problem/A>Fast Food Prizes</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4935811>GNU C++</a></td><td>30 October 2013 14:31:28</td></tr><tr><td>504</td><td><a href=https://codeforces.com/contest/100268/problem/J>Chemicals Monitoring</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4935656>GNU C++</a></td><td>30 October 2013 14:15:08</td></tr><tr><td>503</td><td><a href=https://codeforces.com/contest/100268/problem/F>IQ Test</a></td><td>F</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4935261>GNU C++</a></td><td>30 October 2013 13:42:26</td></tr><tr><td>502</td><td><a href=https://codeforces.com/contest/100268/problem/D>Digital Content Protection</a></td><td>D</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4934866>GNU C++</a></td><td>30 October 2013 13:11:37</td></tr><tr><td>501</td><td><a href=https://codeforces.com/contest/100268/problem/C>Institute of Advanced Category Manipulation</a></td><td>C</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4934739>GNU C++</a></td><td>30 October 2013 13:00:30</td></tr><tr><td>500</td><td><a href=https://codeforces.com/contest/100268/problem/I>Flood-It</a></td><td>I</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4934515>GNU C++</a></td><td>30 October 2013 12:43:49</td></tr><tr><td>499</td><td><a href=https://codeforces.com/contest/100268/problem/E>Credit Card Payment</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4934420>GNU C++</a></td><td>30 October 2013 12:36:23</td></tr><tr><td>498</td><td><a href=https://codeforces.com/contest/100268/problem/H>Tables</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4934333>GNU C++</a></td><td>30 October 2013 12:29:39</td></tr><tr><td>497</td><td><a href=https://codeforces.com/contest/100268/problem/G>Social Advertising</a></td><td>G</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100268/submission/4934245>GNU C++</a></td><td>30 October 2013 12:20:01</td></tr><tr><td>496</td><td><a href=https://codeforces.com/contest/356/problem/D>Bags and Coins</a></td><td>D</td><td>2700</td><td>bitmasks, constructive algorithms, dp, greedy</td><td><a href=https://codeforces.com/contest/356/submission/4794974>GNU C++</a></td><td>15 October 2013 13:11:34</td></tr><tr><td>495</td><td><a href=https://codeforces.com/contest/356/problem/C>Compartments</a></td><td>C</td><td>2100</td><td>combinatorics, constructive algorithms, greedy, implementation</td><td><a href=https://codeforces.com/contest/356/submission/4792387>GNU C++</a></td><td>15 October 2013 12:33:25</td></tr><tr><td>494</td><td><a href=https://codeforces.com/contest/356/problem/A>Knight Tournament</a></td><td>A</td><td>1500</td><td>data structures, dsu</td><td><a href=https://codeforces.com/contest/356/submission/4790471>GNU C++</a></td><td>15 October 2013 12:14:42</td></tr><tr><td>493</td><td><a href=https://codeforces.com/contest/356/problem/B>Xenia and Hamming</a></td><td>B</td><td>1900</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/356/submission/4789769>GNU C++</a></td><td>15 October 2013 12:09:23</td></tr><tr><td>492</td><td><a href=https://codeforces.com/contest/100228/problem/M>Square, Segments and Point</a></td><td>M</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4496769>GNU C++</a></td><td>18 September 2013 15:23:38</td></tr><tr><td>491</td><td><a href=https://codeforces.com/contest/100228/problem/L>Young Diagrams</a></td><td>L</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4496161>GNU C++</a></td><td>18 September 2013 14:38:17</td></tr><tr><td>490</td><td><a href=https://codeforces.com/contest/100228/problem/K>Chessboard in FEN</a></td><td>K</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4495968>GNU C++</a></td><td>18 September 2013 14:27:46</td></tr><tr><td>489</td><td><a href=https://codeforces.com/contest/100228/problem/J>Common Permutation</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4495834>GNU C++</a></td><td>18 September 2013 14:17:05</td></tr><tr><td>488</td><td><a href=https://codeforces.com/contest/100228/problem/I>Graph of Inversions</a></td><td>I</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4495750>GNU C++</a></td><td>18 September 2013 14:11:04</td></tr><tr><td>487</td><td><a href=https://codeforces.com/contest/100228/problem/H>This Takes the Cake</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4495685>GNU C++</a></td><td>18 September 2013 14:06:39</td></tr><tr><td>486</td><td><a href=https://codeforces.com/contest/100228/problem/G>Squadtrees</a></td><td>G</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4495631>GNU C++</a></td><td>18 September 2013 14:02:02</td></tr><tr><td>485</td><td><a href=https://codeforces.com/contest/100228/problem/F>Pushing Boxes</a></td><td>F</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4495354>GNU C++</a></td><td>18 September 2013 13:44:28</td></tr><tr><td>484</td><td><a href=https://codeforces.com/contest/100228/problem/E>Polly Nomials</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4495185>GNU C++</a></td><td>18 September 2013 13:33:49</td></tr><tr><td>483</td><td><a href=https://codeforces.com/contest/100228/problem/D>Phone Home</a></td><td>D</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4495096>GNU C++</a></td><td>18 September 2013 13:27:44</td></tr><tr><td>482</td><td><a href=https://codeforces.com/contest/100228/problem/C>EKG Sequence</a></td><td>C</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4494997>GNU C++</a></td><td>18 September 2013 13:22:26</td></tr><tr><td>481</td><td><a href=https://codeforces.com/contest/100228/problem/B>Decorations</a></td><td>B</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4494881>GNU C++</a></td><td>18 September 2013 13:15:28</td></tr><tr><td>480</td><td><a href=https://codeforces.com/contest/100228/problem/A>Crypto Columns</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100228/submission/4494365>GNU C++</a></td><td>18 September 2013 12:46:08</td></tr><tr><td>479</td><td><a href=https://codeforces.com/contest/343/problem/D>Water Tree</a></td><td>D</td><td>2100</td><td>data structures, dfs and similar, graphs, trees</td><td><a href=https://codeforces.com/contest/343/submission/4464141>GNU C++</a></td><td>14 September 2013 16:18:23</td></tr><tr><td>478</td><td><a href=https://codeforces.com/contest/343/problem/C>Read Time</a></td><td>C</td><td>1900</td><td>binary search, greedy, two pointers</td><td><a href=https://codeforces.com/contest/343/submission/4460935>GNU C++</a></td><td>14 September 2013 15:46:43</td></tr><tr><td>477</td><td><a href=https://codeforces.com/contest/343/problem/B>Alternating Current</a></td><td>B</td><td>1600</td><td>data structures, greedy, implementation</td><td><a href=https://codeforces.com/contest/343/submission/4459735>GNU C++</a></td><td>14 September 2013 15:38:30</td></tr><tr><td>476</td><td><a href=https://codeforces.com/contest/343/problem/A>Rational Resistance</a></td><td>A</td><td>1600</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/343/submission/4458959>GNU C++</a></td><td>14 September 2013 15:34:45</td></tr><tr><td>475</td><td><a href=https://codeforces.com/contest/338/problem/D>GCD Table</a></td><td>D</td><td>2900</td><td>chinese remainder theorem, math, number theory</td><td><a href=https://codeforces.com/contest/338/submission/4295147>GNU C++</a></td><td>16 August 2013 17:29:50</td></tr><tr><td>474</td><td><a href=https://codeforces.com/contest/338/problem/C>Divisor Tree</a></td><td>C</td><td>2200</td><td>brute force, dp, number theory</td><td><a href=https://codeforces.com/contest/338/submission/4293877>GNU C++</a></td><td>16 August 2013 17:11:14</td></tr><tr><td>473</td><td><a href=https://codeforces.com/contest/338/problem/A>Quiz</a></td><td>A</td><td>1600</td><td>greedy, math, number theory</td><td><a href=https://codeforces.com/contest/338/submission/4292482>GNU C++</a></td><td>16 August 2013 16:52:28</td></tr><tr><td>472</td><td><a href=https://codeforces.com/contest/338/problem/E>Optimize!</a></td><td>E</td><td>2600</td><td>data structures</td><td><a href=https://codeforces.com/contest/338/submission/4291715>GNU C++</a></td><td>16 August 2013 16:42:46</td></tr><tr><td>471</td><td><a href=https://codeforces.com/contest/338/problem/B>Book of Evil</a></td><td>B</td><td>2000</td><td>dfs and similar, dp, trees</td><td><a href=https://codeforces.com/contest/338/submission/4289897>GNU C++</a></td><td>16 August 2013 16:24:26</td></tr><tr><td>470</td><td><a href=https://codeforces.com/contest/335/problem/E>Counting Skyscrapers</a></td><td>E</td><td>2800</td><td>dp, math, probabilities</td><td><a href=https://codeforces.com/contest/335/submission/4224349>GNU C++</a></td><td>03 August 2013 19:50:41</td></tr><tr><td>469</td><td><a href=https://codeforces.com/contest/335/problem/D>Rectangles and Square</a></td><td>D</td><td>2400</td><td>brute force, dp</td><td><a href=https://codeforces.com/contest/335/submission/4223701>GNU C++</a></td><td>03 August 2013 19:09:15</td></tr><tr><td>468</td><td><a href=https://codeforces.com/contest/335/problem/B>Palindrome</a></td><td>B</td><td>1900</td><td>constructive algorithms, dp</td><td><a href=https://codeforces.com/contest/335/submission/4222343>GNU C++</a></td><td>03 August 2013 17:49:55</td></tr><tr><td>467</td><td><a href=https://codeforces.com/contest/335/problem/C>More Reclamation</a></td><td>C</td><td>2100</td><td>games</td><td><a href=https://codeforces.com/contest/335/submission/4222014>GNU C++</a></td><td>03 August 2013 17:35:26</td></tr><tr><td>466</td><td><a href=https://codeforces.com/contest/335/problem/A>Banana</a></td><td>A</td><td>1400</td><td>binary search, constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/335/submission/4221303>GNU C++</a></td><td>03 August 2013 17:05:23</td></tr><tr><td>465</td><td><a href=https://codeforces.com/contest/329/problem/C>Graph Reconstruction</a></td><td>C</td><td>2400</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/329/submission/4122060>GNU C++</a></td><td>20 July 2013 15:29:54</td></tr><tr><td>464</td><td><a href=https://codeforces.com/contest/329/problem/D>The Evil Temple and the Moving Rocks</a></td><td>D</td><td>2500</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/329/submission/4118708>GNU C++</a></td><td>20 July 2013 14:39:23</td></tr><tr><td>463</td><td><a href=https://codeforces.com/contest/329/problem/B>Biridian Forest</a></td><td>B</td><td>1500</td><td>dfs and similar, shortest paths</td><td><a href=https://codeforces.com/contest/329/submission/4114580>GNU C++</a></td><td>20 July 2013 13:50:44</td></tr><tr><td>462</td><td><a href=https://codeforces.com/contest/329/problem/A>Purification</a></td><td>A</td><td>1500</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/329/submission/4113197>GNU C++</a></td><td>20 July 2013 13:41:07</td></tr><tr><td>461</td><td><a href=https://codeforces.com/contest/331/problem/D1>Escaping on Beaveractor</a></td><td>D1</td><td>2400</td><td>dfs and similar, implementation</td><td><a href=https://codeforces.com/contest/331/submission/4091829>GNU C++</a></td><td>17 July 2013 17:00:30</td></tr><tr><td>460</td><td><a href=https://codeforces.com/contest/331/problem/B1>Shave Beaver!</a></td><td>B1</td><td>1700</td><td>implementation</td><td><a href=https://codeforces.com/contest/331/submission/4089349>GNU C++</a></td><td>17 July 2013 16:08:02</td></tr><tr><td>459</td><td><a href=https://codeforces.com/contest/331/problem/A1>Oh Sweet Beaverette</a></td><td>A1</td><td>1400</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/331/submission/4088920>GNU C++</a></td><td>17 July 2013 16:00:02</td></tr><tr><td>458</td><td><a href=https://codeforces.com/contest/331/problem/C1>The Great Julya Calendar</a></td><td>C1</td><td>1100</td><td>dp</td><td><a href=https://codeforces.com/contest/331/submission/4088426>GNU C++</a></td><td>17 July 2013 15:51:57</td></tr><tr><td>457</td><td><a href=https://codeforces.com/contest/317/problem/D>Game with Powers</a></td><td>D</td><td>2300</td><td>dp, games</td><td><a href=https://codeforces.com/contest/317/submission/3889207>GNU C++</a></td><td>14 June 2013 16:19:58</td></tr><tr><td>456</td><td><a href=https://codeforces.com/contest/317/problem/B>Ants</a></td><td>B</td><td>2000</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/317/submission/3888482>GNU C++</a></td><td>14 June 2013 16:12:42</td></tr><tr><td>455</td><td><a href=https://codeforces.com/contest/317/problem/A>Perfect Pair</a></td><td>A</td><td>1600</td><td>brute force</td><td><a href=https://codeforces.com/contest/317/submission/3886617>GNU C++</a></td><td>14 June 2013 15:52:59</td></tr><tr><td>454</td><td><a href=https://codeforces.com/contest/316/problem/F1>Suns and Rays</a></td><td>F1</td><td>2200</td><td>dfs and similar, implementation</td><td><a href=https://codeforces.com/contest/316/submission/3872438>GNU C++</a></td><td>12 June 2013 16:09:16</td></tr><tr><td>453</td><td><a href=https://codeforces.com/contest/316/problem/E1>Summer Homework</a></td><td>E1</td><td>1500</td><td>brute force, data structures</td><td><a href=https://codeforces.com/contest/316/submission/3863479>GNU C++</a></td><td>12 June 2013 13:41:09</td></tr><tr><td>452</td><td><a href=https://codeforces.com/contest/316/problem/G1>Good Substrings</a></td><td>G1</td><td>1700</td><td>hashing, strings</td><td><a href=https://codeforces.com/contest/316/submission/3867240>GNU C++</a></td><td>12 June 2013 14:40:43</td></tr><tr><td>451</td><td><a href=https://codeforces.com/contest/316/problem/C1>Tidying Up</a></td><td>C1</td><td>2200</td><td>flows</td><td><a href=https://codeforces.com/contest/316/submission/3864899>GNU C++</a></td><td>12 June 2013 14:02:16</td></tr><tr><td>450</td><td><a href=https://codeforces.com/contest/316/problem/D1>PE Lesson</a></td><td>D1</td><td>2300</td><td>brute force, dp</td><td><a href=https://codeforces.com/contest/316/submission/3863206>GNU C++</a></td><td>12 June 2013 13:37:24</td></tr><tr><td>449</td><td><a href=https://codeforces.com/contest/316/problem/B1>EKG</a></td><td>B1</td><td>1500</td><td>brute force, dfs and similar</td><td><a href=https://codeforces.com/contest/316/submission/3860823>GNU C++</a></td><td>12 June 2013 13:11:21</td></tr><tr><td>448</td><td><a href=https://codeforces.com/contest/316/problem/A1>Special Task</a></td><td>A1</td><td>1100</td><td>greedy</td><td><a href=https://codeforces.com/contest/316/submission/3860538>GNU C++</a></td><td>12 June 2013 13:06:20</td></tr><tr><td>447</td><td><a href=https://codeforces.com/contest/100153/problem/H>School of Magic</a></td><td>H</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821721>GNU C++</a></td><td>04 June 2013 13:30:00</td></tr><tr><td>446</td><td><a href=https://codeforces.com/contest/100153/problem/F>Infinite Recursion</a></td><td>F</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821691>Java 7</a></td><td>04 June 2013 13:19:24</td></tr><tr><td>445</td><td><a href=https://codeforces.com/contest/100153/problem/I>Shepherd's Problem</a></td><td>I</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821506>Java 7</a></td><td>04 June 2013 12:23:02</td></tr><tr><td>444</td><td><a href=https://codeforces.com/contest/100153/problem/D>Minimal Cut Matrix</a></td><td>D</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821390>GNU C++</a></td><td>04 June 2013 11:51:16</td></tr><tr><td>443</td><td><a href=https://codeforces.com/contest/100153/problem/J>Suffix Automaton</a></td><td>J</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821352>Java 7</a></td><td>04 June 2013 11:41:29</td></tr><tr><td>442</td><td><a href=https://codeforces.com/contest/100153/problem/E>Shortest Path</a></td><td>E</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821306>GNU C++</a></td><td>04 June 2013 11:26:32</td></tr><tr><td>441</td><td><a href=https://codeforces.com/contest/100153/problem/B>Discount</a></td><td>B</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821257>GNU C++</a></td><td>04 June 2013 11:05:38</td></tr><tr><td>440</td><td><a href=https://codeforces.com/contest/100153/problem/A>War Academy</a></td><td>A</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821237>GNU C++</a></td><td>04 June 2013 10:58:35</td></tr><tr><td>439</td><td><a href=https://codeforces.com/contest/100153/problem/C>Dowry</a></td><td>C</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821221>Java 7</a></td><td>04 June 2013 10:53:55</td></tr><tr><td>438</td><td><a href=https://codeforces.com/contest/100153/problem/G>Yet Another Rooks Problem</a></td><td>G</td><td>undefined</td><td></td><td><a href=https://codeforces.com/contest/100153/submission/3821176>GNU C++</a></td><td>04 June 2013 10:34:49</td></tr><tr><td>437</td><td><a href=https://codeforces.com/contest/308/problem/D>Tennis Rackets</a></td><td>D</td><td>2700</td><td></td><td><a href=https://codeforces.com/contest/308/submission/3729478>GNU C++</a></td><td>17 May 2013 11:10:50</td></tr><tr><td>436</td><td><a href=https://codeforces.com/contest/308/problem/B>Context Advertising</a></td><td>B</td><td>2100</td><td></td><td><a href=https://codeforces.com/contest/308/submission/3729411>GNU C++</a></td><td>17 May 2013 10:40:10</td></tr><tr><td>435</td><td><a href=https://codeforces.com/contest/308/problem/C>Memory for Arrays</a></td><td>C</td><td>1900</td><td></td><td><a href=https://codeforces.com/contest/308/submission/3729371>GNU C++</a></td><td>17 May 2013 10:29:09</td></tr><tr><td>434</td><td><a href=https://codeforces.com/contest/308/problem/A>Morning run</a></td><td>A</td><td>2000</td><td></td><td><a href=https://codeforces.com/contest/308/submission/3729326>GNU C++</a></td><td>17 May 2013 10:16:15</td></tr><tr><td>433</td><td><a href=https://codeforces.com/contest/303/problem/E>Random Ranking</a></td><td>E</td><td>3000</td><td>dp, math, probabilities</td><td><a href=https://codeforces.com/contest/303/submission/3713726>GNU C++</a></td><td>12 May 2013 17:55:12</td></tr><tr><td>432</td><td><a href=https://codeforces.com/contest/293/problem/E>Close Vertices</a></td><td>E</td><td>2700</td><td>data structures, divide and conquer, trees</td><td><a href=https://codeforces.com/contest/293/submission/3609723>GNU C++</a></td><td>23 April 2013 07:35:55</td></tr><tr><td>431</td><td><a href=https://codeforces.com/contest/293/problem/B>Distinct Paths</a></td><td>B</td><td>2700</td><td>brute force, combinatorics</td><td><a href=https://codeforces.com/contest/293/submission/3606650>GNU C++</a></td><td>22 April 2013 17:23:56</td></tr><tr><td>430</td><td><a href=https://codeforces.com/contest/293/problem/A>Weird Game</a></td><td>A</td><td>1500</td><td>games, greedy</td><td><a href=https://codeforces.com/contest/293/submission/3605548>GNU C++</a></td><td>22 April 2013 16:42:26</td></tr><tr><td>429</td><td><a href=https://codeforces.com/contest/293/problem/C>Cube Problem</a></td><td>C</td><td>2400</td><td>brute force, math, number theory</td><td><a href=https://codeforces.com/contest/293/submission/3605165>GNU C++</a></td><td>22 April 2013 16:32:37</td></tr><tr><td>428</td><td><a href=https://codeforces.com/contest/293/problem/D>Ksusha and Square</a></td><td>D</td><td>2700</td><td>geometry, math, probabilities, two pointers</td><td><a href=https://codeforces.com/contest/293/submission/3603787>GNU C++</a></td><td>22 April 2013 16:04:47</td></tr><tr><td>427</td><td><a href=https://codeforces.com/contest/297/problem/E>Mystic Carvings</a></td><td>E</td><td>3000</td><td>data structures</td><td><a href=https://codeforces.com/contest/297/submission/3573577>GNU C++</a></td><td>19 April 2013 17:02:21</td></tr><tr><td>426</td><td><a href=https://codeforces.com/contest/297/problem/C>Splitting the Uniqueness</a></td><td>C</td><td>2400</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/297/submission/3572198>GNU C++</a></td><td>19 April 2013 16:44:00</td></tr><tr><td>425</td><td><a href=https://codeforces.com/contest/297/problem/D>Color the Carpet</a></td><td>D</td><td>2500</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/297/submission/3571285>GNU C++</a></td><td>19 April 2013 16:32:52</td></tr><tr><td>424</td><td><a href=https://codeforces.com/contest/297/problem/B>Fish Weight</a></td><td>B</td><td>1600</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/297/submission/3565273>GNU C++</a></td><td>19 April 2013 15:41:03</td></tr><tr><td>423</td><td><a href=https://codeforces.com/contest/297/problem/A>Parity Game</a></td><td>A</td><td>1700</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/297/submission/3564985>GNU C++</a></td><td>19 April 2013 15:36:51</td></tr><tr><td>422</td><td><a href=https://codeforces.com/contest/292/problem/D>Connected Components</a></td><td>D</td><td>1900</td><td>data structures, dfs and similar, dp, dsu</td><td><a href=https://codeforces.com/contest/292/submission/3543332>GNU C++</a></td><td>15 April 2013 15:56:53</td></tr><tr><td>421</td><td><a href=https://codeforces.com/contest/292/problem/C>Beautiful IP Addresses</a></td><td>C</td><td>2000</td><td>brute force</td><td><a href=https://codeforces.com/contest/292/submission/3544312>GNU C++</a></td><td>15 April 2013 16:10:36</td></tr><tr><td>420</td><td><a href=https://codeforces.com/contest/292/problem/E>Copying Data</a></td><td>E</td><td>1900</td><td>data structures</td><td><a href=https://codeforces.com/contest/292/submission/3542709>GNU C++</a></td><td>15 April 2013 15:50:32</td></tr><tr><td>419</td><td><a href=https://codeforces.com/contest/292/problem/A>SMSC</a></td><td>A</td><td>1100</td><td>implementation</td><td><a href=https://codeforces.com/contest/292/submission/3541917>GNU C++</a></td><td>15 April 2013 15:42:55</td></tr><tr><td>418</td><td><a href=https://codeforces.com/contest/292/problem/B>Network Topology</a></td><td>B</td><td>1200</td><td>graphs, implementation</td><td><a href=https://codeforces.com/contest/292/submission/3541690>GNU C++</a></td><td>15 April 2013 15:39:36</td></tr><tr><td>417</td><td><a href=https://codeforces.com/contest/291/problem/E>Tree-String Problem</a></td><td>E</td><td>2000</td><td>*special, dfs and similar, hashing, strings</td><td><a href=https://codeforces.com/contest/291/submission/3534877>GNU C++</a></td><td>14 April 2013 12:55:10</td></tr><tr><td>416</td><td><a href=https://codeforces.com/contest/291/problem/D>Parallel Programming</a></td><td>D</td><td>1600</td><td>*special, greedy</td><td><a href=https://codeforces.com/contest/291/submission/3534834>GNU C++</a></td><td>14 April 2013 12:48:18</td></tr><tr><td>415</td><td><a href=https://codeforces.com/contest/291/problem/C>Network Mask</a></td><td>C</td><td>1600</td><td>*special, bitmasks, brute force, implementation</td><td><a href=https://codeforces.com/contest/291/submission/3534733>GNU C++</a></td><td>14 April 2013 12:35:53</td></tr><tr><td>414</td><td><a href=https://codeforces.com/contest/291/problem/B>Command Line Arguments</a></td><td>B</td><td>1300</td><td>*special, implementation, strings</td><td><a href=https://codeforces.com/contest/291/submission/3534671>GNU C++</a></td><td>14 April 2013 12:28:24</td></tr><tr><td>413</td><td><a href=https://codeforces.com/contest/291/problem/A>Spyke Talks</a></td><td>A</td><td>800</td><td>*special, implementation, sortings</td><td><a href=https://codeforces.com/contest/291/submission/3534584>GNU C++</a></td><td>14 April 2013 12:21:38</td></tr><tr><td>412</td><td><a href=https://codeforces.com/contest/280/problem/C>Game on Tree</a></td><td>C</td><td>2200</td><td>implementation, math, probabilities, trees</td><td><a href=https://codeforces.com/contest/280/submission/3277787>GNU C++</a></td><td>10 March 2013 16:03:27</td></tr><tr><td>411</td><td><a href=https://codeforces.com/contest/280/problem/B>Maximum Xor Secondary</a></td><td>B</td><td>1800</td><td>data structures, implementation, two pointers</td><td><a href=https://codeforces.com/contest/280/submission/3277306>GNU C++</a></td><td>10 March 2013 15:58:22</td></tr><tr><td>410</td><td><a href=https://codeforces.com/contest/280/problem/A>Rectangle Puzzle</a></td><td>A</td><td>2000</td><td>geometry</td><td><a href=https://codeforces.com/contest/280/submission/3275958>GNU C++</a></td><td>10 March 2013 15:40:42</td></tr><tr><td>409</td><td><a href=https://codeforces.com/contest/273/problem/E>Dima and Game</a></td><td>E</td><td>2600</td><td>dp, games</td><td><a href=https://codeforces.com/contest/273/submission/3120720>GNU C++</a></td><td>13 February 2013 16:55:40</td></tr><tr><td>408</td><td><a href=https://codeforces.com/contest/273/problem/D>Dima and Figure</a></td><td>D</td><td>2400</td><td>dp</td><td><a href=https://codeforces.com/contest/273/submission/3117520>GNU C++</a></td><td>13 February 2013 16:19:17</td></tr><tr><td>407</td><td><a href=https://codeforces.com/contest/273/problem/B>Dima and Two Sequences</a></td><td>B</td><td>1600</td><td>combinatorics</td><td><a href=https://codeforces.com/contest/273/submission/3113886>GNU C++</a></td><td>13 February 2013 15:46:30</td></tr><tr><td>406</td><td><a href=https://codeforces.com/contest/273/problem/A>Dima and Staircase</a></td><td>A</td><td>1500</td><td></td><td><a href=https://codeforces.com/contest/273/submission/3112373>GNU C++</a></td><td>13 February 2013 15:36:12</td></tr><tr><td>405</td><td><a href=https://codeforces.com/contest/269/problem/D>Maximum Waterfall</a></td><td>D</td><td>2600</td><td>data structures, dp, graphs, sortings</td><td><a href=https://codeforces.com/contest/269/submission/3055065>GNU C++</a></td><td>01 February 2013 16:55:57</td></tr><tr><td>404</td><td><a href=https://codeforces.com/contest/269/problem/B>Greenhouse Effect</a></td><td>B</td><td>1700</td><td>dp</td><td><a href=https://codeforces.com/contest/269/submission/3051384>GNU C++</a></td><td>01 February 2013 16:13:58</td></tr><tr><td>403</td><td><a href=https://codeforces.com/contest/269/problem/A>Magical Boxes</a></td><td>A</td><td>1600</td><td>greedy, math</td><td><a href=https://codeforces.com/contest/269/submission/3050569>GNU C++</a></td><td>01 February 2013 16:06:56</td></tr><tr><td>402</td><td><a href=https://codeforces.com/contest/269/problem/C>Flawed Flow</a></td><td>C</td><td>2100</td><td>constructive algorithms, flows, graphs, greedy</td><td><a href=https://codeforces.com/contest/269/submission/3048752>GNU C++</a></td><td>01 February 2013 15:53:48</td></tr><tr><td>401</td><td><a href=https://codeforces.com/contest/260/problem/D>Black and White Tree</a></td><td>D</td><td>2100</td><td>constructive algorithms, dsu, graphs, greedy, trees</td><td><a href=https://codeforces.com/contest/260/submission/2844129>GNU C++</a></td><td>27 December 2012 17:51:45</td></tr><tr><td>400</td><td><a href=https://codeforces.com/contest/260/problem/E>Dividing Kingdom</a></td><td>E</td><td>2500</td><td>binary search, brute force, data structures</td><td><a href=https://codeforces.com/contest/260/submission/2840239>GNU C++</a></td><td>27 December 2012 16:34:56</td></tr><tr><td>399</td><td><a href=https://codeforces.com/contest/260/problem/C>Balls and Boxes</a></td><td>C</td><td>1700</td><td>constructive algorithms, greedy, implementation</td><td><a href=https://codeforces.com/contest/260/submission/2837093>GNU C++</a></td><td>27 December 2012 15:52:05</td></tr><tr><td>398</td><td><a href=https://codeforces.com/contest/260/problem/B>Ancient Prophesy</a></td><td>B</td><td>1600</td><td>brute force, implementation, strings</td><td><a href=https://codeforces.com/contest/260/submission/2836467>GNU C++</a></td><td>27 December 2012 15:44:19</td></tr><tr><td>397</td><td><a href=https://codeforces.com/contest/260/problem/A>Adding Digits</a></td><td>A</td><td>1400</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/260/submission/2836160>GNU C++</a></td><td>27 December 2012 15:39:57</td></tr><tr><td>396</td><td><a href=https://codeforces.com/contest/251/problem/C>Number Transformation</a></td><td>C</td><td>2000</td><td>dp, greedy, number theory</td><td><a href=https://codeforces.com/contest/251/submission/2708116>GNU C++</a></td><td>06 December 2012 17:00:32</td></tr><tr><td>395</td><td><a href=https://codeforces.com/contest/251/problem/D>Two Sets</a></td><td>D</td><td>2700</td><td>bitmasks, math</td><td><a href=https://codeforces.com/contest/251/submission/2706516>GNU C++</a></td><td>06 December 2012 16:37:33</td></tr><tr><td>394</td><td><a href=https://codeforces.com/contest/251/problem/B>Playing with Permutations</a></td><td>B</td><td>1800</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/251/submission/2702885>GNU C++</a></td><td>06 December 2012 15:52:36</td></tr><tr><td>393</td><td><a href=https://codeforces.com/contest/251/problem/A>Points on Line</a></td><td>A</td><td>1300</td><td>binary search, combinatorics, two pointers</td><td><a href=https://codeforces.com/contest/251/submission/2700911>GNU C++</a></td><td>06 December 2012 15:32:16</td></tr><tr><td>392</td><td><a href=https://codeforces.com/contest/243/problem/B>Hydra</a></td><td>B</td><td>2000</td><td>graphs, sortings</td><td><a href=https://codeforces.com/contest/243/submission/2574723>GNU C++</a></td><td>16 November 2012 18:33:39</td></tr><tr><td>391</td><td><a href=https://codeforces.com/contest/243/problem/C>Colorado Potato Beetle</a></td><td>C</td><td>2200</td><td>dfs and similar, implementation</td><td><a href=https://codeforces.com/contest/243/submission/2569802>GNU C++</a></td><td>16 November 2012 16:04:11</td></tr><tr><td>390</td><td><a href=https://codeforces.com/contest/243/problem/A>The Brand New Function</a></td><td>A</td><td>1600</td><td>bitmasks</td><td><a href=https://codeforces.com/contest/243/submission/2567807>GNU C++</a></td><td>16 November 2012 15:35:30</td></tr><tr><td>389</td><td><a href=https://codeforces.com/contest/238/problem/E>Meeting Her</a></td><td>E</td><td>2600</td><td>dp, graphs, shortest paths</td><td><a href=https://codeforces.com/contest/238/submission/2504243>GNU C++</a></td><td>04 November 2012 17:49:56</td></tr><tr><td>388</td><td><a href=https://codeforces.com/contest/238/problem/B>Boring Partition</a></td><td>B</td><td>1800</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/238/submission/2501797>GNU C++</a></td><td>04 November 2012 16:52:35</td></tr><tr><td>387</td><td><a href=https://codeforces.com/contest/238/problem/C>World Eater Brothers</a></td><td>C</td><td>2100</td><td>dfs and similar, dp, greedy, trees</td><td><a href=https://codeforces.com/contest/238/submission/2500671>GNU C++</a></td><td>04 November 2012 16:29:43</td></tr><tr><td>386</td><td><a href=https://codeforces.com/contest/238/problem/A>Not Wool Sequences</a></td><td>A</td><td>1300</td><td>constructive algorithms, math</td><td><a href=https://codeforces.com/contest/238/submission/2498053>Delphi</a></td><td>04 November 2012 16:03:26</td></tr><tr><td>385</td><td><a href=https://codeforces.com/contest/13/problem/A>Numbers</a></td><td>A</td><td>1000</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/13/submission/55780>Delphi</a></td><td>06 May 2010 14:01:48</td></tr><tr><td>384</td><td><a href=https://codeforces.com/contest/241/problem/B>Friends</a></td><td>B</td><td>2700</td><td>binary search, bitmasks, data structures, math</td><td><a href=https://codeforces.com/contest/241/submission/2485774>GNU C++</a></td><td>01 November 2012 17:55:07</td></tr><tr><td>383</td><td><a href=https://codeforces.com/contest/241/problem/F>Race</a></td><td>F</td><td>2300</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/241/submission/2484024>GNU C++</a></td><td>01 November 2012 17:13:14</td></tr><tr><td>382</td><td><a href=https://codeforces.com/contest/241/problem/E>Flights</a></td><td>E</td><td>2600</td><td>graphs, shortest paths</td><td><a href=https://codeforces.com/contest/241/submission/2482138>GNU C++</a></td><td>01 November 2012 16:29:48</td></tr><tr><td>381</td><td><a href=https://codeforces.com/contest/241/problem/G>Challenging Balloons</a></td><td>G</td><td>1900</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/241/submission/2481472>GNU C++</a></td><td>01 November 2012 16:13:16</td></tr><tr><td>380</td><td><a href=https://codeforces.com/contest/241/problem/C>Mirror Box</a></td><td>C</td><td>2000</td><td>geometry, implementation</td><td><a href=https://codeforces.com/contest/241/submission/2480741>GNU C++</a></td><td>01 November 2012 15:56:11</td></tr><tr><td>379</td><td><a href=https://codeforces.com/contest/241/problem/A>Old Peykan</a></td><td>A</td><td>1300</td><td>greedy</td><td><a href=https://codeforces.com/contest/241/submission/2480014>GNU C++</a></td><td>01 November 2012 15:38:37</td></tr><tr><td>378</td><td><a href=https://codeforces.com/contest/235/problem/B>Let's Play Osu!</a></td><td>B</td><td>2000</td><td>dp, math, probabilities</td><td><a href=https://codeforces.com/contest/235/submission/2396839>Delphi</a></td><td>21 October 2012 07:22:34</td></tr><tr><td>377</td><td><a href=https://codeforces.com/contest/235/problem/A>LCM Challenge</a></td><td>A</td><td>1600</td><td>number theory</td><td><a href=https://codeforces.com/contest/235/submission/2395919>GNU C++</a></td><td>21 October 2012 07:15:42</td></tr><tr><td>376</td><td><a href=https://codeforces.com/contest/240/problem/E>Road Repairs</a></td><td>E</td><td>2800</td><td>dfs and similar, graphs, greedy</td><td><a href=https://codeforces.com/contest/240/submission/2372786>GNU C++</a></td><td>16 October 2012 10:32:39</td></tr><tr><td>375</td><td><a href=https://codeforces.com/contest/240/problem/F>TorCoder</a></td><td>F</td><td>2600</td><td>data structures</td><td><a href=https://codeforces.com/contest/240/submission/2369245>GNU C++</a></td><td>16 October 2012 08:46:49</td></tr><tr><td>374</td><td><a href=https://codeforces.com/contest/240/problem/A>Cinema</a></td><td>A</td><td>1600</td><td>implementation</td><td><a href=https://codeforces.com/contest/240/submission/2364871>GNU C++</a></td><td>16 October 2012 07:34:42</td></tr><tr><td>373</td><td><a href=https://codeforces.com/contest/240/problem/D>Merging Two Decks</a></td><td>D</td><td>2000</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/240/submission/2363963>GNU C++</a></td><td>16 October 2012 07:23:57</td></tr><tr><td>372</td><td><a href=https://codeforces.com/contest/232/problem/D>Fence</a></td><td>D</td><td>2900</td><td>binary search, data structures, string suffix structures</td><td><a href=https://codeforces.com/contest/232/submission/2346447>GNU C++</a></td><td>11 October 2012 17:09:44</td></tr><tr><td>371</td><td><a href=https://codeforces.com/contest/240/problem/C>Practice</a></td><td>C</td><td>1600</td><td>constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/240/submission/2362766>GNU C++</a></td><td>16 October 2012 07:03:37</td></tr><tr><td>370</td><td><a href=https://codeforces.com/contest/232/problem/A>Cycles</a></td><td>A</td><td>1600</td><td>binary search, constructive algorithms, graphs, greedy</td><td><a href=https://codeforces.com/contest/232/submission/2343160>GNU C++</a></td><td>11 October 2012 16:13:08</td></tr><tr><td>369</td><td><a href=https://codeforces.com/contest/64/problem/C>Table</a></td><td>C</td><td>1600</td><td>*special, greedy, implementation, math</td><td><a href=https://codeforces.com/contest/64/submission/293796>Tcl</a></td><td>21 February 2011 16:13:17</td></tr><tr><td>368</td><td><a href=https://codeforces.com/contest/225/problem/D>Snake</a></td><td>D</td><td>2200</td><td>bitmasks, dfs and similar, graphs, implementation</td><td><a href=https://codeforces.com/contest/225/submission/2216431>GNU C++</a></td><td>19 September 2012 16:42:15</td></tr><tr><td>367</td><td><a href=https://codeforces.com/contest/225/problem/B>Well-known Numbers</a></td><td>B</td><td>1600</td><td>binary search, greedy, number theory</td><td><a href=https://codeforces.com/contest/225/submission/2215147>GNU C++</a></td><td>19 September 2012 16:21:11</td></tr><tr><td>366</td><td><a href=https://codeforces.com/contest/225/problem/E>Unsolvable</a></td><td>E</td><td>2100</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/225/submission/2214686>GNU C++</a></td><td>19 September 2012 16:13:29</td></tr><tr><td>365</td><td><a href=https://codeforces.com/contest/225/problem/C>Barcode</a></td><td>C</td><td>1700</td><td>dp, matrices</td><td><a href=https://codeforces.com/contest/225/submission/2213023>GNU C++</a></td><td>19 September 2012 15:51:00</td></tr><tr><td>364</td><td><a href=https://codeforces.com/contest/223/problem/A>Bracket Sequence</a></td><td>A</td><td>1700</td><td>data structures, expression parsing, implementation</td><td><a href=https://codeforces.com/contest/223/submission/2191691>Delphi</a></td><td>16 September 2012 15:58:48</td></tr><tr><td>363</td><td><a href=https://codeforces.com/contest/223/problem/B>Two Strings</a></td><td>B</td><td>1900</td><td>data structures, dp, strings</td><td><a href=https://codeforces.com/contest/223/submission/2191009>Delphi</a></td><td>16 September 2012 15:51:48</td></tr><tr><td>362</td><td><a href=https://codeforces.com/contest/223/problem/C>Partial Sums</a></td><td>C</td><td>1900</td><td>combinatorics, math, number theory</td><td><a href=https://codeforces.com/contest/223/submission/2189888>FPC</a></td><td>16 September 2012 15:41:19</td></tr><tr><td>361</td><td><a href=https://codeforces.com/contest/217/problem/C>Formurosa</a></td><td>C</td><td>2600</td><td>divide and conquer, dp, expression parsing</td><td><a href=https://codeforces.com/contest/217/submission/2028513>Delphi</a></td><td>18 August 2012 08:26:22</td></tr><tr><td>360</td><td><a href=https://codeforces.com/contest/217/problem/B>Blackboard Fibonacci</a></td><td>B</td><td>2100</td><td>brute force, math</td><td><a href=https://codeforces.com/contest/217/submission/2025056>Delphi</a></td><td>18 August 2012 07:25:17</td></tr><tr><td>359</td><td><a href=https://codeforces.com/contest/217/problem/A>Ice Skating</a></td><td>A</td><td>1200</td><td>brute force, dfs and similar, dsu, graphs</td><td><a href=https://codeforces.com/contest/217/submission/2023494>Delphi</a></td><td>18 August 2012 07:07:37</td></tr><tr><td>358</td><td><a href=https://codeforces.com/contest/216/problem/A>Tiling with Hexagons</a></td><td>A</td><td>1200</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/216/submission/2019841>Delphi</a></td><td>16 August 2012 15:21:03</td></tr><tr><td>357</td><td><a href=https://codeforces.com/contest/213/problem/D>Stars</a></td><td>D</td><td>2300</td><td>constructive algorithms, geometry</td><td><a href=https://codeforces.com/contest/213/submission/1957392>Delphi</a></td><td>30 July 2012 16:31:02</td></tr><tr><td>356</td><td><a href=https://codeforces.com/contest/213/problem/C>Relay Race</a></td><td>C</td><td>2000</td><td>dp</td><td><a href=https://codeforces.com/contest/213/submission/1955832>Delphi</a></td><td>30 July 2012 16:05:57</td></tr><tr><td>355</td><td><a href=https://codeforces.com/contest/212/problem/A>Privatization</a></td><td>A</td><td>3000</td><td>flows, graphs</td><td><a href=https://codeforces.com/contest/212/submission/1913805>Delphi</a></td><td>20 July 2012 10:46:23</td></tr><tr><td>354</td><td><a href=https://codeforces.com/contest/211/problem/D>Cutting a Fence</a></td><td>D</td><td>2500</td><td></td><td><a href=https://codeforces.com/contest/211/submission/1900241>Delphi</a></td><td>15 July 2012 08:56:02</td></tr><tr><td>353</td><td><a href=https://codeforces.com/contest/211/problem/C>Cowboys</a></td><td>C</td><td>2100</td><td>combinatorics</td><td><a href=https://codeforces.com/contest/211/submission/1900138>Delphi</a></td><td>15 July 2012 08:10:05</td></tr><tr><td>352</td><td><a href=https://codeforces.com/contest/211/problem/B>Polycarpus is Looking for Good Substrings</a></td><td>B</td><td>2300</td><td></td><td><a href=https://codeforces.com/contest/211/submission/1900094>Delphi</a></td><td>15 July 2012 07:46:21</td></tr><tr><td>351</td><td><a href=https://codeforces.com/contest/211/problem/E>IT Restaurants</a></td><td>E</td><td>1500</td><td></td><td><a href=https://codeforces.com/contest/211/submission/1900046>Delphi</a></td><td>15 July 2012 07:15:37</td></tr><tr><td>350</td><td><a href=https://codeforces.com/contest/209/problem/B>Pixels</a></td><td>B</td><td>2100</td><td>constructive algorithms, math</td><td><a href=https://codeforces.com/contest/209/submission/1899085>Delphi</a></td><td>14 July 2012 08:52:45</td></tr><tr><td>349</td><td><a href=https://codeforces.com/contest/209/problem/C>Trails and Glades</a></td><td>C</td><td>2400</td><td>constructive algorithms, dsu, graphs, greedy</td><td><a href=https://codeforces.com/contest/209/submission/1898916>Delphi</a></td><td>14 July 2012 08:11:15</td></tr><tr><td>348</td><td><a href=https://codeforces.com/contest/209/problem/A>Multicolored Marbles</a></td><td>A</td><td>1600</td><td>dp, math</td><td><a href=https://codeforces.com/contest/209/submission/1898847>Delphi</a></td><td>14 July 2012 07:57:05</td></tr><tr><td>347</td><td><a href=https://codeforces.com/contest/204/problem/E>Little Elephant and Strings</a></td><td>E</td><td>2800</td><td>data structures, implementation, string suffix structures, two pointers</td><td><a href=https://codeforces.com/contest/204/submission/1890672>Delphi</a></td><td>11 July 2012 17:16:22</td></tr><tr><td>346</td><td><a href=https://codeforces.com/contest/204/problem/D>Little Elephant and Retro Strings</a></td><td>D</td><td>2400</td><td>dp</td><td><a href=https://codeforces.com/contest/204/submission/1888443>Delphi</a></td><td>11 July 2012 16:30:38</td></tr><tr><td>345</td><td><a href=https://codeforces.com/contest/204/problem/C>Little Elephant and Furik and Rubik</a></td><td>C</td><td>2000</td><td>math, probabilities</td><td><a href=https://codeforces.com/contest/204/submission/1887685>Delphi</a></td><td>11 July 2012 16:18:34</td></tr><tr><td>344</td><td><a href=https://codeforces.com/contest/204/problem/B>Little Elephant and Cards</a></td><td>B</td><td>1500</td><td>binary search, data structures</td><td><a href=https://codeforces.com/contest/204/submission/1884626>Delphi</a></td><td>11 July 2012 15:42:06</td></tr><tr><td>343</td><td><a href=https://codeforces.com/contest/204/problem/A>Little Elephant and Interval</a></td><td>A</td><td>1500</td><td>binary search, combinatorics, dp</td><td><a href=https://codeforces.com/contest/204/submission/1883566>Delphi</a></td><td>11 July 2012 15:34:09</td></tr><tr><td>342</td><td><a href=https://codeforces.com/contest/198/problem/C>Delivering Carcinogen</a></td><td>C</td><td>2400</td><td>binary search, geometry</td><td><a href=https://codeforces.com/contest/198/submission/1820338>Delphi</a></td><td>22 June 2012 17:23:31</td></tr><tr><td>341</td><td><a href=https://codeforces.com/contest/198/problem/E>Gripping Story</a></td><td>E</td><td>2400</td><td>binary search, data structures, sortings</td><td><a href=https://codeforces.com/contest/198/submission/1818691>Delphi</a></td><td>22 June 2012 16:50:33</td></tr><tr><td>340</td><td><a href=https://codeforces.com/contest/198/problem/B>Jumping on Walls</a></td><td>B</td><td>1400</td><td>shortest paths</td><td><a href=https://codeforces.com/contest/198/submission/1815002>Delphi</a></td><td>22 June 2012 15:46:39</td></tr><tr><td>339</td><td><a href=https://codeforces.com/contest/198/problem/A>About Bacteria</a></td><td>A</td><td>1700</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/198/submission/1814240>Delphi</a></td><td>22 June 2012 15:37:51</td></tr><tr><td>338</td><td><a href=https://codeforces.com/contest/196/problem/D>The Next Good String</a></td><td>D</td><td>2800</td><td>data structures, greedy, hashing, strings</td><td><a href=https://codeforces.com/contest/196/submission/1794229>Delphi</a></td><td>12 June 2012 14:33:24</td></tr><tr><td>337</td><td><a href=https://codeforces.com/contest/196/problem/E>Opening Portals</a></td><td>E</td><td>2600</td><td>dsu, graphs, shortest paths</td><td><a href=https://codeforces.com/contest/196/submission/1792424>Delphi</a></td><td>12 June 2012 14:03:27</td></tr><tr><td>336</td><td><a href=https://codeforces.com/contest/196/problem/C>Paint Tree</a></td><td>C</td><td>2200</td><td>constructive algorithms, divide and conquer, geometry, sortings, trees</td><td><a href=https://codeforces.com/contest/196/submission/1790334>Delphi</a></td><td>12 June 2012 13:34:48</td></tr><tr><td>335</td><td><a href=https://codeforces.com/contest/196/problem/B>Infinite Maze</a></td><td>B</td><td>2000</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/196/submission/1788499>Delphi</a></td><td>12 June 2012 13:12:21</td></tr><tr><td>334</td><td><a href=https://codeforces.com/contest/196/problem/A>Lexicographically Maximum Subsequence</a></td><td>A</td><td>1100</td><td>greedy, strings</td><td><a href=https://codeforces.com/contest/196/submission/1787619>Delphi</a></td><td>12 June 2012 13:02:32</td></tr><tr><td>333</td><td><a href=https://codeforces.com/contest/193/problem/E>Fibonacci Number</a></td><td>E</td><td>2900</td><td>brute force, math, matrices</td><td><a href=https://codeforces.com/contest/193/submission/1760964>GNU C++</a></td><td>03 June 2012 17:44:05</td></tr><tr><td>332</td><td><a href=https://codeforces.com/contest/193/problem/C>Hamming Distance</a></td><td>C</td><td>2400</td><td>constructive algorithms, greedy, math, matrices</td><td><a href=https://codeforces.com/contest/193/submission/1759791>Delphi</a></td><td>03 June 2012 17:11:09</td></tr><tr><td>331</td><td><a href=https://codeforces.com/contest/193/problem/B>Xor</a></td><td>B</td><td>2000</td><td>brute force</td><td><a href=https://codeforces.com/contest/193/submission/1754726>Delphi</a></td><td>03 June 2012 15:43:28</td></tr><tr><td>330</td><td><a href=https://codeforces.com/contest/193/problem/A>Cutting Figure</a></td><td>A</td><td>1700</td><td>constructive algorithms, graphs, trees</td><td><a href=https://codeforces.com/contest/193/submission/1754079>Delphi</a></td><td>03 June 2012 15:36:37</td></tr><tr><td>329</td><td><a href=https://codeforces.com/contest/185/problem/D>Visit of the Great</a></td><td>D</td><td>2600</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/185/submission/1657656>FPC</a></td><td>04 May 2012 16:35:09</td></tr><tr><td>328</td><td><a href=https://codeforces.com/contest/185/problem/B>Mushroom Scientists</a></td><td>B</td><td>1800</td><td>math, ternary search</td><td><a href=https://codeforces.com/contest/185/submission/1654143>Delphi</a></td><td>04 May 2012 15:46:23</td></tr><tr><td>327</td><td><a href=https://codeforces.com/contest/185/problem/A>Plant</a></td><td>A</td><td>1300</td><td>math</td><td><a href=https://codeforces.com/contest/185/submission/1652777>Delphi</a></td><td>04 May 2012 15:33:36</td></tr><tr><td>326</td><td><a href=https://codeforces.com/contest/180/problem/A>Defragmentation</a></td><td>A</td><td>1800</td><td>implementation</td><td><a href=https://codeforces.com/contest/180/submission/1609591>Delphi</a></td><td>22 April 2012 07:42:52</td></tr><tr><td>325</td><td><a href=https://codeforces.com/contest/180/problem/D>Name</a></td><td>D</td><td>1900</td><td>greedy, strings</td><td><a href=https://codeforces.com/contest/180/submission/1609317>Delphi</a></td><td>22 April 2012 07:36:16</td></tr><tr><td>324</td><td><a href=https://codeforces.com/contest/180/problem/B>Divisibility Rules</a></td><td>B</td><td>2300</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/180/submission/1608634>Delphi</a></td><td>22 April 2012 07:20:16</td></tr><tr><td>323</td><td><a href=https://codeforces.com/contest/180/problem/F>Mathematical Analysis Rocks!</a></td><td>F</td><td>1200</td><td>constructive algorithms, implementation, math</td><td><a href=https://codeforces.com/contest/180/submission/1608295>Delphi</a></td><td>22 April 2012 07:10:00</td></tr><tr><td>322</td><td><a href=https://codeforces.com/contest/180/problem/E>Cubes</a></td><td>E</td><td>1800</td><td>binary search, dp, two pointers</td><td><a href=https://codeforces.com/contest/180/submission/1608265>Delphi</a></td><td>22 April 2012 07:08:03</td></tr><tr><td>321</td><td><a href=https://codeforces.com/contest/180/problem/C>Letter</a></td><td>C</td><td>1400</td><td>dp</td><td><a href=https://codeforces.com/contest/180/submission/1608236>Delphi</a></td><td>22 April 2012 07:03:43</td></tr><tr><td>320</td><td><a href=https://codeforces.com/contest/175/problem/E>Power Defence</a></td><td>E</td><td>2600</td><td>brute force, dp, geometry, greedy</td><td><a href=https://codeforces.com/contest/175/submission/1536306>Delphi</a></td><td>14 April 2012 10:06:42</td></tr><tr><td>319</td><td><a href=https://codeforces.com/contest/175/problem/D>Plane of Tanks: Duel</a></td><td>D</td><td>2400</td><td>brute force, dp, math, probabilities</td><td><a href=https://codeforces.com/contest/175/submission/1535308>Delphi</a></td><td>14 April 2012 09:23:58</td></tr><tr><td>318</td><td><a href=https://codeforces.com/contest/175/problem/C>Geometry Horse</a></td><td>C</td><td>1600</td><td>greedy, implementation, sortings, two pointers</td><td><a href=https://codeforces.com/contest/175/submission/1532709>Delphi</a></td><td>14 April 2012 08:21:45</td></tr><tr><td>317</td><td><a href=https://codeforces.com/contest/175/problem/B>Plane of Tanks: Pro</a></td><td>B</td><td>1400</td><td>implementation</td><td><a href=https://codeforces.com/contest/175/submission/1532316>Delphi</a></td><td>14 April 2012 08:13:42</td></tr><tr><td>316</td><td><a href=https://codeforces.com/contest/175/problem/A>Robot Bicorn Attack</a></td><td>A</td><td>1400</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/175/submission/1531987>Delphi</a></td><td>14 April 2012 08:04:37</td></tr><tr><td>315</td><td><a href=https://codeforces.com/contest/164/problem/D>Minimum Diameter</a></td><td>D</td><td>3100</td><td>binary search, brute force</td><td><a href=https://codeforces.com/contest/164/submission/1503272>Delphi</a></td><td>08 April 2012 17:00:02</td></tr><tr><td>314</td><td><a href=https://codeforces.com/contest/164/problem/B>Ancient Berland Hieroglyphs</a></td><td>B</td><td>2000</td><td>two pointers</td><td><a href=https://codeforces.com/contest/164/submission/1499994>Delphi</a></td><td>08 April 2012 15:38:50</td></tr><tr><td>313</td><td><a href=https://codeforces.com/contest/164/problem/A>Variable, or There and Back Again</a></td><td>A</td><td>1700</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/164/submission/1498440>Delphi</a></td><td>08 April 2012 15:12:45</td></tr><tr><td>312</td><td><a href=https://codeforces.com/contest/173/problem/E>Camping Groups</a></td><td>E</td><td>2600</td><td>data structures, sortings</td><td><a href=https://codeforces.com/contest/173/submission/1483750>Delphi</a></td><td>06 April 2012 16:36:46</td></tr><tr><td>311</td><td><a href=https://codeforces.com/contest/173/problem/D>Deputies</a></td><td>D</td><td>2500</td><td>constructive algorithms, graphs, greedy, implementation</td><td><a href=https://codeforces.com/contest/173/submission/1482764>Delphi</a></td><td>06 April 2012 16:03:29</td></tr><tr><td>310</td><td><a href=https://codeforces.com/contest/173/problem/B>Chamber of Secrets</a></td><td>B</td><td>1800</td><td>dfs and similar, shortest paths</td><td><a href=https://codeforces.com/contest/173/submission/1481564>Delphi</a></td><td>06 April 2012 15:32:31</td></tr><tr><td>309</td><td><a href=https://codeforces.com/contest/173/problem/C>Spiral Maximum</a></td><td>C</td><td>1900</td><td>brute force, dp</td><td><a href=https://codeforces.com/contest/173/submission/1481290>Delphi</a></td><td>06 April 2012 15:26:17</td></tr><tr><td>308</td><td><a href=https://codeforces.com/contest/173/problem/A>Rock-Paper-Scissors</a></td><td>A</td><td>1300</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/173/submission/1480149>Delphi</a></td><td>06 April 2012 15:04:54</td></tr><tr><td>307</td><td><a href=https://codeforces.com/contest/171/problem/G>Mysterious numbers - 2</a></td><td>G</td><td>1600</td><td>*special</td><td><a href=https://codeforces.com/contest/171/submission/1462911>Delphi</a></td><td>01 April 2012 20:38:42</td></tr><tr><td>306</td><td><a href=https://codeforces.com/contest/171/problem/C>A Piece of Cake</a></td><td>C</td><td>2000</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/171/submission/1462810>Delphi</a></td><td>01 April 2012 20:03:26</td></tr><tr><td>305</td><td><a href=https://codeforces.com/contest/171/problem/F>ucyhf</a></td><td>F</td><td>1600</td><td>*special, brute force, implementation, number theory</td><td><a href=https://codeforces.com/contest/171/submission/1462775>Delphi</a></td><td>01 April 2012 19:51:28</td></tr><tr><td>304</td><td><a href=https://codeforces.com/contest/171/problem/D>Broken checker</a></td><td>D</td><td>1300</td><td>*special, brute force</td><td><a href=https://codeforces.com/contest/171/submission/1462738>Delphi</a></td><td>01 April 2012 19:41:58</td></tr><tr><td>303</td><td><a href=https://codeforces.com/contest/171/problem/A>Mysterious numbers - 1</a></td><td>A</td><td>1200</td><td>*special, constructive algorithms</td><td><a href=https://codeforces.com/contest/171/submission/1462699>Delphi</a></td><td>01 April 2012 19:34:16</td></tr><tr><td>302</td><td><a href=https://codeforces.com/contest/171/problem/B>Star</a></td><td>B</td><td>1300</td><td>*special, combinatorics</td><td><a href=https://codeforces.com/contest/171/submission/1462694>Delphi</a></td><td>01 April 2012 19:33:04</td></tr><tr><td>301</td><td><a href=https://codeforces.com/contest/171/problem/E>MYSTERIOUS LANGUAGE</a></td><td>E</td><td>2000</td><td>*special</td><td><a href=https://codeforces.com/contest/171/submission/1462690>Secret_171</a></td><td>01 April 2012 19:31:49</td></tr><tr><td>300</td><td><a href=https://codeforces.com/contest/167/problem/E>Wizards and Bets</a></td><td>E</td><td>2900</td><td>dfs and similar, graphs, math, matrices</td><td><a href=https://codeforces.com/contest/167/submission/1431660>GNU C++</a></td><td>27 March 2012 16:55:51</td></tr><tr><td>299</td><td><a href=https://codeforces.com/contest/167/problem/A>Wizards and Trolleybuses</a></td><td>A</td><td>1600</td><td>implementation</td><td><a href=https://codeforces.com/contest/167/submission/1426303>Delphi</a></td><td>27 March 2012 15:30:37</td></tr><tr><td>298</td><td><a href=https://codeforces.com/contest/167/problem/B>Wizards and Huge Prize</a></td><td>B</td><td>1800</td><td>dp, math, probabilities</td><td><a href=https://codeforces.com/contest/167/submission/1425716>Delphi</a></td><td>27 March 2012 15:23:48</td></tr><tr><td>297</td><td><a href=https://codeforces.com/contest/167/problem/C>Wizards and Numbers</a></td><td>C</td><td>2300</td><td>games, math</td><td><a href=https://codeforces.com/contest/167/submission/1425129>Delphi</a></td><td>27 March 2012 15:17:48</td></tr><tr><td>296</td><td><a href=https://codeforces.com/contest/163/problem/E>e-Government</a></td><td>E</td><td>2800</td><td>data structures, dfs and similar, dp, strings, trees</td><td><a href=https://codeforces.com/contest/163/submission/1412489>Delphi</a></td><td>25 March 2012 16:02:22</td></tr><tr><td>295</td><td><a href=https://codeforces.com/contest/163/problem/B>Lemmings</a></td><td>B</td><td>2000</td><td>binary search</td><td><a href=https://codeforces.com/contest/163/submission/1411057>Delphi</a></td><td>25 March 2012 15:35:52</td></tr><tr><td>294</td><td><a href=https://codeforces.com/contest/163/problem/C>Conveyor</a></td><td>C</td><td>2100</td><td>sortings, two pointers</td><td><a href=https://codeforces.com/contest/163/submission/1410319>Delphi</a></td><td>25 March 2012 15:25:29</td></tr><tr><td>293</td><td><a href=https://codeforces.com/contest/163/problem/A>Substring and Subsequence</a></td><td>A</td><td>1700</td><td>dp</td><td><a href=https://codeforces.com/contest/163/submission/1409313>Delphi</a></td><td>25 March 2012 15:12:30</td></tr><tr><td>292</td><td><a href=https://codeforces.com/contest/165/problem/D>Beard Graph</a></td><td>D</td><td>2100</td><td>data structures, dsu, trees</td><td><a href=https://codeforces.com/contest/165/submission/1363823>Delphi</a></td><td>16 March 2012 15:56:11</td></tr><tr><td>291</td><td><a href=https://codeforces.com/contest/165/problem/E>Compatible Numbers</a></td><td>E</td><td>2200</td><td>bitmasks, brute force, dfs and similar, dp</td><td><a href=https://codeforces.com/contest/165/submission/1362253>Delphi</a></td><td>16 March 2012 15:39:40</td></tr><tr><td>290</td><td><a href=https://codeforces.com/contest/165/problem/C>Another Problem on Strings</a></td><td>C</td><td>1600</td><td>binary search, brute force, dp, math, strings, two pointers</td><td><a href=https://codeforces.com/contest/165/submission/1361783>Delphi</a></td><td>16 March 2012 15:35:46</td></tr><tr><td>289</td><td><a href=https://codeforces.com/contest/165/problem/B>Burning Midnight Oil</a></td><td>B</td><td>1500</td><td>binary search, implementation</td><td><a href=https://codeforces.com/contest/165/submission/1361572>Delphi</a></td><td>16 March 2012 15:33:25</td></tr><tr><td>288</td><td><a href=https://codeforces.com/contest/165/problem/A>Supercentral Point</a></td><td>A</td><td>1000</td><td>implementation</td><td><a href=https://codeforces.com/contest/165/submission/1361543>Delphi</a></td><td>16 March 2012 15:31:43</td></tr><tr><td>287</td><td><a href=https://codeforces.com/contest/161/problem/C>Abracadabra</a></td><td>C</td><td>2400</td><td>divide and conquer</td><td><a href=https://codeforces.com/contest/161/submission/1346849>Delphi</a></td><td>11 March 2012 16:49:36</td></tr><tr><td>286</td><td><a href=https://codeforces.com/contest/161/problem/E>Polycarpus the Safecracker</a></td><td>E</td><td>2500</td><td>brute force, dp</td><td><a href=https://codeforces.com/contest/161/submission/1344819>Delphi</a></td><td>11 March 2012 16:11:14</td></tr><tr><td>285</td><td><a href=https://codeforces.com/contest/161/problem/B>Discounts</a></td><td>B</td><td>1700</td><td>constructive algorithms, greedy, sortings</td><td><a href=https://codeforces.com/contest/161/submission/1343521>Delphi</a></td><td>11 March 2012 15:49:39</td></tr><tr><td>284</td><td><a href=https://codeforces.com/contest/161/problem/D>Distance in Tree</a></td><td>D</td><td>1800</td><td>dfs and similar, dp, trees</td><td><a href=https://codeforces.com/contest/161/submission/1342736>Delphi</a></td><td>11 March 2012 15:35:26</td></tr><tr><td>283</td><td><a href=https://codeforces.com/contest/161/problem/A>Dress'em in Vests!</a></td><td>A</td><td>1300</td><td>binary search, brute force, greedy, two pointers</td><td><a href=https://codeforces.com/contest/161/submission/1340919>Delphi</a></td><td>11 March 2012 15:11:36</td></tr><tr><td>282</td><td><a href=https://codeforces.com/contest/158/problem/E>Phone Talks</a></td><td>E</td><td>1900</td><td>*special, dp, sortings</td><td><a href=https://codeforces.com/contest/158/submission/1275188>Delphi</a></td><td>04 March 2012 09:55:11</td></tr><tr><td>281</td><td><a href=https://codeforces.com/contest/158/problem/D>Ice Sculptures</a></td><td>D</td><td>1300</td><td>*special, brute force, number theory</td><td><a href=https://codeforces.com/contest/158/submission/1274568>Delphi</a></td><td>04 March 2012 09:26:18</td></tr><tr><td>280</td><td><a href=https://codeforces.com/contest/158/problem/C>Cd and pwd commands</a></td><td>C</td><td>1400</td><td>*special, data structures, implementation</td><td><a href=https://codeforces.com/contest/158/submission/1274555>Delphi</a></td><td>04 March 2012 09:25:49</td></tr><tr><td>279</td><td><a href=https://codeforces.com/contest/158/problem/B>Taxi</a></td><td>B</td><td>1100</td><td>*special, greedy, implementation</td><td><a href=https://codeforces.com/contest/158/submission/1274440>Delphi</a></td><td>04 March 2012 09:21:19</td></tr><tr><td>278</td><td><a href=https://codeforces.com/contest/158/problem/A>Next Round</a></td><td>A</td><td>800</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/158/submission/1274426>Delphi</a></td><td>04 March 2012 09:20:39</td></tr><tr><td>277</td><td><a href=https://codeforces.com/contest/156/problem/A>Message</a></td><td>A</td><td>1700</td><td>brute force</td><td><a href=https://codeforces.com/contest/156/submission/1251062>Delphi</a></td><td>29 February 2012 20:25:15</td></tr><tr><td>276</td><td><a href=https://codeforces.com/contest/156/problem/D>Clues</a></td><td>D</td><td>2500</td><td>combinatorics, graphs</td><td><a href=https://codeforces.com/contest/156/submission/1250914>Delphi</a></td><td>29 February 2012 19:29:08</td></tr><tr><td>275</td><td><a href=https://codeforces.com/contest/156/problem/E>Mrs. Hudson's Pancakes</a></td><td>E</td><td>3000</td><td>brute force, dp</td><td><a href=https://codeforces.com/contest/156/submission/1250291>Delphi</a></td><td>29 February 2012 19:11:15</td></tr><tr><td>274</td><td><a href=https://codeforces.com/contest/156/problem/C>Cipher</a></td><td>C</td><td>2000</td><td>combinatorics, dp</td><td><a href=https://codeforces.com/contest/156/submission/1246183>Delphi</a></td><td>29 February 2012 17:50:46</td></tr><tr><td>273</td><td><a href=https://codeforces.com/contest/156/problem/B>Suspects</a></td><td>B</td><td>1600</td><td>constructive algorithms, data structures, implementation</td><td><a href=https://codeforces.com/contest/156/submission/1244730>Delphi</a></td><td>29 February 2012 17:38:08</td></tr><tr><td>272</td><td><a href=https://codeforces.com/contest/154/problem/D>Flatland Fencing</a></td><td>D</td><td>2400</td><td>games, math</td><td><a href=https://codeforces.com/contest/154/submission/1225484>Delphi</a></td><td>24 February 2012 15:47:44</td></tr><tr><td>271</td><td><a href=https://codeforces.com/contest/154/problem/C>Double Profiles</a></td><td>C</td><td>2300</td><td>graphs, hashing, sortings</td><td><a href=https://codeforces.com/contest/154/submission/1223877>Delphi</a></td><td>24 February 2012 15:25:46</td></tr><tr><td>270</td><td><a href=https://codeforces.com/contest/154/problem/B>Colliders</a></td><td>B</td><td>1600</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/154/submission/1222594>Delphi</a></td><td>24 February 2012 15:13:33</td></tr><tr><td>269</td><td><a href=https://codeforces.com/contest/154/problem/A>Hometask</a></td><td>A</td><td>1600</td><td>greedy</td><td><a href=https://codeforces.com/contest/154/submission/1221625>Delphi</a></td><td>24 February 2012 15:05:56</td></tr><tr><td>268</td><td><a href=https://codeforces.com/contest/150/problem/C>Smart Cheater</a></td><td>C</td><td>2200</td><td>data structures, math, probabilities</td><td><a href=https://codeforces.com/contest/150/submission/1191698>Delphi</a></td><td>17 February 2012 15:53:25</td></tr><tr><td>267</td><td><a href=https://codeforces.com/contest/150/problem/B>Quantity of Strings</a></td><td>B</td><td>1600</td><td>combinatorics, dfs and similar, graphs, math</td><td><a href=https://codeforces.com/contest/150/submission/1187876>Delphi</a></td><td>17 February 2012 15:11:25</td></tr><tr><td>266</td><td><a href=https://codeforces.com/contest/150/problem/A>Win or Freeze</a></td><td>A</td><td>1400</td><td>games, math, number theory</td><td><a href=https://codeforces.com/contest/150/submission/1187174>FPC</a></td><td>17 February 2012 15:06:40</td></tr><tr><td>265</td><td><a href=https://codeforces.com/contest/145/problem/C>Lucky Subsequence</a></td><td>C</td><td>2100</td><td>combinatorics, dp, math</td><td><a href=https://codeforces.com/contest/145/submission/1107770>FPC</a></td><td>22 January 2012 08:53:38</td></tr><tr><td>264</td><td><a href=https://codeforces.com/contest/145/problem/E>Lucky Queries</a></td><td>E</td><td>2400</td><td>data structures</td><td><a href=https://codeforces.com/contest/145/submission/1106471>Delphi</a></td><td>22 January 2012 08:22:19</td></tr><tr><td>263</td><td><a href=https://codeforces.com/contest/145/problem/D>Lucky Pair</a></td><td>D</td><td>2900</td><td>combinatorics, data structures, implementation</td><td><a href=https://codeforces.com/contest/145/submission/1105329>Delphi</a></td><td>22 January 2012 07:57:41</td></tr><tr><td>262</td><td><a href=https://codeforces.com/contest/145/problem/B>Lucky Number 2</a></td><td>B</td><td>1800</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/145/submission/1104573>Delphi</a></td><td>22 January 2012 07:43:53</td></tr><tr><td>261</td><td><a href=https://codeforces.com/contest/145/problem/A>Lucky Conversion</a></td><td>A</td><td>1200</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/145/submission/1101514>Delphi</a></td><td>22 January 2012 07:05:38</td></tr><tr><td>260</td><td><a href=https://codeforces.com/contest/142/problem/D>Help Shrek and Donkey 2</a></td><td>D</td><td>2600</td><td>games</td><td><a href=https://codeforces.com/contest/142/submission/1037704>Delphi</a></td><td>12 January 2012 16:31:41</td></tr><tr><td>259</td><td><a href=https://codeforces.com/contest/142/problem/C>Help Caretaker</a></td><td>C</td><td>2300</td><td>brute force, dp</td><td><a href=https://codeforces.com/contest/142/submission/1036362>Delphi</a></td><td>12 January 2012 16:09:48</td></tr><tr><td>258</td><td><a href=https://codeforces.com/contest/142/problem/B>Help General</a></td><td>B</td><td>1800</td><td>constructive algorithms, greedy, implementation</td><td><a href=https://codeforces.com/contest/142/submission/1031869>Delphi</a></td><td>12 January 2012 15:18:04</td></tr><tr><td>257</td><td><a href=https://codeforces.com/contest/142/problem/A>Help Farmer</a></td><td>A</td><td>1600</td><td>brute force, math</td><td><a href=https://codeforces.com/contest/142/submission/1031117>Delphi</a></td><td>12 January 2012 15:11:35</td></tr><tr><td>256</td><td><a href=https://codeforces.com/contest/140/problem/F>New Year Snowflake</a></td><td>F</td><td>2600</td><td>geometry, sortings</td><td><a href=https://codeforces.com/contest/140/submission/1007449>Delphi</a></td><td>04 January 2012 16:37:40</td></tr><tr><td>255</td><td><a href=https://codeforces.com/contest/140/problem/E>New Year Garland</a></td><td>E</td><td>2600</td><td>combinatorics, dp</td><td><a href=https://codeforces.com/contest/140/submission/1005484>FPC</a></td><td>04 January 2012 16:12:39</td></tr><tr><td>254</td><td><a href=https://codeforces.com/contest/140/problem/D>New Year Contest</a></td><td>D</td><td>1800</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/140/submission/1001437>Delphi</a></td><td>04 January 2012 15:32:45</td></tr><tr><td>253</td><td><a href=https://codeforces.com/contest/140/problem/A>New Year Table</a></td><td>A</td><td>1700</td><td>geometry, math</td><td><a href=https://codeforces.com/contest/140/submission/1000944>Delphi</a></td><td>04 January 2012 15:28:38</td></tr><tr><td>252</td><td><a href=https://codeforces.com/contest/140/problem/B>New Year Cards</a></td><td>B</td><td>1800</td><td>brute force, greedy, implementation</td><td><a href=https://codeforces.com/contest/140/submission/1000239>Delphi</a></td><td>04 January 2012 15:22:48</td></tr><tr><td>251</td><td><a href=https://codeforces.com/contest/140/problem/C>New Year Snowmen</a></td><td>C</td><td>1800</td><td>binary search, data structures, greedy</td><td><a href=https://codeforces.com/contest/140/submission/999267>Delphi</a></td><td>04 January 2012 15:14:59</td></tr><tr><td>250</td><td><a href=https://codeforces.com/contest/123/problem/D>String</a></td><td>D</td><td>2300</td><td>string suffix structures</td><td><a href=https://codeforces.com/contest/123/submission/829997>Delphi</a></td><td>03 November 2011 16:02:24</td></tr><tr><td>249</td><td><a href=https://codeforces.com/contest/128/problem/C>Games with Rectangle</a></td><td>C</td><td>2000</td><td>combinatorics, dp</td><td><a href=https://codeforces.com/contest/128/submission/865977>Delphi</a></td><td>15 November 2011 06:32:08</td></tr><tr><td>248</td><td><a href=https://codeforces.com/contest/128/problem/A>Statues</a></td><td>A</td><td>1500</td><td>dfs and similar</td><td><a href=https://codeforces.com/contest/128/submission/865279>Delphi</a></td><td>15 November 2011 06:20:09</td></tr><tr><td>247</td><td><a href=https://codeforces.com/contest/126/problem/A>Hot Bath</a></td><td>A</td><td>1900</td><td>binary search, brute force, math</td><td><a href=https://codeforces.com/contest/126/submission/848423>Delphi</a></td><td>09 November 2011 18:05:17</td></tr><tr><td>246</td><td><a href=https://codeforces.com/contest/126/problem/D>Fibonacci Sums</a></td><td>D</td><td>2300</td><td>dp, math</td><td><a href=https://codeforces.com/contest/126/submission/846952>Delphi</a></td><td>09 November 2011 17:41:23</td></tr><tr><td>245</td><td><a href=https://codeforces.com/contest/126/problem/C>E-reader Display</a></td><td>C</td><td>2000</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/126/submission/844825>Delphi</a></td><td>09 November 2011 17:14:59</td></tr><tr><td>244</td><td><a href=https://codeforces.com/contest/126/problem/B>Password</a></td><td>B</td><td>1700</td><td>binary search, dp, hashing, string suffix structures, strings</td><td><a href=https://codeforces.com/contest/126/submission/844058>Delphi</a></td><td>09 November 2011 17:08:39</td></tr><tr><td>243</td><td><a href=https://codeforces.com/contest/123/problem/B>Squares</a></td><td>B</td><td>1800</td><td>math</td><td><a href=https://codeforces.com/contest/123/submission/828761>Delphi</a></td><td>03 November 2011 15:36:59</td></tr><tr><td>242</td><td><a href=https://codeforces.com/contest/123/problem/C>Brackets</a></td><td>C</td><td>2300</td><td>combinatorics, dp, greedy</td><td><a href=https://codeforces.com/contest/123/submission/830487>Delphi</a></td><td>03 November 2011 16:16:24</td></tr><tr><td>241</td><td><a href=https://codeforces.com/contest/123/problem/A>Prime Permutation</a></td><td>A</td><td>1300</td><td>implementation, number theory, strings</td><td><a href=https://codeforces.com/contest/123/submission/827481>Delphi</a></td><td>03 November 2011 15:21:03</td></tr><tr><td>240</td><td><a href=https://codeforces.com/contest/121/problem/E>Lucky Array</a></td><td>E</td><td>2400</td><td>data structures</td><td><a href=https://codeforces.com/contest/121/submission/804829>Delphi</a></td><td>27 October 2011 16:11:46</td></tr><tr><td>239</td><td><a href=https://codeforces.com/contest/121/problem/D>Lucky Segments</a></td><td>D</td><td>2500</td><td>binary search, implementation, two pointers</td><td><a href=https://codeforces.com/contest/121/submission/802756>Delphi</a></td><td>27 October 2011 15:40:39</td></tr><tr><td>238</td><td><a href=https://codeforces.com/contest/121/problem/B>Lucky Transformation</a></td><td>B</td><td>1500</td><td>strings</td><td><a href=https://codeforces.com/contest/121/submission/801296>Delphi</a></td><td>27 October 2011 15:22:41</td></tr><tr><td>237</td><td><a href=https://codeforces.com/contest/121/problem/C>Lucky Permutation</a></td><td>C</td><td>1900</td><td>brute force, combinatorics, number theory</td><td><a href=https://codeforces.com/contest/121/submission/800348>Delphi</a></td><td>27 October 2011 15:13:44</td></tr><tr><td>236</td><td><a href=https://codeforces.com/contest/121/problem/A>Lucky Sum</a></td><td>A</td><td>1100</td><td>implementation</td><td><a href=https://codeforces.com/contest/121/submission/799092>Delphi</a></td><td>27 October 2011 15:03:49</td></tr><tr><td>235</td><td><a href=https://codeforces.com/contest/120/problem/I>Luck is in Numbers</a></td><td>I</td><td>2200</td><td>greedy</td><td><a href=https://codeforces.com/contest/120/submission/775976>Delphi</a></td><td>18 October 2011 07:58:49</td></tr><tr><td>234</td><td><a href=https://codeforces.com/contest/120/problem/G>Boom</a></td><td>G</td><td>1800</td><td>implementation</td><td><a href=https://codeforces.com/contest/120/submission/775504>Delphi</a></td><td>18 October 2011 07:43:37</td></tr><tr><td>233</td><td><a href=https://codeforces.com/contest/120/problem/J>Minimum Sum</a></td><td>J</td><td>1900</td><td>divide and conquer, geometry, sortings</td><td><a href=https://codeforces.com/contest/120/submission/775403>Delphi</a></td><td>18 October 2011 07:41:12</td></tr><tr><td>232</td><td><a href=https://codeforces.com/contest/120/problem/E>Put Knight!</a></td><td>E</td><td>1400</td><td>games, math</td><td><a href=https://codeforces.com/contest/120/submission/774183>Delphi</a></td><td>18 October 2011 07:10:55</td></tr><tr><td>231</td><td><a href=https://codeforces.com/contest/120/problem/H>Brevity is Soul of Wit</a></td><td>H</td><td>1800</td><td>graph matchings</td><td><a href=https://codeforces.com/contest/120/submission/773891>Delphi</a></td><td>18 October 2011 07:04:47</td></tr><tr><td>230</td><td><a href=https://codeforces.com/contest/120/problem/F>Spiders</a></td><td>F</td><td>1400</td><td>dp, greedy, trees</td><td><a href=https://codeforces.com/contest/120/submission/772754>Delphi</a></td><td>18 October 2011 06:45:55</td></tr><tr><td>229</td><td><a href=https://codeforces.com/contest/120/problem/D>Three Sons</a></td><td>D</td><td>1400</td><td>brute force</td><td><a href=https://codeforces.com/contest/120/submission/772445>Delphi</a></td><td>18 October 2011 06:41:16</td></tr><tr><td>228</td><td><a href=https://codeforces.com/contest/120/problem/C>Winnie-the-Pooh and honey</a></td><td>C</td><td>1100</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/120/submission/772055>Delphi</a></td><td>18 October 2011 06:35:37</td></tr><tr><td>227</td><td><a href=https://codeforces.com/contest/120/problem/B>Quiz League</a></td><td>B</td><td>1100</td><td>implementation</td><td><a href=https://codeforces.com/contest/120/submission/771950>Delphi</a></td><td>18 October 2011 06:33:49</td></tr><tr><td>226</td><td><a href=https://codeforces.com/contest/117/problem/A>Elevator</a></td><td>A</td><td>1300</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/117/submission/713826>Delphi</a></td><td>23 September 2011 15:05:33</td></tr><tr><td>225</td><td><a href=https://codeforces.com/contest/119/problem/D>String Transformation</a></td><td>D</td><td>2500</td><td>hashing, strings</td><td><a href=https://codeforces.com/contest/119/submission/762523>Delphi</a></td><td>14 October 2011 15:47:31</td></tr><tr><td>224</td><td><a href=https://codeforces.com/contest/119/problem/C>Education Reform</a></td><td>C</td><td>2000</td><td>dp</td><td><a href=https://codeforces.com/contest/119/submission/761666>Delphi</a></td><td>14 October 2011 15:30:52</td></tr><tr><td>223</td><td><a href=https://codeforces.com/contest/119/problem/A>Epic Game</a></td><td>A</td><td>800</td><td>implementation</td><td><a href=https://codeforces.com/contest/119/submission/759387>Delphi</a></td><td>14 October 2011 15:01:47</td></tr><tr><td>222</td><td><a href=https://codeforces.com/contest/117/problem/E>Tree or not Tree</a></td><td>E</td><td>2900</td><td>data structures, divide and conquer, implementation, trees</td><td><a href=https://codeforces.com/contest/117/submission/720521>Delphi</a></td><td>23 September 2011 20:00:26</td></tr><tr><td>221</td><td><a href=https://codeforces.com/contest/117/problem/D>Not Quick Transformation</a></td><td>D</td><td>2500</td><td>divide and conquer, math</td><td><a href=https://codeforces.com/contest/117/submission/715941>FPC</a></td><td>23 September 2011 16:01:23</td></tr><tr><td>220</td><td><a href=https://codeforces.com/contest/117/problem/C>Cycle</a></td><td>C</td><td>2000</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/117/submission/714087>Delphi</a></td><td>23 September 2011 15:21:55</td></tr><tr><td>219</td><td><a href=https://codeforces.com/contest/117/problem/B>Very Interesting Game</a></td><td>B</td><td>1800</td><td>brute force, number theory</td><td><a href=https://codeforces.com/contest/117/submission/713852>Delphi</a></td><td>23 September 2011 15:11:30</td></tr><tr><td>218</td><td><a href=https://codeforces.com/contest/115/problem/B>Lawnmower</a></td><td>B</td><td>1500</td><td>greedy, sortings</td><td><a href=https://codeforces.com/contest/115/submission/701785>Delphi</a></td><td>15 September 2011 16:47:38</td></tr><tr><td>217</td><td><a href=https://codeforces.com/contest/115/problem/D>Unambiguous Arithmetic Expression</a></td><td>D</td><td>2600</td><td>dp, expression parsing</td><td><a href=https://codeforces.com/contest/115/submission/700677>GNU C++</a></td><td>15 September 2011 16:17:00</td></tr><tr><td>216</td><td><a href=https://codeforces.com/contest/115/problem/E>Linear Kingdom Races</a></td><td>E</td><td>2400</td><td>data structures, dp</td><td><a href=https://codeforces.com/contest/115/submission/698918>Delphi</a></td><td>15 September 2011 15:39:32</td></tr><tr><td>215</td><td><a href=https://codeforces.com/contest/115/problem/C>Plumber</a></td><td>C</td><td>2200</td><td>math</td><td><a href=https://codeforces.com/contest/115/submission/696934>Delphi</a></td><td>15 September 2011 15:12:22</td></tr><tr><td>214</td><td><a href=https://codeforces.com/contest/113/problem/D>Museum</a></td><td>D</td><td>2700</td><td>math, matrices, probabilities</td><td><a href=https://codeforces.com/contest/113/submission/682949>GNU C++</a></td><td>08 September 2011 19:22:14</td></tr><tr><td>213</td><td><a href=https://codeforces.com/contest/113/problem/C>Double Happiness</a></td><td>C</td><td>2200</td><td>brute force, math, number theory</td><td><a href=https://codeforces.com/contest/113/submission/682852>Delphi</a></td><td>08 September 2011 19:16:17</td></tr><tr><td>212</td><td><a href=https://codeforces.com/contest/113/problem/E>Sleeping</a></td><td>E</td><td>2700</td><td>combinatorics, implementation, math</td><td><a href=https://codeforces.com/contest/113/submission/680820>Delphi</a></td><td>08 September 2011 16:41:35</td></tr><tr><td>211</td><td><a href=https://codeforces.com/contest/113/problem/A>Grammar Lessons</a></td><td>A</td><td>1600</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/113/submission/676774>Delphi</a></td><td>08 September 2011 15:31:14</td></tr><tr><td>210</td><td><a href=https://codeforces.com/contest/113/problem/B>Petr#</a></td><td>B</td><td>2000</td><td>brute force, data structures, hashing, strings</td><td><a href=https://codeforces.com/contest/113/submission/676084>Delphi</a></td><td>08 September 2011 15:22:34</td></tr><tr><td>209</td><td><a href=https://codeforces.com/contest/111/problem/D>Petya and Coloring</a></td><td>D</td><td>2300</td><td>combinatorics, dp</td><td><a href=https://codeforces.com/contest/111/submission/666371>Delphi</a></td><td>03 September 2011 19:42:51</td></tr><tr><td>208</td><td><a href=https://codeforces.com/contest/111/problem/C>Petya and Spiders</a></td><td>C</td><td>2100</td><td>bitmasks, dp, dsu</td><td><a href=https://codeforces.com/contest/111/submission/659064>Delphi</a></td><td>03 September 2011 12:21:51</td></tr><tr><td>207</td><td><a href=https://codeforces.com/contest/111/problem/B>Petya and Divisors</a></td><td>B</td><td>1900</td><td>binary search, data structures, number theory</td><td><a href=https://codeforces.com/contest/111/submission/658150>Delphi</a></td><td>03 September 2011 12:09:48</td></tr><tr><td>206</td><td><a href=https://codeforces.com/contest/111/problem/A>Petya and Inequiations</a></td><td>A</td><td>1400</td><td>greedy</td><td><a href=https://codeforces.com/contest/111/submission/657206>Delphi</a></td><td>03 September 2011 12:02:29</td></tr><tr><td>205</td><td><a href=https://codeforces.com/contest/109/problem/B>Lucky Probability</a></td><td>B</td><td>1900</td><td>brute force, probabilities</td><td><a href=https://codeforces.com/contest/109/submission/645849>Delphi</a></td><td>29 August 2011 16:42:04</td></tr><tr><td>204</td><td><a href=https://codeforces.com/contest/109/problem/C>Lucky Tree</a></td><td>C</td><td>1900</td><td>dp, dsu, trees</td><td><a href=https://codeforces.com/contest/109/submission/645267>Delphi</a></td><td>29 August 2011 16:32:44</td></tr><tr><td>203</td><td><a href=https://codeforces.com/contest/109/problem/D>Lucky Sorting</a></td><td>D</td><td>2000</td><td>constructive algorithms, sortings</td><td><a href=https://codeforces.com/contest/109/submission/644534>Delphi</a></td><td>29 August 2011 16:22:58</td></tr><tr><td>202</td><td><a href=https://codeforces.com/contest/109/problem/A>Lucky Sum of Digits</a></td><td>A</td><td>1000</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/109/submission/642168>Delphi</a></td><td>29 August 2011 16:02:17</td></tr><tr><td>201</td><td><a href=https://codeforces.com/contest/107/problem/C>Arrangement</a></td><td>C</td><td>2400</td><td>bitmasks, dp</td><td><a href=https://codeforces.com/contest/107/submission/633250>Delphi</a></td><td>23 August 2011 16:37:14</td></tr><tr><td>200</td><td><a href=https://codeforces.com/contest/107/problem/D>Crime Management</a></td><td>D</td><td>2400</td><td>dp, graphs, matrices</td><td><a href=https://codeforces.com/contest/107/submission/632367>Delphi</a></td><td>23 August 2011 16:15:54</td></tr><tr><td>199</td><td><a href=https://codeforces.com/contest/107/problem/A>Dorm Water Supply</a></td><td>A</td><td>1400</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/107/submission/628243>Delphi</a></td><td>23 August 2011 15:15:40</td></tr><tr><td>198</td><td><a href=https://codeforces.com/contest/107/problem/B>Basketball Team</a></td><td>B</td><td>1600</td><td>combinatorics, dp, math, probabilities</td><td><a href=https://codeforces.com/contest/107/submission/627574>Delphi</a></td><td>23 August 2011 15:08:06</td></tr><tr><td>197</td><td><a href=https://codeforces.com/contest/106/problem/D>Treasure Island</a></td><td>D</td><td>1700</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/106/submission/617273>Delphi</a></td><td>19 August 2011 15:26:49</td></tr><tr><td>196</td><td><a href=https://codeforces.com/contest/106/problem/B>Choosing Laptop</a></td><td>B</td><td>1000</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/106/submission/615888>Delphi</a></td><td>19 August 2011 15:08:30</td></tr><tr><td>195</td><td><a href=https://codeforces.com/contest/106/problem/C>Buns</a></td><td>C</td><td>1700</td><td>dp</td><td><a href=https://codeforces.com/contest/106/submission/615679>Delphi</a></td><td>19 August 2011 15:05:46</td></tr><tr><td>194</td><td><a href=https://codeforces.com/contest/105/problem/C>Item World</a></td><td>C</td><td>2200</td><td>brute force, implementation, sortings</td><td><a href=https://codeforces.com/contest/105/submission/606942>Delphi</a></td><td>13 August 2011 15:50:57</td></tr><tr><td>193</td><td><a href=https://codeforces.com/contest/105/problem/B>Dark Assembly</a></td><td>B</td><td>1800</td><td>brute force, probabilities</td><td><a href=https://codeforces.com/contest/105/submission/605713>Delphi</a></td><td>13 August 2011 15:14:29</td></tr><tr><td>192</td><td><a href=https://codeforces.com/contest/105/problem/A>Transmigration</a></td><td>A</td><td>1700</td><td>implementation</td><td><a href=https://codeforces.com/contest/105/submission/605392>Delphi</a></td><td>13 August 2011 15:08:19</td></tr><tr><td>191</td><td><a href=https://codeforces.com/contest/101/problem/C>Vectors</a></td><td>C</td><td>2000</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/101/submission/582749>Delphi</a></td><td>03 August 2011 19:34:20</td></tr><tr><td>190</td><td><a href=https://codeforces.com/contest/101/problem/D>Castle</a></td><td>D</td><td>2300</td><td>dp, greedy, probabilities, sortings, trees</td><td><a href=https://codeforces.com/contest/101/submission/580677>Delphi</a></td><td>03 August 2011 18:06:13</td></tr><tr><td>189</td><td><a href=https://codeforces.com/contest/101/problem/E>Candies and Stones</a></td><td>E</td><td>2500</td><td>divide and conquer, dp</td><td><a href=https://codeforces.com/contest/101/submission/579938>Delphi</a></td><td>03 August 2011 17:45:08</td></tr><tr><td>188</td><td><a href=https://codeforces.com/contest/101/problem/B>Buses</a></td><td>B</td><td>1700</td><td>binary search, data structures, dp</td><td><a href=https://codeforces.com/contest/101/submission/578791>Delphi</a></td><td>03 August 2011 17:19:32</td></tr><tr><td>187</td><td><a href=https://codeforces.com/contest/101/problem/A>Homework</a></td><td>A</td><td>1200</td><td>greedy</td><td><a href=https://codeforces.com/contest/101/submission/577918>Delphi</a></td><td>03 August 2011 17:04:57</td></tr><tr><td>186</td><td><a href=https://codeforces.com/contest/97/problem/D>Robot in Basement</a></td><td>D</td><td>2700</td><td>bitmasks, brute force, implementation</td><td><a href=https://codeforces.com/contest/97/submission/547799>Delphi</a></td><td>15 July 2011 17:51:09</td></tr><tr><td>185</td><td><a href=https://codeforces.com/contest/85/problem/A>Domino</a></td><td>A</td><td>1300</td><td>constructive algorithms, implementation</td><td><a href=https://codeforces.com/contest/85/submission/460184>Delphi</a></td><td>20 May 2011 15:07:28</td></tr><tr><td>184</td><td><a href=https://codeforces.com/contest/97/problem/C>Winning Strategy</a></td><td>C</td><td>2400</td><td>binary search, graphs, math, shortest paths</td><td><a href=https://codeforces.com/contest/97/submission/547022>Delphi</a></td><td>15 July 2011 13:12:39</td></tr><tr><td>183</td><td><a href=https://codeforces.com/contest/97/problem/B>Superset</a></td><td>B</td><td>2300</td><td>constructive algorithms, divide and conquer</td><td><a href=https://codeforces.com/contest/97/submission/546823>Delphi</a></td><td>15 July 2011 12:47:13</td></tr><tr><td>182</td><td><a href=https://codeforces.com/contest/1/problem/A>Theatre Square</a></td><td>A</td><td>1000</td><td>math</td><td><a href=https://codeforces.com/contest/1/submission/545140>Delphi</a></td><td>14 July 2011 11:28:55</td></tr><tr><td>181</td><td><a href=https://codeforces.com/contest/89/problem/B>Widget Library</a></td><td>B</td><td>2300</td><td>dp, expression parsing, graphs, implementation</td><td><a href=https://codeforces.com/contest/89/submission/492381>Delphi</a></td><td>16 June 2011 16:23:25</td></tr><tr><td>180</td><td><a href=https://codeforces.com/contest/89/problem/D>Space mines</a></td><td>D</td><td>2500</td><td>geometry</td><td><a href=https://codeforces.com/contest/89/submission/491352>Delphi</a></td><td>16 June 2011 15:49:02</td></tr><tr><td>179</td><td><a href=https://codeforces.com/contest/89/problem/C>Chip Play</a></td><td>C</td><td>2300</td><td>brute force, data structures, implementation</td><td><a href=https://codeforces.com/contest/89/submission/490286>Delphi</a></td><td>16 June 2011 15:25:17</td></tr><tr><td>178</td><td><a href=https://codeforces.com/contest/89/problem/A>Robbery</a></td><td>A</td><td>1800</td><td>greedy</td><td><a href=https://codeforces.com/contest/89/submission/489326>Delphi</a></td><td>16 June 2011 15:10:40</td></tr><tr><td>177</td><td><a href=https://codeforces.com/contest/87/problem/E>Mogohu-Rea Idol</a></td><td>E</td><td>2600</td><td>geometry</td><td><a href=https://codeforces.com/contest/87/submission/481093>Delphi</a></td><td>07 June 2011 16:56:27</td></tr><tr><td>176</td><td><a href=https://codeforces.com/contest/87/problem/D>Beautiful Road</a></td><td>D</td><td>2300</td><td>dfs and similar, dp, dsu, graphs, implementation, sortings, trees</td><td><a href=https://codeforces.com/contest/87/submission/479186>Delphi</a></td><td>07 June 2011 15:59:50</td></tr><tr><td>175</td><td><a href=https://codeforces.com/contest/87/problem/B>Vasya and Types</a></td><td>B</td><td>1800</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/87/submission/478182>Delphi</a></td><td>07 June 2011 15:33:38</td></tr><tr><td>174</td><td><a href=https://codeforces.com/contest/87/problem/C>Interesting Game</a></td><td>C</td><td>2000</td><td>dp, games, math</td><td><a href=https://codeforces.com/contest/87/submission/477330>Delphi</a></td><td>07 June 2011 15:11:30</td></tr><tr><td>173</td><td><a href=https://codeforces.com/contest/87/problem/A>Trains</a></td><td>A</td><td>1500</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/87/submission/477177>Delphi</a></td><td>07 June 2011 15:04:55</td></tr><tr><td>172</td><td><a href=https://codeforces.com/contest/86/problem/B>Tetris revisited</a></td><td>B</td><td>2200</td><td>constructive algorithms, graph matchings, greedy, math</td><td><a href=https://codeforces.com/contest/86/submission/467658>Delphi</a></td><td>22 May 2011 17:46:21</td></tr><tr><td>171</td><td><a href=https://codeforces.com/contest/86/problem/C>Genetic engineering</a></td><td>C</td><td>2500</td><td>dp, string suffix structures, trees</td><td><a href=https://codeforces.com/contest/86/submission/467636>Delphi</a></td><td>22 May 2011 17:43:11</td></tr><tr><td>170</td><td><a href=https://codeforces.com/contest/86/problem/E>Long sequence</a></td><td>E</td><td>2700</td><td>brute force, math, matrices</td><td><a href=https://codeforces.com/contest/86/submission/466889>Delphi</a></td><td>22 May 2011 16:15:20</td></tr><tr><td>169</td><td><a href=https://codeforces.com/contest/86/problem/D>Powerful array</a></td><td>D</td><td>2200</td><td>data structures, implementation, math, two pointers</td><td><a href=https://codeforces.com/contest/86/submission/466535>Delphi</a></td><td>22 May 2011 15:38:24</td></tr><tr><td>168</td><td><a href=https://codeforces.com/contest/86/problem/A>Reflection</a></td><td>A</td><td>1600</td><td>math</td><td><a href=https://codeforces.com/contest/86/submission/466215>Delphi</a></td><td>22 May 2011 15:17:57</td></tr><tr><td>167</td><td><a href=https://codeforces.com/contest/85/problem/C>Petya and Tree</a></td><td>C</td><td>2200</td><td>binary search, dfs and similar, probabilities, sortings, trees</td><td><a href=https://codeforces.com/contest/85/submission/463260>Delphi</a></td><td>20 May 2011 16:40:20</td></tr><tr><td>166</td><td><a href=https://codeforces.com/contest/85/problem/D>Sum of Medians</a></td><td>D</td><td>2300</td><td>binary search, brute force, data structures, implementation</td><td><a href=https://codeforces.com/contest/85/submission/462588>Delphi</a></td><td>20 May 2011 16:15:24</td></tr><tr><td>165</td><td><a href=https://codeforces.com/contest/85/problem/E>Guard Towers</a></td><td>E</td><td>2600</td><td>binary search, dsu, geometry, graphs, sortings</td><td><a href=https://codeforces.com/contest/85/submission/461951>Delphi</a></td><td>20 May 2011 15:50:33</td></tr><tr><td>164</td><td><a href=https://codeforces.com/contest/85/problem/B>Embassy Queue</a></td><td>B</td><td>1800</td><td>data structures, greedy</td><td><a href=https://codeforces.com/contest/85/submission/460605>Delphi</a></td><td>20 May 2011 15:15:58</td></tr><tr><td>163</td><td><a href=https://codeforces.com/contest/83/problem/E>Two Subsequences</a></td><td>E</td><td>2800</td><td>bitmasks, dp</td><td><a href=https://codeforces.com/contest/83/submission/450578>Delphi</a></td><td>13 May 2011 16:28:04</td></tr><tr><td>162</td><td><a href=https://codeforces.com/contest/83/problem/C>Track</a></td><td>C</td><td>2400</td><td>graphs, greedy, shortest paths</td><td><a href=https://codeforces.com/contest/83/submission/449025>Delphi</a></td><td>13 May 2011 15:53:59</td></tr><tr><td>161</td><td><a href=https://codeforces.com/contest/83/problem/B>Doctor</a></td><td>B</td><td>1800</td><td>binary search, math, sortings</td><td><a href=https://codeforces.com/contest/83/submission/447077>Delphi</a></td><td>13 May 2011 15:19:57</td></tr><tr><td>160</td><td><a href=https://codeforces.com/contest/83/problem/A>Magical Array</a></td><td>A</td><td>1300</td><td>math</td><td><a href=https://codeforces.com/contest/83/submission/446358>Delphi</a></td><td>13 May 2011 15:11:57</td></tr><tr><td>159</td><td><a href=https://codeforces.com/contest/82/problem/E>Corridor</a></td><td>E</td><td>2600</td><td>geometry</td><td><a href=https://codeforces.com/contest/82/submission/440001>Delphi</a></td><td>06 May 2011 16:47:38</td></tr><tr><td>158</td><td><a href=https://codeforces.com/contest/82/problem/C>General Mobilization</a></td><td>C</td><td>2000</td><td>data structures, dfs and similar, sortings</td><td><a href=https://codeforces.com/contest/82/submission/436895>Delphi</a></td><td>06 May 2011 15:43:31</td></tr><tr><td>157</td><td><a href=https://codeforces.com/contest/82/problem/B>Sets</a></td><td>B</td><td>1700</td><td>constructive algorithms, hashing, implementation</td><td><a href=https://codeforces.com/contest/82/submission/436323>Delphi</a></td><td>06 May 2011 15:33:31</td></tr><tr><td>156</td><td><a href=https://codeforces.com/contest/82/problem/D>Two out of Three</a></td><td>D</td><td>2000</td><td>dp</td><td><a href=https://codeforces.com/contest/82/submission/435779>Delphi</a></td><td>06 May 2011 15:24:47</td></tr><tr><td>155</td><td><a href=https://codeforces.com/contest/82/problem/A>Double Cola</a></td><td>A</td><td>1100</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/82/submission/434354>Delphi</a></td><td>06 May 2011 15:03:42</td></tr><tr><td>154</td><td><a href=https://codeforces.com/contest/77/problem/C>Beavermuncher-0xFF</a></td><td>C</td><td>2100</td><td>dfs and similar, dp, dsu, greedy, trees</td><td><a href=https://codeforces.com/contest/77/submission/401718>Delphi</a></td><td>19 April 2011 17:12:56</td></tr><tr><td>153</td><td><a href=https://codeforces.com/contest/77/problem/D>Domino Carpet</a></td><td>D</td><td>2300</td><td>dp, implementation</td><td><a href=https://codeforces.com/contest/77/submission/399134>Delphi</a></td><td>19 April 2011 16:03:22</td></tr><tr><td>152</td><td><a href=https://codeforces.com/contest/77/problem/A>Heroes</a></td><td>A</td><td>1400</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/77/submission/396904>Delphi</a></td><td>19 April 2011 15:23:37</td></tr><tr><td>151</td><td><a href=https://codeforces.com/contest/74/problem/D>Hanger</a></td><td>D</td><td>2400</td><td>data structures</td><td><a href=https://codeforces.com/contest/74/submission/392379>GNU C++</a></td><td>15 April 2011 16:50:19</td></tr><tr><td>150</td><td><a href=https://codeforces.com/contest/74/problem/C>Chessboard Billiard</a></td><td>C</td><td>2100</td><td>dfs and similar, dsu, graphs, number theory</td><td><a href=https://codeforces.com/contest/74/submission/391314>Delphi</a></td><td>15 April 2011 16:03:44</td></tr><tr><td>149</td><td><a href=https://codeforces.com/contest/74/problem/E>Shift It!</a></td><td>E</td><td>2800</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/74/submission/391186>Delphi</a></td><td>15 April 2011 15:58:12</td></tr><tr><td>148</td><td><a href=https://codeforces.com/contest/74/problem/B>Train</a></td><td>B</td><td>1500</td><td>dp, games, greedy</td><td><a href=https://codeforces.com/contest/74/submission/389940>Delphi</a></td><td>15 April 2011 15:18:56</td></tr><tr><td>147</td><td><a href=https://codeforces.com/contest/74/problem/A>Room Leader</a></td><td>A</td><td>1000</td><td>implementation</td><td><a href=https://codeforces.com/contest/74/submission/388976>Delphi</a></td><td>15 April 2011 15:02:55</td></tr><tr><td>146</td><td><a href=https://codeforces.com/contest/76/problem/F>Tourist</a></td><td>F</td><td>2300</td><td>binary search, data structures, dp</td><td><a href=https://codeforces.com/contest/76/submission/380317>Delphi</a></td><td>12 April 2011 14:20:41</td></tr><tr><td>145</td><td><a href=https://codeforces.com/contest/76/problem/E>Points</a></td><td>E</td><td>1700</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/76/submission/380153>Delphi</a></td><td>12 April 2011 14:09:06</td></tr><tr><td>144</td><td><a href=https://codeforces.com/contest/76/problem/D>Plus and xor</a></td><td>D</td><td>1700</td><td>dp, greedy, math</td><td><a href=https://codeforces.com/contest/76/submission/380057>FPC</a></td><td>12 April 2011 14:00:55</td></tr><tr><td>143</td><td><a href=https://codeforces.com/contest/76/problem/C>Mutation</a></td><td>C</td><td>2700</td><td>bitmasks, dp, math</td><td><a href=https://codeforces.com/contest/76/submission/379997>Delphi</a></td><td>12 April 2011 13:54:42</td></tr><tr><td>142</td><td><a href=https://codeforces.com/contest/76/problem/B>Mice</a></td><td>B</td><td>2100</td><td>greedy, two pointers</td><td><a href=https://codeforces.com/contest/76/submission/379575>Delphi</a></td><td>12 April 2011 13:17:06</td></tr><tr><td>141</td><td><a href=https://codeforces.com/contest/76/problem/A>Gift</a></td><td>A</td><td>2200</td><td>dsu, graphs, sortings, trees</td><td><a href=https://codeforces.com/contest/76/submission/379437>Delphi</a></td><td>12 April 2011 13:03:57</td></tr><tr><td>140</td><td><a href=https://codeforces.com/contest/73/problem/B>Need For Brake</a></td><td>B</td><td>2000</td><td>binary search, greedy, sortings</td><td><a href=https://codeforces.com/contest/73/submission/375099>Delphi</a></td><td>10 April 2011 09:37:56</td></tr><tr><td>139</td><td><a href=https://codeforces.com/contest/73/problem/D>FreeDiv</a></td><td>D</td><td>2200</td><td>dfs and similar, graphs, greedy</td><td><a href=https://codeforces.com/contest/73/submission/374698>Delphi</a></td><td>10 April 2011 09:19:16</td></tr><tr><td>138</td><td><a href=https://codeforces.com/contest/73/problem/E>Morrowindows</a></td><td>E</td><td>2400</td><td>math, number theory</td><td><a href=https://codeforces.com/contest/73/submission/374570>Delphi</a></td><td>10 April 2011 08:37:12</td></tr><tr><td>137</td><td><a href=https://codeforces.com/contest/73/problem/C>LionAge II</a></td><td>C</td><td>1800</td><td>dp</td><td><a href=https://codeforces.com/contest/73/submission/373031>Delphi</a></td><td>10 April 2011 08:15:27</td></tr><tr><td>136</td><td><a href=https://codeforces.com/contest/73/problem/A>The Elder Trolls IV: Oblivon</a></td><td>A</td><td>1600</td><td>greedy, math</td><td><a href=https://codeforces.com/contest/73/submission/372713>Delphi</a></td><td>10 April 2011 08:03:48</td></tr><tr><td>135</td><td><a href=https://codeforces.com/contest/67/problem/C>Sequence of Balls</a></td><td>C</td><td>2600</td><td>dp</td><td><a href=https://codeforces.com/contest/67/submission/334436>Delphi</a></td><td>13 March 2011 17:54:55</td></tr><tr><td>134</td><td><a href=https://codeforces.com/contest/67/problem/E>Save the City!</a></td><td>E</td><td>2500</td><td>geometry</td><td><a href=https://codeforces.com/contest/67/submission/333977>Delphi</a></td><td>13 March 2011 17:30:23</td></tr><tr><td>133</td><td><a href=https://codeforces.com/contest/67/problem/B>Restoration of the Permutation</a></td><td>B</td><td>1800</td><td>greedy</td><td><a href=https://codeforces.com/contest/67/submission/333379>Delphi</a></td><td>13 March 2011 17:06:32</td></tr><tr><td>132</td><td><a href=https://codeforces.com/contest/67/problem/D>Optical Experiment</a></td><td>D</td><td>1900</td><td>binary search, data structures, dp</td><td><a href=https://codeforces.com/contest/67/submission/332980>Delphi</a></td><td>13 March 2011 16:48:39</td></tr><tr><td>131</td><td><a href=https://codeforces.com/contest/67/problem/A>Partial Teacher</a></td><td>A</td><td>1800</td><td>dp, graphs, greedy, implementation</td><td><a href=https://codeforces.com/contest/67/submission/332655>Delphi</a></td><td>13 March 2011 16:37:56</td></tr><tr><td>130</td><td><a href=https://codeforces.com/contest/62/problem/C>Inquisition</a></td><td>C</td><td>2300</td><td>geometry, implementation, sortings</td><td><a href=https://codeforces.com/contest/62/submission/305881>Delphi</a></td><td>25 February 2011 17:24:35</td></tr><tr><td>129</td><td><a href=https://codeforces.com/contest/62/problem/D>Wormhouse</a></td><td>D</td><td>2300</td><td>dfs and similar, graphs</td><td><a href=https://codeforces.com/contest/62/submission/304933>Delphi</a></td><td>25 February 2011 16:55:09</td></tr><tr><td>128</td><td><a href=https://codeforces.com/contest/62/problem/B>Tyndex.Brome</a></td><td>B</td><td>1800</td><td>binary search, implementation</td><td><a href=https://codeforces.com/contest/62/submission/303176>Delphi</a></td><td>25 February 2011 16:14:53</td></tr><tr><td>127</td><td><a href=https://codeforces.com/contest/62/problem/A>A Student's Dream</a></td><td>A</td><td>1300</td><td>greedy, math</td><td><a href=https://codeforces.com/contest/62/submission/302385>Delphi</a></td><td>25 February 2011 16:02:54</td></tr><tr><td>126</td><td><a href=https://codeforces.com/contest/64/problem/E>Prime Segment</a></td><td>E</td><td>1800</td><td>*special, brute force</td><td><a href=https://codeforces.com/contest/64/submission/294082>Tcl</a></td><td>21 February 2011 16:28:42</td></tr><tr><td>125</td><td><a href=https://codeforces.com/contest/64/problem/D>Presents</a></td><td>D</td><td>1800</td><td>*special, greedy</td><td><a href=https://codeforces.com/contest/64/submission/293935>Tcl</a></td><td>21 February 2011 16:21:04</td></tr><tr><td>124</td><td><a href=https://codeforces.com/contest/64/problem/A>Factorial</a></td><td>A</td><td>1300</td><td>*special, implementation</td><td><a href=https://codeforces.com/contest/64/submission/293654>Tcl</a></td><td>21 February 2011 16:03:33</td></tr><tr><td>123</td><td><a href=https://codeforces.com/contest/60/problem/C>Mushroom Strife</a></td><td>C</td><td>2100</td><td>brute force, dfs and similar</td><td><a href=https://codeforces.com/contest/60/submission/291432>Delphi</a></td><td>19 February 2011 18:57:48</td></tr><tr><td>122</td><td><a href=https://codeforces.com/contest/60/problem/E>Mushroom Gnomes</a></td><td>E</td><td>2600</td><td>math, matrices</td><td><a href=https://codeforces.com/contest/60/submission/289984>Delphi</a></td><td>19 February 2011 17:00:45</td></tr><tr><td>121</td><td><a href=https://codeforces.com/contest/60/problem/D>Savior</a></td><td>D</td><td>2500</td><td>brute force, dsu, math</td><td><a href=https://codeforces.com/contest/60/submission/289434>Delphi</a></td><td>19 February 2011 16:37:34</td></tr><tr><td>120</td><td><a href=https://codeforces.com/contest/60/problem/B>Serial Time!</a></td><td>B</td><td>1400</td><td>dfs and similar, dsu</td><td><a href=https://codeforces.com/contest/60/submission/288636>Delphi</a></td><td>19 February 2011 16:16:21</td></tr><tr><td>119</td><td><a href=https://codeforces.com/contest/60/problem/A>Where Are My Flakes?</a></td><td>A</td><td>1300</td><td>implementation, two pointers</td><td><a href=https://codeforces.com/contest/60/submission/288077>Delphi</a></td><td>19 February 2011 16:02:28</td></tr><tr><td>118</td><td><a href=https://codeforces.com/contest/57/problem/D>Journey</a></td><td>D</td><td>2500</td><td>dp, math</td><td><a href=https://codeforces.com/contest/57/submission/262995>Delphi</a></td><td>25 January 2011 16:36:16</td></tr><tr><td>117</td><td><a href=https://codeforces.com/contest/57/problem/C>Array</a></td><td>C</td><td>1900</td><td>combinatorics, math</td><td><a href=https://codeforces.com/contest/57/submission/262068>Delphi</a></td><td>25 January 2011 16:11:32</td></tr><tr><td>116</td><td><a href=https://codeforces.com/contest/57/problem/B>Martian Architecture</a></td><td>B</td><td>1600</td><td>implementation</td><td><a href=https://codeforces.com/contest/57/submission/261938>Delphi</a></td><td>25 January 2011 16:07:48</td></tr><tr><td>115</td><td><a href=https://codeforces.com/contest/57/problem/A>Square Earth?</a></td><td>A</td><td>1300</td><td>dfs and similar, greedy, implementation</td><td><a href=https://codeforces.com/contest/57/submission/261854>Delphi</a></td><td>25 January 2011 16:03:12</td></tr><tr><td>114</td><td><a href=https://codeforces.com/contest/51/problem/F>Caterpillar</a></td><td>F</td><td>2800</td><td>dfs and similar, dp, graphs, trees</td><td><a href=https://codeforces.com/contest/51/submission/234330>Delphi</a></td><td>28 December 2010 19:04:11</td></tr><tr><td>113</td><td><a href=https://codeforces.com/contest/51/problem/E>Pentagon</a></td><td>E</td><td>2400</td><td>combinatorics, graphs, matrices</td><td><a href=https://codeforces.com/contest/51/submission/232373>Delphi</a></td><td>28 December 2010 16:53:20</td></tr><tr><td>112</td><td><a href=https://codeforces.com/contest/51/problem/D>Geometrical problem</a></td><td>D</td><td>2200</td><td>implementation</td><td><a href=https://codeforces.com/contest/51/submission/231965>Delphi</a></td><td>28 December 2010 16:35:24</td></tr><tr><td>111</td><td><a href=https://codeforces.com/contest/51/problem/C>Three Base Stations</a></td><td>C</td><td>1800</td><td>binary search, greedy</td><td><a href=https://codeforces.com/contest/51/submission/231526>Delphi</a></td><td>28 December 2010 16:16:54</td></tr><tr><td>110</td><td><a href=https://codeforces.com/contest/51/problem/B>bHTML Tables Analisys</a></td><td>B</td><td>1700</td><td>expression parsing</td><td><a href=https://codeforces.com/contest/51/submission/231286>Delphi</a></td><td>28 December 2010 16:07:56</td></tr><tr><td>109</td><td><a href=https://codeforces.com/contest/51/problem/A>Cheaterius's Problem</a></td><td>A</td><td>1300</td><td>implementation</td><td><a href=https://codeforces.com/contest/51/submission/231222>Delphi</a></td><td>28 December 2010 16:03:38</td></tr><tr><td>108</td><td><a href=https://codeforces.com/contest/50/problem/C>Happy Farm 5</a></td><td>C</td><td>2000</td><td>geometry</td><td><a href=https://codeforces.com/contest/50/submission/227503>Delphi</a></td><td>20 December 2010 17:03:56</td></tr><tr><td>107</td><td><a href=https://codeforces.com/contest/50/problem/D>Bombing</a></td><td>D</td><td>2100</td><td>binary search, dp, probabilities</td><td><a href=https://codeforces.com/contest/50/submission/227374>Delphi</a></td><td>20 December 2010 16:57:52</td></tr><tr><td>106</td><td><a href=https://codeforces.com/contest/50/problem/E>Square Equation Roots</a></td><td>E</td><td>2300</td><td>math</td><td><a href=https://codeforces.com/contest/50/submission/227046>Delphi</a></td><td>20 December 2010 16:39:16</td></tr><tr><td>105</td><td><a href=https://codeforces.com/contest/50/problem/B>Choosing Symbol Pairs</a></td><td>B</td><td>1500</td><td>strings</td><td><a href=https://codeforces.com/contest/50/submission/226131>Delphi</a></td><td>20 December 2010 16:24:14</td></tr><tr><td>104</td><td><a href=https://codeforces.com/contest/50/problem/A>Domino piling</a></td><td>A</td><td>800</td><td>greedy, math</td><td><a href=https://codeforces.com/contest/50/submission/225875>Delphi</a></td><td>20 December 2010 16:21:58</td></tr><tr><td>103</td><td><a href=https://codeforces.com/contest/46/problem/F>Hercule Poirot Problem</a></td><td>F</td><td>2300</td><td>dsu, graphs</td><td><a href=https://codeforces.com/contest/46/submission/208902>Delphi</a></td><td>05 December 2010 09:22:30</td></tr><tr><td>102</td><td><a href=https://codeforces.com/contest/46/problem/G>Emperor's Problem</a></td><td>G</td><td>2500</td><td>geometry</td><td><a href=https://codeforces.com/contest/46/submission/208494>Delphi</a></td><td>05 December 2010 09:06:43</td></tr><tr><td>101</td><td><a href=https://codeforces.com/contest/46/problem/D>Parking Lot</a></td><td>D</td><td>1800</td><td>data structures, implementation</td><td><a href=https://codeforces.com/contest/46/submission/206944>Delphi</a></td><td>05 December 2010 08:20:41</td></tr><tr><td>100</td><td><a href=https://codeforces.com/contest/46/problem/E>Comb</a></td><td>E</td><td>1900</td><td>data structures, dp</td><td><a href=https://codeforces.com/contest/46/submission/206566>Delphi</a></td><td>05 December 2010 08:13:18</td></tr><tr><td>99</td><td><a href=https://codeforces.com/contest/46/problem/A>Ball Game</a></td><td>A</td><td>800</td><td>brute force, implementation</td><td><a href=https://codeforces.com/contest/46/submission/206251>Delphi</a></td><td>05 December 2010 08:09:09</td></tr><tr><td>98</td><td><a href=https://codeforces.com/contest/46/problem/B>T-shirts from Sponsor</a></td><td>B</td><td>1100</td><td>implementation</td><td><a href=https://codeforces.com/contest/46/submission/206222>Delphi</a></td><td>05 December 2010 08:08:06</td></tr><tr><td>97</td><td><a href=https://codeforces.com/contest/46/problem/C>Hamsters and Tigers</a></td><td>C</td><td>1600</td><td>two pointers</td><td><a href=https://codeforces.com/contest/46/submission/206176>Delphi</a></td><td>05 December 2010 08:04:43</td></tr><tr><td>96</td><td><a href=https://codeforces.com/contest/42/problem/B>Game of chess unfinished</a></td><td>B</td><td>1700</td><td>implementation</td><td><a href=https://codeforces.com/contest/42/submission/198344>Delphi</a></td><td>18 November 2010 17:35:29</td></tr><tr><td>95</td><td><a href=https://codeforces.com/contest/42/problem/E>Baldman and the military</a></td><td>E</td><td>2700</td><td>dfs and similar, graphs, trees</td><td><a href=https://codeforces.com/contest/42/submission/198036>Delphi</a></td><td>18 November 2010 17:16:26</td></tr><tr><td>94</td><td><a href=https://codeforces.com/contest/42/problem/C>Safe cracking</a></td><td>C</td><td>2200</td><td>brute force, constructive algorithms</td><td><a href=https://codeforces.com/contest/42/submission/197927>Delphi</a></td><td>18 November 2010 17:10:38</td></tr><tr><td>93</td><td><a href=https://codeforces.com/contest/42/problem/D>Strange town</a></td><td>D</td><td>2300</td><td>constructive algorithms, math</td><td><a href=https://codeforces.com/contest/42/submission/197286>Delphi</a></td><td>18 November 2010 16:39:46</td></tr><tr><td>92</td><td><a href=https://codeforces.com/contest/42/problem/A>Guilty --- to the kitchen!</a></td><td>A</td><td>1400</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/42/submission/196493>Delphi</a></td><td>18 November 2010 16:07:12</td></tr><tr><td>91</td><td><a href=https://codeforces.com/contest/45/problem/F>Goats and Wolves</a></td><td>F</td><td>2500</td><td>greedy</td><td><a href=https://codeforces.com/contest/45/submission/193696>Delphi</a></td><td>13 November 2010 13:42:26</td></tr><tr><td>90</td><td><a href=https://codeforces.com/contest/45/problem/B>School</a></td><td>B</td><td>2200</td><td>dp, dsu</td><td><a href=https://codeforces.com/contest/45/submission/194575>Delphi</a></td><td>13 November 2010 15:07:13</td></tr><tr><td>89</td><td><a href=https://codeforces.com/contest/45/problem/H>Road Problem</a></td><td>H</td><td>2100</td><td>graphs</td><td><a href=https://codeforces.com/contest/45/submission/194186>Delphi</a></td><td>13 November 2010 14:25:18</td></tr><tr><td>88</td><td><a href=https://codeforces.com/contest/45/problem/E>Director</a></td><td>E</td><td>2000</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/45/submission/193320>Delphi</a></td><td>13 November 2010 13:17:23</td></tr><tr><td>87</td><td><a href=https://codeforces.com/contest/45/problem/C>Dancing Lessons</a></td><td>C</td><td>1900</td><td>data structures</td><td><a href=https://codeforces.com/contest/45/submission/193250>Delphi</a></td><td>13 November 2010 13:11:54</td></tr><tr><td>86</td><td><a href=https://codeforces.com/contest/45/problem/G>Prime Problem</a></td><td>G</td><td>2200</td><td>number theory</td><td><a href=https://codeforces.com/contest/45/submission/192694>Delphi</a></td><td>13 November 2010 12:37:01</td></tr><tr><td>85</td><td><a href=https://codeforces.com/contest/45/problem/J>Planting Trees</a></td><td>J</td><td>1800</td><td>constructive algorithms</td><td><a href=https://codeforces.com/contest/45/submission/192510>Delphi</a></td><td>13 November 2010 12:25:57</td></tr><tr><td>84</td><td><a href=https://codeforces.com/contest/45/problem/I>TCMCF+++</a></td><td>I</td><td>1400</td><td>greedy</td><td><a href=https://codeforces.com/contest/45/submission/192327>Delphi</a></td><td>13 November 2010 12:16:01</td></tr><tr><td>83</td><td><a href=https://codeforces.com/contest/45/problem/D>Event Dates</a></td><td>D</td><td>1900</td><td>greedy, meet-in-the-middle, sortings</td><td><a href=https://codeforces.com/contest/45/submission/192238>Delphi</a></td><td>13 November 2010 12:11:31</td></tr><tr><td>82</td><td><a href=https://codeforces.com/contest/45/problem/A>Codecraft III</a></td><td>A</td><td>900</td><td>implementation</td><td><a href=https://codeforces.com/contest/45/submission/192169>Delphi</a></td><td>13 November 2010 12:08:16</td></tr><tr><td>81</td><td><a href=https://codeforces.com/contest/44/problem/G>Shooting Gallery</a></td><td>G</td><td>2500</td><td>data structures, implementation</td><td><a href=https://codeforces.com/contest/44/submission/183725>Delphi</a></td><td>06 November 2010 13:52:27</td></tr><tr><td>80</td><td><a href=https://codeforces.com/contest/44/problem/I>Toys</a></td><td>I</td><td>2300</td><td>brute force, combinatorics</td><td><a href=https://codeforces.com/contest/44/submission/182668>Delphi</a></td><td>06 November 2010 12:15:46</td></tr><tr><td>79</td><td><a href=https://codeforces.com/contest/44/problem/J>Triminoes</a></td><td>J</td><td>2000</td><td>constructive algorithms, greedy</td><td><a href=https://codeforces.com/contest/44/submission/182281>Delphi</a></td><td>06 November 2010 11:53:53</td></tr><tr><td>78</td><td><a href=https://codeforces.com/contest/44/problem/D>Hyperdrive</a></td><td>D</td><td>1800</td><td>math</td><td><a href=https://codeforces.com/contest/44/submission/181646>Delphi</a></td><td>06 November 2010 11:22:07</td></tr><tr><td>77</td><td><a href=https://codeforces.com/contest/44/problem/H>Phone Number</a></td><td>H</td><td>1700</td><td>dp</td><td><a href=https://codeforces.com/contest/44/submission/181455>Delphi</a></td><td>06 November 2010 11:13:46</td></tr><tr><td>76</td><td><a href=https://codeforces.com/contest/44/problem/E>Anfisa the Monkey</a></td><td>E</td><td>1400</td><td>dp</td><td><a href=https://codeforces.com/contest/44/submission/181340>Delphi</a></td><td>06 November 2010 11:09:34</td></tr><tr><td>75</td><td><a href=https://codeforces.com/contest/44/problem/C>Holidays</a></td><td>C</td><td>1300</td><td>implementation</td><td><a href=https://codeforces.com/contest/44/submission/181231>Delphi</a></td><td>06 November 2010 11:05:15</td></tr><tr><td>74</td><td><a href=https://codeforces.com/contest/44/problem/B>Cola</a></td><td>B</td><td>1500</td><td>implementation</td><td><a href=https://codeforces.com/contest/44/submission/181199>Delphi</a></td><td>06 November 2010 11:03:34</td></tr><tr><td>73</td><td><a href=https://codeforces.com/contest/44/problem/A>Indian Summer</a></td><td>A</td><td>900</td><td>implementation</td><td><a href=https://codeforces.com/contest/44/submission/181168>Delphi</a></td><td>06 November 2010 11:01:46</td></tr><tr><td>72</td><td><a href=https://codeforces.com/contest/40/problem/E>Number Table</a></td><td>E</td><td>2500</td><td>combinatorics</td><td><a href=https://codeforces.com/contest/40/submission/178836>Delphi</a></td><td>05 November 2010 16:44:02</td></tr><tr><td>71</td><td><a href=https://codeforces.com/contest/40/problem/C>Berland Square</a></td><td>C</td><td>2300</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/40/submission/179486>Delphi</a></td><td>05 November 2010 17:19:37</td></tr><tr><td>70</td><td><a href=https://codeforces.com/contest/40/problem/D>Interesting Sequence</a></td><td>D</td><td>2600</td><td>math</td><td><a href=https://codeforces.com/contest/40/submission/179344>Delphi</a></td><td>05 November 2010 17:09:57</td></tr><tr><td>69</td><td><a href=https://codeforces.com/contest/40/problem/B>Repaintings</a></td><td>B</td><td>1600</td><td>math</td><td><a href=https://codeforces.com/contest/40/submission/177740>Delphi</a></td><td>05 November 2010 16:08:40</td></tr><tr><td>68</td><td><a href=https://codeforces.com/contest/40/problem/A>Find Color</a></td><td>A</td><td>1300</td><td>constructive algorithms, geometry, implementation, math</td><td><a href=https://codeforces.com/contest/40/submission/177581>Delphi</a></td><td>05 November 2010 16:03:59</td></tr><tr><td>67</td><td><a href=https://codeforces.com/contest/38/problem/H>The Great Marathon</a></td><td>H</td><td>2400</td><td>dp</td><td><a href=https://codeforces.com/contest/38/submission/173421>Delphi</a></td><td>30 October 2010 13:51:00</td></tr><tr><td>66</td><td><a href=https://codeforces.com/contest/38/problem/G>Queue</a></td><td>G</td><td>2300</td><td>data structures</td><td><a href=https://codeforces.com/contest/38/submission/172928>Delphi</a></td><td>30 October 2010 13:27:17</td></tr><tr><td>65</td><td><a href=https://codeforces.com/contest/38/problem/F>Smart Boy</a></td><td>F</td><td>2100</td><td>dp, games, strings</td><td><a href=https://codeforces.com/contest/38/submission/171950>Delphi</a></td><td>30 October 2010 12:48:33</td></tr><tr><td>64</td><td><a href=https://codeforces.com/contest/38/problem/E>Let's Go Rolling!</a></td><td>E</td><td>1800</td><td>dp, sortings</td><td><a href=https://codeforces.com/contest/38/submission/170950>Delphi</a></td><td>30 October 2010 12:16:59</td></tr><tr><td>63</td><td><a href=https://codeforces.com/contest/38/problem/D>Vasya the Architect</a></td><td>D</td><td>1900</td><td>implementation</td><td><a href=https://codeforces.com/contest/38/submission/170802>Delphi</a></td><td>30 October 2010 12:12:29</td></tr><tr><td>62</td><td><a href=https://codeforces.com/contest/38/problem/C>Blinds</a></td><td>C</td><td>1400</td><td>brute force</td><td><a href=https://codeforces.com/contest/38/submission/170531>Delphi</a></td><td>30 October 2010 12:06:35</td></tr><tr><td>61</td><td><a href=https://codeforces.com/contest/38/problem/B>Chess</a></td><td>B</td><td>1200</td><td>brute force, implementation, math</td><td><a href=https://codeforces.com/contest/38/submission/170374>Delphi</a></td><td>30 October 2010 12:03:58</td></tr><tr><td>60</td><td><a href=https://codeforces.com/contest/38/problem/A>Army</a></td><td>A</td><td>800</td><td>implementation</td><td><a href=https://codeforces.com/contest/38/submission/170294>Delphi</a></td><td>30 October 2010 12:01:41</td></tr><tr><td>59</td><td><a href=https://codeforces.com/contest/37/problem/D>Lesson Timetable</a></td><td>D</td><td>2300</td><td>combinatorics, dp, math</td><td><a href=https://codeforces.com/contest/37/submission/167166>Delphi</a></td><td>25 October 2010 16:03:02</td></tr><tr><td>58</td><td><a href=https://codeforces.com/contest/37/problem/C>Old Berland Language</a></td><td>C</td><td>1900</td><td>data structures, greedy, trees</td><td><a href=https://codeforces.com/contest/37/submission/166680>Delphi</a></td><td>25 October 2010 15:46:38</td></tr><tr><td>57</td><td><a href=https://codeforces.com/contest/37/problem/B>Computer Game</a></td><td>B</td><td>1800</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/37/submission/165840>Delphi</a></td><td>25 October 2010 15:13:12</td></tr><tr><td>56</td><td><a href=https://codeforces.com/contest/37/problem/A>Towers</a></td><td>A</td><td>1000</td><td>sortings</td><td><a href=https://codeforces.com/contest/37/submission/165296>Delphi</a></td><td>25 October 2010 15:02:39</td></tr><tr><td>55</td><td><a href=https://codeforces.com/contest/39/problem/K>Testing</a></td><td>K</td><td>2600</td><td></td><td><a href=https://codeforces.com/contest/39/submission/162731>Delphi</a></td><td>24 October 2010 10:38:22</td></tr><tr><td>54</td><td><a href=https://codeforces.com/contest/39/problem/I>Tram</a></td><td>I</td><td>2500</td><td></td><td><a href=https://codeforces.com/contest/39/submission/162242>Delphi</a></td><td>24 October 2010 09:47:57</td></tr><tr><td>53</td><td><a href=https://codeforces.com/contest/39/problem/G>Inverse Function</a></td><td>G</td><td>2400</td><td>implementation</td><td><a href=https://codeforces.com/contest/39/submission/162039>Delphi</a></td><td>24 October 2010 09:23:26</td></tr><tr><td>52</td><td><a href=https://codeforces.com/contest/39/problem/A>C*++ Calculations</a></td><td>A</td><td>2000</td><td>expression parsing, greedy</td><td><a href=https://codeforces.com/contest/39/submission/161290>Delphi</a></td><td>24 October 2010 08:17:51</td></tr><tr><td>51</td><td><a href=https://codeforces.com/contest/39/problem/E>What Has Dirichlet Got to Do with That?</a></td><td>E</td><td>2000</td><td>dp, games</td><td><a href=https://codeforces.com/contest/39/submission/161076>Delphi</a></td><td>24 October 2010 08:02:50</td></tr><tr><td>50</td><td><a href=https://codeforces.com/contest/39/problem/C>Moon Craters</a></td><td>C</td><td>2100</td><td>dp, sortings</td><td><a href=https://codeforces.com/contest/39/submission/160728>Delphi</a></td><td>24 October 2010 07:41:34</td></tr><tr><td>49</td><td><a href=https://codeforces.com/contest/39/problem/F>Pacifist frogs</a></td><td>F</td><td>1300</td><td>implementation</td><td><a href=https://codeforces.com/contest/39/submission/160477>Delphi</a></td><td>24 October 2010 07:29:38</td></tr><tr><td>48</td><td><a href=https://codeforces.com/contest/39/problem/J>Spelling Check</a></td><td>J</td><td>1500</td><td>hashing, implementation, strings</td><td><a href=https://codeforces.com/contest/39/submission/160253>Delphi</a></td><td>24 October 2010 07:20:38</td></tr><tr><td>47</td><td><a href=https://codeforces.com/contest/39/problem/H>Multiplication Table</a></td><td>H</td><td>1300</td><td>implementation</td><td><a href=https://codeforces.com/contest/39/submission/160186>Delphi</a></td><td>24 October 2010 07:16:58</td></tr><tr><td>46</td><td><a href=https://codeforces.com/contest/39/problem/D>Cubical Planet</a></td><td>D</td><td>1100</td><td>math</td><td><a href=https://codeforces.com/contest/39/submission/160156>Delphi</a></td><td>24 October 2010 07:14:57</td></tr><tr><td>45</td><td><a href=https://codeforces.com/contest/39/problem/B>Company Income Growth</a></td><td>B</td><td>1300</td><td>greedy</td><td><a href=https://codeforces.com/contest/39/submission/160145>Delphi</a></td><td>24 October 2010 07:12:17</td></tr><tr><td>44</td><td><a href=https://codeforces.com/contest/33/problem/E>Helper</a></td><td>E</td><td>2600</td><td></td><td><a href=https://codeforces.com/contest/33/submission/143381>Delphi</a></td><td>07 October 2010 15:55:36</td></tr><tr><td>43</td><td><a href=https://codeforces.com/contest/33/problem/D>Knights</a></td><td>D</td><td>2000</td><td>geometry, graphs, shortest paths, sortings</td><td><a href=https://codeforces.com/contest/33/submission/142284>Delphi</a></td><td>07 October 2010 15:23:29</td></tr><tr><td>42</td><td><a href=https://codeforces.com/contest/33/problem/C>Wonderful Randomized Sum</a></td><td>C</td><td>1800</td><td>greedy</td><td><a href=https://codeforces.com/contest/33/submission/141949>Delphi</a></td><td>07 October 2010 15:14:13</td></tr><tr><td>41</td><td><a href=https://codeforces.com/contest/33/problem/A>What is for dinner?</a></td><td>A</td><td>1200</td><td>greedy, implementation</td><td><a href=https://codeforces.com/contest/33/submission/141731>Delphi</a></td><td>07 October 2010 15:08:59</td></tr><tr><td>40</td><td><a href=https://codeforces.com/contest/33/problem/B>String Problem</a></td><td>B</td><td>1800</td><td>shortest paths</td><td><a href=https://codeforces.com/contest/33/submission/141602>Delphi</a></td><td>07 October 2010 15:06:02</td></tr><tr><td>39</td><td><a href=https://codeforces.com/contest/28/problem/A>Bender Problem</a></td><td>A</td><td>1600</td><td>implementation</td><td><a href=https://codeforces.com/contest/28/submission/122374>Delphi</a></td><td>17 September 2010 15:26:37</td></tr><tr><td>38</td><td><a href=https://codeforces.com/contest/28/problem/C>Bath Queue</a></td><td>C</td><td>2200</td><td>combinatorics, dp, probabilities</td><td><a href=https://codeforces.com/contest/28/submission/122318>Delphi</a></td><td>17 September 2010 15:20:00</td></tr><tr><td>37</td><td><a href=https://codeforces.com/contest/28/problem/B>pSort</a></td><td>B</td><td>1600</td><td>dfs and similar, dsu, graphs</td><td><a href=https://codeforces.com/contest/28/submission/122267>Delphi</a></td><td>17 September 2010 15:08:02</td></tr><tr><td>36</td><td><a href=https://codeforces.com/contest/24/problem/E>Berland collider</a></td><td>E</td><td>2300</td><td>binary search</td><td><a href=https://codeforces.com/contest/24/submission/103129>Delphi</a></td><td>26 July 2010 14:29:06</td></tr><tr><td>35</td><td><a href=https://codeforces.com/contest/24/problem/C>Sequence of points</a></td><td>C</td><td>1800</td><td>geometry, implementation, math</td><td><a href=https://codeforces.com/contest/24/submission/101328>Delphi</a></td><td>26 July 2010 13:18:59</td></tr><tr><td>34</td><td><a href=https://codeforces.com/contest/24/problem/A>Ring road</a></td><td>A</td><td>1400</td><td>graphs</td><td><a href=https://codeforces.com/contest/24/submission/101176>Delphi</a></td><td>26 July 2010 13:10:37</td></tr><tr><td>33</td><td><a href=https://codeforces.com/contest/24/problem/B>F1 Champions</a></td><td>B</td><td>1500</td><td>implementation</td><td><a href=https://codeforces.com/contest/24/submission/101112>Delphi</a></td><td>26 July 2010 13:07:26</td></tr><tr><td>32</td><td><a href=https://codeforces.com/contest/23/problem/E>Tree</a></td><td>E</td><td>2500</td><td>dp</td><td><a href=https://codeforces.com/contest/23/submission/98637>Delphi</a></td><td>09 July 2010 16:08:12</td></tr><tr><td>31</td><td><a href=https://codeforces.com/contest/23/problem/A>You're Given a String...</a></td><td>A</td><td>1200</td><td>brute force, greedy</td><td><a href=https://codeforces.com/contest/23/submission/97171>Delphi</a></td><td>09 July 2010 15:01:28</td></tr><tr><td>30</td><td><a href=https://codeforces.com/contest/21/problem/D>Traveling Graph</a></td><td>D</td><td>2400</td><td>bitmasks, graph matchings, graphs</td><td><a href=https://codeforces.com/contest/21/submission/92236>Delphi</a></td><td>28 June 2010 15:51:32</td></tr><tr><td>29</td><td><a href=https://codeforces.com/contest/21/problem/B>Intersection</a></td><td>B</td><td>2000</td><td>implementation, math</td><td><a href=https://codeforces.com/contest/21/submission/92166>Delphi</a></td><td>28 June 2010 15:31:08</td></tr><tr><td>28</td><td><a href=https://codeforces.com/contest/21/problem/C>Stripe 2</a></td><td>C</td><td>2000</td><td>binary search, dp, sortings</td><td><a href=https://codeforces.com/contest/21/submission/91035>Delphi</a></td><td>28 June 2010 13:20:02</td></tr><tr><td>27</td><td><a href=https://codeforces.com/contest/21/problem/A>Jabber ID</a></td><td>A</td><td>1900</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/21/submission/90961>Delphi</a></td><td>28 June 2010 13:12:14</td></tr><tr><td>26</td><td><a href=https://codeforces.com/contest/19/problem/E>Fairy</a></td><td>E</td><td>2900</td><td>dfs and similar, divide and conquer, dsu</td><td><a href=https://codeforces.com/contest/19/submission/88480>Delphi</a></td><td>24 June 2010 16:34:46</td></tr><tr><td>25</td><td><a href=https://codeforces.com/contest/19/problem/C>Deletion of Repeats</a></td><td>C</td><td>2200</td><td>greedy, hashing, string suffix structures</td><td><a href=https://codeforces.com/contest/19/submission/87216>Delphi</a></td><td>24 June 2010 15:37:29</td></tr><tr><td>24</td><td><a href=https://codeforces.com/contest/19/problem/A>World Football Cup</a></td><td>A</td><td>1400</td><td>implementation</td><td><a href=https://codeforces.com/contest/19/submission/86678>Delphi</a></td><td>24 June 2010 15:14:54</td></tr><tr><td>23</td><td><a href=https://codeforces.com/contest/19/problem/B>Checkout Assistant</a></td><td>B</td><td>1900</td><td>dp</td><td><a href=https://codeforces.com/contest/19/submission/86568>Delphi</a></td><td>24 June 2010 15:06:34</td></tr><tr><td>22</td><td><a href=https://codeforces.com/contest/16/problem/D>Logging</a></td><td>D</td><td>1900</td><td>implementation, strings</td><td><a href=https://codeforces.com/contest/16/submission/69874>Delphi</a></td><td>03 June 2010 13:16:27</td></tr><tr><td>21</td><td><a href=https://codeforces.com/contest/16/problem/E>Fish</a></td><td>E</td><td>1900</td><td>bitmasks, dp, probabilities</td><td><a href=https://codeforces.com/contest/16/submission/69700>Delphi</a></td><td>03 June 2010 13:11:35</td></tr><tr><td>20</td><td><a href=https://codeforces.com/contest/16/problem/C>Monitor</a></td><td>C</td><td>1800</td><td>binary search, number theory</td><td><a href=https://codeforces.com/contest/16/submission/69548>Delphi</a></td><td>03 June 2010 13:06:59</td></tr><tr><td>19</td><td><a href=https://codeforces.com/contest/16/problem/B>Burglar and Matches</a></td><td>B</td><td>900</td><td>greedy, implementation, sortings</td><td><a href=https://codeforces.com/contest/16/submission/69460>Delphi</a></td><td>03 June 2010 13:03:51</td></tr><tr><td>18</td><td><a href=https://codeforces.com/contest/16/problem/A>Flag</a></td><td>A</td><td>800</td><td>implementation</td><td><a href=https://codeforces.com/contest/16/submission/69426>Delphi</a></td><td>03 June 2010 13:01:37</td></tr><tr><td>17</td><td><a href=https://codeforces.com/contest/15/problem/B>Laser</a></td><td>B</td><td>1800</td><td>math</td><td><a href=https://codeforces.com/contest/15/submission/65213>Delphi</a></td><td>29 May 2010 15:21:35</td></tr><tr><td>16</td><td><a href=https://codeforces.com/contest/15/problem/C>Industrial Nim</a></td><td>C</td><td>2000</td><td>games</td><td><a href=https://codeforces.com/contest/15/submission/65227>Delphi</a></td><td>29 May 2010 15:21:41</td></tr><tr><td>15</td><td><a href=https://codeforces.com/contest/15/problem/E>Triangles</a></td><td>E</td><td>2600</td><td>combinatorics, dp</td><td><a href=https://codeforces.com/contest/15/submission/65699>Delphi</a></td><td>29 May 2010 15:39:03</td></tr><tr><td>14</td><td><a href=https://codeforces.com/contest/15/problem/D>Map</a></td><td>D</td><td>2500</td><td>data structures, implementation, sortings</td><td><a href=https://codeforces.com/contest/15/submission/66031>Delphi</a></td><td>29 May 2010 15:57:32</td></tr><tr><td>13</td><td><a href=https://codeforces.com/contest/15/problem/A>Cottage Village</a></td><td>A</td><td>1200</td><td>implementation, sortings</td><td><a href=https://codeforces.com/contest/15/submission/65192>Delphi</a></td><td>29 May 2010 15:21:23</td></tr><tr><td>12</td><td><a href=https://codeforces.com/contest/13/problem/C>Sequence</a></td><td>C</td><td>2200</td><td>dp, sortings</td><td><a href=https://codeforces.com/contest/13/submission/56502>Delphi</a></td><td>06 May 2010 14:29:42</td></tr><tr><td>11</td><td><a href=https://codeforces.com/contest/13/problem/B>Letter A</a></td><td>B</td><td>2000</td><td>geometry, implementation</td><td><a href=https://codeforces.com/contest/13/submission/56172>Delphi</a></td><td>06 May 2010 14:13:19</td></tr><tr><td>10</td><td><a href=https://codeforces.com/contest/10/problem/C>Digital Root</a></td><td>C</td><td>2000</td><td>number theory</td><td><a href=https://codeforces.com/contest/10/submission/43384>Delphi</a></td><td>15 April 2010 16:00:12</td></tr><tr><td>9</td><td><a href=https://codeforces.com/contest/10/problem/B>Cinema Cashier</a></td><td>B</td><td>1500</td><td>dp, implementation</td><td><a href=https://codeforces.com/contest/10/submission/43251>Delphi</a></td><td>15 April 2010 15:55:11</td></tr><tr><td>8</td><td><a href=https://codeforces.com/contest/10/problem/A>Power Consumption Calculation</a></td><td>A</td><td>900</td><td>implementation</td><td><a href=https://codeforces.com/contest/10/submission/43119>Delphi</a></td><td>15 April 2010 15:47:49</td></tr><tr><td>7</td><td><a href=https://codeforces.com/contest/8/problem/E>Beads</a></td><td>E</td><td>2600</td><td>dp, graphs</td><td><a href=https://codeforces.com/contest/8/submission/36668>Delphi</a></td><td>08 April 2010 17:33:43</td></tr><tr><td>6</td><td><a href=https://codeforces.com/contest/8/problem/C>Looking for Order</a></td><td>C</td><td>2000</td><td>bitmasks, dp</td><td><a href=https://codeforces.com/contest/8/submission/34987>Delphi</a></td><td>08 April 2010 16:17:42</td></tr><tr><td>5</td><td><a href=https://codeforces.com/contest/8/problem/B>Obsession with Robots</a></td><td>B</td><td>1400</td><td>constructive algorithms, graphs, implementation</td><td><a href=https://codeforces.com/contest/8/submission/34203>Delphi</a></td><td>08 April 2010 15:56:37</td></tr><tr><td>4</td><td><a href=https://codeforces.com/contest/8/problem/A>Train and Peter</a></td><td>A</td><td>1200</td><td>strings</td><td><a href=https://codeforces.com/contest/8/submission/34121>Delphi</a></td><td>08 April 2010 15:52:31</td></tr><tr><td>3</td><td><a href=https://codeforces.com/contest/5/problem/C>Longest Regular Bracket Sequence</a></td><td>C</td><td>1900</td><td>constructive algorithms, data structures, dp, greedy, sortings, strings</td><td><a href=https://codeforces.com/contest/5/submission/24745>Delphi</a></td><td>26 March 2010 13:22:01</td></tr><tr><td>2</td><td><a href=https://codeforces.com/contest/2/problem/B>The least round way</a></td><td>B</td><td>2000</td><td>dp, math</td><td><a href=https://codeforces.com/contest/2/submission/7531>Delphi</a></td><td>25 February 2010 17:36:08</td></tr><tr><td>1</td><td><a href=https://codeforces.com/contest/2/problem/A>Winner</a></td><td>A</td><td>1500</td><td>hashing, implementation</td><td><a href=https://codeforces.com/contest/2/submission/7331>Delphi</a></td><td>25 February 2010 17:13:34</td></tr></table>
diff --git a/cpTool/__main__.py b/cpTool/__main__.py
index 4604abe..5cab213 100644
--- a/cpTool/__main__.py
+++ b/cpTool/__main__.py
@@ -3,7 +3,7 @@
 import subprocess as sp
 import optparse as op
 
-import cpTool.customModules.readmeFIleGenerator as readme
+import cpTool.customModules.readmeFileGenerator as readme
 import cpTool.git as git
 import cpTool.api as api
 
diff --git a/cpTool/customModules/readmeFIleGenerator.py b/cpTool/customModules/readmeFileGenerator.py
similarity index 100%
rename from cpTool/customModules/readmeFIleGenerator.py
rename to cpTool/customModules/readmeFileGenerator.py