2015年02月_kimnoic

12月 10月 08月 07月 06月 05月 04月 03月 02月 01月

原创 Codeforces Round #293 (Div. 2)

A. Vitaly and Strings time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vitaly is a diligent student who never

2015-02-26 01:39:58 373

原创 spfa

#include #include #include #include #include #include #include using namespace std; #define Max 10010 struct edge { int u,v; edge () {} edge(int _u,int _v):u(_u),v(_v) {} }; vect

2015-02-21 18:01:46 258

原创 Kruskal【MST】

#include #include #include using namespace std; #define Maxn 23333 #define Maxm 23333 struct edge { int u,v,w; }edges[Maxm]; int p[Maxn]; int n,m; int Find(int x) { int s; for(s=x;p[

2015-02-13 01:33:12 345

原创 Prim【MST】

#include #include #define Max 10000 #define INF 1000000 using namespace std; int n,m; int edge[Max][Max]; int lowcost[Max]; int nearvex[Max]; void prim(int u0) { int sumweight = 0; for(i

2015-02-13 01:12:34 339

原创 hoj 四连击 ACM ICPC Tehran Regional Contest 2002

hoj 1019 开始想复杂了，只要枚举每个点和四个象限，以r为正方形边长，看最多有多少。 hoj 1020 bfs hoj 1021 二分图，把26字母和k个方块建图 hoj 1022 枚举，注意判断情况，如果有两个n的一定是错的，也有可能没有n的。。【居然可以这么水。。

2015-02-12 00:27:37 342

原创 hoj1017 Joseph's problem II

Joseph's problem II My Tags (Edit) Source : ACM ICPC Central European Regional 1995 Time limit : 2 sec Memory limit : 32 M Subm

2015-02-05 15:45:05 384

原创 hoj1016 Joseph's problem I

oseph's problem I My Tags (Edit) Source : Unknown Time limit : 10 sec Memory limit : 32 M Submitted : 1725, Accepted : 536

2015-02-05 01:11:20 477

原创 poj2517And Then There Was One 约瑟夫问题

And Then There Was One Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 4849 Accepted: 2578 Description Let’s play a stone removing game. Initially, n ston

2015-02-05 00:43:17 376

原创 poj2230Watchcow 欧拉回路

Watchcow Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 6186 Accepted: 2673 Special Judge Description Bessie's been appointed the new watch-cow for th

2015-02-02 17:34:04 281

原创 poj1679The Unique MST 次小生成树

The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21580 Accepted: 7636 Description Given a connected undirected graph, tell if its minimum spa

2015-02-02 00:26:37 309

原创 poj1386 play on word 欧拉回路+并查集

Play on Words Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10128 Accepted: 3465 Description Some of the secret doors contain a very interesting word puz

2015-02-01 19:07:59 262

Stronger Baselines for Trustable Results in Neural Machine Translation

Stronger Baselines for Trustable Results in Neural Machine Translation Stronger Baselines for Trustable Results in Neural Machine Translation Stronger Baselines for Trustable Results in Neural Machine Translation Stronger Baselines for Trustable Results in Neural Machine Translation

2018-01-22

w2v经典论文

word2vec经典文档，在我看之前没有对w2v有深刻的理解，看了之后有了较为深刻的理解，并有其中的绝大多数的公式的推导，便于理解。

2017-11-11

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

kimnoic的专栏