Pinned

1. Timus: DP Timus: DP

   1

   #include <iostream>

   2

   #include <cmath>

   3

   using namespace std;

   4

   5

   constexpr int MAXN = 1e3 + 1;

2. Timus: Data Structure Timus: Data Structure

   1

   // Source: http://acm.timus.ru/problem.aspx?space=1&num=1494

   2

   #include <iostream>

   3

   #include <stack>

   4

   using namespace std;

   5

3. LeetCode: Graph LeetCode: Graph

   1

   // Source: https://leetcode.com/problems/symmetric-tree/

   2

   /**

   3

    * Definition for a binary tree node.

   4

    * struct TreeNode {

   5

    *     int val;