https://blog.youkuaiyun.com/Triosezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Triose/article/details/49998687https://blog.youkuaiyun.com/Triose/article/details/49998687TrioseMon, 23 Nov 2015 18:05:42 +0800https://blog.youkuaiyun.com/Triose/article/details/49873697https://blog.youkuaiyun.com/Triose/article/details/49873697TrioseMon, 16 Nov 2015 23:11:15 +0800https://blog.youkuaiyun.com/Triose/article/details/49641365https://blog.youkuaiyun.com/Triose/article/details/49641365TrioseWed, 04 Nov 2015 17:58:07 +0800https://blog.youkuaiyun.com/Triose/article/details/49021969https://blog.youkuaiyun.com/Triose/article/details/49021969TrioseSat, 10 Oct 2015 11:44:55 +0800https://blog.youkuaiyun.com/Triose/article/details/49002821https://blog.youkuaiyun.com/Triose/article/details/49002821TrioseFri, 09 Oct 2015 17:31:55 +0800https://blog.youkuaiyun.com/Triose/article/details/48415305https://blog.youkuaiyun.com/Triose/article/details/48415305TrioseSun, 13 Sep 2015 14:05:21 +0800https://blog.youkuaiyun.com/Triose/article/details/47781095https://blog.youkuaiyun.com/Triose/article/details/47781095TrioseWed, 19 Aug 2015 15:22:08 +0800https://blog.youkuaiyun.com/Triose/article/details/47421333https://blog.youkuaiyun.com/Triose/article/details/47421333TrioseTue, 11 Aug 2015 16:06:38 +0800https://blog.youkuaiyun.com/Triose/article/details/47357387https://blog.youkuaiyun.com/Triose/article/details/47357387TrioseSat, 08 Aug 2015 14:45:45 +0800https://blog.youkuaiyun.com/Triose/article/details/47122037https://blog.youkuaiyun.com/Triose/article/details/47122037TrioseThu, 30 Jul 2015 10:48:04 +0800https://blog.youkuaiyun.com/Triose/article/details/47087141https://blog.youkuaiyun.com/Triose/article/details/47087141TrioseMon, 27 Jul 2015 16:45:10 +0800https://blog.youkuaiyun.com/Triose/article/details/46972035https://blog.youkuaiyun.com/Triose/article/details/46972035TrioseMon, 20 Jul 2015 18:21:51 +0800https://blog.youkuaiyun.com/Triose/article/details/46967769https://blog.youkuaiyun.com/Triose/article/details/46967769TrioseMon, 20 Jul 2015 14:22:01 +0800 class priority_queue; T是数据类型，Container 是保留数据的容器，Functional是元素的比较方式。 Container必须是用数组实现的容器，比如vector,deque但是不能是list。 STL 里面容器默认的用的是vector，]]>https://blog.youkuaiyun.com/Triose/article/details/45950879https://blog.youkuaiyun.com/Triose/article/details/45950879TrioseSun, 24 May 2015 12:01:41 +0800https://blog.youkuaiyun.com/Triose/article/details/45044473https://blog.youkuaiyun.com/Triose/article/details/45044473TrioseTue, 14 Apr 2015 16:54:21 +0800https://blog.youkuaiyun.com/Triose/article/details/45044367https://blog.youkuaiyun.com/Triose/article/details/45044367TrioseTue, 14 Apr 2015 16:48:31 +0800https://blog.youkuaiyun.com/Triose/article/details/44204533https://blog.youkuaiyun.com/Triose/article/details/44204533TrioseWed, 11 Mar 2015 20:47:05 +0800https://blog.youkuaiyun.com/Triose/article/details/44096777https://blog.youkuaiyun.com/Triose/article/details/44096777TrioseFri, 06 Mar 2015 10:55:47 +0800https://blog.youkuaiyun.com/Triose/article/details/43958025https://blog.youkuaiyun.com/Triose/article/details/43958025TrioseThu, 26 Feb 2015 23:15:16 +0800https://blog.youkuaiyun.com/Triose/article/details/43954207https://blog.youkuaiyun.com/Triose/article/details/43954207TrioseThu, 26 Feb 2015 16:15:44 +0800=2可唯一分解成素数的乘积；（这是我寒假闲的蛋疼给自己出的题目，并不严密） 现在输入一个n（n 输入： 180 110 250 输出： 2 2 3 3 5 2 5 11 2 5 5 5 代码：#include #include #include using namespace std; #define N 10000 int p[N+10]; void screen]]>