<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Pinaceae的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Pinaceae</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Pinaceae]]></copyright><item><title><![CDATA[Contest 8B Rail Station]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78964062</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78964062</guid><author>Pinaceae</author><pubDate>Wed, 03 Jan 2018 18:10:06 +0800</pubDate><description><![CDATA[Problem B: Rail station
Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 479  Solved: 243
[Submit][Status][Web
 Board]

Description

There is a famous railway station in PopPush City. Country t]]></description><category></category></item><item><title><![CDATA[Contest 8A The Maze runner]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78945268</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78945268</guid><author>Pinaceae</author><pubDate>Mon, 01 Jan 2018 13:20:56 +0800</pubDate><description><![CDATA[Problem A: The Maze runner
Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 468  Solved: 256
[Submit][Status][Web
 Board]

Description


Given a maze, find a shortest path from start to exit.]]></description><category></category></item><item><title><![CDATA[Contest 7B  Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78945260</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78945260</guid><author>Pinaceae</author><pubDate>Mon, 01 Jan 2018 13:18:16 +0800</pubDate><description><![CDATA[Problem B: Remove Nth Node From End of List
Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 221  Solved: 68
[Submit][Status][Web
 Board]

Description


Given a linked list, remove the nth nod]]></description><category></category></item><item><title><![CDATA[Contest 7 Big vs Big (2)]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78945246</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78945246</guid><author>Pinaceae</author><pubDate>Mon, 01 Jan 2018 13:14:58 +0800</pubDate><description><![CDATA[Problem A: Big vs Big (2)
Time Limit: 3 Sec  Memory Limit: 128 MB
Submit: 332  Solved: 183
[Submit][Status][Web
 Board]

Description


Calculate the addtion of any two positive big integers.]]></description><category></category></item><item><title><![CDATA[Contest6 The K-th largest number]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78713586</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78713586</guid><author>Pinaceae</author><pubDate>Mon, 04 Dec 2017 20:40:00 +0800</pubDate><description><![CDATA[Problem B: The K-th largest number
Time Limit: 2 Sec  Memory Limit: 40 MB
Submit: 856  Solved: 233
[Submit][Status][Web
 Board]

Description


Given N integer numbers, find the K-th largest n]]></description><category></category></item><item><title><![CDATA[contest6:A dilemma of HR]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78713507</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78713507</guid><author>Pinaceae</author><pubDate>Mon, 04 Dec 2017 20:35:52 +0800</pubDate><description><![CDATA[Problem A: A dilemma of HR
Time Limit: 1 Sec  Memory Limit: 15 MB
Submit: 260  Solved: 65
[Submit][Status][Web
 Board]

Description


The manager of Human Resource(HR) is now facing a dilemma]]></description><category></category></item><item><title><![CDATA[Contest5.StringReverse]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78519109</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78519109</guid><author>Pinaceae</author><pubDate>Mon, 13 Nov 2017 12:45:37 +0800</pubDate><description><![CDATA[Description

You will be given a number of test cases. The first line contains the number of cases as a positive integer. Each case is given with a line containing a list of words separated by a spa]]></description><category></category></item><item><title><![CDATA[NLP一周总结（一）]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78481459</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78481459</guid><author>Pinaceae</author><pubDate>Wed, 08 Nov 2017 17:52:33 +0800</pubDate><description><![CDATA[1.jieba在ubuntu环境下的安装，命令行中输入
pip install jieba//注意不要进入python环境中，就在系统环境中输入
import jieba
str=">>> str="网络可以被看作未经标注的巨大的语料库。网络搜索引擎提供了一个有效的手段，搜索"
>>> for t in result:
...      print (t)
>>> result= jieba.]]></description><category></category></item><item><title><![CDATA[nltk.获得文本语料和词汇资源]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78311873</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78311873</guid><author>Pinaceae</author><pubDate>Sun, 22 Oct 2017 18:37:46 +0800</pubDate><description><![CDATA[1.获取文本语料库
1.1古滕堡语料库
nltk.corpus.gutenberg.fileids()//古滕堡语料库文件标识符
emma = nltk.corpus.gutenberg.words('austen-emma.txt')emma = nltk.Text(nltk.corpus.gutenberg.words('austen-emma.txt'))//我们调用了NLTK 中的co]]></description><category></category></item><item><title><![CDATA[nltk练习题]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78311332</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78311332</guid><author>Pinaceae</author><pubDate>Sun, 22 Oct 2017 17:17:10 +0800</pubDate><description><![CDATA[1.制作《理智与情感》中四个主角：Elinor，Marianne，Edward 和Willoughby 的分布图。
在这部小说中关于男性和女性所扮演的不同角色，你能观察到什么？你能找出一对夫妻
吗？
text2.dispersion_plot(["Elinor", "Marianne", "Edward", "Willoughby"])
2.使用的语法my_sent = ["My", "s]]></description><category></category></item><item><title><![CDATA[Contest4:Problem B: Mirror Expression]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78307495</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78307495</guid><author>Pinaceae</author><pubDate>Sat, 21 Oct 2017 23:49:35 +0800</pubDate><description><![CDATA[Problem B: Mirror Expression
Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 217  Solved: 95
[Submit][Status][Web
 Board]
Description

A mirrored experssion is a string for which when each of t]]></description><category></category></item><item><title><![CDATA[Contest4:A+B problem]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78306782</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78306782</guid><author>Pinaceae</author><pubDate>Sat, 21 Oct 2017 21:54:51 +0800</pubDate><description><![CDATA[#include 
#include 
int main()
{   int n,i;
   long long int s;
    scanf("%d",&n);
    long long int x[2*n];
    for(i=0;i<n;i++){
        scanf("\n%lld %lld",&x[2*i],&x[2*i+1]);}
    for(i=0;i<n;i++]]></description><category></category></item><item><title><![CDATA[nltk参考文章]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78259253</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78259253</guid><author>Pinaceae</author><pubDate>Tue, 17 Oct 2017 13:05:25 +0800</pubDate><description><![CDATA[黄聪：Python+NLTK自然语言处理学习（三）：计算机自动学习机制

http://www.cnblogs.com/huangcong/archive/2011/08/29/2158447.html]]></description><category></category></item><item><title><![CDATA[nlp nltk note（1）]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78255713</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78255713</guid><author>Pinaceae</author><pubDate>Mon, 16 Oct 2017 23:17:07 +0800</pubDate><description><![CDATA[1.下载语料库 
import nltk 
nltk.download() 
2.文本简易处理 
from nltk.book import * 
text1 
text1.concordance(“”) 
text1.similar(“”) 
text5.common_contexts([“boy”,”girl”]) 
text4.dispersion_plot([“citizens”, “dem]]></description><category></category></item><item><title><![CDATA[Stanford nlp 初步之词性标注]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78254625</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78254625</guid><author>Pinaceae</author><pubDate>Mon, 16 Oct 2017 21:24:55 +0800</pubDate><description><![CDATA[关于词性标记

动词，形容词（4种）：VA，VC，VE，VV

1、谓词性形容词：VA

谓词性形容词大致上相当于英语中的形容词和中文语法中、文学作品里的静态动词。我们的谓词性形容词包括两类：

第一类：没有宾语且能被“很”修饰的谓语。

第二类：源自第一类的、通过重叠（如红彤彤）或者通过名词加形容词模式意味着“像N一样A”（如雪白）的谓语。这个类型的谓词性形容词没有宾语，但是]]></description><category></category></item><item><title><![CDATA[Contest 3:Problem A: Number and its reverse]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78254304</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78254304</guid><author>Pinaceae</author><pubDate>Mon, 16 Oct 2017 20:56:12 +0800</pubDate><description><![CDATA[此题注意c中无reverse函数，用模的方法进行reverse操作。计算反转数时忘注意回文数，导致了最开始想减小计算域，结果从1开始也不会超时。C'est tout.

Description

Give you a number M (9999
Output the number of total numbers such that the sum of this number and]]></description><category></category></item><item><title><![CDATA[Contest 2: Find all factors]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78250551</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78250551</guid><author>Pinaceae</author><pubDate>Mon, 16 Oct 2017 15:49:22 +0800</pubDate><description><![CDATA[Description


Output the number of total factors of an integer.




Input

There are several lines. And each line contains a positive number N (1




Output

Output the number of tota]]></description><category></category></item><item><title><![CDATA[Contest 2:Temperature Conversion]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78250478</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78250478</guid><author>Pinaceae</author><pubDate>Mon, 16 Oct 2017 15:45:29 +0800</pubDate><description><![CDATA[Description


Fahrenheit(F) and Centigrade(C) are used as unit of measuring the temperature. The conversion between them is: F = 32 + C*1.8; C = (F - 32)/1.8
We need you write a C program to conve]]></description><category></category></item><item><title><![CDATA[Warm up:C input and output]]></title><link>https://blog.youkuaiyun.com/Pinaceae/article/details/78250362</link><guid>https://blog.youkuaiyun.com/Pinaceae/article/details/78250362</guid><author>Pinaceae</author><pubDate>Mon, 16 Oct 2017 15:37:24 +0800</pubDate><description><![CDATA[谨以此练习来学习最基础的C语言输入和输出。

#include  //头文件，标准输入输出
#include 

int main()
{   int ch;
    while(scanf("%s",&ch)!=EOF){
                printf("%s\n",ch);};


return(0);]]></description><category></category></item></channel></rss>