<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[辛巴爱喝星巴克的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qinweibig</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qinweibig]]></copyright><item><title><![CDATA[cv 产生anchor代码解读]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/90210987</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/90210987</guid><author>qinweibig</author><pubDate>Wed, 15 May 2019 12:55:10 +0800</pubDate><description><![CDATA[import numpy as np
def generate_anchors(scales, ratios, shape, feature_stride, anchor_stride):
    """
    scales: 1D array of anchor sizes in pixels. Example: [32, 64, 128]
    ratios: 1D array o...]]></description><category></category></item><item><title><![CDATA[numpy argsort排序函数]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/82952566</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/82952566</guid><author>qinweibig</author><pubDate>Sat, 06 Oct 2018 17:34:41 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/sunshine_in_moon/article/details/48803851]]></description><category></category></item><item><title><![CDATA[numpy.cov() 计算协方差矩阵]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/82952418</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/82952418</guid><author>qinweibig</author><pubDate>Sat, 06 Oct 2018 17:16:53 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/chixujohnny/article/details/51063562]]></description><category></category></item><item><title><![CDATA[python knn分类算法]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/82688539</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/82688539</guid><author>qinweibig</author><pubDate>Thu, 13 Sep 2018 15:14:02 +0800</pubDate><description><![CDATA[
import math
import operator
def euclideanDistance(inst1,inst2,length):
    distance=0
    for x in range(length):
        distance+=pow((inst1[x]-inst2[x]),2)
    return math.sqrt(distance)

def getN...]]></description><category></category></item><item><title><![CDATA[python网格编程 mnist]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/82596436</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/82596436</guid><author>qinweibig</author><pubDate>Mon, 10 Sep 2018 21:25:48 +0800</pubDate><description><![CDATA[import numpy
import scipy.special
import matplotlib.pyplot
class neuralNetwork:
    def __init__(self,inputnodes,hiddennodes,outputnodes,learningrate) :
        self.inodes=inputnodes
        self.hno...]]></description><category></category></item><item><title><![CDATA[pat python B1046]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/82347299</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/82347299</guid><author>qinweibig</author><pubDate>Mon, 03 Sep 2018 13:18:38 +0800</pubDate><description><![CDATA[
num=int(input())
qw=[[0 for col in range(0,4)] for row in range(0,num)]
for i in range(0,num):
        qw[i]=input().split(&quot; &quot;)
num1,num2=0,0
for i in range(0,num):
    if int(qw[i][0])+int(qw[i][2])...]]></description><category></category></item><item><title><![CDATA[python PAT B1016]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/82221414</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/82221414</guid><author>qinweibig</author><pubDate>Thu, 30 Aug 2018 14:54:07 +0800</pubDate><description><![CDATA[A,a,B,b=input().split()
num1=A.count(a)
num2=B.count(b)

qw=''
qw2=''
if num1==0:qw=0
if num2==0:qw2=0
for i in range(0,num1):
    qw+=a
for i in range(0,num2):
    qw2+=b
print(int(qw)+int(qw2))]]></description><category></category></item><item><title><![CDATA[PAT B1011 A+B 和 C（15 分）]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/82181403</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/82181403</guid><author>qinweibig</author><pubDate>Wed, 29 Aug 2018 12:24:10 +0800</pubDate><description><![CDATA[num=int(input())
for i in range(0,num):
    a,b,c=input().split()
    a=int(a)
    b=int(b)
    c=int(c)
    if a+b&amp;gt;c:
        print('Case #{}: {}'.format(i+1,'true'))
    else:print('Case #{}: {}'...]]></description><category></category></item><item><title><![CDATA[用cmd打开python文件存在编码问题]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/81203485</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/81203485</guid><author>qinweibig</author><pubDate>Wed, 25 Jul 2018 15:17:42 +0800</pubDate><description><![CDATA[可以用notepad++指定文件编码来解决问题]]></description><category></category></item><item><title><![CDATA[git常用命令]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/81200839</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/81200839</guid><author>qinweibig</author><pubDate>Wed, 25 Jul 2018 13:10:19 +0800</pubDate><description><![CDATA[git config user.name&quot;&quot;去掉引号可以查看
git config user.email&quot;&quot;去掉引号可以查看
mkdir 创建文件夹
cd 进入文件夹
git init 初始git
nano-- 用nano编辑器编辑文件
git add跟踪文件
git commit -m&quot;&quot;添加版本库
git commit -am“”跟踪后直接提交到版本库
git log查看提交信giy
git ...]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1094（The largest generation） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75670146</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75670146</guid><author>qinweibig</author><pubDate>Fri, 21 Jul 2017 18:42:00 +0800</pubDate><description><![CDATA[#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010 
struct node{
 vector child;
 int level; ]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1090（ Highest Price in Supply Chain ） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75645050</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75645050</guid><author>qinweibig</author><pubDate>Fri, 21 Jul 2017 14:17:20 +0800</pubDate><description><![CDATA[点击打开链接
#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010 
struct node{//记录最长路径 和个数还有更好的方法 
]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1079（ Total Sales of Supply Chain ） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75639871</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75639871</guid><author>qinweibig</author><pubDate>Fri, 21 Jul 2017 13:27:17 +0800</pubDate><description><![CDATA[点击打开链接
#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010
struct node{
 int pnum;
 vector c]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1102（ Invert a Binary Tree  ） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75579707</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75579707</guid><author>qinweibig</author><pubDate>Fri, 21 Jul 2017 01:44:01 +0800</pubDate><description><![CDATA[#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010
struct node{//由于题目中直接 给出了节点关系 用静态二叉树比较方便 
]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1086（ The best rank ） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75453417</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75453417</guid><author>qinweibig</author><pubDate>Thu, 20 Jul 2017 02:04:04 +0800</pubDate><description><![CDATA[点击打开链接       
#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010
struct node{
 int id;
 nod]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1053（ Path of Equal Weight） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75269817</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75269817</guid><author>qinweibig</author><pubDate>Tue, 18 Jul 2017 00:31:27 +0800</pubDate><description><![CDATA[#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010
int s;
struct node{//注意为什么才用先更遍历 是因为到达某个节点]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1012（ The best rank ） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75195365</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75195365</guid><author>qinweibig</author><pubDate>Sun, 16 Jul 2017 01:52:15 +0800</pubDate><description><![CDATA[自认为完美 但有两分没有调试成功点击打开链接
#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010


struct subject{]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1020（ Tree traverse ） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75135847</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75135847</guid><author>qinweibig</author><pubDate>Fri, 14 Jul 2017 20:18:40 +0800</pubDate><description><![CDATA[点击打开pat链接
#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010
int pre[maxn];
int post[maxn];]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1082（ Read Number in Chinese ） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75094642</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75094642</guid><author>qinweibig</author><pubDate>Fri, 14 Jul 2017 00:11:32 +0800</pubDate><description><![CDATA[点击打开pat链接
#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010 
int store[maxn];
int num;
str]]></description><category></category></item><item><title><![CDATA[PAT程序设计考题——甲级1077（Kuchiguse ） C++实现]]></title><link>https://blog.youkuaiyun.com/qinweibig/article/details/75040210</link><guid>https://blog.youkuaiyun.com/qinweibig/article/details/75040210</guid><author>qinweibig</author><pubDate>Wed, 12 Jul 2017 19:30:08 +0800</pubDate><description><![CDATA[点击打开pat链接
#include 
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 100000000
#define maxn 100010 
vector sto;
 string temp;
voi]]></description><category></category></item></channel></rss>