<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[weixin_40076972的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/weixin_40076972</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; weixin_40076972]]></copyright><item><title><![CDATA[配环境踩过的坑（RuntimeError: Error compiling objects for extension）]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/109272349</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/109272349</guid><author>weixin_40076972</author><pubDate>Sun, 25 Oct 2020 12:44:11 +0800</pubDate><description><![CDATA[（RuntimeError: Error compiling objects for extension）
可能是你的pytorch与cuda版本不匹配
根据我的了解
cuda10.2+pytorch1.5
cuda10.1+pytorch1.6

]]></description><category></category></item><item><title><![CDATA[/usr/bin/xauth:  error in locking authority file /**/.Xauthority]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/105565310</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/105565310</guid><author>weixin_40076972</author><pubDate>Thu, 16 Apr 2020 19:38:40 +0800</pubDate><description><![CDATA[解决办法：/usr/bin/xauth:  error in locking authority file /**/.Xauthority
可能是个人目录下内存不足,删除一些用不到的文件即可。
rm -rf ***

]]></description><category></category></item><item><title><![CDATA[Google基于TensorFlow.js框架的bodypix和posenet踩坑过程（windows版）]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/104024284</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/104024284</guid><author>weixin_40076972</author><pubDate>Fri, 17 Jan 2020 22:27:29 +0800</pubDate><description><![CDATA[引入
Google官方推出的使用TensorFlow.js的工具
基于浏览器调用预训练的模型

两种方法实现方式相同，侧重点略有不同
代码来源
代码github
https://github.com/tensorflow/tfjs-models.git

详细的readme可以直接在github获得，本文重点介绍具体的配置流程。
运行步骤
1.打开demos文件夹


2.安装node.js
ht...]]></description><category></category></item><item><title><![CDATA[人体姿态估计数据集(附详细信息、地址及论文)]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/103953308</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/103953308</guid><author>weixin_40076972</author><pubDate>Mon, 13 Jan 2020 10:47:46 +0800</pubDate><description><![CDATA[人体姿态估计数据集2D数据集1.LSP2.FLIC3.MPII4.MSCOCO5.AI Challenge6.PoseTrack3D数据集1.Human3.6M2.HumanEva3.Total Capture / CMU4.JTA Dataset5.MPI-INF-3DHP6.SURREAL7.3DPW8.UP-3D9.DensePose COCO
2D数据集
1.LSP
地址：http://s...]]></description><category></category></item><item><title><![CDATA[区间内非对称素数]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88781519</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88781519</guid><author>weixin_40076972</author><pubDate>Sun, 24 Mar 2019 20:34:49 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;

using namespace std;

int main()
{
    int a,b;
    cin&gt;&gt;a&gt;&gt;b;
    int sum=0;
    for(int i=a;i&lt;=b;i++)
    {
        int flag=1;
        for(int j=2;j*j&lt;i...]]></description><category></category></item><item><title><![CDATA[出现次数最多的数]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88748877</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88748877</guid><author>weixin_40076972</author><pubDate>Fri, 22 Mar 2019 19:28:31 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using  namespace std; 
/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main() {
	int n;
	cin&gt;&gt;n;
	int a[1000];...]]></description><category></category></item><item><title><![CDATA[输出三角型]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88416819</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88416819</guid><author>weixin_40076972</author><pubDate>Tue, 12 Mar 2019 11:07:47 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#include &amp;lt;iomanip&amp;gt;
using namespace std;

int main()
{
   int n;
   cin&amp;gt;&amp;gt;n;
   int i,j,k;
   
   for(i=1;i&amp;lt;=n;i++)
   {
   		for(j=1;j&amp;lt;=n-i;j++)
   		 cout&amp;l...]]></description><category></category></item><item><title><![CDATA[杭电OJ1996汉诺塔]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88368067</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88368067</guid><author>weixin_40076972</author><pubDate>Sat, 09 Mar 2019 16:40:33 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;

using namespace std;

int main()
{
    int n;
cin&amp;gt;&amp;gt;n;
    while(n--)
    {
        int t;
        cin&amp;gt;&amp;gt;t;
        long long  num=3;
        for(int i=1;i&amp;lt;t;i+...]]></description><category></category></item><item><title><![CDATA[杭电OJ2055]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88169503</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88169503</guid><author>weixin_40076972</author><pubDate>Tue, 05 Mar 2019 10:06:24 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;

using namespace std;

int main()
{ char m;
  int n;
  int sum=0;
  int t;
  cin&amp;gt;&amp;gt;t;
  while(t--)
while (cin&amp;gt;&amp;gt;m&amp;gt;&amp;gt;n){
         sum= m-'0';
 //       cout &amp;lt...]]></description><category></category></item><item><title><![CDATA[杭电OJ2020（绝对值排序）]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88091032</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88091032</guid><author>weixin_40076972</author><pubDate>Sun, 03 Mar 2019 17:38:46 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cmath&amp;gt;
using namespace std;

int main()
{
    int n;
    while(cin&amp;gt;&amp;gt;n){

           if(n==0)
                break;
    int a[100];


    for(int k=1;k&amp;...]]></description><category></category></item><item><title><![CDATA[杭电OJ2018（母牛生小牛）]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88090512</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88090512</guid><author>weixin_40076972</author><pubDate>Sun, 03 Mar 2019 17:06:07 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;

using namespace std;

int main()
{
    int n;
    while(cin&amp;gt;&amp;gt;n){int a[100];
        if(n==0)
            break;
       a[1]=1;
       a[2]=2;
       a[3]=3;
       a[4...]]></description><category></category></item><item><title><![CDATA[杭电OJ2019（冒泡排序）]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88090464</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88090464</guid><author>weixin_40076972</author><pubDate>Sun, 03 Mar 2019 17:04:32 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;

using namespace std;

int main()
{
    int n,m;
    while(cin&amp;gt;&amp;gt;n&amp;gt;&amp;gt;m){

           if(n==0 &amp;amp;&amp;amp; m==0)
                break;

    int a[100];
    a[0]=m;

 ...]]></description><category></category></item><item><title><![CDATA[杭电OJ2016C++]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88081873</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88081873</guid><author>weixin_40076972</author><pubDate>Sat, 02 Mar 2019 21:33:33 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;

using namespace std;

int main()
{
    int n;
    while(cin&amp;gt;&amp;gt;n)
    {  if(n==0)
            break;
         int t;
        t=n;
        int a[100];

            int mi...]]></description><category></category></item><item><title><![CDATA[杭电oj2014C++]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88081057</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88081057</guid><author>weixin_40076972</author><pubDate>Sat, 02 Mar 2019 20:44:14 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#include &amp;lt;iomanip&amp;gt;
using namespace std;

int main()
{
    int n;
    while(cin&amp;gt;&amp;gt;n)
    {int t;
        t=n-2;
        double avg=0;
        int a,sum=0;
        i...]]></description><category></category></item><item><title><![CDATA[杭电OJ2013C++]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88050629</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88050629</guid><author>weixin_40076972</author><pubDate>Fri, 01 Mar 2019 10:34:14 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;

using namespace std;

int main()
{
    int t;
    while(cin&amp;gt;&amp;gt;t){
    int n=1;
    t--;
    while(t--)
    {

        n=(n+1)*2;
    }
    cout &amp;lt;&amp;lt;n&amp;lt;&amp;lt; endl;
...]]></description><category></category></item><item><title><![CDATA[杭电OJ2012C++（素数判定）]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88050023</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88050023</guid><author>weixin_40076972</author><pubDate>Fri, 01 Mar 2019 10:15:27 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;

using namespace std;

int main()
{
    int a,b;
    while(cin&amp;gt;&amp;gt;a&amp;gt;&amp;gt;b)
    {int n=0,flag=0;
        if(a==0 &amp;amp;&amp;amp; b==0)
            break;
        for(int i=a...]]></description><category></category></item><item><title><![CDATA[杭电OJ2629C++]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88049785</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88049785</guid><author>weixin_40076972</author><pubDate>Fri, 01 Mar 2019 10:07:13 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;

using namespace std;

int main()
{
    int n;
    cin&amp;gt;&amp;gt;n;
    while(n--){
        char a[100];
        cin&amp;gt;&amp;gt;a;
       // cout &amp;lt;&amp;lt;a[0]&amp;lt;&amp;lt;a[1];

        ...]]></description><category></category></item><item><title><![CDATA[杭电OJ1197]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88049118</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88049118</guid><author>weixin_40076972</author><pubDate>Fri, 01 Mar 2019 09:34:24 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;

using namespace std;

int main()
{
    for(int i=1000;i&amp;lt;10000;i++){
        int a=0,b=0,c=0,m=0,n=0;
        int r=i;
        c=i/1000+i/10%10+i/100%10+i%10;
        whil...]]></description><category></category></item><item><title><![CDATA[杭电OJ1170]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/88048823</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/88048823</guid><author>weixin_40076972</author><pubDate>Fri, 01 Mar 2019 09:15:47 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#include &amp;lt;iomanip&amp;gt;
#include &amp;lt;cmath&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
using namespace std;

int main()
{
    int n;
    cin&amp;gt;&amp;gt;n;
    while(n--)
    {
        char c;
...]]></description><category></category></item><item><title><![CDATA[杭电OJ 1720   进制处理]]></title><link>https://blog.youkuaiyun.com/weixin_40076972/article/details/86747351</link><guid>https://blog.youkuaiyun.com/weixin_40076972/article/details/86747351</guid><author>weixin_40076972</author><pubDate>Sat, 02 Feb 2019 09:11:49 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
using namespace std;

int main()
{
    int a,b;

    while(cin&amp;gt;&amp;gt;hex&amp;gt;&amp;gt;a&amp;gt;&amp;gt;b)   
    cout&amp;lt;&amp;lt;dec&amp;lt;&amp;lt;a+b&amp;lt;&amp;lt;endl;;

    return 0;
}


]]></description><category></category></item></channel></rss>