https://blog.youkuaiyun.com/github_35095990zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/github_35095990/article/details/51793220https://blog.youkuaiyun.com/github_35095990/article/details/51793220github_35095990Thu, 30 Jun 2016 20:36:27 +0800 #include using namespace std; int main() { int n; cin >> n; int ** sum = new int*[n]; sum[0] = new int; cin >> sum[0][0]; for (int i = 1; i]]>https://blog.youkuaiyun.com/github_35095990/article/details/51782276https://blog.youkuaiyun.com/github_35095990/article/details/51782276github_35095990Wed, 29 Jun 2016 13:02:03 +0800https://blog.youkuaiyun.com/github_35095990/article/details/51774985https://blog.youkuaiyun.com/github_35095990/article/details/51774985github_35095990Tue, 28 Jun 2016 12:11:19 +0800https://blog.youkuaiyun.com/github_35095990/article/details/51773959https://blog.youkuaiyun.com/github_35095990/article/details/51773959github_35095990Tue, 28 Jun 2016 10:24:15 +0800https://blog.youkuaiyun.com/github_35095990/article/details/51501285https://blog.youkuaiyun.com/github_35095990/article/details/51501285github_35095990Wed, 25 May 2016 20:05:40 +0800 using namespace std;class BinaryTree { private: struct treenode{ int key; treenode *left, *right; treenode (int k, treenode *l = 0, t]]>https://blog.youkuaiyun.com/github_35095990/article/details/51484605https://blog.youkuaiyun.com/github_35095990/article/details/51484605github_35095990Mon, 23 May 2016 20:44:29 +0800 #include #include #include using std::cout; using std::endl; const int n = 80000;// bubblesort void bubble(int * a, int n) { for (int i = 0; i < n]]>