<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[SCPmaster的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/SCPmaster</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; SCPmaster]]></copyright><item><title><![CDATA[linux服务器配置（自用）]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/130553425</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/130553425</guid><author>SCPmaster</author><pubDate>Mon, 08 May 2023 13:28:06 +0800</pubDate><description><![CDATA[自用服务器使用流程]]></description><category></category></item><item><title><![CDATA[leetcode 第 314 场周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/120628620</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/120628620</guid><author>SCPmaster</author><pubDate>Tue, 20 Sep 2022 10:06:53 +0800</pubDate><description><![CDATA[leecode周赛]]></description><category></category></item><item><title><![CDATA[leetcode 第 87 场双周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126931648</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126931648</guid><author>SCPmaster</author><pubDate>Mon, 19 Sep 2022 13:21:49 +0800</pubDate><description><![CDATA[letcode 周赛]]></description><category></category></item><item><title><![CDATA[leetcode 第 309 场周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126703964</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126703964</guid><author>SCPmaster</author><pubDate>Mon, 05 Sep 2022 14:09:42 +0800</pubDate><description><![CDATA[第 309 场周赛]]></description><category></category></item><item><title><![CDATA[leetcode 第 86 场双周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126688869</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126688869</guid><author>SCPmaster</author><pubDate>Sun, 04 Sep 2022 14:13:33 +0800</pubDate><description><![CDATA[第 86 场双周赛]]></description><category></category></item><item><title><![CDATA[leetcode 第 308 场周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126598488</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126598488</guid><author>SCPmaster</author><pubDate>Tue, 30 Aug 2022 10:34:31 +0800</pubDate><description><![CDATA[第 308 场周赛]]></description><category></category></item><item><title><![CDATA[九坤投资专场竞赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126483441</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126483441</guid><author>SCPmaster</author><pubDate>Tue, 23 Aug 2022 14:06:59 +0800</pubDate><description><![CDATA[leetcode 九坤投资专场竞赛]]></description><category></category></item><item><title><![CDATA[leetcode 第 85 场双周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126464636</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126464636</guid><author>SCPmaster</author><pubDate>Mon, 22 Aug 2022 14:29:08 +0800</pubDate><description><![CDATA[leetcode 85 双周赛]]></description><category></category></item><item><title><![CDATA[leetcode 第 306 场周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126344734</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126344734</guid><author>SCPmaster</author><pubDate>Mon, 15 Aug 2022 13:12:30 +0800</pubDate><description><![CDATA[leetcode 306]]></description><category></category></item><item><title><![CDATA[torchtext 0.12 中文语料加载]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126283930</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126283930</guid><author>SCPmaster</author><pubDate>Thu, 11 Aug 2022 14:14:25 +0800</pubDate><description><![CDATA[torchtext 新版本使用]]></description><category></category></item><item><title><![CDATA[leetcode 第 305 场周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126245618</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126245618</guid><author>SCPmaster</author><pubDate>Tue, 09 Aug 2022 13:24:41 +0800</pubDate><description><![CDATA[总结]]></description><category></category></item><item><title><![CDATA[leetcode 第 84 场双周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126223229</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126223229</guid><author>SCPmaster</author><pubDate>Mon, 08 Aug 2022 10:53:29 +0800</pubDate><description><![CDATA[双周赛]]></description><category></category></item><item><title><![CDATA[leetcode 第 303 场周赛]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/126156756</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/126156756</guid><author>SCPmaster</author><pubDate>Thu, 04 Aug 2022 12:09:41 +0800</pubDate><description><![CDATA[周赛总结]]></description><category></category></item><item><title><![CDATA[bert 新闻标题聚类]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/125847482</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/125847482</guid><author>SCPmaster</author><pubDate>Mon, 18 Jul 2022 13:53:45 +0800</pubDate><description><![CDATA[bert训练]]></description><category></category></item><item><title><![CDATA[nlp数据增强-back translation]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/125780118</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/125780118</guid><author>SCPmaster</author><pubDate>Thu, 14 Jul 2022 11:16:00 +0800</pubDate><description><![CDATA[nlp数据增强中的back translation]]></description><category></category></item><item><title><![CDATA[AttributeError: ‘str‘ object has no attribute ‘dim‘ in pytorch]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/125131433</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/125131433</guid><author>SCPmaster</author><pubDate>Sun, 05 Jun 2022 13:58:20 +0800</pubDate><description><![CDATA[AttributeError: 'str' object has no attribute 'dim' in pytorch]]></description><category></category></item><item><title><![CDATA[torchtext 中文语料加载]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/124425381</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/124425381</guid><author>SCPmaster</author><pubDate>Tue, 26 Apr 2022 14:28:52 +0800</pubDate><description><![CDATA[ZJUTOJ-摸鱼前言数据集准备torchtext流程FieldTabularDatasetBucketIterator
前言
因为研究生方向选的是自然语言处理，准备提前接触下相关技术内容。在pytorch学习中发现有个torchtext库，说是用来文本处理，就接触一下。
发现目前网上资料都有点过时了（毕竟这东西出了这么久，总有版本更新）。所以自己另开一个帖子记录以下内容。
……
数据集准备
数据集就选了个常用的网上数据集，关于携程酒店评论。基本就如图所示：

label代表评论标签，1为正面情绪，0为负.]]></description><category></category></item><item><title><![CDATA[摸鱼（---）]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/122593830</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/122593830</guid><author>SCPmaster</author><pubDate>Thu, 20 Jan 2022 08:31:39 +0800</pubDate><description><![CDATA[ZJUTOJ-摸鱼题目解答
题目
题目地址-点此跳转
企鹅来到了海边寻找鱼群。他想摸正好n千克鱼。
附近海中的鱼只有两个品种：重1千克的小鱼和重2千克的大鱼。海里有无限多的这两种鱼。
企鹅摸到第一种鱼要花费a点体力，摸到第二种鱼要花费b点体力。
企鹅想尽可能节省体力。你的任务是找出他最少需要花费多少点体力，能摸到正好n千克鱼。
……
解答
就是针对a,b进行讨论，如果 a*2≤b 的话，一直用 a 摸就好了， 否则就一直用 b 摸，如果 n 为奇数，就在加上一个 a 的摸

#include&lt;alg.]]></description><category></category></item><item><title><![CDATA[超级卷王（）]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/122255101</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/122255101</guid><author>SCPmaster</author><pubDate>Fri, 31 Dec 2021 14:07:25 +0800</pubDate><description><![CDATA[ZJUTOJ-超级卷王题目解答
题目
题目地址-点此跳转
内卷指不能从外部渠道获取资源，没有产生整体的增量，只能在存量分配上做文章，往往损害内部一部分甚至绝大多数群体利益来补偿少数群体的利益，最终整体利益没有增加，持续性内耗的一种状态。内卷本身是个艰难晦涩的社会学专用名词，今天之所以能成为热搜，都是因为今天内卷是很多人今天可以亲身感受到的社会现象。
“内卷”被现在很多高校学生来指代非理性的内部竞争或“被自愿”竞争，这种风气已经逐渐蔓延到中小学甚至幼儿园。
已知浙江工业大学幼儿园今年有 n 名新生入学，每名.]]></description><category></category></item><item><title><![CDATA[律者核心（）]]></title><link>https://blog.youkuaiyun.com/SCPmaster/article/details/120852276</link><guid>https://blog.youkuaiyun.com/SCPmaster/article/details/120852276</guid><author>SCPmaster</author><pubDate>Fri, 05 Nov 2021 21:06:25 +0800</pubDate><description><![CDATA[ZJUTOJ-律者核心题目解答
题目
题目地址-点此跳转
(按照上次说的，摸了一道崩坏题)
一只正在寻找理之律者核心的吼姆在量子之海中迷路了，布洛妮娅和希儿都想通过吼姆得到理之律者核心，于是她们会轮流帮助吼姆移动。
已知量子之海等价于欧氏平面，现在吼姆的坐标是 (x1, y1)，而理之律者核心的坐标是 (x2, y2)。
希儿和布洛妮娅能轮流移动吼姆，但必须保证每次移动只能横向或者纵向移动（即只能改变 x或者 y 坐标）任意个单位，并且每次移动后，当前位置到核心位置的曼哈顿距离必须减小。
最终带领吼姆走到.]]></description><category></category></item></channel></rss>