<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wyjwyl的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wyjwyl</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wyjwyl]]></copyright><item><title><![CDATA[【codeforces1060C】【思维】【Maximum Subrectangle】]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/100886504</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/100886504</guid><author>wyjwyl</author><pubDate>Mon, 16 Sep 2019 14:40:51 +0800</pubDate><description><![CDATA[题目来源： http://codeforces.com/problemset/problem/1060/C
题目描述
现有两个长度分别为n,mn, mn,m的数组a,ba, ba,b，数组中的元素都为正数，令CCC为一个n×mn \times mn×m的矩阵，其中Ci,j=ai⋅bjC_{i, j} = a_i \cdot b_jCi,j​=ai​⋅bj​。现需要找CCC的一个子矩阵，子矩阵的元素...]]></description><category></category></item><item><title><![CDATA[【洛谷P2602】【数字计数】【来自小zhu的奥数计数方法】]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/100881208</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/100881208</guid><author>wyjwyl</author><pubDate>Mon, 16 Sep 2019 11:38:17 +0800</pubDate><description><![CDATA[题目描述
给定两个正整数a和b，求在[a,b]中的所有整数中，每个数码(digit)各出现了多少次。
输入格式
输入文件中仅包含一行两个整数a、b，含义如上所述。
输出格式
输出文件中包含一行10个整数，分别表示0-9在[a,b]中出现了多少次。
输入样例
1 99
输出样例
9 20 20 20 20 20 20 20 20 20
分析：
小zhu教给我的计数方法：例如213中有多少个1
个位1...]]></description><category></category></item><item><title><![CDATA[【扩展中国剩余定理求解 && 逆元求解】POJ2891 Strange Way to Express Integers]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/92617523</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/92617523</guid><author>wyjwyl</author><pubDate>Mon, 17 Jun 2019 14:16:20 +0800</pubDate><description><![CDATA[Strange Way to Express Integers
Time Limit: 1000MS		Memory Limit: 131072K
Description
Elina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The...]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1017. Queueing at Bank (25)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79175787</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79175787</guid><author>wyjwyl</author><pubDate>Fri, 26 Jan 2018 18:57:36 +0800</pubDate><description><![CDATA[Queueing at Bank (25)Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait in line]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1016. Phone Bills (25)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79167280</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79167280</guid><author>wyjwyl</author><pubDate>Thu, 25 Jan 2018 22:10:13 +0800</pubDate><description><![CDATA[Phone Bills (25)A long-distance telephone company charges its customers by the following rules:Making a long-distance call costs a certain amount per minute, depending on the time of day when the call]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1027. Colors in Mars (20)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79132534</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79132534</guid><author>wyjwyl</author><pubDate>Mon, 22 Jan 2018 19:14:58 +0800</pubDate><description><![CDATA[Colors in Mars (20)People in Mars represent the colors in their computers in a similar way as the Earth people. That is, a color is represented by a 6-digit number, where the first 2 digits are for Red]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1015. Reversible Primes (20)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79123302</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79123302</guid><author>wyjwyl</author><pubDate>Sun, 21 Jan 2018 21:33:30 +0800</pubDate><description><![CDATA[Reversible Primes (20)A reversible prime in any number system is a prime whose “reverse” in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its re]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1014. Waiting in Line (30)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79122699</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79122699</guid><author>wyjwyl</author><pubDate>Sun, 21 Jan 2018 20:24:50 +0800</pubDate><description><![CDATA[Waiting in Line (30)

Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait i]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1013. Battle Over Cities (25)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79121398</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79121398</guid><author>wyjwyl</author><pubDate>Sun, 21 Jan 2018 17:20:17 +0800</pubDate><description><![CDATA[Battle Over Cities (25)It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know]]></description><category></category></item><item><title><![CDATA[HDU4496 D-City【并查集删边】]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79121015</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79121015</guid><author>wyjwyl</author><pubDate>Sun, 21 Jan 2018 16:30:36 +0800</pubDate><description><![CDATA[D-CityProblem Description 
Luxer is a really bad guy. He destroys everything he met.  
One day Luxer went to D-city. D-city has N D-points and M D-lines. Each D-line connects exactly two D-points. Luxe]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1012. The Best Rank (25)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79120301</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79120301</guid><author>wyjwyl</author><pubDate>Sun, 21 Jan 2018 14:46:34 +0800</pubDate><description><![CDATA[The Best Rank (25)To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Alge]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1011. World Cup Betting (20)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79116832</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79116832</guid><author>wyjwyl</author><pubDate>Sat, 20 Jan 2018 22:01:18 +0800</pubDate><description><![CDATA[World Cup Betting (20)

With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the World Cup tr]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1010. Radix (25)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79116749</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79116749</guid><author>wyjwyl</author><pubDate>Sat, 20 Jan 2018 20:58:37 +0800</pubDate><description><![CDATA[Radix (25)Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is “yes”, if 6 is a decimal number and 110 is a binary number.Now for any pair of posi]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1009. Product of Polynomials (25)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79110771</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79110771</guid><author>wyjwyl</author><pubDate>Fri, 19 Jan 2018 21:08:11 +0800</pubDate><description><![CDATA[Product of Polynomials (25)This time, you are supposed to find A*B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, and each lin]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1008. Elevator (20)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79110265</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79110265</guid><author>wyjwyl</author><pubDate>Fri, 19 Jan 2018 19:58:00 +0800</pubDate><description><![CDATA[Elevator (20)The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It]]></description><category></category></item><item><title><![CDATA[PAT(甲级)1007. Maximum Subsequence Sum (25)]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79110185</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79110185</guid><author>wyjwyl</author><pubDate>Fri, 19 Jan 2018 19:45:39 +0800</pubDate><description><![CDATA[Maximum Subsequence Sum (25)Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the contin]]></description><category></category></item><item><title><![CDATA[最大连续子序列和]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79105070</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79105070</guid><author>wyjwyl</author><pubDate>Fri, 19 Jan 2018 11:42:21 +0800</pubDate><description><![CDATA[最大连续子序列和 
转载于http://blog.youkuaiyun.com/sgbfblog/article/details/8032464 
最大连续子序列和问题是个很老的面试题了，最佳的解法是O(N)复杂度，当然其中的一些小的地方还是有些值得注意的地方的。这里还是总结三种常见的解法，重点关注最后一种O(N)的解法即可。需要注意的是有些题目中的最大连续子序列和如果为负，则返回0；而本题目中的最大连续子序列]]></description><category></category></item><item><title><![CDATA[Linux下ftp搭建过程中所遇到的问题]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79103824</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79103824</guid><author>wyjwyl</author><pubDate>Fri, 19 Jan 2018 10:29:36 +0800</pubDate><description><![CDATA[1.首先就是yum install -y vsftpd 和 yum install -y lftp 下载安装不成功 
简单的可以直接在vi /etc/sysconfig/network-scripts/ifcfg-eth0 里面 将 
BOOTPROTO=”dhch” 然后Esc 之后:wq 保存退出 shutdown -r now 或者init 6重启虚拟机尝试一番  
如果上面不行可以尝试更换]]></description><category></category></item><item><title><![CDATA[Linux下ftp服务器搭建]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79103098</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79103098</guid><author>wyjwyl</author><pubDate>Fri, 19 Jan 2018 09:43:04 +0800</pubDate><description><![CDATA[创建两个Linux虚拟机，完成初始配置，可以让两台Linux虚拟机能互相ping通 
修改各自的 主机名，在/etc/sysconfig/network 文件中，完成如下设置 
服务端主机名设置为 server 。客户端设置为 client 
  
  
 两台虚拟机已经ping通一、Vsftpd 简单用法 
[root@localhost ~]# yum install -y vsftpd]]></description><category></category></item><item><title><![CDATA[Linux下实现虚拟机和主机的通信]]></title><link>https://blog.youkuaiyun.com/wyjwyl/article/details/79102777</link><guid>https://blog.youkuaiyun.com/wyjwyl/article/details/79102777</guid><author>wyjwyl</author><pubDate>Fri, 19 Jan 2018 09:21:34 +0800</pubDate><description><![CDATA[1.实现虚拟机和主机的通信配置方式如下： 
首先将VMnet1和VMnet8禁用 
  
打开虚拟机 更改其网络适配器为 桥接模式 选择确定 
  
然后进入虚拟机中，进行设置IP，与宿主在同一网段的其他IP 
查看本机的IP地址和子网掩码 
打开cmd命令窗口，输入ipconfig -all  
如果是ping两台虚拟机 则输入ifconfig -a 
  
进入虚拟机，打开一个命令窗口，输入se]]></description><category></category></item></channel></rss>