<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[<WRM>的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/QFREX</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; QFREX]]></copyright><item><title><![CDATA[滑动窗口模板]]></title><link>https://blog.csdn.net/QFREX/article/details/134533142</link><guid>https://blog.csdn.net/QFREX/article/details/134533142</guid><author>QFREX</author><pubDate>Tue, 21 Nov 2023 15:35:57 +0800</pubDate><description><![CDATA[是：以右指针作为驱动，拖着左指针向前走。右指针每次只移动一步，而左指针在内部 while 循环中每次可能移动多步。右指针是主动前移，探索未知的新区域；左指针是被迫移动，负责寻找满足题意的区间。《挑战程序设计竞赛》这本书中把滑动窗口叫做「虫取法」，我觉得非常生动形象。因为滑动窗口的两个指针移动的过程和虫子爬动的过程非常像：前脚不动，把后脚移动过来；模板中的 sums 需要根据题目意思具体去修改，本题是求和题目因此把sums 定义成整数用于求和；对于本题而言，就是该区间内的 0 的个数 超过了 2。]]></description><category></category></item><item><title><![CDATA[python中iter函数]]></title><link>https://blog.csdn.net/QFREX/article/details/130214163</link><guid>https://blog.csdn.net/QFREX/article/details/130214163</guid><author>QFREX</author><pubDate>Tue, 18 Apr 2023 09:33:46 +0800</pubDate><description><![CDATA[当使用一个循环机制需要下一个项时，调用迭代器的next()方法，迭代完后引发一个StopIteration异常。python中的迭代器用起来非常灵巧，不仅可以迭代序列，也可以迭代表现出序列行为的对象，例如字典的键、一个文件的行，等等。版权声明：本文为CSDN博主「快递小可」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。反序迭代工具：reversed()将返回一个反序访问的迭代器。但是迭代器只能向后移动、不能回到开始、再次迭代只能创建另一个新的迭代对象。]]></description><category></category></item><item><title><![CDATA[python中yield的用法详解]]></title><link>https://blog.csdn.net/QFREX/article/details/130208071</link><guid>https://blog.csdn.net/QFREX/article/details/130208071</guid><author>QFREX</author><pubDate>Mon, 17 Apr 2023 20:13:47 +0800</pubDate><description><![CDATA[到这里你可能就明白yield和return的关系和区别了，带yield的函数是一个生成器，而不是一个函数了，这个生成器有一个函数就是next函数，next就相当于“下一步”生成哪个数，这一次的next开始的地方是接着上一次的next停止的地方执行的，所以调用next的时候，生成器并不会从foo函数的开始执行，只是接着上一步停止的地方开始，然后遇到yield后，return出要生成的数，此步就结束。2.直到调用next方法，foo函数正式开始执行，先执行foo函数中的print方法，然后进入while循环。]]></description><category></category></item><item><title><![CDATA[拿到已开发好的Vue前端代码如何在本地运行？]]></title><link>https://blog.csdn.net/QFREX/article/details/125570082</link><guid>https://blog.csdn.net/QFREX/article/details/125570082</guid><author>QFREX</author><pubDate>Sat, 02 Jul 2022 10:57:08 +0800</pubDate><description><![CDATA[package.json文件中已经记录了项目所用的所有依赖及其版本，所以打开cmd，定位到项目的根目录，运行如下代码即可：
2.运行
在打开package.json文件，查看“start”值是什么，将其输入到cmd中


运行完之后，如果出现图片中的情况，说明运行成功。
在本地浏览器中输入cmd给出的链接“http://localhost:8080”即可查看在运行完之后，报错如下

出现问题的原因应该是版本不匹配
解决办法：
先卸载vue-template-compiler，再装匹配的版本

（2）Modu]]></description><category></category></item><item><title><![CDATA[模板生成系统]]></title><link>https://blog.csdn.net/QFREX/article/details/123395457</link><guid>https://blog.csdn.net/QFREX/article/details/123395457</guid><author>QFREX</author><pubDate>Thu, 10 Mar 2022 11:23:46 +0800</pubDate><description><![CDATA[一、解法一（90分）
一定要注意以下几个函数应该传的参数是什么：
1.substr(pos,length);
2.erase(pos,length);
#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N = 105;

struct node {
    string name;
    string value;
}a[N];

string str[N];

int main() {
    int n,m;
    cin&]]></description><category></category></item><item><title><![CDATA[ccf 节日]]></title><link>https://blog.csdn.net/QFREX/article/details/123371639</link><guid>https://blog.csdn.net/QFREX/article/details/123371639</guid><author>QFREX</author><pubDate>Wed, 09 Mar 2022 10:46:27 +0800</pubDate><description><![CDATA[本次刷题错误：计算某一天是周几的时候，需要将每一天往后移动一天，因为1850/1/1是周二，顾对7取模之前应该先加一
#include&lt;bits/stdc++.h&gt;

using namespace std;

int isRun(int x) {
    if(x%400==0||(x%4==0&amp;&amp;x%100!=0)) return 1;
    return 0;
}

int day[7] = {1,2,3,4,5,6,7};

int mon1[12]={31,28,31]]></description><category></category></item><item><title><![CDATA[ccf 集合竞价]]></title><link>https://blog.csdn.net/QFREX/article/details/123367709</link><guid>https://blog.csdn.net/QFREX/article/details/123367709</guid><author>QFREX</author><pubDate>Wed, 09 Mar 2022 08:05:43 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N = 5010;

struct node {
    string t;
    int flag;
    int s;
    double p;
}a[N];

bool compare(node x,node y) {
    return x.p&lt;y.p;
}

int main() {
    string tt;
    int n=0;
    while(]]></description><category></category></item><item><title><![CDATA[字符串匹配]]></title><link>https://blog.csdn.net/QFREX/article/details/123155747</link><guid>https://blog.csdn.net/QFREX/article/details/123155747</guid><author>QFREX</author><pubDate>Sat, 26 Feb 2022 21:05:43 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N = 105;

int nextT[N];

void getNext(string pattern) {
	int m = pattern.size();
	int i = 0;
	nextT[0] = -1;
	int t = nextT[i];
	while (i &lt; m) {
		if (t == -1 || pattern[i] == pattern[t]) {
]]></description><category></category></item><item><title><![CDATA[命令行选项]]></title><link>https://blog.csdn.net/QFREX/article/details/123154206</link><guid>https://blog.csdn.net/QFREX/article/details/123154206</guid><author>QFREX</author><pubDate>Sat, 26 Feb 2022 19:00:15 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N = 30;

bool o1[N], o2[N]; //o2为有参数选项，o1为无参数选项
string ans[N];

int main() {
	string str;
	cin &gt;&gt; str;
	for (int i = 0; i &lt; str.size(); i++) {
		if (i + 1 &lt; str.size() &amp;&amp; st]]></description><category></category></item><item><title><![CDATA[最大的矩形]]></title><link>https://blog.csdn.net/QFREX/article/details/123069129</link><guid>https://blog.csdn.net/QFREX/article/details/123069129</guid><author>QFREX</author><pubDate>Tue, 22 Feb 2022 15:18:16 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N = 1010;

int h[N];

int main() {
	int n;
	scanf("%d", &amp;n);
	for (int i = 1; i &lt;= n; i++) {
		scanf("%d", &amp;h[i]);
	}
	int result = 0;
	//sort(h+1,h+n+1);
	for (int i = 1; i &lt;= n;]]></description><category></category></item><item><title><![CDATA[ISBN号码]]></title><link>https://blog.csdn.net/QFREX/article/details/122929680</link><guid>https://blog.csdn.net/QFREX/article/details/122929680</guid><author>QFREX</author><pubDate>Mon, 14 Feb 2022 18:06:58 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

int main() {
	string str;
	cin &gt;&gt; str;
	int a[10];
	int pos = 0;
	for (int i = 0; i &lt; str.size(); i++) {
		if (isdigit(str[i])) {
			a[pos++] = str[i] - 48;
		}
	}
	int sum = 0;
	for (int i = 0;]]></description><category></category></item><item><title><![CDATA[csp 窗口]]></title><link>https://blog.csdn.net/QFREX/article/details/122929261</link><guid>https://blog.csdn.net/QFREX/article/details/122929261</guid><author>QFREX</author><pubDate>Mon, 14 Feb 2022 17:44:45 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N=50;

struct node {
	int x1,y1,x2,y2;
	int level;
	int number;
}a[N];

bool compare (node x,node y) {
	return x.level&gt;y.level;
}

int main() {
	int n,m;
	scanf("%d%d",&amp;n,&amp;m);
	for(i]]></description><category></category></item><item><title><![CDATA[csp 画图]]></title><link>https://blog.csdn.net/QFREX/article/details/122928102</link><guid>https://blog.csdn.net/QFREX/article/details/122928102</guid><author>QFREX</author><pubDate>Mon, 14 Feb 2022 16:59:46 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N = 1000;

int a[N][N];

int main() {
	int n;
	scanf("%d", &amp;n);
	for (int i = 0; i &lt;= 110; i++) {
		for (int j = 0; j &lt;= 110; j++) {
			a[i][j] = 0;
		}
	}
	for (int i = 0; i &lt; n; ]]></description><category></category></item><item><title><![CDATA[Z字形扫描]]></title><link>https://blog.csdn.net/QFREX/article/details/122927244</link><guid>https://blog.csdn.net/QFREX/article/details/122927244</guid><author>QFREX</author><pubDate>Mon, 14 Feb 2022 16:30:04 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N = 5500;

int a[N][N];
int visited[N][N];

int dx[4] = {0, 1, 1, -1};
int dy[4] = {1, -1, 0, 1};

int result[260000];

int main() {
	int n;
	scanf("%d", &amp;n);
	for (int i = 1; i &lt;= n; i+]]></description><category></category></item><item><title><![CDATA[csp 数字排序]]></title><link>https://blog.csdn.net/QFREX/article/details/122915323</link><guid>https://blog.csdn.net/QFREX/article/details/122915323</guid><author>QFREX</author><pubDate>Sun, 13 Feb 2022 22:23:10 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N=1010;

struct node {
	int cunt;
	int data;
}a[N];

bool compare(node x,node y) {
	if(x.cunt!=y.cunt) {
		return x.cunt&gt;y.cunt;
	} 
	return x.data&lt;y.data; 
}

int b[N];

int main() {
	in]]></description><category></category></item><item><title><![CDATA[csp 日期计算]]></title><link>https://blog.csdn.net/QFREX/article/details/122915080</link><guid>https://blog.csdn.net/QFREX/article/details/122915080</guid><author>QFREX</author><pubDate>Sun, 13 Feb 2022 22:06:27 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

bool yJudge(int y) {
	if (y % 4 == 0 &amp;&amp; y % 100 != 0 || y % 400 == 0) {
		return true;
	}
	return false;
}

int m1[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; //闰年
int m2[12] = {31, 2]]></description><category></category></item><item><title><![CDATA[消除类游戏]]></title><link>https://blog.csdn.net/QFREX/article/details/122914695</link><guid>https://blog.csdn.net/QFREX/article/details/122914695</guid><author>QFREX</author><pubDate>Sun, 13 Feb 2022 21:43:54 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N = 100;

int a[N][N];
int b[N][N];//表示（i，j）位置的格子能不能删，能删标记为1，不能删标记为0 

int main() {
	int n, m;
	scanf("%d%d", &amp;n, &amp;m);
	for (int i = 1; i &lt;= n; i++) {
		for (int j = 1; j &lt;= m; j+]]></description><category></category></item><item><title><![CDATA[俄罗斯方块]]></title><link>https://blog.csdn.net/QFREX/article/details/122913914</link><guid>https://blog.csdn.net/QFREX/article/details/122913914</guid><author>QFREX</author><pubDate>Sun, 13 Feb 2022 20:52:04 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

int a[20][20];

int b[10][10];

int main() {
	int m;
	for (int i = 1; i &lt;= 15; i++) {
		for (int j = 1; j &lt;= 10; j++) {
			scanf("%d", &amp;a[i][j]);
		}
	}
	int pos = 1;
	for (int i = 1; i &lt;= 4]]></description><category></category></item><item><title><![CDATA[csp 火车购票]]></title><link>https://blog.csdn.net/QFREX/article/details/122911813</link><guid>https://blog.csdn.net/QFREX/article/details/122911813</guid><author>QFREX</author><pubDate>Sun, 13 Feb 2022 17:53:41 +0800</pubDate><description><![CDATA[注意：当没有相连的座位时，从编号较小的座位依次进行分配
#include&lt;bits/stdc++.h&gt;

using namespace std;

const int N=110;

int a[N];

int chair[25][10];

int sum[25][10];

int main() {
	int n,m;
	scanf("%d",&amp;n);
	for(int i=1;i&lt;=20;i++) {
		for(int j=1;j&lt;=5;j++) {
			cha]]></description><category></category></item><item><title><![CDATA[csp 工资计算]]></title><link>https://blog.csdn.net/QFREX/article/details/122909734</link><guid>https://blog.csdn.net/QFREX/article/details/122909734</guid><author>QFREX</author><pubDate>Sun, 13 Feb 2022 15:36:15 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

using namespace std;

int main() {
	int t;
	scanf("%d",&amp;t);
	int s;
	if(t&lt;=3500) {
		s=t;
	} else if(t&lt;=3500+1500-45) {
		s=(t-105)*100/97;
	} else if(t&lt;=8000-45-300) {
		s=(t-455)*10/9;
	}else if(t&lt;=3500+9000]]></description><category></category></item></channel></rss>