<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[J.DiCaprio的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Jdicaprio</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Jdicaprio]]></copyright><item><title><![CDATA[PyCharm使用SSH远程连接服务器时，无法加载Conda环境，出现Com.google.gson.stream.MalformedJsonException问题]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/144950342</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/144950342</guid><author>Jdicaprio</author><pubDate>Sun, 05 Jan 2025 20:22:31 +0800</pubDate><description><![CDATA[报错信息：Com.google.gson.stream.MalformedJsonException: Expected value at line 1 column 1 path $PyCharm 无法自动检测远程 conda 环境，当选择 conda 路径时，PyCharm 无法识别它。，在使用本地SSH连接服务器之后，base环境下直接运行下面代码，问题即可解决。]]></description><category></category></item><item><title><![CDATA[【小论文相关问题】]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/140294878</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/140294878</guid><author>Jdicaprio</author><pubDate>Tue, 09 Jul 2024 14:36:17 +0800</pubDate><description><![CDATA[比如目录结构如下的情况，从CVPR包下的train module导入utilis包下的utils module。)来获得文件所在的绝对路径。使用两个os.path.dirname(）来代替相对路径中的“…修改模块内容，添加绝对搜索路径。此处用os.path.realpath(]]></description><category></category></item><item><title><![CDATA[Java环境配置及IDEA安装]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/125282452</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/125282452</guid><author>Jdicaprio</author><pubDate>Sun, 19 Jun 2022 12:48:21 +0800</pubDate><description><![CDATA[Java环境配置、intellij IDEA安装]]></description><category></category></item><item><title><![CDATA[[PAT] A1143/A1151 Lowest Common Ancestor]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119737007</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119737007</guid><author>Jdicaprio</author><pubDate>Mon, 16 Aug 2021 17:13:04 +0800</pubDate><description><![CDATA[A1143/A1151 Lowest Common Ancestor1143	Lowest Common Ancestor1151	LCA in a Binary Tree
1143	Lowest Common Ancestor
Link
1143 Lowest Common Ancestor (30 分)
The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U a]]></description><category></category></item><item><title><![CDATA[[PAT] A1153 Decode Registration Card of PAT]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119399042</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119399042</guid><author>Jdicaprio</author><pubDate>Thu, 05 Aug 2021 02:09:32 +0800</pubDate><description><![CDATA[A1153 Decode Registration Card of PATLinkInput SpecificationOutput SpecificationSample Input &amp; OutputSample InputSample OutputTopicAnalysis &amp; Code
Link
1153 Decode Registration Card of PAT (25 分)
A registration card number of PAT consists of 4 part]]></description><category></category></item><item><title><![CDATA[[PAT] A1152 Google Recruitment]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119398709</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119398709</guid><author>Jdicaprio</author><pubDate>Thu, 05 Aug 2021 01:53:24 +0800</pubDate><description><![CDATA[A1152 Google RecruitmentLinkInput SpecificationOutput SpecificationSample Input &amp; OutputSample Input 1Sample Output 1Sample Input 2Sample Output 2TopicAnalysis &amp; Code
Link
1152 Google Recruitment (20 分)
In July 2004, Google posted on a giant billbo]]></description><category></category></item><item><title><![CDATA[[PAT] A1016 Phone Bills]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119224816</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119224816</guid><author>Jdicaprio</author><pubDate>Fri, 30 Jul 2021 00:46:49 +0800</pubDate><description><![CDATA[A1016 Phone BillsLinkInput SpecificationOutput SpecificationSample InputSample OutputCode
Link
1016 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 mi]]></description><category></category></item><item><title><![CDATA[[PAT] A1015 Reversible Primes]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119192317</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119192317</guid><author>Jdicaprio</author><pubDate>Wed, 28 Jul 2021 23:15:39 +0800</pubDate><description><![CDATA[A1015 Reversible PrimesInput SpecificationOutput SpecificationSample InputSample OutputCode
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]]></description><category></category></item><item><title><![CDATA[[PAT] A1012 The Best Rank]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119121136</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119121136</guid><author>Jdicaprio</author><pubDate>Mon, 26 Jul 2021 23:45:21 +0800</pubDate><description><![CDATA[A1012 The Best RankInput SpecificationOutput SpecificationSample InputSample OutputCode
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]]></description><category></category></item><item><title><![CDATA[[PAT] A1011 World Cup Betting]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119028766</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119028766</guid><author>Jdicaprio</author><pubDate>Fri, 23 Jul 2021 11:55:24 +0800</pubDate><description><![CDATA[A1008 ElevatorInput SpecificationOutput SpecificationSample InputSample OutputCode
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]]></description><category></category></item><item><title><![CDATA[[PAT] A1009 Product of Polynomials]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119028534</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119028534</guid><author>Jdicaprio</author><pubDate>Fri, 23 Jul 2021 11:48:02 +0800</pubDate><description><![CDATA[A1009 Product of PolynomialsInput SpecificationOutput SpecificationSample InputSample OutputCode
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 lin]]></description><category></category></item><item><title><![CDATA[[PAT] A1008 Elevator]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119011212</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119011212</guid><author>Jdicaprio</author><pubDate>Thu, 22 Jul 2021 23:12:40 +0800</pubDate><description><![CDATA[A1008 ElevatorInput SpecificationOutput SpecificationSample InputSample OutputCode
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 spec]]></description><category></category></item><item><title><![CDATA[[PAT] A1006 Sign In and Sign Out]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119009741</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119009741</guid><author>Jdicaprio</author><pubDate>Thu, 22 Jul 2021 21:51:01 +0800</pubDate><description><![CDATA[A1006 Sign In and Sign OutInput SpecificationOutput SpecificationSample InputSample OutputCode
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the]]></description><category></category></item><item><title><![CDATA[[PAT] A1005 Spell It Right]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119009691</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119009691</guid><author>Jdicaprio</author><pubDate>Thu, 22 Jul 2021 21:43:31 +0800</pubDate><description><![CDATA[A1005 Spell It RightInput SpecificationOutput SpecificationSample InputSample OutputCode
Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.
Input Specification
Each input fi]]></description><category></category></item><item><title><![CDATA[[PAT] A1003 Emergency]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/119009540</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/119009540</guid><author>Jdicaprio</author><pubDate>Thu, 22 Jul 2021 21:40:55 +0800</pubDate><description><![CDATA[A1003 EmergencyInput SpecificationOutput SpecificationSample InputSample OutputCode
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue ]]></description><category></category></item><item><title><![CDATA[[PAT] A1002 A+B for Polynomials (23分!)]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/118973838</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/118973838</guid><author>Jdicaprio</author><pubDate>Wed, 21 Jul 2021 19:11:39 +0800</pubDate><description><![CDATA[A1002 A+B for PolynomialsInput SpecificationOutput SpecificationSample InputSample OutputCode
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,]]></description><category></category></item><item><title><![CDATA[[PAT] A1001 A+B Format]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/118973676</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/118973676</guid><author>Jdicaprio</author><pubDate>Wed, 21 Jul 2021 18:57:01 +0800</pubDate><description><![CDATA[A1001  A+B FormatInput SpecificationOutput SpecificationSample InputSample OutputCode
Calculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).
Input]]></description><category></category></item><item><title><![CDATA[[Deep Learning-Andrew] Course1 Week2]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/116465414</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/116465414</guid><author>Jdicaprio</author><pubDate>Thu, 06 May 2021 23:07:30 +0800</pubDate><description><![CDATA[Python Basics with Numpy1 - Building basic functions with numpy1.1 - sigmoid function,  np.exp():
1 - Building basic functions with numpy
1.1 - sigmoid function,  np.exp():
				????????????????????????????(????) = 1 / 1+e^-x^

import math
def basic_sigmoid]]></description><category></category></item><item><title><![CDATA[[CCF-CSP] 201609-2 火车购票]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/114108777</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/114108777</guid><author>Jdicaprio</author><pubDate>Thu, 25 Feb 2021 23:50:12 +0800</pubDate><description><![CDATA[201609-2 火车购票输入格式输出格式样例输入样例输出样例说明 及 评测用例规模与约定分析Code（C++）
　　请实现一个铁路购票系统的简单座位分配算法，来处理一节车厢的座位分配。
　　假设一节车厢有20排、每一排5个座位。为方便起见，我们用1到100来给所有的座位编号，第一排是1到5号，第二排是6到10号，依次类推，第20排是96到100号。
　　购票时，一个人可能购一张或多张票，最多不超过5张。如果这几张票可以安排在同一排编号相邻的座位，则应该安排在编号最小的相邻座位。否则应该安排在编号最小的几个]]></description><category></category></item><item><title><![CDATA[[CCF-CSP] 201609-1 最大波动]]></title><link>https://blog.youkuaiyun.com/Jdicaprio/article/details/114078800</link><guid>https://blog.youkuaiyun.com/Jdicaprio/article/details/114078800</guid><author>Jdicaprio</author><pubDate>Thu, 25 Feb 2021 13:55:08 +0800</pubDate><description><![CDATA[201512-1 数位之和输入格式输出格式样例输入样例输出样例说明 及 评测用例规模与约定分析Code（C++）
小明正在利用股票的波动程度来研究股票。小明拿到了一只股票每天收盘时的价格，他想知道，这只股票连续几天的最大波动值是多少，即在这几天中某天收盘价格与前一天收盘价格之差的绝对值最大是多少。
输入格式
输入的第一行包含了一个整数n，表示小明拿到的收盘价格的连续天数。
第二行包含n个正整数，依次表示每天的收盘价格。
输出格式
输出一个整数，表示这只股票这n天中的最大波动值。
样例输入
6
2 5 5 7]]></description><category></category></item></channel></rss>