<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Fearain的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Fearain</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Fearain]]></copyright><item><title><![CDATA[Paddlehub安装血泪史]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/118791706</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/118791706</guid><author>Fearain</author><pubDate>Fri, 16 Jul 2021 13:15:51 +0800</pubDate><description><![CDATA[这段时间刚刚入职，要求要学习paddlepaddle，用OCR，我电脑原本就装了cudnn，anaconda这些工具的，因此就直接在现有的环境上安装paddlepaddle。

由于太久没有使用anaconda（三年前的了，python3.6），我直接在base环境下装了一下，好像没装上，然后才想到要新建一个虚拟环境 ，在这个虚拟环境中安装paddlepaddle和paddlehub。

在这个过程中，paddlepaddle很好装，用 conda install paddle paddle 就可以安装上，]]></description><category></category></item><item><title><![CDATA[LeetCode 347 Top K Frequent Elements]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/107491017</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/107491017</guid><author>Fearain</author><pubDate>Tue, 21 Jul 2020 16:49:19 +0800</pubDate><description><![CDATA[题目：

Given a non-empty array of integers, return the k most frequent elements.

思路：

我是用比较暴力的方法求解了一遍，先全部排序，然后用结构体记录每个值的个数，最后按照个数进行排序，取前k个值。


struct Node{
    int count;
    int val;
};

int compare(Node a, Node b) {
    if (a.count &gt; b.count)
        r]]></description><category></category></item><item><title><![CDATA[java笔记]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/78464006</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/78464006</guid><author>Fearain</author><pubDate>Tue, 07 Nov 2017 09:07:04 +0800</pubDate><description><![CDATA[1.构造器


构造器负责类中成员变量（域）的初始化


2.静态变量 该类中所有对象可共享的变量 属于整个类所有 推荐用类名访问


3.静态方法 静态方法中可以直接调用同类中的静态成员，但不能直接调用非静态成员


  如果希望在静态方法中调用非静态变量，可以通过创建类的对象，然后通过对象来访问非静态变量


  在 普通成员方法 中，则可以 直接 访问 同类的非]]></description><category></category></item><item><title><![CDATA[hdu1016 Prime Ring Problem]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/65457991</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/65457991</guid><author>Fearain</author><pubDate>Thu, 23 Mar 2017 23:02:05 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;

int n, a[21], vid[21];

bool isP(int c)
{
    int q = sqrt(c);
    if (c == 2)
    {
        return true;
]]></description><category></category></item><item><title><![CDATA[我的软件工程课目标（作业向）]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/61417054</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/61417054</guid><author>Fearain</author><pubDate>Sat, 11 Mar 2017 15:23:47 +0800</pubDate><description><![CDATA[在这个大三的下学期，我们开始了学习软件工程的课程。作为一名学习软件工程专业的学生，这门课是非常重要的。因此，我需要确定我在软件工程这门课上的目标。
根据百度百科，软件工程专业是一门研究用工程化方法构建和维护有效的、实用的和高质量的软件的学科，软件工程的目标是：在给定成本、进度的前提下，开发出具有适用性、有效性、可修改性、可靠性、可理解性、可维护性、可重用性、可移植性、可追踪性、可互操作性和满足用]]></description><category></category></item><item><title><![CDATA[hdu 5326 Work]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/54408762</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/54408762</guid><author>Fearain</author><pubDate>Fri, 13 Jan 2017 15:09:34 +0800</pubDate><description><![CDATA[哈哈，放假回家一周啦！这几天真是堕落得不像话（这就是为啥我会一直处在菜鸟阶段。。O.O），今天突然来了兴致开始刷题了。嗯，放着史诗BGM刷题，感觉不错不错！希望在新的一年里面能够勤奋努力学习！（感觉离我还很遥远。。）#include
#include
#include
#include
#include
#include
using namespace std;
#define MAX_N 100]]></description><category></category></item><item><title><![CDATA[hdu 1300 Pearls]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53748719</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53748719</guid><author>Fearain</author><pubDate>Mon, 19 Dec 2016 20:50:42 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
using namespace std;
#define MAX_N 100005
#define INF 1000000000

int main()
{
    int t, c, a[1003], p[1003], dpp[102];
    cin>>t;
    while (t-]]></description><category></category></item><item><title><![CDATA[hdu 1158 Employment Planning]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53488088</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53488088</guid><author>Fearain</author><pubDate>Tue, 06 Dec 2016 16:04:14 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 

using namespace std;

const int MAX = 500005;
int dp[13][MAX] = {0};

int main()
{
    int n, h, s, f, p[20], mw;
    while (cin>>n, n) {
        cin]]></description><category></category></item><item><title><![CDATA[hdu2151 worm]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53466576</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53466576</guid><author>Fearain</author><pubDate>Mon, 05 Dec 2016 16:29:33 +0800</pubDate><description><![CDATA[#include #include 
#include 
#include 
#include 

using namespace std;

const int MAX = 105;

int n, p, m, t, dp[MAX][MAX];

int main()
{
    while (scanf("%d%d%d%d", &n, &p, &m, &t) != EOF) {
       ]]></description><category></category></item><item><title><![CDATA[hdu 2845  Beans]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53363155</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53363155</guid><author>Fearain</author><pubDate>Sun, 27 Nov 2016 10:01:35 +0800</pubDate><description><![CDATA[#include
#include
#include

using namespace std;

//很多二维的问题能够分解成两个一维的问题

int x[200002], y[200002];

int main()
{
    int n, m, a;
    while (cin>>n>>m) {  //顺手就写成了（cin>>n>>m,n|m）然后就TLE了。。。&_&
        ]]></description><category></category></item><item><title><![CDATA[C++ 初始化数组为负无穷]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53362955</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53362955</guid><author>Fearain</author><pubDate>Sun, 27 Nov 2016 06:59:31 +0800</pubDate><description><![CDATA[memset(d, 0x8f,
sizeof(d));]]></description><category></category></item><item><title><![CDATA[poj 3641  Pseudoprime numbers]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53353708</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53353708</guid><author>Fearain</author><pubDate>Sat, 26 Nov 2016 18:24:12 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 

using namespace std;

typedef long long int ll;//好吧，这次是因为没有使用long long。。。。

ll mod_pow(ll x, ll n, ll mod)
{
    ll res = 1;
    while (n > 0) {
    ]]></description><category></category></item><item><title><![CDATA[hdu 1203 I NEED A OFFER!]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53258688</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53258688</guid><author>Fearain</author><pubDate>Mon, 21 Nov 2016 13:39:06 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#define min(x, y) (x) < (y) ? (x) : (y)
using namespace std;

    int n, m, a[10002];
    double b[10002];
    double dp[10002];

int main()
{
    while (c]]></description><category></category></item><item><title><![CDATA[hdu 1372 Knight Moves]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53246583</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53246583</guid><author>Fearain</author><pubDate>Sun, 20 Nov 2016 22:29:20 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;

typedef struct Node
{
    int x, y, stp;
}Node;

int vid[9][9];
int dir[8][2] = {1, -2, -1, -2,
                 -2, -1, -2, 1,
     ]]></description><category></category></item><item><title><![CDATA[poj 2352 Stars]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53244512</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53244512</guid><author>Fearain</author><pubDate>Sun, 20 Nov 2016 20:58:11 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;

int n, levels[32005], c[32005];

int lowbit(int x)
{
    return x & (-x);
}

int sum(int x)
{
    int s = 0;
    while (x > 0)
    {
]]></description><category></category></item><item><title><![CDATA[hdu 1232 畅通工程]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53244145</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53244145</guid><author>Fearain</author><pubDate>Sun, 20 Nov 2016 20:19:33 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;

int p[10002];
int ra[10002] = {0};
void init(int n)
{
    for (int i = 0; i <= n; i++)
        p[i] = i;
}

int fd(int x)
{
    if (x]]></description><category></category></item><item><title><![CDATA[poj 1979 Red and Black]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53241366</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53241366</guid><author>Fearain</author><pubDate>Sun, 20 Nov 2016 16:00:06 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;

typedef struct Node
{
    int x, y;
}Node;

int main()
{
    int m, n, si, sj;
    int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
    char g[21][21];]]></description><category></category></item><item><title><![CDATA[hdu 1548 A strange lift]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53241204</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53241204</guid><author>Fearain</author><pubDate>Sun, 20 Nov 2016 15:40:12 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;

typedef struct Node
{
    int cf, stp;
}Node;

int main()
{
    int n, a, b, k[202], ans, vid[202];

    while (cin>>n, n)
    {
        cin>>a>>b;
   ]]></description><category></category></item><item><title><![CDATA[poj 1061 青蛙的约会]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53240948</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53240948</guid><author>Fearain</author><pubDate>Sun, 20 Nov 2016 14:59:24 +0800</pubDate><description><![CDATA[#include
using namespace std;

typedef long long LL;

LL ex_gcd(LL a, LL b, LL &x, LL &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    LL ans = ex_gcd(b, a%b, x, y]]></description><category></category></item><item><title><![CDATA[poj 3050 Hopscotch]]></title><link>https://blog.youkuaiyun.com/Fearain/article/details/53114163</link><guid>https://blog.youkuaiyun.com/Fearain/article/details/53114163</guid><author>Fearain</author><pubDate>Thu, 10 Nov 2016 11:40:56 +0800</pubDate><description><![CDATA[这道题我是用一棵高度为 6 的树来存储路径，每一个叶子节点表示一条不同的路径，第k层就表示第k步，每生成一条路径，就从树的根部开始查找，若在第 i 层没有找到该路径下的第 i 步的数字，便添加进树的第 i 层中
#include 
#include 
#include 
#include 
using namespace std;

typedef struct Node{
    int v,]]></description><category></category></item></channel></rss>