<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[woniupengpeng的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/woniupengpeng</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; woniupengpeng]]></copyright><item><title><![CDATA[POJ 3602 Typographical Ligatures G++ 模拟]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/125209795</link><guid>https://blog.csdn.net/woniupengpeng/article/details/125209795</guid><author>woniupengpeng</author><pubDate>Thu, 09 Jun 2022 19:46:11 +0800</pubDate><description><![CDATA[POJ 3602 Typographical Ligatures G++ 模拟]]></description><category></category></item><item><title><![CDATA[POJ 3637 Shopaholic G++ 贪心]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/125208755</link><guid>https://blog.csdn.net/woniupengpeng/article/details/125208755</guid><author>woniupengpeng</author><pubDate>Thu, 09 Jun 2022 18:25:12 +0800</pubDate><description><![CDATA[POJ 3637 Shopaholic G++ 贪心]]></description><category></category></item><item><title><![CDATA[POJ 3632 Optimal Parking G++ 模拟]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/125203556</link><guid>https://blog.csdn.net/woniupengpeng/article/details/125203556</guid><author>woniupengpeng</author><pubDate>Thu, 09 Jun 2022 15:02:49 +0800</pubDate><description><![CDATA[POJ 3632 Optimal Parking G++ 模拟]]></description><category></category></item><item><title><![CDATA[POJ 3664 Election Time G++ 排序]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/125196271</link><guid>https://blog.csdn.net/woniupengpeng/article/details/125196271</guid><author>woniupengpeng</author><pubDate>Thu, 09 Jun 2022 08:36:48 +0800</pubDate><description><![CDATA[POJ 3664 Election Time G++ 排序]]></description><category></category></item><item><title><![CDATA[POJ 1957 Beehives C++ 模拟]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/124973365</link><guid>https://blog.csdn.net/woniupengpeng/article/details/124973365</guid><author>woniupengpeng</author><pubDate>Wed, 25 May 2022 20:44:47 +0800</pubDate><description><![CDATA[POJ 1957 Beehives C++ 模拟]]></description><category></category></item><item><title><![CDATA[python爬取孔夫子旧书网某一店铺所有书籍的书名 出版社 品相]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/120350122</link><guid>https://blog.csdn.net/woniupengpeng/article/details/120350122</guid><author>woniupengpeng</author><pubDate>Fri, 17 Sep 2021 15:45:48 +0800</pubDate><description><![CDATA[import requests
from lxml.html import etree
import time
for i in range(1,6):
    print('http://shop.kongfz.com/34186/new/0_50_0_0_{}_sort_desc_0_0/'.format(i))
    url='http://shop.kongfz.com/34186/new/0_50_0_0_{}_sort_desc_0_0/'.format(i)

    res = requ.]]></description><category></category></item><item><title><![CDATA[POJ 1991 Turning in Homework G++        动态规划       贪心    没掌握]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/109263548</link><guid>https://blog.csdn.net/woniupengpeng/article/details/109263548</guid><author>woniupengpeng</author><pubDate>Sat, 24 Oct 2020 18:20:53 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;utility&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
using namespace std;
//英语       看博友分析      抄博友程序       动态规划       贪心    没掌握
//贪心没掌握
int dp[1010][10...]]></description><category></category></item><item><title><![CDATA[POJ 1992 Jack G++       动态规划]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/109131579</link><guid>https://blog.csdn.net/woniupengpeng/article/details/109131579</guid><author>woniupengpeng</author><pubDate>Sat, 17 Oct 2020 13:05:56 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt; 
using namespace std;
//英语      抄博友程序      动态规划 
char da[1010][1010];
int dp[1010][1010];
int main()
{
	int T;
	//cin&gt;&gt;T;//TLE 
	scanf("%d",&amp;T);
	while(T--)
	{
		in...]]></description><category></category></item><item><title><![CDATA[POJ 1998 Lloyd Fifteen Puzzle G++    模拟    巧妙]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/109128451</link><guid>https://blog.csdn.net/woniupengpeng/article/details/109128451</guid><author>woniupengpeng</author><pubDate>Sat, 17 Oct 2020 08:39:19 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt; 
#include &lt;string&gt;
using namespace std;
//英语     抄博友程序    模拟    巧妙 
int da[1010][1010];
int dx[4]={-1,1,0,0};//抄博友程序 
int dy[4]={0,0,-1,1};
string nam[4]={"dolu","n...]]></description><category></category></item><item><title><![CDATA[POJ 1882 Stamps G++     完全背包      背]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/109010413</link><guid>https://blog.csdn.net/woniupengpeng/article/details/109010413</guid><author>woniupengpeng</author><pubDate>Sun, 11 Oct 2020 12:45:51 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt; 
#include &lt;algorithm&gt;
using namespace std;
//英语      看博友分析     抄博友程序       完全背包      背 
int a[20];//抄博友程序 
int out[20]; 
int dp[2010];
int res[3];//抄博友注释    0表示最优cove...]]></description><category></category></item><item><title><![CDATA[POJ 1959 Darts G++]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108913710</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108913710</guid><author>woniupengpeng</author><pubDate>Sat, 03 Oct 2020 21:32:17 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
using namespace std;
//英语     看博友分析    抄博友程序     枚举 
int da[63];
int main()
{
	da[0]=0;
	for(int i=1;i&lt;=20;i++)
	{
		da[i]=i;
		da[i+20]=i*2;
		da[i+40]=i*3;
	}
	da[61]=25;
	da[62]=50;
	int T;
	...]]></description><category></category></item><item><title><![CDATA[POJ 1874 Trade on Verweggistan G++     dfs    巧妙    没掌握]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108912230</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108912230</guid><author>woniupengpeng</author><pubDate>Sat, 03 Oct 2020 18:37:01 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;set&gt;
#include &lt;cstring&gt;
using namespace std;
//英语    看博友分析   抄博友程序    dfs    巧妙    没掌握 
int da[104][104];
int cnt[104];
int res[104][104];//抄博友程序 
int n;
set&lt;int&gt; se;
void...]]></description><category></category></item><item><title><![CDATA[POJ 1907 Work Reduction G++]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108903867</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108903867</guid><author>woniupengpeng</author><pubDate>Fri, 02 Oct 2020 18:53:50 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;string&gt;
#include &lt;sstream&gt;
#include &lt;algorithm&gt;
using namespace std;
//英语     抄博友程序    排序 
struct nod{
	string s;
	int num;
}da[100010];
bool cmp(nod a, nod b)
{
	if(a.num...]]></description><category></category></item><item><title><![CDATA[POJ 1926 Pollution G++      模拟未实现可能易理解     floyd实现       没掌握]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108880143</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108880143</guid><author>woniupengpeng</author><pubDate>Wed, 30 Sep 2020 09:43:21 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
using namespace std;
//英语     看博友分析     抄博友程序     模拟未实现可能易理解     floyd实现       没掌握 
//样例一与Figure-1相同    没掌握 
int g[104][104];
double c[104];
int du[104]; 
int vis[104];
int...]]></description><category></category></item><item><title><![CDATA[POJ 1896 Code Formatting G++       模拟       背]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108830752</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108830752</guid><author>woniupengpeng</author><pubDate>Sun, 27 Sep 2020 16:27:42 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;string&gt;
using namespace std;
//英语       看博友分析     抄博友程序      模拟       背        
int main()
{
	//freopen("1896.txt","r",stdin);
	int level=1;
	while(getchar()!='{');//抄博友程序 
	printf(...]]></description><category></category></item><item><title><![CDATA[POJ 1888 Crossword Answers G++ 模拟]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108825654</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108825654</guid><author>woniupengpeng</author><pubDate>Sun, 27 Sep 2020 12:40:36 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;vector&gt;
#include &lt;string&gt;
#include &lt;cstring&gt;
using namespace std;
//英语    看博友程序     抄博友程序      模拟    
char a1[20][20];
char a2[20][20];
int da[20][20]; 
struct nod{
	str...]]></description><category></category></item><item><title><![CDATA[POJ 1886 Borrowers G++        字符串处理巧妙       upper_bound使用      没掌握]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108804726</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108804726</guid><author>woniupengpeng</author><pubDate>Fri, 25 Sep 2020 21:39:25 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;set&gt;
#include &lt;map&gt;
#include &lt;string&gt; 
using namespace std;
//英语     抄博友程序       字符串处理巧妙       upper_bound使用      没掌握
struct book{
	string title...]]></description><category></category></item><item><title><![CDATA[POJ 1885 Uncompress G++       输入巧妙     list使用      字符串s=s+c会超时        背]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108799430</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108799430</guid><author>woniupengpeng</author><pubDate>Fri, 25 Sep 2020 16:29:45 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;string&gt;
#include &lt;list&gt;
using namespace std;
//英语    抄博友程序      输入巧妙     list使用      字符串s=s+c会超时        背
int main()
{
	//freopen("1885.txt","r",stdin);
	string s;
	list&lt;stri...]]></description><category></category></item><item><title><![CDATA[POJ 1876 The Letter Carrier‘s Rounds G++      模拟     文本输入]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108782101</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108782101</guid><author>woniupengpeng</author><pubDate>Thu, 24 Sep 2020 20:01:01 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;string&gt;
#include &lt;set&gt;
#include &lt;map&gt;
#include &lt;vector&gt;
using namespace std;
//英语      看博友分析     抄博友程序      模拟     文件输入 
void fen(string s,string &amp;mta,string...]]></description><category></category></item><item><title><![CDATA[POJ 1870 Bee Breeding G++        正六边形矩阵        巧妙       背]]></title><link>https://blog.csdn.net/woniupengpeng/article/details/108771594</link><guid>https://blog.csdn.net/woniupengpeng/article/details/108771594</guid><author>woniupengpeng</author><pubDate>Thu, 24 Sep 2020 12:25:48 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cmath&gt;
using namespace std;
//英语     看博友分析     抄博友程序       博友有其他定义坐标的方法       正六边形矩阵        巧妙       背 
int x,y;
void fun(int a)
{
	if(a==1)
	{
		x=0;
		y=0; 
		return;
	}
	int n=0;...]]></description><category></category></item></channel></rss>