https://blog.youkuaiyun.com/ustbjeromezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/ustbjerome/article/details/115879965https://blog.youkuaiyun.com/ustbjerome/article/details/115879965ustbjeromeTue, 20 Apr 2021 01:19:31 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79428573https://blog.youkuaiyun.com/ustbjerome/article/details/79428573ustbjeromeSat, 03 Mar 2018 10:25:50 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79421254https://blog.youkuaiyun.com/ustbjerome/article/details/79421254ustbjeromeFri, 02 Mar 2018 11:20:20 +0800 fdepth; v]]>https://blog.youkuaiyun.com/ustbjerome/article/details/79404719https://blog.youkuaiyun.com/ustbjerome/article/details/79404719ustbjeromeWed, 28 Feb 2018 19:46:26 +0800 a; string ss; int main(){ while (cin >> ss){ while(1){]]>https://blog.youkuaiyun.com/ustbjerome/article/details/79396817https://blog.youkuaiyun.com/ustbjerome/article/details/79396817ustbjeromeWed, 28 Feb 2018 10:05:00 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79393636https://blog.youkuaiyun.com/ustbjerome/article/details/79393636ustbjeromeTue, 27 Feb 2018 21:40:19 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79390084https://blog.youkuaiyun.com/ustbjerome/article/details/79390084ustbjeromeTue, 27 Feb 2018 16:26:14 +0800b?a:bint d[1005]; int cost[1005][1005]; int used]]>https://blog.youkuaiyun.com/ustbjerome/article/details/79234677https://blog.youkuaiyun.com/ustbjerome/article/details/79234677ustbjeromeFri, 02 Feb 2018 00:29:25 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79223609https://blog.youkuaiyun.com/ustbjerome/article/details/79223609ustbjeromeThu, 01 Feb 2018 01:11:33 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79216238https://blog.youkuaiyun.com/ustbjerome/article/details/79216238ustbjeromeWed, 31 Jan 2018 13:42:47 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79212537https://blog.youkuaiyun.com/ustbjerome/article/details/79212537ustbjeromeWed, 31 Jan 2018 00:54:29 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79177510https://blog.youkuaiyun.com/ustbjerome/article/details/79177510ustbjeromeFri, 26 Jan 2018 22:58:57 +0800 word; vectorint> a[10000]; bool dps(int i ,int s]]>https://blog.youkuaiyun.com/ustbjerome/article/details/79171559https://blog.youkuaiyun.com/ustbjerome/article/details/79171559ustbjeromeFri, 26 Jan 2018 13:55:44 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79162485https://blog.youkuaiyun.com/ustbjerome/article/details/79162485ustbjeromeThu, 25 Jan 2018 15:29:00 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79162290https://blog.youkuaiyun.com/ustbjerome/article/details/79162290ustbjeromeThu, 25 Jan 2018 15:17:26 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79145263https://blog.youkuaiyun.com/ustbjerome/article/details/79145263ustbjeromeTue, 23 Jan 2018 21:57:06 +0800 &a, const pairint,int> &b){ return a.second < b.]]>https://blog.youkuaiyun.com/ustbjerome/article/details/79145142https://blog.youkuaiyun.com/ustbjerome/article/details/79145142ustbjeromeTue, 23 Jan 2018 21:46:52 +0800 P; struct node { ll a; int b; char c; }N[10]; bool cmp1(const P &a, const P &b) { return a.first > b.first; }]]>https://blog.youkuaiyun.com/ustbjerome/article/details/79140783https://blog.youkuaiyun.com/ustbjerome/article/details/79140783ustbjeromeTue, 23 Jan 2018 15:53:26 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79137186https://blog.youkuaiyun.com/ustbjerome/article/details/79137186ustbjeromeTue, 23 Jan 2018 10:56:55 +0800https://blog.youkuaiyun.com/ustbjerome/article/details/79135122https://blog.youkuaiyun.com/ustbjerome/article/details/79135122ustbjeromeTue, 23 Jan 2018 00:41:52 +0800>count; while (cin>>a>>b && count--){ long long num1 = 1; long lon]]>