<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>pres1dent.net</title><description>競技プログラミングのための日本語知識ベース</description><link>https://pres1dent.net/</link><item><title>データ構造</title><link>https://pres1dent.net/algorithm/data-structures/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/data-structures/</guid></item><item><title>セグメント木</title><link>https://pres1dent.net/algorithm/data-structures/segment-tree/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/data-structures/segment-tree/</guid></item><item><title>ダイクストラ法</title><link>https://pres1dent.net/algorithm/dijkstra/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/dijkstra/</guid></item><item><title>グラフ</title><link>https://pres1dent.net/algorithm/graph/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/graph/</guid></item><item><title>最短経路</title><link>https://pres1dent.net/algorithm/graph/shortest-path/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/graph/shortest-path/</guid></item><item><title>最短経路アルゴリズムの選び方</title><link>https://pres1dent.net/algorithm/graph/shortest-path/choosing-algorithm/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/graph/shortest-path/choosing-algorithm/</guid></item><item><title>アルゴリズム</title><link>https://pres1dent.net/algorithm/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/</guid></item><item><title>言語・実装</title><link>https://pres1dent.net/algorithm/languages/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/languages/</guid></item><item><title>Python 競技プログラミング実戦リファレンス</title><link>https://pres1dent.net/algorithm/languages/python-contest-reference/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/languages/python-contest-reference/</guid></item><item><title>数学</title><link>https://pres1dent.net/algorithm/mathematics/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/mathematics/</guid></item><item><title>包除原理</title><link>https://pres1dent.net/algorithm/mathematics/inclusion-exclusion/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/mathematics/inclusion-exclusion/</guid></item><item><title>典型テクニック</title><link>https://pres1dent.net/algorithm/techniques/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/techniques/</guid></item><item><title>答えで二分探索</title><link>https://pres1dent.net/algorithm/techniques/binary-search-answer/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/techniques/binary-search-answer/</guid></item><item><title>木の走査</title><link>https://pres1dent.net/algorithm/tree-traversal/</link><guid isPermaLink="true">https://pres1dent.net/algorithm/tree-traversal/</guid></item><item><title>ヒューリスティック</title><link>https://pres1dent.net/heuristic/</link><guid isPermaLink="true">https://pres1dent.net/heuristic/</guid></item><item><title>局所探索</title><link>https://pres1dent.net/heuristic/local-search/</link><guid isPermaLink="true">https://pres1dent.net/heuristic/local-search/</guid></item><item><title>メタヒューリスティクス</title><link>https://pres1dent.net/heuristic/local-search/meta-heuristics/</link><guid isPermaLink="true">https://pres1dent.net/heuristic/local-search/meta-heuristics/</guid></item><item><title>焼きなまし法</title><link>https://pres1dent.net/heuristic/local-search/meta-heuristics/simulated-annealing/</link><guid isPermaLink="true">https://pres1dent.net/heuristic/local-search/meta-heuristics/simulated-annealing/</guid></item></channel></rss>