<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>淡淡博客 – 记录生活点滴，关注Python数据挖掘、深度学习相关技术</title><link>https://blog.i-ll.cc/</link><description>Recent content on 淡淡博客 – 记录生活点滴，关注Python数据挖掘、深度学习相关技术</description><generator>Hugo -- gohugo.io</generator><language>zh-cn</language><lastBuildDate>Sat, 18 Dec 2021 11:06:59 +0300</lastBuildDate><atom:link href="https://blog.i-ll.cc/index.xml" rel="self" type="application/rss+xml"/><item><title>About</title><link>https://blog.i-ll.cc/about/</link><pubDate>Wed, 06 Jun 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/about/</guid><description>个人简介 男，PhD在读，热爱数学，科学，喜欢推理，时常旅游，顺便拍片。 伪程序员一枚、业余设计师、游泳爱好者。 关注数据挖掘、深度学习技术， 立志</description></item><item><title>Vim Awesome Cheatsheets -- 中文版</title><link>https://blog.i-ll.cc/post/2021-12-18-vim-awesome-cheatsheets/</link><pubDate>Sat, 18 Dec 2021 11:06:59 +0300</pubDate><guid>https://blog.i-ll.cc/post/2021-12-18-vim-awesome-cheatsheets/</guid><description>&lt;div class="highlight">&lt;div class="chroma">
&lt;table class="lntable">&lt;tr>&lt;td class="lntd">
&lt;pre tabindex="0" class="chroma">&lt;code>&lt;span class="lnt">1
&lt;/span>&lt;span class="lnt">2
&lt;/span>&lt;span class="lnt">3
&lt;/span>&lt;/code>&lt;/pre>&lt;/td>
&lt;td class="lntd">
&lt;pre tabindex="0" class="chroma">&lt;code class="language-plaintext" data-lang="plaintext">VIM CHEATSHEET (中文速查表) - by skywind (created on 2017/10/12)
Version: 47, Last Modified: 2020/10/10 11:02
https://github.com/skywind3000/awesome-cheatsheets
&lt;/code>&lt;/pre>&lt;/td>&lt;/tr>&lt;/table>
&lt;/div>
&lt;/div></description></item><item><title>The impact of hypocrisy on opinion formation: A dynamic model</title><link>https://blog.i-ll.cc/post/2021-11-01-impact-of-hypocrisy/</link><pubDate>Mon, 01 Nov 2021 23:40:53 +0300</pubDate><guid>https://blog.i-ll.cc/post/2021-11-01-impact-of-hypocrisy/</guid><description>&lt;p>Opinion Dynamics focus on the generation, diffusion and aggregation of opinions or behaviors in a social network. Humans have a demonstrated tendency to copy or imitate the behavior and attitude of others and actively influence each other’s opinions. But, publicly revealed opinions are not necessarily in line with internal opinions, causing complex social influence dynamics.&lt;/p></description></item><item><title>完美迁移博客从wordpress到hugo</title><link>https://blog.i-ll.cc/post/2021-10-09-move-to-hugo/</link><pubDate>Sat, 09 Oct 2021 13:00:04 +0300</pubDate><guid>https://blog.i-ll.cc/post/2021-10-09-move-to-hugo/</guid><description>&lt;h2 id="前言">前言&lt;/h2>
&lt;p>博客一直在阿里云学生机上托管，使用wordpress。自从上了研究生之后博客也就一直荒废了。服务器9月底到期，本想着继续续费一下学生机就不需要再折腾一遍了。但是由于已经不在国内读书了，没法进行学生认证。只好将博客迁移到&lt;strong>hugo&lt;/strong>。迁移到&lt;strong>Hugo&lt;/strong>而不是&lt;strong>Hexo&lt;/strong>的原因主要是因为&lt;strong>hugo&lt;/strong>对&lt;strong>Rmarkdown&lt;/strong>的支持更好。&lt;/p></description></item><item><title>通过键盘控制显示器输入源的切换</title><link>https://blog.i-ll.cc/archives/587/</link><pubDate>Sat, 06 Mar 2021 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/587/</guid><description>通过键盘实现单屏多信号源的一键切换 本人有两台设备都接入了同一台显示器，要切换输入源需要手动去按显示器上的按钮，显示器有点大，按钮离得又远，人</description></item><item><title>Mdic字典文件转换mac原生字典</title><link>https://blog.i-ll.cc/archives/582/</link><pubDate>Sat, 16 Jan 2021 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/582/</guid><description>Requirements 转换过程中需要用到PyGlossary，直接去github克隆仓库，或者直接去releases页面下载最新版。作者在这里已经给出了Requ</description></item><item><title>美区Apple ID 注册以及绑定美区PayPal付款</title><link>https://blog.i-ll.cc/archives/562/</link><pubDate>Thu, 26 Nov 2020 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/562/</guid><description>美区Apple ID 注册以及绑定美区PayPal付款 背景 近期apple推出一项订阅服务, apple one. 包含music, news, fitness, tv, arcade 以及 icloud 存储. 当然, apple 大陆官网</description></item><item><title>Mac 生产力提升之 Alfred 4 (一) 入门</title><link>https://blog.i-ll.cc/archives/553/</link><pubDate>Tue, 05 May 2020 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/553/</guid><description>[toc] 关于Alfred Alfred 4是Mac OS下可以大大提高生产力的一款效率工具. Alfred 功能 查找(电脑上的任何文件) 网络搜索(支持自定义搜索引擎) 剪贴板历史</description></item><item><title>MacOS Catalina 10.15.4 alias添加自定义命令</title><link>https://blog.i-ll.cc/archives/551/</link><pubDate>Tue, 14 Apr 2020 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/551/</guid><description>例如:简化命令&amp;rsquo;clear&amp;rsquo;为&amp;rsquo;c' 在之前的版本中,bash_profile和bashrc 首先打开终端:</description></item><item><title>CS224 Lecture1 Word2Vec</title><link>https://blog.i-ll.cc/archives/548/</link><pubDate>Wed, 19 Feb 2020 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/548/</guid><description>CS224 Lecture1 - Word2Vec 1 Introduction of Natural Language Processing Natural Language is a discrete/symbolic/categorical system. 1.1 Examples of tasks There are many different levels in NLP. For instance: Easy: Spell Checking Keywords Search Finding Synonyms Synonym: 同义词 noun Medium Parsing information from websites, documents, etc. Parse: 对句子进行语法分析 verb Hard Machine Translation Semantic Analysis (What is the meaning of query</description></item><item><title>GitLab+Hexo更改数学公式渲染引擎为Pandoc</title><link>https://blog.i-ll.cc/archives/534/</link><pubDate>Tue, 05 Mar 2019 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/534/</guid><description>1 git push origin master 当我把远程仓库更新完成的时候, 过了好久发现博客并没有变化. 于是去看了一下Pipelines中的执行过程, 果然报错. 问题1: Error: spawn pandoc ENOENT</description></item><item><title>计算机中数的表示(一) - 无符号数和有符号数</title><link>https://blog.i-ll.cc/archives/531/</link><pubDate>Mon, 04 Mar 2019 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/531/</guid><description>无符号数的表示 寄存器的位数反应无符号数的表示范围 有符号数的表示 机器数与真值 其中小数点的位置是以约定的方式给出的. 原码表示法 整数 正数的原码反码</description></item><item><title>延安大学本科毕业论文Latex模板2019</title><link>https://blog.i-ll.cc/archives/501/</link><pubDate>Thu, 14 Feb 2019 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/501/</guid><description>延安大学本科毕业论文Latex模板2019 标签（空格分隔）: Latex [toc] 项目说明 YAUthesis是延安大学非官方的毕业论文(设计)的LaTeX模板</description></item><item><title>使用Xshell连接Google Cloud</title><link>https://blog.i-ll.cc/archives/497/</link><pubDate>Wed, 13 Feb 2019 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/497/</guid><description>使用Xshell连接Google Cloud 标签（空格分隔）： 工具 [toc] 前提： 1. 科学上网 2. ssh工具，如Xshell，putty等. 3. Google Cloud服务器 本</description></item><item><title>北京工业大学896历年真题算法</title><link>https://blog.i-ll.cc/archives/489/</link><pubDate>Sat, 03 Nov 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/489/</guid><description>北京工业大学896历年真题算法 @StdKe整理 所有算法都是自己手写思路然后在python上模拟(暂时没C环境)再翻译成C的,难免疏漏，请不吝</description></item><item><title>在OneNote种使用Latex命令愉快地敲出数学公式</title><link>https://blog.i-ll.cc/archives/472/</link><pubDate>Fri, 28 Sep 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/472/</guid><description>在OneNote种使用Latex命令愉快地敲出数学公式 office中所有支持键盘输入的公式 office中默认是用的Unicodemath，相</description></item><item><title>提取圣才电子书并转成PDF,epub,mobi,word等格式</title><link>https://blog.i-ll.cc/archives/468/</link><pubDate>Sun, 23 Sep 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/468/</guid><description>[toc] Start 大四考研狗一名，本科计算机科学与技术，前面几个月一直准备继续读本专业，由于各种原因最终决定跨考管理科学与工程。学校指定教材是《管理学》罗</description></item><item><title>Julia Pro国内下载地址</title><link>https://blog.i-ll.cc/archives/462/</link><pubDate>Mon, 13 Aug 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/462/</guid><description>Julia Pro下载地址 Julia Pro 相当于Julia全家桶，可以把它当作Python的Anaconda。 官方下载地址：https://juliacomput</description></item><item><title>Python二进制文件读取并转换</title><link>https://blog.i-ll.cc/archives/447/</link><pubDate>Fri, 25 May 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/447/</guid><description>Python二进制文件读取并转换 标签（空格分隔）： python [toc] 本文所用环境： Python 3.6.5 |Anaconda custom (64-bit)| 引言 由于某些原因，需要用python读取二进制文件，这里主要用</description></item><item><title>卷积神经网络&amp;&amp;爬虫实现网易新闻自动爬取并分类</title><link>https://blog.i-ll.cc/archives/422/</link><pubDate>Sun, 13 May 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/422/</guid><description>[toc] 比赛做的一个小项目，很遗憾，比赛结果不理想，现在将它开源，希望有小伙伴可以继续完善。 卷积神经网络&amp;amp;&amp;amp;爬虫实现网易新闻自动爬</description></item><item><title>一次反盗号writeup</title><link>https://blog.i-ll.cc/archives/411/</link><pubDate>Sun, 22 Apr 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/411/</guid><description>起因：昨天晚上朋友发了一个消息给我： 晚上喝了点酒，没怎么看就睡了。 第二天一大早上想起这个问题，心血来潮想扒一扒这个网站 首先看这个网址： http://maschada.wbac.ac.th/ui.html?index/=ciquitj?url=s9fwpc&amp;amp;iv 打开</description></item><item><title>玩彩票赢钱概率有多少？用Python来告诉你</title><link>https://blog.i-ll.cc/archives/408/</link><pubDate>Wed, 18 Apr 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/408/</guid><description>玩彩票赢钱概率有多少？用Python来告诉你 标签（空格分隔）： Python 工具：Jupyter notebook + Anaconda **游戏规则：**时时彩一种玩法是买尾号。2元一个</description></item><item><title>机器学习之卷积神经网络 &amp;&amp; 卷积神经网络在NLP中的应用</title><link>https://blog.i-ll.cc/archives/296/</link><pubDate>Mon, 16 Apr 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/296/</guid><description>[toc] 机器学习之卷积神经网络 标签（空格分隔）： 机器学习 卷积神经网络 1. 神经网络是啥？ 神经网络其实就是按照一定规则连接起来的多个神经元。上图展示了一</description></item><item><title>爬虫基本介绍 &amp;&amp; python3 爬虫爬取网易新闻排行榜</title><link>https://blog.i-ll.cc/archives/293/</link><pubDate>Mon, 16 Apr 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/293/</guid><description>1. 什么是爬虫？ 爬虫是请求⽹网站并提取数据的⾃自动化程序 2. 爬虫的基本流程 发起请求 通过HTTP库向目标站点发起请求，即发送一个Request，请</description></item><item><title>折腾(享受DIY的乐趣)----客制化键盘GH60自定义配列</title><link>https://blog.i-ll.cc/archives/250/</link><pubDate>Thu, 08 Feb 2018 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/250/</guid><description>需要用到两个网站 第一个是GH60默认配列的地址 http://www.keyboard-layout-editor.com/#/layouts/7d55431c8a8d9f9bf94b6f6af8ce7c12 第二个是生成eep文件的地址,还可以查看每个键对应的标签是什么. http://keyboard.fans/tkg 需要准备材料以及工具 材料 P</description></item><item><title>PHP循环遍历数据库中表的字段并显示到前端</title><link>https://blog.i-ll.cc/archives/247/</link><pubDate>Wed, 20 Dec 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/247/</guid><description>刚接触PHP，需要做一个简单的项目。 项目背景 学校中老师或多或少的都需要统计学生的各种资料，除了像问卷星，金数据这样的第三方平台，学校内部暂时</description></item><item><title>如何注册APP Store美区ID</title><link>https://blog.i-ll.cc/archives/242/</link><pubDate>Mon, 18 Dec 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/242/</guid><description>刚从安卓换回ios,由于特殊需要, 需下载ShadowRocket和Potatso. 以前中国商店没下架的时候购买的,但是下架之后再已购里面也找</description></item><item><title>Visual Studio Code &amp; LaTeX Workshop 优雅地编写Latex文档 , 完美支持中文</title><link>https://blog.i-ll.cc/archives/214/</link><pubDate>Fri, 03 Nov 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/214/</guid><description>LATEX 是基于 Tex 的排版系统，多用于排版高质量的科技类和数学类文档。 Tex Live TexLive是tex的集合环境，包含了pdfletex，xeletex等编</description></item><item><title>数据挖掘实验(一)</title><link>https://blog.i-ll.cc/archives/208/</link><pubDate>Thu, 02 Nov 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/208/</guid><description>实验内容 产生-1···1间隔为0.05的向量 $$ \\vec x $$ 计算方程$$ y=x^2+3 $$ 绘制函数$$ y=x^2+3 $$的函数图像 随机产生大小为30*30的随机矩阵$$ A $$ 绘</description></item><item><title>初识Git 如何使用Git将本地项目上传到Github</title><link>https://blog.i-ll.cc/archives/198/</link><pubDate>Sun, 29 Oct 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/198/</guid><description>什么是Git？ Git是一款免费、开源、世界上最先进的分布式版本控制系统，用于敏捷高效地处理任何或小或大的项目。 什么是版本控制系统？ 上图实际上</description></item><item><title>机器学习(周志华) 第一章 绪论 课后习题答案</title><link>https://blog.i-ll.cc/archives/30/</link><pubDate>Sat, 30 Sep 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/30/</guid><description>1.1 表1.1中若只包含编号为1和4的两个样例，试给出相应的版本空间。 编号 色泽 根蒂 敲声 是否好瓜 1 青绿 蜷缩 浊响 是 4 乌黑 稍蜷 沉闷 否 假设空间：问题所有</description></item><item><title>VS2017安装过程电脑突然关机</title><link>https://blog.i-ll.cc/archives/45/</link><pubDate>Wed, 20 Sep 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/45/</guid><description>VS2017安装过程电脑突然关机，再次安装一直提示“很抱歉，安装失败” 删掉 C:\ProgramData\Microsoft\VisualStudio\Packages 解决</description></item><item><title>wget windows版安装与使用</title><link>https://blog.i-ll.cc/archives/46/</link><pubDate>Wed, 20 Sep 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/46/</guid><description>这几天需要下载各种音效，但是在素材网里面打开下载链接，都是直接进入的网页，由于学校电脑没装idm，所以临时想了一个办法，在windows下用</description></item><item><title>网件路由器R6400 梅林固件折腾篇</title><link>https://blog.i-ll.cc/archives/47/</link><pubDate>Fri, 18 Aug 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/47/</guid><description>由于R6800是联发科的芯片，暂时不支持梅林固件。 所以410块挂咸鱼卖了。开始折腾R6400. 主要分为以下部分 1. 将drcom放到梅林固件里面</description></item><item><title>VS2017离线包下载</title><link>https://blog.i-ll.cc/archives/48/</link><pubDate>Sat, 12 Aug 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/48/</guid><description>去官网找到自己需要的版本并下载。https://www.visualstudio.com/zh-hans/downloads/ 打开下载好的文</description></item><item><title>POJ 2773 - Happy 2006(素数判定 欧几里得算法)</title><link>https://blog.i-ll.cc/archives/49/</link><pubDate>Sat, 29 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/49/</guid><description>Description Two positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9…are all relatively prime to 2006. Now your job is easy: for the given integer m, find the K-th element which is relatively prime to m when these elements are sorted in ascending order. Input The input contains multiple</description></item><item><title>CodeForces 699A - Launch of Collider(水题)</title><link>https://blog.i-ll.cc/archives/51/</link><pubDate>Fri, 28 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/51/</guid><description>Description There will be a launch of a new, powerful and unusual collider very soon, which located along a straight line. n particles will be launched inside it. All of them are located in a straight line and there can not be two or more particles located in the same point. The coordinates of the particles coincide with the distance in meters from the center of the collider, xi is</description></item><item><title>POJ 1258 - Agri-Net(最小生成树 Prim)</title><link>https://blog.i-ll.cc/archives/50/</link><pubDate>Fri, 28 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/50/</guid><description>Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm</description></item><item><title>Codeforces 4A - Watermelon(水题)</title><link>https://blog.i-ll.cc/archives/52/</link><pubDate>Thu, 27 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/52/</guid><description>Description One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed w kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem. Pete and Billy are great fans of even numbers, that’</description></item><item><title>HDU 1010 - Tempter of the Bone（DFS 奇偶剪枝）</title><link>https://blog.i-ll.cc/archives/55/</link><pubDate>Wed, 26 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/55/</guid><description>Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to get out of this maze. The maze was a rectangle with sizes N by M. There was a door in the maze. At</description></item><item><title>HDU 1016 - Prime Ring Problem (DFS)</title><link>https://blog.i-ll.cc/archives/54/</link><pubDate>Wed, 26 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/54/</guid><description>Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime. Note: the number of first circle should always be 1. Input n (0 Output The output format is shown as sample below. Each row represents a series of circle numbers in the ring</description></item><item><title>HDU 1242 - Rescue（BFS 优先队列）</title><link>https://blog.i-ll.cc/archives/53/</link><pubDate>Wed, 26 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/53/</guid><description>Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel’s friends want to save Angel. Their task is: approach Angel. We assume that “approach Angel” is to get to the position where Angel stays. When</description></item><item><title>HDU 1009 - FatMouse' Trade（贪心）</title><link>https://blog.i-ll.cc/archives/56/</link><pubDate>Sun, 23 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/56/</guid><description>Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room contains Jii pounds of JavaBeans and requires Fii pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get Jii* a% pounds of JavaBeans if he pays Fii* a% pounds</description></item><item><title>POJ 2431 - Expedition (贪心 优先队列)</title><link>https://blog.i-ll.cc/archives/57/</link><pubDate>Sun, 23 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/57/</guid><description>Description A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck’s fuel tank. The truck now leaks one unit of fuel every unit of distance it travels. To repair the truck, the cows need to drive to the nearest town (no</description></item><item><title>POJ 3069 - Saruman's Army(贪心)</title><link>https://blog.i-ll.cc/archives/58/</link><pubDate>Sun, 23 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/58/</guid><description>Description Saruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known as palantirs, among the troops. Each palantir has a maximum effective range of R units, and must be carried by some troop in the army (i.e., palantirs are not allowed to “free f</description></item><item><title>Code Forces 587A - Duff and Weight Lifting（贪心）</title><link>https://blog.i-ll.cc/archives/60/</link><pubDate>Sat, 22 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/60/</guid><description>Description Recently, Duff has been practicing weight lifting. As a hard practice, Malek gave her a task. He gave her a sequence of weights. Weight of i-th of them is 2wi pounds. In each step, Duff can lift some of the remaining weights and throw them away. She does this until there’s no more weight left. Malek asked her to minimize the number of</description></item><item><title>Code Forces 588A - Duff and Meat（贪心）</title><link>https://blog.i-ll.cc/archives/59/</link><pubDate>Sat, 22 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/59/</guid><description>Description Duff is addicted to meat! Malek wants to keep her happy for n days. In order to be happy in i-th day, she needs to eat exactly ai kilograms of meat. There is a big shop uptown and Malek wants to buy meat for her from there. In i-th day, they sell meat for pi dollars per kilogram. Malek knows all numbers a1, …, an and p1, …</description></item><item><title>Codeforces 581C - Developing Skills(贪心)</title><link>https://blog.i-ll.cc/archives/61/</link><pubDate>Fri, 21 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/61/</guid><description>Description Petya loves computer games. Finally a game that he’s been waiting for so long came out! The main character of this game has n different skills, each of which is characterized by an integer ai from 0 to 100. The higher the number ai is, the higher is the i-th skill of the character. The total rating of the character is calculated as the sum of</description></item><item><title>HDU 3714 - Error Curves (三分查找)</title><link>https://blog.i-ll.cc/archives/66/</link><pubDate>Fri, 21 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/66/</guid><description>Description Josephina is a clever girl and addicted to Machine Learning recently. She pays much attention to a method called Linear Discriminant Analysis, which has many interesting properties. In order to test the algorithm’s efficiency, she collects many datasets. What’s more, each data is divided into two parts: training data and test data. She gets</description></item><item><title>POJ 1905 - Expanding Rods(二分查找)</title><link>https://blog.i-ll.cc/archives/65/</link><pubDate>Fri, 21 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/65/</guid><description>Description When a thin rod of length L is heated n degrees, it expands to a new length L’=(1+n*C)*L, where C is the coefficient of heat expansion. When a thin rod is mounted on two solid walls and then heated, it expands and takes the shape of a circular segment, the original rod being the chord of the</description></item><item><title>POJ 3070 - Fibonacci (矩阵快速幂)</title><link>https://blog.i-ll.cc/archives/63/</link><pubDate>Fri, 21 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/63/</guid><description>Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, … An alternative formula for the Fibonacci sequence is Given an integer n, your goal is to compute the last 4 digits of</description></item><item><title>POJ 3233 - Matrix Power Series（矩阵快速幂）</title><link>https://blog.i-ll.cc/archives/62/</link><pubDate>Fri, 21 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/62/</guid><description>Description Given a n × n matrix A and a positive integer k, find the sum S=A+A2+A3+…+Ak. Input The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 109) and m (m Output Output the elements of S modulo m in the same</description></item><item><title>UVA 10006 - Carmichael Numbers(卡迈克尔数 快速幂算法)</title><link>https://blog.i-ll.cc/archives/64/</link><pubDate>Fri, 21 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/64/</guid><description>Description An important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important field in computer science, and that life would not matter at all without cryptography. Alvaro is one of such persons, and is designing a set of cryptographic procedures for cooking paella. ´ Some of the cryptographic algorithms he is implementing make use of big prime numbers. However, checking if a</description></item><item><title>HDU 2037 - 今年暑假不AC(贪心)</title><link>https://blog.i-ll.cc/archives/67/</link><pubDate>Wed, 19 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/67/</guid><description>Description 今年暑假不AC？” “是的。” “那你干什么呢？” “看世界杯呀，笨蛋！” “@#$%^&amp;amp;*%…” 确实如此，世界杯来了，球迷的节日也来了，</description></item><item><title>HDU 2021 - 发工资咯：） (贪心)</title><link>https://blog.i-ll.cc/archives/68/</link><pubDate>Tue, 18 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/68/</guid><description>Description 作为杭电的老师，最盼望的日子就是每月的8号了，因为这一天是发工资的日子，养家糊口就靠它了，呵呵 但是对于学校财务处的工作人员来说，这一天则是</description></item><item><title>POJ 1061 - 青蛙的约会(线性同余方程)</title><link>https://blog.i-ll.cc/archives/69/</link><pubDate>Tue, 18 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/69/</guid><description>Description 两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止</description></item><item><title>POJ 1064 - Cable master(二分)</title><link>https://blog.i-ll.cc/archives/71/</link><pubDate>Mon, 17 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/71/</guid><description>Description Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect computers for the contestants using a “star” topology - i.e. connect them all to a single central hub. To organize a truly honest contest, the Head of the Judging Committee has decreed</description></item><item><title>POJ 2456 - Aggressive cows(二分)</title><link>https://blog.i-ll.cc/archives/70/</link><pubDate>Mon, 17 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/70/</guid><description>Description Farmer John has built a new long barn, with N (2 His C (2 Input Line 1: Two space-separated integers: N and C Lines 2..N+1: Line i+1 contains an integer stall location, xi Output Line 1: One integer: the largest minimum distance Sample Input 5 3 1 2 8 4 9 Sample Output 3 Hint OUTPUT DETAILS: FJ can put his 3 cows in the stalls at positions 1,</description></item><item><title>动态规划</title><link>https://blog.i-ll.cc/archives/73/</link><pubDate>Sun, 16 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/73/</guid><description>动态规划 动态规划算法通常基于一个递推公式及一个或多个初始状态。 当前子问题的解将由上一次子问题的解推出。使用动态规划来解题只需要多项式时间复杂</description></item><item><title>并查集</title><link>https://blog.i-ll.cc/archives/72/</link><pubDate>Sun, 16 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/72/</guid><description>什么是并查集？ 并查集是一种树型的数据结构，常用于处理一些不相交集合（Disjoint Sets）的合并及查询问题。 并查集可以高效的进行如下操作</description></item><item><title>数论基础</title><link>https://blog.i-ll.cc/archives/74/</link><pubDate>Sun, 16 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/74/</guid><description>基本运算 取模(mod)取余(rem) 定义 给定一个正整数p，任意一个整数n，一定存在等式 ： n = kp + r ； 其中 k、r 是整数，且 0 ≤ r 对于正整数 p 和</description></item><item><title>HDU 1237 - 简单计算器 表达式求值</title><link>https://blog.i-ll.cc/archives/79/</link><pubDate>Fri, 14 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/79/</guid><description>读入一个只包含 +, -, *, / 的非负整数计算表达式，计算该表达式的值。 Input 测试输入包含若干测试用例，每个测试用例占一行，每行不超过200个字符，整数和</description></item><item><title>HDU 1387 - Team Queue</title><link>https://blog.i-ll.cc/archives/75/</link><pubDate>Fri, 14 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/75/</guid><description>Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the queue in front of the Mensa is a team queue, for example. In a team queue each element belongs to a team. If an element enters the queue, it first searches the queue from head to</description></item><item><title>HDU 1509 - Windows Message Queue</title><link>https://blog.i-ll.cc/archives/76/</link><pubDate>Fri, 14 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/76/</guid><description>Message queue is the basic fundamental of windows system. For each process, the system maintains a message queue. If something happens to this process, such as mouse click, text change, the system will add a message to the queue. Meanwhile, the process will do a loop for getting message from the queue according to the priority value if it is not empty. Note that the less priority value means the</description></item><item><title>HDU 1702 - ACboy needs your help again!</title><link>https://blog.i-ll.cc/archives/78/</link><pubDate>Fri, 14 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/78/</guid><description>ACboy was kidnapped!! he miss his mother very much and is very scare now.You can&amp;rsquo;t image how dark the room he was put into is, so poor :(. As a smart ACMer, you want to get ACboy out of the monster&amp;rsquo;s labyrinth.But when you arrive at the gate of the maze, the monste say :&amp;quot; I have heard that you are very clever, but if can&amp;rsquo;t solve my problems, you</description></item><item><title>HDU 1873 - 看病要排队</title><link>https://blog.i-ll.cc/archives/77/</link><pubDate>Fri, 14 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/77/</guid><description>看病要排队这个是地球人都知道的常识。 不过经过细心的0068的观察，他发现了医院里排队还是有讲究的。0068所去的医院有三个医生（汗，这么少）</description></item><item><title>HDU 1257 - 最少拦截系统</title><link>https://blog.i-ll.cc/archives/80/</link><pubDate>Thu, 13 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/80/</guid><description>某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹</description></item><item><title>POJ 3176 - Cow Bowling</title><link>https://blog.i-ll.cc/archives/81/</link><pubDate>Thu, 13 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/81/</guid><description>The cows don&amp;rsquo;t use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 Then the other cows traverse the triangle</description></item><item><title>POJ 1611 - The Suspects</title><link>https://blog.i-ll.cc/archives/82/</link><pubDate>Wed, 12 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/82/</guid><description>POJ 1611 - The Suspects Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separate the suspects from others. In the Not-Spreading-Your-Sickness University (NSYSU), there are many student groups. Students in the same group intercommunicate with each other frequently, and a student may join several groups. To prevent the</description></item><item><title>POJ 1703 - Find them, Catch them</title><link>https://blog.i-ll.cc/archives/83/</link><pubDate>Wed, 12 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/83/</guid><description>POJ 1703 - Find them, Catch them The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, given two criminals; do they belong to a same clan? You must give your judgment based</description></item><item><title>HDU 1272 - 小希的迷宫</title><link>https://blog.i-ll.cc/archives/84/</link><pubDate>Tue, 11 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/84/</guid><description>HDU 1272 - 小希的迷宫 上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路</description></item><item><title>HDU 1232 - 畅通工程</title><link>https://blog.i-ll.cc/archives/86/</link><pubDate>Mon, 10 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/86/</guid><description>畅通工程 某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以</description></item><item><title>POJ 1182 - 食物链</title><link>https://blog.i-ll.cc/archives/85/</link><pubDate>Mon, 10 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/85/</guid><description>动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都是A,B,</description></item><item><title>UVA 10583 - Ubiquitous Religions</title><link>https://blog.i-ll.cc/archives/87/</link><pubDate>Mon, 10 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/87/</guid><description>Ubiquitous Religions There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your university believe in. You know that there are n students in your university (0 Input The input consists of a number of cases. Each case starts with a line specifying the integers n and m.</description></item><item><title>UVA 10059 - Maximum Product</title><link>https://blog.i-ll.cc/archives/88/</link><pubDate>Sun, 09 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/88/</guid><description>Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of the maximum positive product involving consecutive terms of S. If you cannot find a positive sequence, you should consider 0 as the value of the maximum product. Input Each test case starts with 1 ≤ N ≤ 18, the number of elements in a sequence. Each element Si</description></item><item><title>UVA 10082 - WERTYU</title><link>https://blog.i-ll.cc/archives/90/</link><pubDate>Sun, 09 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/90/</guid><description>UVA 10082 - WERTYU A common typing error is to place the hands on the keyboard one row to the right of the correct position. So ‘Q’ is typed as ‘W’ and ‘J’ is typed as ‘K’ and so on. You are to decode a message typed in this manner. Input Input consists of several lines of text. Each line may contain</description></item><item><title>最大乘积问题</title><link>https://blog.i-ll.cc/archives/89/</link><pubDate>Sun, 09 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/89/</guid><description>1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 /*给定一个序列 序列内部数字自由组合 求最大乘积*/</description></item><item><title>字符串的输入输出 C/C++</title><link>https://blog.i-ll.cc/archives/91/</link><pubDate>Sat, 08 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/91/</guid><description>C字符串-字符数组 输入输出函数 输入函数 scanf(&amp;quot;%s&amp;quot;, s) 读入字符串，在第一个空白符(' &amp;lsquo;、'\n&amp;rsquo;、'\t')处停止，不读入空白符</description></item><item><title>常见排序算法以及对应的时间复杂度和空间复杂度</title><link>https://blog.i-ll.cc/archives/92/</link><pubDate>Sat, 08 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/92/</guid><description>排序：将杂乱无章的数据，按照一定的方法进行排列的过程叫做排序。 排序的分类 排序大的分类可分为内排序和外排序，不需要访问外存就能进行排序的叫做内</description></item><item><title>简单数据结构(队列 栈 树 堆 )</title><link>https://blog.i-ll.cc/archives/93/</link><pubDate>Fri, 07 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/93/</guid><description>基础知识 基本概念 1 2 3 4 5 6 7 8 9 程序 = 算法 + 数据结构 数据结构是计算机存储、组织数据的方式。 数据结构是指相互之间存在一种或多种特定关系的数据</description></item><item><title>118A - String Task</title><link>https://blog.i-ll.cc/archives/94/</link><pubDate>Thu, 06 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/94/</guid><description>Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it: deletes all the vowels, inserts a character &amp;ldquo;.&amp;rdquo; before each consonant, replaces all uppercase consonants with corresponding lowercase ones. Vowels are letters &amp;ldquo;A&amp;rdquo;, &amp;ldquo;O&amp;rdquo;, &amp;ldquo;Y&amp;rdquo;, &amp;ldquo;E&amp;rdquo;, &amp;ldquo;U&amp;rdquo;, &amp;ldquo;I&amp;rdquo;, and the rest are</description></item><item><title>hdu 5143 NPY and arithmetic progression(枚举)</title><link>https://blog.i-ll.cc/archives/96/</link><pubDate>Thu, 06 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/96/</guid><description>NPY is learning arithmetic progression in his math class. In mathematics, an arithmetic progression (AP) is a sequence of numbers such that the difference between the consecutive terms is constant.(from wikipedia) He thinks it&amp;rsquo;s easy to understand,and he found a challenging problem from his talented math teacher: You&amp;rsquo;re given four integers, $a_1, a_2, a_3, a_4$, which are the numbers of 1,2,3,4 you have.Can you divide these numbers into some Arithmetic</description></item><item><title>UVA 1585 Score</title><link>https://blog.i-ll.cc/archives/95/</link><pubDate>Thu, 06 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/95/</guid><description>There is an objective test result such as “OOXXOXXOOO”. An ‘O’ means a correct answer of a problem and an ‘X’ means a wrong answer. The score of each problem of this test is calculated by itself and its just previous consecutive ‘O’s only when the answer is correct. For example,</description></item><item><title>Sublime MinGw实现C/C++代码编译运行</title><link>https://blog.i-ll.cc/archives/97/</link><pubDate>Wed, 05 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/97/</guid><description>安装配置MinGw 下载安装MinGW 去官网下载MinGw ：http://www.mingw.org/ 或者下载我已经下载好的完整版：http:</description></item><item><title>排序练习</title><link>https://blog.i-ll.cc/archives/99/</link><pubDate>Tue, 04 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/99/</guid><description>题目描述： 给你n个整数，请按从大到小的顺序输出其中前m大的数。 输入： 每组测试数据有两行，第一行有两个数n,m(0 输出： 对每组测试数据按从大到</description></item><item><title>绝对值排序</title><link>https://blog.i-ll.cc/archives/98/</link><pubDate>Tue, 04 Jul 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/98/</guid><description>Description 输入n(n Input 输入数据有多组，每组占一行，每行的第一个数字为n,接着是n个整数，n=0表示输入数据的结束，不做处理。 Output 对于每个测试实例，输出</description></item><item><title>Python元组</title><link>https://blog.i-ll.cc/archives/100/</link><pubDate>Thu, 08 Jun 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/100/</guid><description>元组与列表的区别之处在于，元组的元素不能修改。但是可以进行分片链接操作。 元组 name=(&amp;lsquo;赵驰&amp;rsquo;,100,99,88</description></item><item><title>Python字典以及常见的操作</title><link>https://blog.i-ll.cc/archives/101/</link><pubDate>Wed, 07 Jun 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/101/</guid><description>字典 字典可以理解为列表的升级版 列表 1 list={“dandan”,&amp;#34;zhangsan&amp;#34;,&amp;#34;wangwu&amp;#34;} 字</description></item><item><title>Python简单的名片管理器</title><link>https://blog.i-ll.cc/archives/102/</link><pubDate>Tue, 06 Jun 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/102/</guid><description>循环遍历列表(for循环) 列表常见操作(“增”、“删”、“改”、“查”) 增(append) 删(“pop”、“del”、“remove”) 改(</description></item><item><title>PowerDesigner将建好的数据表格导出到excel</title><link>https://blog.i-ll.cc/archives/103/</link><pubDate>Sun, 04 Jun 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/103/</guid><description>ctrl+a选中所有表格 按住ctrl+shift+x输入下面命令执行即可。 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33</description></item><item><title>plsql连接Oracle数据库、解决plsql中文乱码、免注册在Oracle官网下载文件、Oracel Database全套下载链接</title><link>https://blog.i-ll.cc/archives/104/</link><pubDate>Wed, 17 May 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/104/</guid><description>Plsql下载以及安装 第一个需要安装Oralce 客户端，第二个不需要，但是tsn文件得自己配置 image.png 下载地址如下 链接: [https://pan.baidu.com/s/1dEK8o1r](https://pan.baidu.com/s/1dEK8o1r) 密码: bhpm 文件一压缩包里面</description></item><item><title>Sublime Text3下两款Markdown插件 支持实时预览与代码高亮</title><link>https://blog.i-ll.cc/archives/105/</link><pubDate>Thu, 04 May 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/105/</guid><description>Sublime Text3 安装 Package Control 快捷键 ctrl+` Sublime Text3安装Package Control代码如下 import urllib.request,os,hashlib; h = &amp;lsquo;df21e130d211cfc94d9b0905775a7c0f&amp;rsquo; + &amp;lsquo;1e3d39e33b79698005270310898eea76&amp;rsquo;; pf = &amp;lsquo;Package Control.sublime-package&amp;rsquo;; ipp = sublime.installed_packages_path(); urllib.request.install_opener( urllib.request.build_opener( urllib.request.ProxyHandler()) ); by = urllib.request.urlopen( &amp;lsquo;http://packagecontrol.io/&amp;rsquo; + pf.replace(' &amp;lsquo;, &amp;lsquo;%20&amp;rsquo;)).read(); dh = hashlib.sha256(by).hexdigest(); print(&amp;lsquo;Error validating download (got %s</description></item><item><title>微信公众平台配置服务器之后实现自动回复</title><link>https://blog.i-ll.cc/archives/107/</link><pubDate>Thu, 09 Mar 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/107/</guid><description>&amp;lt; div id=&amp;ldquo;fromjs&amp;rdquo;&amp;gt; &amp;lt; div class=&amp;ldquo;markdown_views&amp;rdquo;&amp;gt; 参考微信公众平台开发者文档 https://mp.weixin.qq.com/wiki/8/f9a0b8382e0b77d87b3bcc1ce6fbc104.html 下载示例代码 将示例代码通过FTP传至自己的服务器 配置域名和Token(我这里是dandan) 随机生成</description></item><item><title>微信公众平台配置服务器后自定义菜单</title><link>https://blog.i-ll.cc/archives/106/</link><pubDate>Thu, 09 Mar 2017 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/106/</guid><description>1. 获取access_token 登陆微信公众平台-&amp;gt;开发者工具-&amp;gt;在线接口调试工具 填写appid和appsecret 获取到acce</description></item><item><title>Drcom下如何优雅地使用路由器上网</title><link>https://blog.i-ll.cc/archives/108/</link><pubDate>Fri, 23 Dec 2016 00:00:00 +0000</pubDate><guid>https://blog.i-ll.cc/archives/108/</guid><description>本次使用的路由器为 联想newifimini Y1 步骤如下 newifi刷openwrt固件 刷uboot 下载地址http://downloads.o</description></item></channel></rss>