2015年11月_Tovi-A

原创 Educational Codeforces Round 2_B. Queries about less or equal elements

B. Queries about less or equal elementstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two arrays of i

2015-11-28 00:58:43 610

原创 A. Two Bases

A. Two Basestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter seeing the "ALL YOUR BASE ARE BELONG TO U

2015-11-25 12:12:11 540

原创 A. Vasya and Football

A. Vasya and Footballtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has started watching football g

2015-11-23 15:54:41 393

原创 Codeforces Round #332 (Div. 2)_B. Spongebob and Joke

B. Spongebob and Joketime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Patrick was gone shopping, Spon

2015-11-21 04:02:24 613

原创 Codeforces Round #280 (Div. 2)_C. Vanya and Exams

C. Vanya and Examstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya wants to pass n exams and get the a

2015-11-19 18:31:56 536

原创 DFS入门__poj1979

Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 26944 Accepted: 14637DescriptionThere is a rectangular room, covered with square tiles. Eac

2015-11-17 18:32:02 423

原创 Codeforces Round #331 (Div. 2) _A. Wilbur and Swimming Pool

A. Wilbur and Swimming Pooltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter making bad dives into swim

2015-11-16 13:20:01 424

原创 HDU_5563Clarke and five-pointed star

Clarke and five-pointed starTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 156 Accepted Submission(s): 88Problem Description

2015-11-14 22:45:51 566

原创克鲁斯卡尔(Kruskal)算法求最小生成树

/* *Kruskal算法求MST */#include #include #include #include #include #include #include #include #include using namespace std;const int MAXN = 110; //最大点数 const int MAXM = 10000; //

2015-11-12 14:29:32 701

原创 B. OR in Matrix

B. OR in Matrixtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define logical OR as an operation on two logical

2015-11-08 12:30:48 461

原创 ACM_高次同余方程

/*poj 3243 *解决高次同余方程的应用，已知 X^Y = K mod Z, 及X,Z,K的值，求 Y 的值 */#include #include #include using namespace std; #define lint __int64 #define MAXN 131071 struct HashNode { lint data, id, n

2015-11-07 10:40:41 673

我本不习惯于写下自己的经历，或者说记下自己的所感所想。时间过得很快，一晃自己都已经大二了，回想起自己的读书生涯已有十四个年头了，在这些年里虽然自己不够优秀，但很庆幸的是自己坚持走到了今天。在这过程中我也曾想过放弃，曾经放下过很多的错误，由于自己的冲动给身边的人也造成过伤害。我记得我高中时候高一高二是一个放荡不羁的男孩子，整天游手好闲，除了玩还是玩，那时候会因为插队出矛盾而拉帮结派去将对方暴打一顿，

2015-11-07 09:58:26 721 1

原创 ACM_扩展欧几里德算法

/* 扩展欧几里德算法基本算法：对于不完全为 0 的非负整数 a，b，gcd（a，b）表示 a，b 的最大公约数，必然存在整数对 x，y ，使得 gcd（a，b）=ax+by。证明：设 a>b。　　1，显然当 b=0，gcd（a，b）=a。此时 x=1，y=0；　　2，ab!=0 时　　设 ax1+by1=gcd(a,b);　　bx2+(a mod b)y2=gcd(b,

2015-11-06 14:40:29 600

原创 Codeforces Round #328 (Div. 2)_B. The Monster and the Squirrel

B. The Monster and the Squirreltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAri the monster always wakes up very e

2015-11-01 11:09:13 525

原创 Codeforces Round #328 (Div. 2)_A. PawnChess

A. PawnChesstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGalois is one of the strongest chess players of Byteforce

2015-11-01 10:59:36 494

原创 HDU_5523Game

GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 159 Accepted Submission(s): 74Problem DescriptionXY is playing a game:t

2015-11-01 00:02:45 767

Tovi的博客