<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[imxike的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/imxike</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; imxike]]></copyright><item><title><![CDATA[java打印杨辉三角]]></title><link>https://blog.youkuaiyun.com/imxike/article/details/103837054</link><guid>https://blog.youkuaiyun.com/imxike/article/details/103837054</guid><author>imxike</author><pubDate>Sat, 04 Jan 2020 20:05:58 +0800</pubDate><description><![CDATA[package hello;

import java.util.Scanner;

public class Test {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int[][] arr = new i...]]></description><category></category></item><item><title><![CDATA[python实现筛法求素数]]></title><link>https://blog.youkuaiyun.com/imxike/article/details/83381274</link><guid>https://blog.youkuaiyun.com/imxike/article/details/83381274</guid><author>imxike</author><pubDate>Thu, 25 Oct 2018 16:05:37 +0800</pubDate><description><![CDATA[
def iters():#先构造一个从3开始的奇数序列。这是一个生成器，并且是一个无限序列
    n=1
    while 1:
        n=n+2
        yield n
def isinit(n):#筛选函数
    return lambda x:x%n&amp;gt;0
def prime():
    yield 2
    it=iters()# 初始序列
    whi...]]></description><category></category></item><item><title><![CDATA[python输出杨辉三角]]></title><link>https://blog.youkuaiyun.com/imxike/article/details/83338622</link><guid>https://blog.youkuaiyun.com/imxike/article/details/83338622</guid><author>imxike</author><pubDate>Wed, 24 Oct 2018 09:14:21 +0800</pubDate><description><![CDATA[
def yhsj(max):

    n=0

    row = [1]

    while (n&amp;lt;max):

        n+=1

        yield(row)

        row = [1] + [row[k] + row[k + 1] for k in range(len(row) - 1)] + [1]



y=yhsj(3)

for i in y:...]]></description><category></category></item><item><title><![CDATA[使用VS code配置python调试环境遇到timeout waiting for debugger]]></title><link>https://blog.youkuaiyun.com/imxike/article/details/83245223</link><guid>https://blog.youkuaiyun.com/imxike/article/details/83245223</guid><author>imxike</author><pubDate>Sun, 21 Oct 2018 20:57:39 +0800</pubDate><description><![CDATA[文件-首选项-设置-



打开seeting.json

添加

&quot;editor.multiCursorModifier&quot;: &quot;ctrlCmd&quot;,

&quot;terminal.integrated.shell.windows&quot;: &quot;C:\\WINDOWS\\System32\\cmd.exe&quot;]]></description><category></category></item><item><title><![CDATA[。。。]]></title><link>https://blog.youkuaiyun.com/imxike/article/details/80032880</link><guid>https://blog.youkuaiyun.com/imxike/article/details/80032880</guid><author>imxike</author><pubDate>Sat, 21 Apr 2018 20:01:09 +0800</pubDate><description><![CDATA[约瑟夫中的递归思想解法：例题：点击打开链接解法：点击打开链接]]></description><category></category></item><item><title><![CDATA[求质数的相关高效算法]]></title><link>https://blog.youkuaiyun.com/imxike/article/details/79979125</link><guid>https://blog.youkuaiyun.com/imxike/article/details/79979125</guid><author>imxike</author><pubDate>Sat, 21 Apr 2018 19:15:13 +0800</pubDate><description><![CDATA[1.利用一个定理——如果一个数是合数，那么它的最小质因数肯定小于等于他的平方根。例如：50，最小质因数是2，2&amp;lt;50的开根号再比如：15，最小质因数是3，3&amp;lt;15的开根号　　合数是与质数相对应的自然数。一个大于1的自然数如果它不是合数，则它是质数。　　上面的定理是说，如果一个数能被它的最小质因数整除的话，那它肯定是合数，即不是质数。所以判断一个数是否是质数，只需判断它是否能被小于它开跟...]]></description><category></category></item><item><title><![CDATA[斐波那契数列相关算法及例题]]></title><link>https://blog.youkuaiyun.com/imxike/article/details/79979243</link><guid>https://blog.youkuaiyun.com/imxike/article/details/79979243</guid><author>imxike</author><pubDate>Sat, 21 Apr 2018 19:14:59 +0800</pubDate><description><![CDATA[1..循环    时间复杂度O(n)int f(int a)
{
	int f0=0,f1=1,f2=1;
	if(a)
	{
		for(int i=1;i&amp;lt;a;i++)
	{
		f2=f0+f1;
		f0=f1;
		f1=f2;
	}
	return f2;
	}
	else return 0;
}2.矩阵求解    时间复杂度O(logn)    斐波那契的递推公式可以表示成如下...]]></description><category></category></item></channel></rss>